{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:48:15Z","timestamp":1725515295027},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727910"},{"type":"electronic","value":"9783540727927"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72792-7_9","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T12:07:11Z","timestamp":1182773231000},"page":"104-118","source":"Crossref","is-referenced-by-count":17,"title":["Orbital Branching"],"prefix":"10.1007","author":[{"given":"James","family":"Ostrowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeff","family":"Linderoth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Smriglio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","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. Operations Research\u00a046, 316\u2013329 (1998)","journal-title":"Operations Research"},{"key":"9_CR2","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\u00a015, 1\u20138 (1993)","journal-title":"OR Spectrum"},{"issue":"5","key":"9_CR3","doi-asserted-by":"publisher","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 Applied Mathematics\u00a0154(5), 826\u2013847 (2006)","journal-title":"Discrete Applied Mathematics"},{"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":"9_CR4"},{"unstructured":"Rothberg, E.: Using cuts to remove symmetry. Presented at the $17^{\\mbox{th}}$ International Symposium on Mathematical Programming","key":"9_CR5"},{"issue":"10","key":"9_CR6","doi-asserted-by":"publisher","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. Management Science\u00a047(10), 1396\u20131407 (2001)","journal-title":"Management Science"},{"doi-asserted-by":"crossref","unstructured":"Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Mathemathical Programming, To appear (2007)","key":"9_CR7","DOI":"10.1007\/s10107-006-0081-5"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-72792-7_7","volume-title":"Integer Programming and Combinatorial Optimization","author":"V. Kaibel","year":"2007","unstructured":"Kaibel, V., Peinhardt, M., Pfetsch, M.E.: Orbitopal fixing. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 74\u201388. Springer, Heidelberg (2007)"},{"key":"9_CR9","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":"9_CR10","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, Series B\u00a098, 3\u201321 (2003)","journal-title":"Mathematical Programming, Series B"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1002\/nav.3800300210","volume":"30","author":"M.S. Bazaraa","year":"1983","unstructured":"Bazaraa, M.S., Kirca, O.: A branch-and-bound heuristic for solving the quadratic assignment problem. Naval Research Logistics Quarterly\u00a030, 287\u2013304 (1983)","journal-title":"Naval Research Logistics Quarterly"},{"key":"9_CR12","doi-asserted-by":"publisher","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. Operations Research Letters\u00a015, 47\u201358 (1994)","journal-title":"Operations Research Letters"},{"unstructured":"McKay, B.D.: Nauty User\u2019s Guide (Version 1.5). Australian National University, Canberra (2002)","key":"9_CR13"},{"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":"9_CR14"},{"key":"9_CR15","first-page":"463","volume-title":"Handbook of Coding Theory","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, vol.\u00a01, pp. 463\u2013498. Elsevier, Amsterdam (1998)"},{"key":"9_CR16","first-page":"371","volume-title":"Contemporary Design Theory: A Collection of Surveys","author":"W.H. Mills","year":"1992","unstructured":"Mills, W.H., Mullin, R.C.: Coverings and packings. In: Contemporary Design Theory: A Collection of Surveys, pp. 371\u2013399. Wiley, Chichester (1992)"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"579","DOI":"10.2307\/2974552","volume":"102","author":"H. Hamalainen","year":"1995","unstructured":"Hamalainen, H., Honkala, I., Litsyn, S., \u00d6sterg\u00e5rd, P.: Football pools\u2014A game for mathematicians. American Mathematical Monthly\u00a0102, 579\u2013588 (1995)","journal-title":"American Mathematical Monthly"},{"key":"9_CR18","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. Mathematical Programming Study\u00a02, 72\u201381 (1973)","journal-title":"Mathematical Programming Study"},{"key":"9_CR19","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\u00a094, 207\u2013220 (2003)","journal-title":"Mathematical Programming"},{"key":"9_CR20","doi-asserted-by":"publisher","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. Mathematical Programming\u00a091, 201\u2013213 (2002)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72792-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:05:29Z","timestamp":1605762329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72792-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727910","9783540727927"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72792-7_9","relation":{},"subject":[]}}