{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T02:29:36Z","timestamp":1783996176023,"version":"3.55.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T00:00:00Z","timestamp":1530662400000},"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. Prog. Comp."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s12532-018-0140-y","type":"journal-article","created":{"date-parts":[[2018,7,4]],"date-time":"2018-07-04T05:15:29Z","timestamp":1530681329000},"page":"37-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["A computational comparison of symmetry handling methods for mixed integer programs"],"prefix":"10.1007","volume":"11","author":[{"given":"Marc E.","family":"Pfetsch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Rehn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"key":"140_CR1","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. Thesis, TU Berlin (2007)"},{"issue":"1","key":"140_CR2","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":"140_CR3","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":"140_CR4","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S0377-2217(99)00015-6","volume":"121","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk, A., Nemhauser, G.L., Savelsbergh, M.W.P.: Conflict graphs in integer programming. Eur. J. Oper. Res. 121, 40\u201355 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"140_CR5","unstructured":"Berthold, T.: Heuristic Algorithms in Global MINLP Solvers. Ph.D. Thesis, TU Berlin (2014)"},{"key":"140_CR6","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-642-00142-0_70","volume-title":"Operations Research Proceedings 2008","author":"T Berthold","year":"2009","unstructured":"Berthold, T., Pfetsch, M.E.: Detecting orbitopal symmetries. In: Fleischmann, B., Borgwardt, K.H., Klein, R., Tuma, A. (eds.) Operations Research Proceedings 2008, pp. 433\u2013438. Springer, Berlin (2009)"},{"issue":"1\u20132","key":"140_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10107-011-0487-6","volume":"137","author":"R B\u00f6di","year":"2013","unstructured":"B\u00f6di, R., Herr, K., Joswig, M.: Algorithms for highly symmetric linear and integer programs. Math. Program. 137(1\u20132), 65\u201390 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"140_CR8","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1112\/S1461157014000400","volume":"17","author":"D Bremner","year":"2014","unstructured":"Bremner, D., Pasechnik, D.V., Rehn, T., Sch\u00fcrmann., A., Dutour Sikiri\u0107, D.: Computing symmetry groups of polyhedra. LMS J. Comput. Math. 17(1), 565\u2013581 (2014)","journal-title":"LMS J. Comput. Math."},{"key":"140_CR9","unstructured":"Christophel, P.M., G\u00fczelsoy, M., P\u00f3olik, I.: New symmetries in mixed-integer linear optimization symmetry heuristics and complement-based symmetries. In: Technical Report, Optimization Online. \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2014\/07\/4466.html\n                    \n                   (2014). Accessed June 2018"},{"key":"140_CR10","unstructured":"Darga, P.T., Katebi, H., Liffiton, M., Markov,\u00a0I., Sakallah, K.: Saucy. \n                    http:\/\/vlsicad.eecs.umich.edu\/BK\/SAUCY\/\n                    \n                   (2012). Accessed June 2018"},{"issue":"3","key":"140_CR11","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":"140_CR12","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., Markakis, V., Milis, I., Paschos, V.T. (eds.) Combinatorial Optimization, Lecture Notes in Computer Science, vol. 7422, pp. 48\u201358. Springer, Berlin (2012)"},{"key":"140_CR13","doi-asserted-by":"crossref","unstructured":"Friedman, E.J.: Fundamental domains for integer programs with symmetries. In: Combinatorial Optimization and Applications, volume 4616 of Lecture Notes in Computer Science, pp. 146\u2013153. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-73556-4_17"},{"key":"140_CR14","unstructured":"GAP\u2014Groups, Algorithms, Programming: A system for computational discrete algebra. Version 4.5. \n                    http:\/\/www.gap-system.org\/\n                    \n                   (2013). Accessed June 2018"},{"issue":"1\u20133","key":"140_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jpaa.2003.12.011","volume":"192","author":"K Gatermann","year":"2004","unstructured":"Gatermann, K., Parrilo, P.: Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192(1\u20133), 95\u2013128 (2004)","journal-title":"J. Pure Appl. Algebra"},{"key":"140_CR16","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, 575\u2013588 (2011)","journal-title":"IIE Trans."},{"key":"140_CR17","unstructured":"Herr, K.: Core Sets and Symmetric Convex Optimization. Ph.D. Thesis, TU Darmstadt (2013)"},{"issue":"3","key":"140_CR18","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":"140_CR19","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."},{"issue":"1","key":"140_CR20","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1145\/1077464.1077476","volume":"1","author":"DS Johnson","year":"2005","unstructured":"Johnson, D.S.: The NP-completeness column. ACM Trans. Algorithms 1(1), 160\u2013176 (2005)","journal-title":"ACM Trans. Algorithms"},{"key":"140_CR21","unstructured":"Junttila, T., Kaski, P.: bliss: A tool for computing automorphism groups and canonical labelings of graphs. \n                    http:\/\/www.tcs.hut.fi\/Software\/bliss\/\n                    \n                   (2012). Accessed June 2018"},{"key":"140_CR22","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\u201336 (2008)","journal-title":"Math. Program."},{"issue":"4","key":"140_CR23","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":"2","key":"140_CR24","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: mixed integer programming library version 5. Math. Program. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"key":"140_CR25","volume-title":"Algebra","author":"S Lang","year":"2005","unstructured":"Lang, S.: Algebra, 3rd edn. Springer, New York (2005)","edition":"3"},{"key":"140_CR26","doi-asserted-by":"crossref","unstructured":"Liberti, L.: Automatic generation of symmetry-breaking constraints. In: Combinatorial Optimization and Applications, volume 5165 of Lecture Notes in Computer Science, pp. 328\u2013338. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-85097-7_31"},{"issue":"1\u20132","key":"140_CR27","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":"140_CR28","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":"140_CR29","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, 71\u201390 (2002)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"140_CR30","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\u20133","key":"140_CR31","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\u20133), 207\u2013220 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"140_CR32","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":"140_CR33","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1007\/978-3-540-68279-0_17","volume-title":"50 Years of Integer Programming 1958\u20132008, chapter 17","author":"F Margot","year":"2010","unstructured":"Margot, F.: Symmetry in integer linear programming. In: J\u00fcnger, M., Liebling, T., Naddef, D., Nemhauser, G.L., Pulleyblank, W., Reinelt, G., Rinaldi, G., Wolsey, L. (eds.) 50 Years of Integer Programming 1958\u20132008, chapter 17, pp. 647\u2013681. Springer, Berlin (2010)"},{"key":"140_CR34","unstructured":"McKay, B.D.: The nauty program. \n                    http:\/\/cs.anu.edu.au\/people\/bdm\/nauty\/\n                    \n                   (2012). Accessed June 2018"},{"key":"140_CR35","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s12532-015-0077-3","volume":"7","author":"HD Mittelmann","year":"2015","unstructured":"Mittelmann, H.D., Salvagnin, D.: On solving a hard quadratic 3-dimensional assignment problem. Math. Program. Comput. 7, 219\u2013234 (2015)","journal-title":"Math. Program. Comput."},{"key":"140_CR36","doi-asserted-by":"crossref","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. In: Integer Programming and Combinatorial Optimization, volume 4513 of Lecture Notes in Computer Science, pp. 104\u2013118. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-72792-7_9"},{"key":"140_CR37","unstructured":"Ostrowski, J.: Symmetry in Integer Programming. Ph.D. Thesis, Lehigh University (2009)"},{"issue":"1","key":"140_CR38","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":"140_CR39","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-38189-8_2","volume-title":"Facets of Combinatorial Optimization","author":"MW Padberg","year":"2013","unstructured":"Padberg, M.W.: Facets and rank of integer polyhedra. In: J\u00fcnger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization, pp. 23\u201358. Springer, Berlin (2013)"},{"key":"140_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/11564751_36","volume-title":"Principles and Practice of Constraint Programming\u2014CP 2005","author":"J-F Puget","year":"2005","unstructured":"Puget, J.-F.: Automatic detection of variable and value symmetries. In: Beek, P. (ed.) Principles and Practice of Constraint Programming\u2014CP 2005. Lecture Notes in Computer Science, vol. 3709, pp. 475\u2013489. Springer, Berlin (2005)"},{"issue":"4","key":"140_CR41","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1002\/jgt.3190010410","volume":"1","author":"RC Read","year":"1977","unstructured":"Read, R.C., Corneil, D.G.: The graph isomorphism disease. J. Graph Theory 1(4), 339\u2013363 (1977)","journal-title":"J. Graph Theory"},{"key":"140_CR42","unstructured":"Rehn, T.: Exploring Core Points for Fun and Profit: A Study Of Lattice-free Orbit Polytopes. Ph.D. Thesis, University of Rostock (2014)"},{"key":"140_CR43","unstructured":"Rehn, T.: PermLib: Permutation Computation Library. \n                    http:\/\/www.geometrie.uni-rostock.de\/software\/\n                    \n                   (2013). Accessed June 2018"},{"key":"140_CR44","unstructured":"Salvagnin, D.: A Dominance Procedure For Integer Programming. Master\u2019s Thesis, University of Padova (2005)"},{"key":"140_CR45","doi-asserted-by":"crossref","unstructured":"Salvagnin, D.: Orbital shrinking: a new tool for hybrid MIP\/CP methods. In: Gomes, C., Sellmann, M. (eds.) Proceedings of Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), pp. 204\u2013215. Springer, Berlin, Heidelberg (2013)","DOI":"10.1007\/978-3-642-38171-3_14"},{"issue":"4","key":"140_CR46","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"MWP Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6(4), 445\u2013454 (1994)","journal-title":"ORSA J. Comput."},{"key":"140_CR47","unstructured":"SCIP\u2013Solving Constraint Integer Programs: \n                    http:\/\/scip.zib.de\n                    \n                   (2015). Accessed June 2018"},{"key":"140_CR48","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546549","volume-title":"Permutation Group Algorithms","author":"\u00c1 Seress","year":"2003","unstructured":"Seress, \u00c1.: Permutation Group Algorithms. Cambridge University Press, Cambridge (2003)"},{"issue":"10","key":"140_CR49","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, J.C.: Improving discrete model representations via symmetry considerations. Manag. Sci. 47(10), 1396\u20131407 (2001)","journal-title":"Manag. Sci."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0140-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-018-0140-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0140-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T23:08:09Z","timestamp":1562195289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-018-0140-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,4]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["140"],"URL":"https:\/\/doi.org\/10.1007\/s12532-018-0140-y","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,4]]},"assertion":[{"value":"21 November 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}