{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T22:40:50Z","timestamp":1779230450688,"version":"3.51.4"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,1,24]],"date-time":"2018-01-24T00:00:00Z","timestamp":1516752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10107-018-1239-7","type":"journal-article","created":{"date-parts":[[2018,1,24]],"date-time":"2018-01-24T09:59:01Z","timestamp":1516787941000},"page":"197-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Polytopes associated with symmetry handling"],"prefix":"10.1007","volume":"175","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5324-8996","authenticated-orcid":false,"given":"Christopher","family":"Hojny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc E.","family":"Pfetsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,24]]},"reference":[{"issue":"1","key":"1239_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"1239_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 361\u2013372 (2006)","journal-title":"Oper. Res. Lett."},{"key":"1239_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, STOC \u201983, pp. 171\u2013183, New York, NY, USA, ACM (1983)","DOI":"10.1145\/800061.808746"},{"issue":"1","key":"1239_CR4","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E Balas","year":"1975","unstructured":"Balas, E.: Facets of the knapsack polytope. Math. Program. 8(1), 146\u2013164 (1975)","journal-title":"Math. Program."},{"issue":"1","key":"1239_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10479-005-3969-1","volume":"140","author":"E Balas","year":"2005","unstructured":"Balas, E.: Projection, lifting and extended formulation in integer and combinatorial optimization. Ann. Oper. Res. 140(1), 125\u2013161 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1239_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0123007","volume":"23","author":"E Balas","year":"1972","unstructured":"Balas, E., Jeroslow, R.: Canonical cuts on the unit hypercube. SIAM J. Appl. Math. 23(1), 61\u201369 (1972)","journal-title":"SIAM J. Appl. Math."},{"key":"1239_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/1970044","volume":"68","author":"KT Chen","year":"1958","unstructured":"Chen, K.T., Fox, R.H., Lyndon, R.C.: Free differential calculus, IV. The quotient groups of the lower central series. Ann. Math. 68, 81\u201395 (1958)","journal-title":"Ann. Math."},{"issue":"1","key":"1239_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10479-012-1269-0","volume":"204","author":"M Conforti","year":"2013","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Extended formulations in combinatorial optimization. Ann. Oper. Res. 204(1), 97\u2013143 (2013)","journal-title":"Ann. Oper. Res."},{"key":"1239_CR9","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2007","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT press, Cambridge (2007)","edition":"2"},{"issue":"3","key":"1239_CR10","doi-asserted-by":"publisher","first-page":"588","DOI":"10.2307\/1968753","volume":"35","author":"HSM Coxeter","year":"1934","unstructured":"Coxeter, H.S.M.: Discrete groups generated by reflections. Ann. Math. 35(3), 588\u2013621 (1934)","journal-title":"Ann. Math."},{"issue":"5","key":"1239_CR11","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H Crowder","year":"1983","unstructured":"Crowder, H., Johnson, E.L., Padberg, M.: Solving large-scale zero-one linear programming problems. Oper. Res. 31(5), 803\u2013834 (1983)","journal-title":"Oper. Res."},{"key":"1239_CR12","first-page":"467","volume-title":"Orbital Independence in Symmetric Mathematical Programs","author":"G Dias","year":"2015","unstructured":"Dias, G., Liberti, L.: Orbital Independence in Symmetric Mathematical Programs, pp. 467\u2013480. Springer, Berlin (2015)"},{"key":"1239_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0731-3","volume-title":"Permutation Groups. Graduate Texts in Mathematics","author":"JD Dixon","year":"1996","unstructured":"Dixon, J.D., Mortimer, B.: Permutation Groups. Graduate Texts in Mathematics, vol. 163. Springer, New York (1996)"},{"issue":"3","key":"1239_CR14","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1287\/moor.1090.0392","volume":"34","author":"Y Faenza","year":"2009","unstructured":"Faenza, Y., Kaibel, V.: Extended formulations for packing and partitioning orbitopes. Math. Oper. Res. 34(3), 686\u2013697 (2009)","journal-title":"Math. Oper. Res."},{"key":"1239_CR15","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-32147-4_6","volume-title":"Combinatorial Optimization. Lecture Notes in Computer Science","author":"M Fischetti","year":"2012","unstructured":"Fischetti, M., Liberti, L.: Orbital shrinking. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) Combinatorial Optimization. Lecture Notes in Computer Science, vol. 7422, pp. 48\u201358. Springer, Berlin (2012)"},{"key":"1239_CR16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-73556-4_17","volume-title":"Combinatorial Optimization and Applications. LNCS","author":"EJ Friedman","year":"2007","unstructured":"Friedman, E.J.: Fundamental domains for integer programs with symmetries. In: Dress, A., Xu, Y., Zhu, B. (eds.) Combinatorial Optimization and Applications. LNCS, vol. 4616, pp. 146\u2013153. Springer, Berlin (2007)"},{"issue":"8","key":"1239_CR17","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1080\/0740817X.2010.541899","volume":"43","author":"A Ghoniem","year":"2011","unstructured":"Ghoniem, A., Sherali, H.D.: Defeating symmetry in combinatorial optimization via objective perturbations and hierarchical constraints. IIE Trans. 43(8), 575\u2013588 (2011)","journal-title":"IIE Trans."},{"key":"1239_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, vol. 2. Springer, Berlin (1988)"},{"issue":"1","key":"1239_CR19","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P Hammer","year":"1975","unstructured":"Hammer, P., Johnson, E., Peled, U.: Facet of regular 0\u20131 polytopes. Math. Program. 8(1), 179\u2013206 (1975)","journal-title":"Math. Program."},{"issue":"1","key":"1239_CR20","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1215\/S0012-7094-59-02603-1","volume":"26","author":"F Harary","year":"1959","unstructured":"Harary, F.: On the group of the composition of two graphs. Duke Math. J. 26(1), 29\u201334 (1959)","journal-title":"Duke Math. J."},{"key":"1239_CR21","unstructured":"Harvey, W.: The fully social golfer problem. In: Smith, B.M., and Gent, I.P. (eds.) Proceedings of SymCom\u201903: The Third International Workshop on Symmetry in Constraint Satisfaction Problems, pp. 75\u201385 (2003)"},{"key":"1239_CR22","unstructured":"Herr, K.: Core Sets and Symmetric Convex Optimization. Ph.D. thesis, Technische Universit\u00e4t Darmstadt (2013)"},{"issue":"3","key":"1239_CR23","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.orl.2013.02.007","volume":"41","author":"K Herr","year":"2013","unstructured":"Herr, K., Rehn, T., Sch\u00fcrmann, A.: Exploiting symmetry in integer convex optimization using core points. Oper. Res. Lett. 41(3), 298\u2013304 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1239_CR24","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/s00454-014-9638-x","volume":"53","author":"K Herr","year":"2015","unstructured":"Herr, K., Rehn, T., Sch\u00fcrmann, A.: On lattice-free orbit polytopes. Discrete Comput. Geom. 53(1), 144\u2013172 (2015)","journal-title":"Discrete Comput. Geom."},{"key":"1239_CR25","unstructured":"Hojny, C., L\u00fcthen, H., Pfetsch, M.E.: On the size of integer programs with bounded coefficients or sparse constraints. Technical report, Optimization Online (2017). \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2017\/06\/6056.html"},{"key":"1239_CR26","unstructured":"IBM ILOG CPLEX Optimization Studio. \n                    http:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/"},{"issue":"3","key":"1239_CR27","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.disopt.2011.04.002","volume":"8","author":"T Januschowski","year":"2011","unstructured":"Januschowski, T., Pfetsch, M.E.: The maximum-colorable subgraph problem and orbitopes. Discrete Optim. 8(3), 478\u2013494 (2011)","journal-title":"Discrete Optim."},{"key":"1239_CR28","first-page":"2","volume":"85","author":"V Kaibel","year":"2011","unstructured":"Kaibel, V.: Extended formulations in combinatorial optimization. Optima 85, 2\u20137 (2011)","journal-title":"Optima"},{"key":"1239_CR29","unstructured":"Kaibel, V., Loos, A.: Branched polyhedral systems. In Eisenbrand, F., Shepherd, F.B. (eds.) Proceedings of the 14th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2010, Lausanne, Switzerland, 9\u201311 June 2010. LNCS, vol. 6080, pp. 177\u2013190. Springer, Berlin (2010)"},{"key":"1239_CR30","volume-title":"Progress in Combinatorial Optimization","author":"V Kaibel","year":"2011","unstructured":"Kaibel, V., Loos, A.: Finding descriptions of polytopes via extended formulations and liftings. In: Mahjoub, A.R. (ed.) Progress in Combinatorial Optimization. Wiley, New York (2011)"},{"issue":"4","key":"1239_CR31","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.disopt.2011.07.001","volume":"8","author":"V Kaibel","year":"2011","unstructured":"Kaibel, V., Peinhardt, M., Pfetsch, M.E.: Orbitopal fixing. Discrete Optim. 8(4), 595\u2013610 (2011)","journal-title":"Discrete Optim."},{"issue":"1","key":"1239_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-006-0081-5","volume":"114","author":"V Kaibel","year":"2008","unstructured":"Kaibel, V., Pfetsch, M.E.: Packing and partitioning orbitopes. Math. Program. 114(1), 1\u201336 (2008)","journal-title":"Math. Program."},{"issue":"2","key":"1239_CR33","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"key":"1239_CR34","doi-asserted-by":"crossref","unstructured":"Liberti, L.: Automatic generation of symmetry-breaking constraints. In: Yang, B., Du, D.-Z., Wang, C. (eds.) Combinatorial Optimization and Applications. Lecture Notes in Computer Science, vol. 5165, pp. 328\u2013338. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-85097-7_31"},{"issue":"1\u20132","key":"1239_CR35","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10107-010-0351-0","volume":"131","author":"L Liberti","year":"2012","unstructured":"Liberti, L.: Reformulations in mathematical programming: automatic symmetry detection and exploitation. Math. Program. 131(1\u20132), 273\u2013304 (2012)","journal-title":"Math. Program."},{"key":"1239_CR36","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10898-013-0106-6","volume":"60","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Ostrowski, J.: Stabilizer-based symmetry breaking constraints for mathematical programs. J. Glob. Optim. 60, 183\u2013194 (2014)","journal-title":"J. Glob. Optim."},{"key":"1239_CR37","unstructured":"Loos, A.: Describing Orbitopes by Linear Inequalities and Projection Based Tools. Ph.D. thesis, University of Magdeburg (2010)"},{"key":"1239_CR38","unstructured":"Maher, S.J., Fischer, T., Gally, T., Gamrath, G., Gleixner, A., Gottwald, R.L., Hendel, G., Koch, T., L\u00fcbbecke, M.E., Miltenberger, M., M\u00fcller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schenker, S., Schwarz, R., Serrano, F., Shinano, Y., Weninger, D., Witt, J.T., Witzig, J.: The SCIP optimization suite 4.0. Technical report, Optimization Online (2017). \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2017\/03\/5895.html"},{"issue":"1","key":"1239_CR39","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. Math. Program. 94(1), 71\u201390 (2002)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"1239_CR40","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. Math. Program. 98(1\u20133), 3\u201321 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"1239_CR41","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. Math. Program. 94(2), 207\u2013220 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"1239_CR42","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 Optim. 4(1), 40\u201362 (2007)","journal-title":"Discrete Optim."},{"key":"1239_CR43","first-page":"647","volume-title":"50 Years of Integer Programming","author":"F Margot","year":"2010","unstructured":"Margot, F.: Symmetry in integer linear programming. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming, pp. 647\u2013686. Springer, Berlin (2010)"},{"key":"1239_CR44","unstructured":"Ostrowski, J., Anjos, M.F., Vannelli, A.: Symmetry in Scheduling Problems. Cahier du GERAD G-2010-69, GERAD, Montreal, QC, Canada (2010)"},{"issue":"1","key":"1239_CR45","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10107-014-0812-y","volume":"150","author":"J Ostrowski","year":"2015","unstructured":"Ostrowski, J., Anjos, M.F., Vannelli, A.: Modified orbital branching for structured symmetry with an application to unit commitment. Math. Program. 150(1), 99\u2013129 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"1239_CR46","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","volume":"126","author":"J Ostrowski","year":"2011","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. Math. Program. 126(1), 147\u2013178 (2011)","journal-title":"Math. Program."},{"key":"1239_CR47","unstructured":"Pfetsch, M.E., Rehn, T.: A computational comparison of symmetry handling methods for mixed integer programs. Technical report, Optimization Online (2015). \n                    http:\/\/www.optimization-online.org\/DB_FILE\/2015\/11\/5209.pdf"},{"key":"1239_CR48","unstructured":"Rehn, T.: Exploring Core Points for Fun and Profit\u2014a Study of Lattice-Free Orbit Polytopes. Ph.D. thesis, Universit\u00e4t Rostock (2013)"},{"key":"1239_CR49","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2012.01.013","volume":"502","author":"J Sawada","year":"2013","unstructured":"Sawada, J., Williams, A.: A gray code for fixed-density necklaces and lyndon words in constant amortized time. Theor. Comput. Sci. 502, 46\u201354 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"1239_CR50","volume-title":"Theory of Linear and Integer Programming. Wiley Interscience Series in Discrete Mathematics and Optimization","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1986)"},{"issue":"10","key":"1239_CR51","doi-asserted-by":"publisher","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"HD Sherali","year":"2001","unstructured":"Sherali, H.D., Smith, J.C.: Improving discrete model representations via symmetry considerations. Manag. Sci. 47(10), 1396\u20131407 (2001)","journal-title":"Manag. Sci."},{"issue":"2","key":"1239_CR52","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/0022-0000(79)90042-4","volume":"18","author":"RE Tarjan","year":"1979","unstructured":"Tarjan, R.E.: A class of algorithms which require nonlinear time to maintain disjoint sets. J. Comput. Syst. Sci. 18(2), 110\u2013127 (1979)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"1239_CR53","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., van Leeuwen, J.: Worst-case analysis of set union algorithms. J. ACM 31(2), 245\u2013281 (1984)","journal-title":"J. ACM"},{"key":"1239_CR54","volume-title":"A Course in Combinatorics, 2nd edn.","author":"JH Lint van","year":"1993","unstructured":"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (1993)"},{"issue":"5","key":"1239_CR55","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1002\/net.3230190510","volume":"19","author":"JH Vande Vate","year":"1989","unstructured":"Vande Vate, J.H.: The path set polytope of an acyclic, directed graph with an application to machine sequencing. Networks 19(5), 607\u2013614 (1989)","journal-title":"Networks"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1239-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1239-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1239-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T10:20:36Z","timestamp":1579170036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1239-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,24]]},"references-count":55,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["1239"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1239-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,24]]},"assertion":[{"value":"26 January 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}