{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:13:19Z","timestamp":1771035199667,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,10,18]],"date-time":"2012-10-18T00:00:00Z","timestamp":1350518400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10107-012-0596-x","type":"journal-article","created":{"date-parts":[[2012,10,17]],"date-time":"2012-10-17T22:08:35Z","timestamp":1350511715000},"page":"87-110","source":"Crossref","is-referenced-by-count":15,"title":["Coordinated cutting plane generation via multi-objective separation"],"prefix":"10.1007","volume":"143","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","published-online":{"date-parts":[[2012,10,18]]},"reference":[{"key":"596_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. C 1, 1\u201341 (2009)","journal-title":"Math. Program. C"},{"key":"596_CR2","doi-asserted-by":"crossref","unstructured":"Amaldi, E., Coniglio, S., Gualandi, S.: Improving cutting plane generation with 0\u20131 inequalities by bi-criteria separation. In: Festa, P. (ed.) Experimental Algorithms, Lecture Notes in Computer Science, pp. 266\u2013275. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-13193-6_23"},{"issue":"2","key":"596_CR3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/ijoc.1050.0162","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. INFORMS J. Comput. 19(2), 229\u2013238 (2007)","journal-title":"INFORMS J. Comput."},{"issue":"1\u20133","key":"596_CR4","doi-asserted-by":"crossref","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\u20131 programs. Math. Program. 58(1\u20133), 295\u2013324 (1993)","journal-title":"Math. Program."},{"issue":"9","key":"596_CR5","doi-asserted-by":"crossref","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. Manage. Sci. 42(9), 1229\u20131246 (1996)","journal-title":"Manage. Sci."},{"key":"596_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e8jols, G., Natraj, N.: Gomory cuts revised. Oper. Res. Lett. 19, 1\u20139 (1996)","journal-title":"Oper. Res. Lett."},{"key":"596_CR7","first-page":"153","volume":"1","author":"E Balas","year":"2011","unstructured":"Balas, E., Fischetti, M., Zanette, A.: Lexicography and degeneracy: can a pure cutting plane algorithm work? Math. Program. A 1, 153\u2013176 (2011)","journal-title":"Math. Program. A"},{"key":"596_CR8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107-006-0049-5","volume":"113","author":"E Balas","year":"2008","unstructured":"Balas, E., Saxena, A.: Optimizing over the split closure. Math. Program. A 113, 219\u2013240 (2008)","journal-title":"Math. Program. A"},{"key":"596_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/net.20137","volume":"49","author":"W Ben-Ameur","year":"2007","unstructured":"Ben-Ameur, W., Neto, J.: Acceleration of cutting-plane and column generation algorithms: applications to network design. Networks 49, 3\u201317 (2007)","journal-title":"Networks"},{"key":"596_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01582573","volume":"64","author":"S Chopra","year":"1994","unstructured":"Chopra, S., Rao, M.R.: The Steiner tree problem I: formulations, compositions and extension of facets. Math. Program. 64, 209\u2013229 (1994)","journal-title":"Math. Program."},{"key":"596_CR11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01582574","volume":"64","author":"S Chopra","year":"1994","unstructured":"Chopra, S., Rao, M.R.: The Steiner tree problem II: properties and classes of facets. Math. Program. 64, 231\u2013246 (1994)","journal-title":"Math. Program."},{"key":"596_CR12","doi-asserted-by":"crossref","unstructured":"Coniglio, S.: On coordinated cutting plane generation and mixed-integer programs with nonconvex 2-norm constraints. Ph.D. thesis, Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy (2011)","DOI":"10.1007\/s10288-012-0199-7"},{"key":"596_CR13","doi-asserted-by":"crossref","unstructured":"Coniglio, S.: On coordinated cutting plane generation and mixed-integer programs with nonconvex 2-norm constraints. 4OR: Quart. J. Oper. Res. 1\u20132 (2012). doi: 10.1007\/s10288-012-0199-7","DOI":"10.1007\/s10288-012-0199-7"},{"key":"596_CR14","unstructured":"Cook, W., Fukusawa, R., Goycoolea, M.: Choosing the best cuts. In: 3rd Mixed Integer Programming, Workshop (2006)"},{"key":"596_CR15","doi-asserted-by":"crossref","unstructured":"Desrosiers, J., L\u00fcbbeke, M.: A primer in column generation. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, GERAD 25th Anniversary, chap. 1, pp. 1\u201332. Springer, Berlin (2005)","DOI":"10.1007\/0-387-25486-2_1"},{"issue":"2","key":"596_CR16","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"issue":"1","key":"596_CR17","doi-asserted-by":"crossref","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 Chv\u00e0tal closure. Math. Program. A 110(1), 3\u201320 (2006)","journal-title":"Math. Program. A"},{"key":"596_CR18","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Salvagnin, D.: An in-out approach to disjunctive optimization. In: Lodi, A., Toth, P. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, pp. 136\u2013140. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-13520-0_17"},{"key":"596_CR19","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"R Gomory","year":"1963","unstructured":"Gomory, R.: An algorithm for integer solutions to linear programs. In: Graves, R., Wolfe, P. (eds.) Recent Advances in Mathematical Programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"key":"596_CR20","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1287\/ijoc.1100.0436","volume":"24","author":"S Gualandi","year":"2012","unstructured":"Gualandi, S., Malucelli, F.: Exact solution of graph coloring problems via constraint programming and column generation. INFORMS J. Comput. 24, 81\u2013100 (2012)","journal-title":"INFORMS J. Comput."},{"key":"596_CR21","doi-asserted-by":"crossref","unstructured":"Held, S., Cook, W., Sewell, E.: Safe lower bounds for graph coloring. In: G\u00fcnl\u00fck, O., Woeginger, G. (eds.) Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, pp. 261\u2013273. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-20807-2_21"},{"key":"596_CR22","volume-title":"Cliques, Coloring, and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"D Johnson","year":"1996","unstructured":"Johnson, D., Trick, M.: Cliques, Coloring, and Satisfiability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26. American Mathematical Society, Providence (1996)"},{"issue":"3","key":"596_CR23","doi-asserted-by":"crossref","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 32(3), 207\u2013232 (1998)","journal-title":"Networks"},{"key":"596_CR24","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-1-4613-0255-1_9","volume-title":"Steiner Trees in Industry","author":"T Koch","year":"2001","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: SteinLib: an updated library on steiner tree problems in graphs. In: Cheng, X., Du, D. (eds.) Steiner Trees in Industry, vol. 11, pp. 285\u2013326. Kluwer, Dordrecht (2001)"},{"key":"596_CR25","volume-title":"Integer Programming and Combinatorial Optimization","author":"G Nemhauser","year":"1980","unstructured":"Nemhauser, G., Wolsey, L.: Integer Programming and Combinatorial Optimization. Wiley, New York (1980)"},{"key":"596_CR26","doi-asserted-by":"crossref","unstructured":"Ostergard, P.: A fast algorithm for the maximum clique problem. Disc. Appl. Math. 120(1\u20133), 197\u2013207 (2002)","DOI":"10.1016\/S0166-218X(01)00290-6"},{"key":"596_CR27","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1987.133","volume":"38","author":"N Phillips","year":"1987","unstructured":"Phillips, N.: A weighting function for pre-emptive multicriteria assignment problems. J. Oper. Res. Soc. 38, 797\u2013802 (1987)","journal-title":"J. Oper. Res. Soc."},{"key":"596_CR28","unstructured":"Wesselmann, F., Suhl, U.: Implementation techniques for cutting plane management and selection. Technical report, University of Paderborn, Paderborn (2007)"},{"key":"596_CR29","volume-title":"Model Building in Mathematical Programming","author":"H Williams","year":"1999","unstructured":"Williams, H.: Model Building in Mathematical Programming. Wiley, New York (1999)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0596-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0596-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0596-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,30]],"date-time":"2022-01-30T10:05:45Z","timestamp":1643537145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0596-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,18]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["596"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0596-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,18]]}}}