{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:18:22Z","timestamp":1761895102171},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135194"},{"type":"electronic","value":"9783642135200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13520-0_17","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T16:10:33Z","timestamp":1276359033000},"page":"136-140","source":"Crossref","is-referenced-by-count":13,"title":["An In-Out Approach to Disjunctive Optimization"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Fischetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domenico","family":"Salvagnin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","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\u00a049(1), 3\u201317 (2007)","journal-title":"Networks"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-006-0086-0","volume":"112","author":"G. Cornu\u00e9jols","year":"2008","unstructured":"Cornu\u00e9jols, G.: Valid inequalities for mixed integer linear programs. Mathematical Programming\u00a0112(1), 3\u201344 (2008)","journal-title":"Mathematical Programming"},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s10107-005-0670-8","volume":"106","author":"G. Cornu\u00e9jols","year":"2006","unstructured":"Cornu\u00e9jols, G., Lemar\u00e9chal, C.: A convex analysis perspective on disjunctive cuts. Mathematical Programming\u00a0106(3), 567\u2013586 (2006)","journal-title":"Mathematical Programming"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Naoum-Sawaya, J., Elhedhli, S.: An interior-point branch-and-cut algorithm for mixed integer programs. Technical report, Department of Management Sciences, University of Waterloo (2009)","DOI":"10.1007\/s10479-010-0806-y"},{"key":"17_CR5","first-page":"703","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"Kelley, J.E.: The cutting plane method for solving convex programs. Journal of the SIAM\u00a08, 703\u2013712 (1960)","journal-title":"Journal of the SIAM"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BF01580439","volume":"8","author":"J. Elzinga","year":"1975","unstructured":"Elzinga, J., Moore, T.J.: A central cutting plane algorithm for the convex programming problem. Mathematical Programming\u00a08, 134\u2013145 (1975)","journal-title":"Mathematical Programming"},{"key":"17_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms: Theory and Analysis","author":"Y. Ye","year":"1997","unstructured":"Ye, Y.: Interior Point Algorithms: Theory and Analysis. John Wiley, New York (1997)"},{"key":"17_CR8","first-page":"226","volume":"37","author":"S. Tarasov","year":"1988","unstructured":"Tarasov, S., Khachiyan, L., Erlikh, I.: The method of inscribed ellipsoids. Soviet Mathematics Doklady\u00a037, 226\u2013230 (1988)","journal-title":"Soviet Mathematics Doklady"},{"issue":"6","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1287\/opre.29.6.1039","volume":"29","author":"R.G. Bland","year":"1981","unstructured":"Bland, R.G., Goldfarb, D., Todd, M.J.: The ellipsoid method: a survey. Operations Research\u00a029(6), 1039\u20131091 (1981)","journal-title":"Operations Research"},{"key":"17_CR10","first-page":"1","volume":"69","author":"D.S. Atkinson","year":"1995","unstructured":"Atkinson, D.S., Vaidya, P.M.: A cutting plane algorithm for convex programming that uses analytic centers. Mathematical Programming\u00a069, 1\u201343 (1995)","journal-title":"Mathematical Programming"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01585556","volume":"69","author":"Y. Nesterov","year":"1995","unstructured":"Nesterov, Y.: Cutting plane algorithms from analytic centers: efficiency estimates. Mathematical Programming\u00a069(1), 149\u2013176 (1995)","journal-title":"Mathematical Programming"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01580602","volume":"60","author":"J.L. Goffin","year":"1993","unstructured":"Goffin, J.L., Vial, J.P.: On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm. Mathematical Programming\u00a060, 81\u201392 (1993)","journal-title":"Mathematical Programming"},{"key":"17_CR13","unstructured":"Boyd, S., Vandenberghe, L.: Localization and cutting-plane methods (2007), http:\/\/www.stanford.edu\/class\/ee364b\/notes\/localization_methods_notes.pdf"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Annals of Discrete Mathematics\u00a05, 3\u201351 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"17_CR15","first-page":"12","volume":"58","author":"R.E. Bixby","year":"1998","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Optima\u00a058, 12\u201315 (1998), http:\/\/www.caam.rice.edu\/bixby\/miplib\/miplib.html","journal-title":"Optima"},{"issue":"4","key":"17_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T. Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Operations Research Letters\u00a034(4), 1\u201312 (2006), http:\/\/miplib.zib.de","journal-title":"Operations Research Letters"},{"issue":"11","key":"17_CR17","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J. Beasley","year":"1990","unstructured":"Beasley, J.: OR-Library: distributing test problems by electronic mail. Journal of the Operational Research Society\u00a041(11), 1069\u20131072 (1990), http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html","journal-title":"Journal of the Operational Research Society"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13520-0_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:12Z","timestamp":1606185552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}