{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T01:36:30Z","timestamp":1772674590449,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540850960","type":"print"},{"value":"9783540850977","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_31","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"328-338","source":"Crossref","is-referenced-by-count":11,"title":["Automatic Generation of Symmetry-Breaking Constraints"],"prefix":"10.1007","author":[{"given":"Leo","family":"Liberti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"31_CR1","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1137\/0130063","volume":"30","author":"D. Bell","year":"1976","unstructured":"Bell, D.: Constructive group relaxations for integer programs. SIAM Journal on Applied Mathematics\u00a030(4), 708\u2013719 (1976)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/B:OPTE.0000038889.84284.c7","volume":"5","author":"M. Boulle","year":"2004","unstructured":"Boulle, M.: Compact mathematical formulation for graph partitioning. Optimization and Engineering\u00a05, 315\u2013333 (2004)","journal-title":"Optimization and Engineering"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11564751_5","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"D. Cohen","year":"2005","unstructured":"Cohen, D., Jeavons, P., Jefferson, C., Petrie, K., Smith, B.: Symmetry definitions for constraint satisfaction problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 17\u201331. Springer, Heidelberg (2005)"},{"key":"31_CR4","volume-title":"The AMPL Book","author":"R. Fourer","year":"2002","unstructured":"Fourer, R., Gay, D.: The AMPL Book. Duxbury Press, Pacific Grove (2002)"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-73556-4_17","volume-title":"Combinatorial Optimization and Applications","author":"E.J. Friedman","year":"2007","unstructured":"Friedman, E.J.: Fundamental domains for integer programs with symmetries. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol.\u00a04616, pp. 146\u2013153. Springer, Heidelberg (2007)"},{"key":"31_CR6","unstructured":"The GAP Group. GAP \u2013 Groups, Algorithms, and Programming, Version 4.4.10 (2007)"},{"issue":"4","key":"31_CR7","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R. Gomory","year":"1969","unstructured":"Gomory, R.: Some polyhedra related to combinatorial problems. Linear Algebra and Its Applications\u00a02(4), 451\u2013558 (1969)","journal-title":"Linear Algebra and Its Applications"},{"key":"31_CR8","unstructured":"ILOG. ILOG CPLEX 10.1 User\u2019s Manual. ILOG S.A., Gentilly, France (2006)"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Mathematical Programming (to appear)","DOI":"10.1007\/s10107-006-0081-5"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1014804110661","volume":"6","author":"J. Lee","year":"2002","unstructured":"Lee, J.: All-different polytopes. Journal of Combinatorial Optimization\u00a06, 335\u2013352 (2002)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"3","key":"31_CR11","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1287\/ijoc.1060.0178","volume":"19","author":"J. Lee","year":"2007","unstructured":"Lee, J., Margot, F.: On a binary-encoded ILP coloring formulation. INFORMS Journal on Computing\u00a019(3), 406\u2013415 (2007)","journal-title":"INFORMS Journal on Computing"},{"key":"31_CR12","unstructured":"Liberti, L.: Reformulation techniques in mathematical programming, Th\u00e8se d\u2019Habilitation \u00e0 Diriger des Recherches (November 2007)"},{"key":"31_CR13","unstructured":"Liberti, L.: Reformulations in mathematical programming: Definitions. In: Aringhieri, R., Cordone, R., Righini, G. (eds.) Proceedings of the 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Crema, Universit\u00e0 Statale di Milano (2008)"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-002-0358-2","volume":"94","author":"F. Margot","year":"2002","unstructured":"Margot, F.: Pruning by isomorphism in branch-and-cut. Mathematical Programming\u00a094, 71\u201390 (2002)","journal-title":"Mathematical Programming"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-003-0394-6","volume":"98","author":"F. Margot","year":"2003","unstructured":"Margot, F.: Exploiting orbits in symmetric ILP. Mathematical Programming B\u00a098, 3\u201321 (2003)","journal-title":"Mathematical Programming B"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-002-0316-z","volume":"94","author":"F. Margot","year":"2003","unstructured":"Margot, F.: Small covering designs by branch-and-cut. Mathematical Programming B\u00a094, 207\u2013220 (2003)","journal-title":"Mathematical Programming B"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.disopt.2006.10.008","volume":"4","author":"F. Margot","year":"2007","unstructured":"Margot, F.: Symmetric ILP: coloring and small integers. Discrete Optimization\u00a04, 40\u201362 (2007)","journal-title":"Discrete Optimization"},{"key":"31_CR18","unstructured":"Martin, A., Achterberg, T., Koch, T.: MIPLIB 2003. A library of pure and mixed-Integer programs (2003)"},{"key":"31_CR19","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-72792-7_9","volume-title":"Integer Programming and Combinatorial Optimization","author":"J. Ostrowski","year":"2007","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 104\u2013118. Springer, Heidelberg (2007)"},{"issue":"10","key":"31_CR21","doi-asserted-by":"publisher","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"H. Sherali","year":"2001","unstructured":"Sherali, H., Smith, C.: Improving discrete model representations via symmetry considerations. Management Science\u00a047(10), 1396\u20131407 (2001)","journal-title":"Management Science"},{"key":"31_CR22","unstructured":"Wolsey, L.: Group representation theory in integer programming. Technical Report Op.\u00a0Res.\u00a0Center 41, MIT (1969)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T10:59:18Z","timestamp":1709204358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}