{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T07:15:13Z","timestamp":1781248513510,"version":"3.54.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1007\/bf01581105","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:36:37Z","timestamp":1114680997000},"page":"201-214","source":"Crossref","is-referenced-by-count":30,"title":["Cutting planes for integer programs with general integer variables"],"prefix":"10.1007","volume":"81","author":[{"given":"Sebasti\u00e1n","family":"Ceria","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C\u00e9cile","family":"Cordier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hugues","family":"Marchand","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurence A.","family":"Wolsey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E. Balas","year":"1996","unstructured":"E. Balas, S. Ceria, G. Cornu\u00e9jols, Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework, Management Science 42 (1996) 1229\u20131246.","journal-title":"Management Science"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"H. Crowder, E.L. Johnson, M.W. Padberg, Solving large-scale zero\u2013one linear programming problems, Operations Research 31 (1983) 803\u2013834.","journal-title":"Operations Research"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.35.1.45","volume":"35","author":"T.J. Roy Van","year":"1987","unstructured":"T.J. Van Roy, L.A. Wolsey, Solving mixed 0\u20131 programs by automatic reformulation, Operations Research 35 (1987) 145\u2013163.","journal-title":"Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/net.3230230205","volume":"23","author":"T.L. Magnanti","year":"1993","unstructured":"T.L. Magnanti, P. Mirchandani, Shortest paths, network design and associated polyhedra, Networks 23 (1993) 103\u2013121.","journal-title":"Networks"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(95)90600-K","volume":"59","author":"Y. Pochet","year":"1995","unstructured":"Y. Pochet, L.A. Wolsey, Integer knapsacks and flow covers with divisible coefficients: polyhedra, optimization and separation, Discrete Applied Mathematics 59 (1995) 57\u201374.","journal-title":"Discrete Applied Mathematics"},{"key":"CR6","volume-title":"Etude d'un probl\u00e8me d'optimisation li\u00e9 \u00e0 la gestion d'un parc \u00e9lectrique, M\u00e9moire d'ing\u00e9nieur civil en math\u00e9matiques appliqu\u00e9es","author":"H. Marchand","year":"1994","unstructured":"H. Marchand, Etude d'un probl\u00e8me d'optimisation li\u00e9 \u00e0 la gestion d'un parc \u00e9lectrique, M\u00e9moire d'ing\u00e9nieur civil en math\u00e9matiques appliqu\u00e9es, UCL, Louvain-la-Neuve, 1994."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G.L. Nemhauser","year":"1990","unstructured":"G.L. Nemhauser, L.A. Wolsey, A recursive procedure for generating all cuts for 0\u20131 mixed integer programs, Mathematical Programming 46 (1990) 379\u2013390.","journal-title":"Mathematical Programming"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"M.W. Padberg, On the facial structure of set packing polyhedra, Mathematical Programming 5 (1973) 199\u2013215.","journal-title":"Mathematical Programming"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.24.2.367","volume":"24","author":"L.A. Wolsey","year":"1976","unstructured":"L.A. Wolsey, Facets and strong valid inequalities for integer programs, Operations Research 24 (1976) 367\u2013372.","journal-title":"Operations Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1090\/psapm\/010\/0114670","volume-title":"Combinatorial Analysis","author":"R.E. Gomory","year":"1960","unstructured":"R.E. Gomory, Solving linear programming problems in integers, in: R.E. Bellman, M. Hall, Jr. (Eds.), Combinatorial Analysis, American Mathematical Society, Providence, RI, 1960, pp. 211\u2013216."},{"key":"CR11","first-page":"1","volume":"19","author":"E. Balas","year":"1996","unstructured":"E. Balas, S. Ceria, G. Cornu\u00e9jols, N.R. Natraj, Gomory cuts revisited, OR Letters 19 (1996) 1\u20139.","journal-title":"OR Letters"},{"key":"CR12","volume-title":"Model Building in Mathematical Programming","author":"H.P. Williams","year":"1993","unstructured":"H.P. Williams, Model Building in Mathematical Programming, 3rd ed., Wiley, Chichester, 1993.","edition":"3rd ed."},{"key":"CR13","unstructured":"Pamips, Esprit Project 8755, Public Report Ref. DR4.3.5\/I, 31\/1\/95."},{"key":"CR14","volume-title":"Integer programming solutions for capacity expansion of the local access network","author":"W.A. Cook","year":"1990","unstructured":"W.A. Cook, Integer programming solutions for capacity expansion of the local access network, Bell Communications Research, Morristown, NJ, 1990."},{"key":"CR15","unstructured":"B. Brockmueller, O. Gunluk, L.A. Wolsey, Designing Private Line Networks: Polyhedral Analysis and Computation. CORE Discussion paper DP9647, Universit\u00e9 Catholique de Louvain (1996)."},{"key":"CR16","unstructured":"R.E. Bixby, S. Ceria, C. McZeal, M. Savelsbergh, An Updated Mixed Integer Programming Library: MIPLIB 3.0 (in preparation)."},{"key":"CR17","unstructured":"CPLEX 3.0 Optimizer, CPLEX Inc."},{"key":"CR18","unstructured":"XPRESS-MP optimisation subroutine library, Reference Manual, Release 9, Dash Associates, Blisworth House, Blisworth, Northants NN7 3BX, UK."},{"key":"CR19","first-page":"49","volume":"77","author":"R. Weismantel","year":"1997","unstructured":"R. Weismantel, On the 0\u20131 knapsack polytope, Mathematical Programming 77 (1997) 49\u201368.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581105.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581105\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:15Z","timestamp":1556896335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["BF01581105"],"URL":"https:\/\/doi.org\/10.1007\/bf01581105","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}