{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:17:55Z","timestamp":1761895075426},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_23","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T07:54:59Z","timestamp":1272354899000},"page":"266-275","source":"Crossref","is-referenced-by-count":3,"title":["Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation"],"prefix":"10.1007","author":[{"given":"Edoardo","family":"Amaldi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Coniglio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Gualandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Achterberg, T.: Constrained Integer Programming. PhD thesis, Technische Universitat at Berlin (2007)"},{"issue":"2","key":"23_CR2","first-page":"229","volume":"19","author":"G. Andreello","year":"2007","unstructured":"Andreello, G., Caprara, A., Fischetti, M.: Embedding 0,1\/2-cuts in a branch-and-cut framework: a computational study. J. on Computing\u00a019(2), 229\u2013238 (2007)","journal-title":"J. on Computing"},{"issue":"1-3","key":"23_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program.\u00a058(1-3), 295\u2013324 (1993)","journal-title":"Math. Program."},{"issue":"9","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E. Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework. Manag. Sci.\u00a042(9), 1229\u20131246 (1996)","journal-title":"Manag. Sci."},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","first-page":"416","volume-title":"Integer Programming and Combinatorial Optimization","author":"E. Balas","year":"2008","unstructured":"Balas, E., Fischetti, M., Zanette, A.: Can pure cutting plane algorithms work? In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol.\u00a05035, pp. 416\u2013434. Springer, Heidelberg (2008)"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-006-0054-8","volume":"110","author":"M. Fischetti","year":"2006","unstructured":"Fischetti, M., Lodi, A.: Optimizing over the first Chvatal closure. Math. Program.\u00a0110(1), 3\u201320 (2006)","journal-title":"Math. Program."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Trick, M.A.: Cliques, Coloring, and Satisfiability. In: Second DIMACS Implementation Challenge. DIMACS Series in Disc. Math. and Theo. Comp. Scie. Amer. Math. Soc., vol.\u00a026 (1996)","DOI":"10.1090\/dimacs\/026"},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","volume":"32","author":"T. Koch","year":"1998","unstructured":"Koch, T., Martin, A.: Solving Steiner Tree Problems in Graphs to Optimality. Networks\u00a032(3), 207\u2013232 (1998)","journal-title":"Networks"},{"key":"23_CR9","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: SteinLib: An updated library on steiner tree problems in graphs. Technical Report ZIB-Report 00-37, ZIB Berlin, Takustr. 7, Berlin (2000)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0166-218X(01)00348-1","volume":"123","author":"H. Marchand","year":"2002","unstructured":"Marchand, H., Martin, A., Weismantel, R., Wolsey, L.: Cutting planes in integer and mixed integer programming. Discrete Applied Mathematics\u00a0123, 397\u2013446 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s12532-009-0003-7","volume":"1","author":"F. Margot","year":"2009","unstructured":"Margot, F.: Testing Cut Generators for mixed-integer linear programming. Math. Prog. Comp.\u00a01, 69\u201395 (2009)","journal-title":"Math. Prog. Comp."},{"key":"23_CR12","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, Chichester (1988)"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M. Padberg","year":"1991","unstructured":"Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Reviews\u00a033, 60\u2013100 (1991)","journal-title":"SIAM Reviews"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T23:05:09Z","timestamp":1711407909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}