{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:43:47Z","timestamp":1774367027339,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540735557","type":"print"},{"value":"9783540735564","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73556-4_17","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T11:55:47Z","timestamp":1188302147000},"page":"146-153","source":"Crossref","is-referenced-by-count":22,"title":["Fundamental Domains for Integer Programs with Symmetries"],"prefix":"10.1007","author":[{"given":"Eric J.","family":"Friedman","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_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":"17_CR2","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":"17_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01783411","volume":"15","author":"S. Holm","year":"1993","unstructured":"Holm, S., Srensen, 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"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Kaibel, V., Peinhardt, M., Pfetsch, M.: Orbitopal fixing. In: Proc. 12th Conference on Integer Programming and Combinatorial Optimization (IPCO). LNCS, Springer, Heidelberg (forthcoming, 2007)","DOI":"10.1007\/978-3-540-72792-7_7"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Math. Program., Ser. A 2006 (in press), doi:10.1007\/s10107-006-0081-5","DOI":"10.1007\/s10107-006-0081-5"},{"issue":"1","key":"17_CR6","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(1), 71\u201390 (2002)","journal-title":"Mathematical Programming"},{"issue":"2","key":"17_CR7","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(2), 207\u2013220 (2003)","journal-title":"Mathematical Programming"},{"issue":"5","key":"17_CR8","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"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. In: Proc. 12th Conference on Integer Programming and Combinatorial Optimization (IPCO). LNCS, Springer, Heidelberg (forthcoming, 2007)","DOI":"10.1007\/978-3-540-72792-7_9"},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0402049","volume":"2","author":"P. Serafini","year":"1989","unstructured":"Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems. SIAM J. Discrete Math\u00a02(4), 550\u2013581 (1989)","journal-title":"SIAM J. Discrete Math"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73556-4_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:51:39Z","timestamp":1619502699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73556-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735557","9783540735564"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73556-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}