{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:48:17Z","timestamp":1725515297928},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_7","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T12:07:11Z","timestamp":1182773231000},"page":"74-88","source":"Crossref","is-referenced-by-count":18,"title":["Orbitopal Fixing"],"prefix":"10.1007","author":[{"given":"Volker","family":"Kaibel","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Peinhardt","sequence":"additional","affiliation":[]},{"given":"Marc E.","family":"Pfetsch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Achterberg, T.: SCIP \u2013 A framework to integrate constraint and mixed integer programming. Report 04-19, Zuse Institute Berlin (2004), http:\/\/www.zib.de\/Publications\/abstracts\/ZR-04-19\/"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T. Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett.\u00a033(1), 42\u201354 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01581239","volume":"59","author":"S. Chopra","year":"1993","unstructured":"Chopra, S., Rao, M.R.: The partition problem. Math. Program.\u00a059(1), 87\u2013115 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(93)E0175-X","volume":"61","author":"S. Chopra","year":"1995","unstructured":"Chopra, S., Rao, M.R.: Facets of the k-partition polytope. Discrete Appl. Math.\u00a061(1), 27\u201348 (1995)","journal-title":"Discrete Appl. Math."},{"key":"7_CR5","unstructured":"Eisenbl\u00e4tter, A.: Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds. PhD thesis, TU Berlin (2001)"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01581147","volume":"66","author":"J. Falkner","year":"1994","unstructured":"Falkner, J., Rendl, F., Wolkowicz, H.: A computational study of graph partitioning. Math. Program.\u00a066(2), 211\u2013239 (1994)","journal-title":"Math. Program."},{"key":"7_CR7","first-page":"247","volume":"74","author":"C. Ferreira","year":"1996","unstructured":"Ferreira, C., Martin, A., de Souza, C., Weismantel, R., Wolsey, L.: Formulations and valid inequalities of the node capacitated graph partitioning problem. Math. Program.\u00a074, 247\u2013266 (1996)","journal-title":"Math. Program."},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01581107","volume":"81","author":"C.E. Ferreira","year":"1998","unstructured":"Ferreira, C.E., Martin, A., de Souza, C.C., Weismantel, R., Wolsey, L.A.: The node capacitated graph partitioning problem: A computational study. Math. Program.\u00a081(2), 229\u2013256 (1998)","journal-title":"Math. Program."},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M. Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Prog.\u00a045(1), 59\u201396 (1989)","journal-title":"Math. Prog."},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01580870","volume":"47","author":"M. Gr\u00f6tschel","year":"1990","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: Facets of the clique partitioning polytope. Math. Prog.\u00a047(3), 367\u2013387 (1990)","journal-title":"Math. Prog."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Kaibel, V., Pfetsch, M.E.: Packing and partitioning orbitopes, Math. Program., In press (2007)","DOI":"10.1007\/s10107-006-0081-5"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10878-005-1861-1","volume":"10","author":"G. Kochenberger","year":"2005","unstructured":"Kochenberger, G., Glover, F., Alidaee, B., Wang, H.: Clustering of microarray data via clique partitioning. J. Comb. Optim.\u00a010(1), 77\u201392 (2005)","journal-title":"J. Comb. Optim."},{"key":"7_CR13","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.P. Ostrowski","year":"2007","unstructured":"Ostrowski, J.P., 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)"},{"issue":"1","key":"7_CR14","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.\u00a094(1), 71\u201390 (2002)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"7_CR15","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.\u00a098(1\u20133), 3\u201321 (2003)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"7_CR16","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.\u00a094(2\u20133), 207\u2013220 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"7_CR17","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 Opt.\u00a04(1), 40\u201362 (2007)","journal-title":"Discrete Opt."},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(98)00006-6","volume":"22","author":"A. Mehrotra","year":"1998","unstructured":"Mehrotra, A., Trick, M.A.: Cliques and clustering: A combinatorial approach. Oper. Res. Lett.\u00a022(1), 1\u201312 (1998)","journal-title":"Oper. Res. Lett."},{"key":"7_CR19","unstructured":"S\u00f8rensen, M.M.: Polyhedral computations for the simple graph partitioning problem. Working paper L-2005-02, \u00c5rhus School of Business (2005)"}],"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_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:05:28Z","timestamp":1605762328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72792-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727910","9783540727927"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72792-7_7","relation":{},"subject":[]}}