{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:10:52Z","timestamp":1774415452097,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540727910","type":"print"},{"value":"9783540727927","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72792-7_18","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T12:07:11Z","timestamp":1182773231000},"page":"225-239","source":"Crossref","is-referenced-by-count":4,"title":["On the Exact Separation of Mixed Integer Knapsack Cuts"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Fukasawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcos","family":"Goycoolea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-45586-8_7","volume-title":"Computational Combinatorial Optimization","author":"D. Applegate","year":"2001","unstructured":"Applegate, D., Bixby, R.E., Chv\u00e1tal, V., Cook, W.: TSP cuts which do not conform to the template paradigm. In: J\u00fcnger, M., Naddef, D. (eds.) Computational Combinatorial Optimization. LNCS, vol.\u00a02241, pp. 261\u2013304. Springer, Heidelberg (2001)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Applegate, D., Cook, W., Dash, S., Espinoza, D.: Exact solutions to linear programming problems. Submitted to Operations Research Letters (2006)","DOI":"10.1016\/j.orl.2006.12.010"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-003-0400-z","volume":"98","author":"A. Atamt\u00fcrk","year":"2003","unstructured":"Atamt\u00fcrk, A.: On the facets of the mixed\u2013integer knapsack polyhedron. Mathematical Programming\u00a098, 145\u2013175 (2003)","journal-title":"Mathematical Programming"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","volume":"94","author":"E. Balas","year":"2003","unstructured":"Balas, E., Perregaard, M.: A precise correspondence between lift-and-project cuts, simple disjuntive cuts, and mixed integer Gomory cuts for 0-1 programming. Mathematical Programming\u00a094, 221\u2013245 (2003)","journal-title":"Mathematical Programming"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Balas, E., Saxena, A.: Optimizing over the split closure. Mathematical Programming, To appear","DOI":"10.1007\/s10107-006-0049-5"},{"key":"18_CR6","volume-title":"Dynamic Programming","author":"R.E. Bellman","year":"1957","unstructured":"Bellman, R.E.: Dynamic Programming. Princeton University Press, Princeton (1957)"},{"key":"18_CR7","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)","journal-title":"Optima"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/opre.42.1.53","volume":"42","author":"A.E. Boyd","year":"1992","unstructured":"Boyd, A.E.: Fenchel cutting planes for integer programs. Operations Research\u00a042, 53\u201364 (1992)","journal-title":"Operations Research"},{"issue":"2-3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10107-002-0320-3","volume":"94","author":"A. Caprara","year":"2003","unstructured":"Caprara, A., Letchford, A.: On the separation of split cuts and related inequalities. Mathematical Programming\u00a094(2-3), 279\u2013294 (2003)","journal-title":"Mathematical Programming"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W. Cook","year":"1990","unstructured":"Cook, W., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programming problems. Mathematical Programming\u00a047, 155\u2013174 (1990)","journal-title":"Mathematical Programming"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1287\/ijoc.15.4.385.24893","volume":"15","author":"G. Cornu\u00e9jols","year":"2003","unstructured":"Cornu\u00e9jols, G., Li, Y., Vanderbussche, D.: K-cuts: A variation of gomory mixed integer cuts from the LP tableau. Informs Journal On Computing\u00a015, 385\u2013396 (2003)","journal-title":"Informs Journal On Computing"},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"Crowder, H., Johnson, E.L., Padberg, M.: Solving large-scale zero-one linear-programming problems. Operations Research\u00a031, 803\u2013834 (1983)","journal-title":"Operations Research"},{"issue":"2","key":"18_CR13","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"G.B. Dantzig","year":"1957","unstructured":"Dantzig, G.B.: Discrete variable extremum problems. Operations Research\u00a05(2), 266\u2013277 (1957)","journal-title":"Operations Research"},{"key":"18_CR14","unstructured":"Dash, S., Goycoolea, M., G\u00fcnl\u00fck, O.: Two-step mir inequalities for mixed-integer programs. Optimization Online (Jul. 2006)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Dash, S., G\u00fcnl\u00fck, O.: On the strength of gomory mixed-integer cuts as group cuts. IBM research report RC23967 (2006)","DOI":"10.1007\/s10107-007-0179-4"},{"key":"18_CR16","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Lodi, A.: MIR closures of polyhedral sets. Available online at http:\/\/www.optimization-online.org\/DB_HTML\/2007\/03\/1604.html"},{"key":"18_CR17","unstructured":"Espinoza, D.G.: On Linear Programming, Integer Programming and Cutting Planes. PhD thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology (March 2006)"},{"key":"18_CR18","unstructured":"Fischetti, M., Lodi, A.: On the knapsack closure of 0-1 integer linear problems. Presentation at 10th International Workshop on Combinatorial Optimization, Aussois (2006), Available at http:\/\/www-id.imag.fr\/IWCO2006\/slides\/Fischetti.pdf"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1287\/opre.50.1.78.17793","volume":"50","author":"R.E. Gomory","year":"2002","unstructured":"Gomory, R.E.: Early integer programming (reprinted). Operations Research\u00a050, 78\u201381 (2002)","journal-title":"Operations Research"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01584976","volume":"3","author":"R.E. Gomory","year":"1972","unstructured":"Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra I. Mathematical Programming\u00a03, 23\u201385 (1972)","journal-title":"Mathematical Programming"},{"key":"18_CR21","unstructured":"Goycoolea, M.: Cutting Planes for Large Mixed Integer Programming Models. PhD thesis, Georgia Institute of Technology (2006)"},{"key":"18_CR22","unstructured":"Granlund, T.: The GNU multiple precision arithmetic library. Available on-line at http:\/\/www.swox.com\/gmp\/"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"10","author":"Z. Gu","year":"1998","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Lifted cover inequalities for 0-1 integer programs: Computation. INFORMS Journal on Computing\u00a010, 427\u2013437 (1998)","journal-title":"INFORMS Journal on Computing"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E. Horowitz","year":"1974","unstructured":"Horowitz, E., Sahni, S.: Computing partitions with applications to the knapsack problem. Journal of the ACM\u00a021, 277\u2013292 (1974)","journal-title":"Journal of the ACM"},{"key":"18_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H. Marchand","year":"2001","unstructured":"Marchand, H., Wolsey, L.A.: Aggregation and mixed integer rounding to solve MIPs. Operations Research\u00a049, 363\u2013371 (2001)","journal-title":"Operations Research"},{"key":"18_CR27","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. J. Wiley, New York (1990)"},{"key":"18_CR28","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G.L. Nemhauser","year":"1990","unstructured":"Nemhauser, G.L., Wolsey, L.A.: A recursive procedure for generating all cuts for 0-1 mixed integer programs. Mathematical Programming\u00a046, 379\u2013390 (1990)","journal-title":"Mathematical Programming"},{"key":"18_CR29","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"M.W.P. Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P.: Preprocessing and probing for mixed integer programming problems. ORSA Journal on Computing\u00a06, 445\u2013454 (1994)","journal-title":"ORSA Journal on Computing"},{"key":"18_CR30","first-page":"257","volume":"81","author":"X.Q. Yan","year":"1998","unstructured":"Yan, X.Q., Boyd, E.A.: Cutting planes for mixed-integer knapsack polyhedra. Mathematical Programming\u00a081, 257\u2013262 (1998)","journal-title":"Mathematical Programming"}],"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_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T14:58:14Z","timestamp":1683903494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72792-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727910","9783540727927"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72792-7_18","relation":{},"subject":[]}}