{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T22:34:58Z","timestamp":1781735698364,"version":"3.54.5"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,3,10]],"date-time":"2009-03-10T00:00:00Z","timestamp":1236643200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1007\/s10107-009-0273-x","type":"journal-article","created":{"date-parts":[[2009,3,9]],"date-time":"2009-03-09T12:20:42Z","timestamp":1236601242000},"page":"147-178","source":"Crossref","is-referenced-by-count":106,"title":["Orbital branching"],"prefix":"10.1007","volume":"126","author":[{"given":"James","family":"Ostrowski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeff","family":"Linderoth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabrizio","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefano","family":"Smriglio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,3,10]]},"reference":[{"key":"273_CR1","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T. Achterberg","year":"2004","unstructured":"Achterberg T., Koch T., Martin A.: Branching rules revisited. Oper. Res. Lett. 33, 42\u201354 (2004)","journal-title":"Oper. Res. Lett."},{"key":"273_CR2","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart C., Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P., Vance P.H.: Branch and price: column generation for solving huge integer programs. Oper. Res. 46, 316\u2013329 (1998)","journal-title":"Oper. Res."},{"key":"273_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511623677","volume-title":"Permutation Groups","author":"P.J. Cameron","year":"1999","unstructured":"Cameron P.J.: Permutation Groups. London Mathematical Society, London (1999)"},{"key":"273_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E. Dolan","year":"2002","unstructured":"Dolan E., Mor\u00e9 J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"273_CR5","unstructured":"Foggia, P., Sansone, C., Vento, M.: A preformance comparison of five algorithms for graph isomorphism. In: Proc. 3rd IAPR-TC15 Workshop Graph-Based Representations in Pattern Recognition, pp. 188\u2013199 (2001)"},{"key":"273_CR6","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BFb0120689","volume":"2","author":"D.R. Fulkerson","year":"1973","unstructured":"Fulkerson D.R., Nemhauser G.L., Trotter L.E.: Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triples. Math. Program. Study 2, 72\u201381 (1973)","journal-title":"Math. Program. Study"},{"key":"273_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1869-0","volume-title":"Finite Reflection Groups","author":"L.C. Grove","year":"1985","unstructured":"Grove L.C., Benson C.T.: Finite Reflection Groups. Springer, Heidelberg (1985)"},{"key":"273_CR8","first-page":"579","volume":"102","author":"H. Hamalainen","year":"1995","unstructured":"Hamalainen H., Honkala I., Litsyn S., \u00d6sterg\u00e5rd P.: Football pools\u2014a game for mathematicians. Am. Math. Monthly 102, 579\u2013588 (1995)","journal-title":"Am. Math. Monthly"},{"key":"273_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01783411","volume":"15","author":"S. Holm","year":"1993","unstructured":"Holm S., S\u00f8rensen M.: The optimal graph partitioning problem: solution method based on reducing symmetric nature and combinatorial cuts. OR Spectrum 15, 1\u20138 (1993)","journal-title":"OR Spectrum"},{"key":"273_CR10","doi-asserted-by":"crossref","unstructured":"Kaibel, V., Peinhardt, M., Pfetsch, M.E.: Orbitopal fixing. In: IPCO 2007: The Twelfth Conference on Integer Programming and Combinatorial Optimization, pp. 74\u201388. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-72792-7_7"},{"key":"273_CR11","doi-asserted-by":"crossref","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."},{"key":"273_CR12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"J.T. Linderoth","year":"1999","unstructured":"Linderoth J.T., Savelsbergh M.W.P.: A computational study of search strategies in mixed integer programming. INFORMS J. Comput. 11, 173\u2013187 (1999)","journal-title":"INFORMS J. Comput."},{"key":"273_CR13","first-page":"463","volume-title":"Handbook of Coding Theory volume 1","author":"S. Litsyn","year":"1998","unstructured":"Litsyn S.: An updated table of the best binary codes known. In: Pless, V.S., Huffman, W.C. (eds) Handbook of Coding Theory volume 1, pp. 463\u2013498. Elsevier, Amsterdam (1998)"},{"key":"273_CR14","unstructured":"Macambira, E.M., Maculan, N., de Souza, C.C.: Reducing symmetry of the SONET ring assignment problem using hierarchical inequalities. Technical Report ES-636\/04, Programa de Engenharia de Sistemas e Computa\u00e7\u00e3o, Universidade Federal do Rio de Janeiro (2004)"},{"key":"273_CR15","doi-asserted-by":"crossref","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."},{"key":"273_CR16","doi-asserted-by":"crossref","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. Ser. B 98, 3\u201321 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"273_CR17","doi-asserted-by":"crossref","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, 207\u2013220 (2003)","journal-title":"Math. Program."},{"key":"273_CR18","volume-title":"Nauty User\u2019s Guide (Version 1.5)","author":"B.D. McKay","year":"2002","unstructured":"McKay B.D.: Nauty User\u2019s Guide (Version 1.5). Australian National University, Canberra (2002)"},{"issue":"5","key":"273_CR19","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1016\/j.dam.2005.05.022","volume":"154","author":"I. M\u00e9ndez-D\u00edaz","year":"2006","unstructured":"M\u00e9ndez-D\u00edaz I., Zabala P.: A branch-and-cut algorithm for graph coloring. Discrete Appl. Math. 154(5), 826\u2013847 (2006)","journal-title":"Discrete Appl. Math."},{"key":"273_CR20","unstructured":"Mills, W.H., Mullin, R.C.: Coverings and packings. In: Contemporary Design Theory: A Collection of Surveys, pp. 371\u2013399. Wiley, New York (1992)"},{"key":"273_CR21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G.L. Nemhauser","year":"1994","unstructured":"Nemhauser G.L., Savelsbergh M.W.P., Sigismondi G.C.: MINTO, a Mixed INTeger Optimizer. Oper. Res. Lett. 15, 47\u201358 (1994)","journal-title":"Oper. Res. Lett."},{"key":"273_CR22","doi-asserted-by":"crossref","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. In: IPCO 2007: The Twelfth Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 4517, pp. 104\u2013118. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-72792-7_9"},{"key":"273_CR23","doi-asserted-by":"crossref","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Constraint orbital branching. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008: The Thirteenth Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 5035, pp. 225\u2013239 (2008)","DOI":"10.1007\/978-3-540-68891-4_16"},{"key":"273_CR24","volume-title":"An Introduction to the Theory of Groups","author":"J.J. Rotman","year":"1994","unstructured":"Rotman J.J.: An Introduction to the Theory of Groups, 4th edn. Springer, Heidelberg (1994)","edition":"4"},{"key":"273_CR25","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/ijoc.10.4.438","volume":"10","author":"E.C. Sewell","year":"1998","unstructured":"Sewell E.C.: A branch-and-bound algorithm for the stability number of a sparse graph. INFORMS J. Comput. 10, 438\u2013447 (1998)","journal-title":"INFORMS J. Comput."},{"issue":"10","key":"273_CR26","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"H.D. Sherali","year":"2001","unstructured":"Sherali H.D., Smith J.C.: Improving zero-one model representations via symmetry considerations. Manage. Sci. 47(10), 1396\u20131407 (2001)","journal-title":"Manage. Sci."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0273-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-009-0273-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0273-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:06Z","timestamp":1559109006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-009-0273-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,10]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["273"],"URL":"https:\/\/doi.org\/10.1007\/s10107-009-0273-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3,10]]}}}