{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:30:12Z","timestamp":1725514212597},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688860"},{"type":"electronic","value":"9783540688914"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68891-4_16","type":"book-chapter","created":{"date-parts":[[2008,5,23]],"date-time":"2008-05-23T13:31:37Z","timestamp":1211549497000},"page":"225-239","source":"Crossref","is-referenced-by-count":14,"title":["Constraint 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":"16_CR1","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":"16_CR2","unstructured":"Rothberg, E.: Using cuts to remove symmetry. In: 17th International Symposium on Mathematical Programming (2000)"},{"issue":"10","key":"16_CR3","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"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Mathematical Programming (to appear, 2007)","DOI":"10.1007\/s10107-006-0081-5"},{"key":"16_CR5","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.: Orbitopal fixing. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 74\u201388. Springer, Heidelberg (2007)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","volume":"2","author":"R.C. Read","year":"1998","unstructured":"Read, R.C.: Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations. Annals of Discrete Mathematics\u00a02, 107\u2013120 (1998)","journal-title":"Annals of Discrete Mathematics"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0747-7171(85)80021-3","volume":"1","author":"G. Butler","year":"1985","unstructured":"Butler, G., Lam, W.H.: A general backtrack algorithm for the isomorphism problem of combinatorial objects. Journal of Symbolic Computation\u00a01, 363\u2013381 (1985)","journal-title":"Journal of Symbolic Computation"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"D. McKay","year":"1998","unstructured":"McKay, D.: Isomorph-free exhaustive generation. Journal of Algorithms\u00a026, 306\u2013324 (1998)","journal-title":"Journal of Algorithms"},{"key":"16_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":"16_CR10","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)"},{"key":"16_CR11","unstructured":"Linderoth, J., Margot, F., Thain, G.: Improving bounds on the football pool problem via symmetry reduction and high-throughput computing (submitted, 2007)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(95)00034-H","volume":"18","author":"C. Mannino","year":"1995","unstructured":"Mannino, C., Sassano, A.: Solving hard set covering problems. Operations Research Letters\u00a018, 1\u20135 (1995)","journal-title":"Operations Research Letters"},{"key":"16_CR13","unstructured":"Karamanov, M., Cornu\u00e9jols, G.: Branching on general disjunctions (submitted, 2005)"},{"key":"16_CR14","first-page":"191","volume":"2","author":"T.P. Kirkman","year":"1847","unstructured":"Kirkman, T.P.: On a problem in combinations. Cambridge and Dublin Mathematics Journal\u00a02, 191\u2013204 (1847)","journal-title":"Cambridge and Dublin Mathematics Journal"},{"key":"16_CR15","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BFb0120689","volume":"2","author":"D.R. Fulkerson","year":"1974","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 (1974)","journal-title":"Mathematical Programming Study"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/BF01588309","volume":"8","author":"D. Avis","year":"1980","unstructured":"Avis, D.: A note on some computationally difficult set covering problems. Mathematical Programming\u00a08, 138\u2013145 (1980)","journal-title":"Mathematical Programming"},{"key":"16_CR17","unstructured":"Hall, M.: Combinatorial Theory. Blaisdell Company (1967)"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"Feo, T.A., Resende, G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters\u00a08, 67\u201371 (1989)","journal-title":"Operations Research Letters"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/BF01582907","volume":"52","author":"N. Karmarkar","year":"1991","unstructured":"Karmarkar, N., Ramakrishnan, K., Resende, M.: An interior point algorithm to solve computationally difficult set covering problems. Mathematical Programming, Series B\u00a052, 597\u2013618 (1991)","journal-title":"Mathematical Programming, Series B"},{"issue":"2","key":"16_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0020-0190(97)80440-1","volume":"65","author":"M.A. Odijk","year":"1998","unstructured":"Odijk, M.A., van Maaren, H.: Improved solutions to the Steiner triple covering problem. Information Processing Letters\u00a065(2), 67\u201369 (1998)","journal-title":"Information Processing Letters"},{"key":"16_CR21","unstructured":"The GAP Group: GAP\u2014Groups, Algorithms, and Programming, Version 4.4 (2004), http:\/\/www.gap-system.org"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-72792-7_22","volume-title":"Integer Programming and Combinatorial Optimization","author":"E. Danna","year":"2007","unstructured":"Danna, E., Fenelon, M., Gu, Z., Wunderling, R.: Generating multiple solutions for mixed integer programming problems. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 280\u2013294. Springer, Heidelberg (2007)"},{"key":"16_CR23","unstructured":"Livny, M., Basney, J., Raman, R., Tannenbaum, T.: Mechanisms for high throughput computing. SPEEDUP\u00a011 (1997)"},{"key":"16_CR24","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.2140\/pjm.1964.14.1405","volume":"14","author":"J. Sch\u00f6nheim","year":"1964","unstructured":"Sch\u00f6nheim, J.: On coverings. Pacific Journal of Mathematics\u00a014, 1405\u20131411 (1964)","journal-title":"Pacific Journal of Mathematics"},{"key":"16_CR25","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":"16_CR26","first-page":"93","volume":"96","author":"K.J. Nurmela","year":"1993","unstructured":"Nurmela, K.J., \u00d6sterg\u00e5rd, P.: Upper bounds for covering designs by simulated annealing. Congressus Numerantium\u00a096, 93\u2013111 (1993)","journal-title":"Congressus Numerantium"},{"key":"16_CR27","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1002\/jcd.10022","volume":"11","author":"D. Applegate","year":"2003","unstructured":"Applegate, D., Rains, E., Sloane, N.: On asymmetric coverings and covering numbers. Journal of Combinatorial Designs\u00a011, 218\u2013228 (2003)","journal-title":"Journal of Combinatorial Designs"},{"key":"16_CR28","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1002\/jcd.3180030404","volume":"3","author":"D. Gordon","year":"1995","unstructured":"Gordon, D., Kuperberg, G., Patashnik, O.: New constructions for covering designs. Journal of Combinatorial Designs\u00a03, 269\u2013284 (1995)","journal-title":"Journal of Combinatorial Designs"},{"key":"16_CR29","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"}],"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-68891-4_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:17:47Z","timestamp":1620015467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68891-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688860","9783540688914"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68891-4_16","relation":{},"subject":[]}}