{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T03:57:20Z","timestamp":1784001440459,"version":"3.55.0"},"reference-count":108,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3911,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0166-218x(01)00348-1","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"397-446","source":"Crossref","is-referenced-by-count":158,"title":["Cutting planes in integer and mixed integer programming"],"prefix":"10.1016","volume":"123","author":[{"given":"Hugues","family":"Marchand","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Martin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurence","family":"Wolsey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00348-1_BIB1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01581103","article-title":"Capacitated facility location: separation algorithms and computational experience","volume":"81","author":"Aardal","year":"1998","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB2","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1287\/moor.20.3.562","article-title":"Capacitated facility location: valid inequalities and facets","volume":"20","author":"Aardal","year":"1995","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB3","unstructured":"D. Applegate, R.E. Bixby, V. Chv\u00e1tal, W. Cook, Project-and-lift (a paradigm for finding cuts), Draft, Aussois, March, 1998."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB4","unstructured":"A. Atamturk, On network design cut-set polyhedra, Draft, Department of Industrial Engineering and Operations Research, U.C. at Berkeley, August, 1999."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB5","unstructured":"A. Atamturk, G.L. Nemhauser, M.W.P. Savelsbergh, Conflict graphs in integer programming, Technical Report LEC 98-03, Georgia Institute of Technology, 1998."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB6","unstructured":"A. Balakrishnan, T.L. Magnanti, J. Sokol, Y. Wang, Modeling and solving the single facility line restoration problem, Technical report, MIT, Operations Research Center, 1998. Available at http:\/\/web.mit.edu\/yiwang\/www."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB7","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","article-title":"Facets of the knapsack polytope","volume":"8","author":"Balas","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","article-title":"Disjunctive programming","volume":"5","author":"Balas","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB9","first-page":"37","article-title":"Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study","volume":"12","author":"Balas","year":"1980","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","article-title":"A lift-and-project cutting plane algorithm for mixed 0\u20131 programs","volume":"58","author":"Balas","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB11","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","article-title":"Mixed 0\u20131 programming by lift-and-project in a branch-and-cut framework","volume":"42","author":"Balas","year":"1996","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","article-title":"Gomory cuts revisited","volume":"19","author":"Balas","year":"1996","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB13","unstructured":"E. Balas, E. Zemel, Lifting and complementing yields all the facets of positive zero-one programming polytopes, Math. Programming (1984) 13\u201324, Proceedings of the International Congress, Rio de Janeiro, 1981."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB14","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","article-title":"Facets of the knapsack polytope from minimal covers","volume":"34","author":"Balas","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB15","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1137\/S1052623494279134","article-title":"Network design using cut inequalities","volume":"6","author":"Barahona","year":"1996","journal-title":"SIAM J Optim."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB16","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1287\/mnsc.30.10.1255","article-title":"Strong formulations for multi-item capacitated lot-sizing","volume":"30","author":"Barany","year":"1984","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB17","doi-asserted-by":"crossref","unstructured":"J.E. Beasley, OR-Library: distributing test problems by electronic mail, J. Oper. Res. Soc. 41 (1990) 1069\u20131072, available at (http:\/\/mscmga.ms.ic.ac.uk\/info.html).","DOI":"10.1057\/jors.1990.166"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB18","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1287\/mnsc.46.5.724.12048","article-title":"BC-PROD: A specialized branch-and-cut system for lot-sizing problems","volume":"46","author":"Belvaux","year":"2000","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB19","unstructured":"C. Berge, F\u00e4rbung von Graphen, deren s\u00e4mtliche bzw. deren ungerade Kreise starr sind (Zusammenfassung), in Wissenschaftliche Zeitschrift, Mathematisch-Naturwissenschaftliche Reihe. Martin-Luther-Universit\u00e4t Halle-Wittenberg, 1961."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB20","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","article-title":"Capacitated network design\u2014polyhedral structure and computation","volume":"8","author":"Bienstock","year":"1996","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB21","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01581104","article-title":"Minimum cost capacity installation for multicommodity network flows","volume":"81","author":"Bienstock","year":"1998","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB22","unstructured":"R.E. Bixby, S. Ceria, C.M. McZeal, M.W.P. Savelsbergh, An updated mixed integer programming library: MIPLIB 3.0, text and problems available at http:\/\/www.caam.rice.edu\/~bixby\/miplib\/miplib.html"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB23","unstructured":"R. Bornd\u00f6rfer, Aspects of set packing, partitioning, and covering, Ph.D. Thesis, Technische Universit\u00e4t Berlin, 1998."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB24","unstructured":"R. Bornd\u00f6rfer, R. Weismantel, Relations among some combinatorial programs, Technical Report Preprint SC 97-54, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, 1997."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB25","unstructured":"R. Bornd\u00f6rfer, R. Weismantel, Set packing relaxations of some integer programs, Technical Report Preprint SC 97-30, Konrad-Zuse Zentrum f\u00fcr Informationstechnik Berlin, 1997."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB26","unstructured":"B. Brockm\u00fcller, O. G\u00fcnl\u00fck, L.A. Wolsey, designing private line networks\u2014polyhedral analysis and computation, Core Discussion Paper 9647, Universit\u00e9 Catholique de Louvain, 1996, revised March, 1998."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB27","series-title":"Annotated Bibliographies in Combinatorial Optimization","first-page":"45","article-title":"Branch-and-cut algorithms","author":"Caprara","year":"1997"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB28","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02592196","article-title":"{0,12}-Chv\u00e1tal\u2013Gomory cuts","volume":"74","author":"Caprara","year":"1996","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB29","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01581105","article-title":"Cutting planes for integer programs with general integer variables","volume":"81","author":"Ceria","year":"1998","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB30","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","article-title":"Edmonds polytopes and a hierarchy of combinatorial problems","volume":"4","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB31","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(75)90041-6","article-title":"On certain polytopes associated with graphs","volume":"18","author":"Chv\u00e1tal","year":"1975","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB32","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF02592189","article-title":"A cutting plane approach to capacitated lot-sizing with start-up costs","volume":"75","author":"Constantino","year":"1996","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB33","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","article-title":"Chv\u00e1tal closures for mixed integer programming problems","volume":"47","author":"Cook","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB34","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s101070050092","article-title":"bc-opt: A branch-and-cut code for mixed integer programs, bc-opt: a branch-and-cut code for mixed integer programs","volume":"86","author":"Cordier","year":"1999","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB35","unstructured":"CPLEX, Using the CPLEX callable library, ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA, Information available at URL http:\/\/www.cplex.com (1998)."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB36","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","article-title":"Solving large-scale zero-one linear programming problems","volume":"31","author":"Crowder","year":"1983","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB37","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1287\/opre.47.5.693","article-title":"Routing through virtual paths in layered telecommunication networks, Research Note N78\/95, Telenor Research and Development, Kjeller, Norway, 1995","volume":"49","author":"Dahl","year":"1999","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.10.1.1","article-title":"A cutting plane algorithm for multicommodity survivable network design problems","volume":"10","author":"Dahl","year":"1998","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB39","unstructured":"I.R. de Farias, E.L. Johnson, G.L. Nemhauser, Facets of the complementarity knapsack polytope, Technical Report LEC-98-08, Georgia Institute of Technology, 1998."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB40","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","article-title":"Matroids and the greedy algorithm","volume":"1","author":"Edmonds","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB41","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0167-5060(08)70817-3","article-title":"Matroid intersection","volume":"4","author":"Edmonds","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB42","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1287\/moor.12.3.451","article-title":"Generalizations of odd cycles and anti-cycles and their relation to independence system polyhedra","volume":"12","author":"M. J\u00fcnger","year":"1987","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB43","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1137\/S1052623493254455","article-title":"Solving multiple knapsack problems by cutting planes","volume":"6","author":"Ferreira","year":"1996","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB44","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","article-title":"Blocking and anti-blocking pairs of polyhedra","volume":"1","author":"Fulkerson","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB45","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01582064","article-title":"The Steiner tree polytope and related polyhedra","volume":"63","author":"Goemans","year":"1994","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB46","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","article-title":"Outline of an algorithm for integer solutions to linear programs","volume":"64","author":"Gomory","year":"1958","journal-title":"Bull. Amer. Soc."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB47","doi-asserted-by":"crossref","unstructured":"R.E. Gomory, An algorithm for the mixed integer problem, Technical Report RM-2597, The RAND Cooperation, 1960.","DOI":"10.2307\/1910130"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB48","doi-asserted-by":"crossref","unstructured":"R.E. Gomory, Solving linear programming problems in integers, in: R. Bellman, M. Hall (Eds.), Combinatorial Analysis, Proceedings of Symposia in Applied Mathematics 10, Providence, RI, 1960.","DOI":"10.1090\/psapm\/010\/0114670"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB49","series-title":"Recent Advances in Mathematical Programming","first-page":"269","article-title":"An algorithm for integer solutions to linear programming","author":"Gomory","year":"1969"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB50","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB51","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, C.L. Monma, M. Stoer, Design of survivable networks, in: M.O. Ball et al. (Eds.), Network Models, Handbooks in OR and MS 7, Elsevier, Amsterdam, 1995 (chapter 10).","DOI":"10.1016\/S0927-0507(05)80127-6"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB52","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1009841107478","article-title":"Sequence independent lifting in mixed integer programming","volume":"4","author":"Gu","year":"2000","journal-title":"J. Combin. Optim."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB53","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1007\/s101070050067","article-title":"Lifted flow cover inequalities for mixed 0\u20131 integer programs","volume":"85","author":"Gu","year":"1999","journal-title":"Math. Programming A"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB54","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","article-title":"Lifted cover inequalities for 0\u20131 integer programs: computation","volume":"10","author":"Gu","year":"1998","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB55","unstructured":"O. G\u00fcnl\u00fck, A branch-and-cut algorithm for capacitated network design, Technical report, Cornell University, 1966."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB56","doi-asserted-by":"crossref","unstructured":"O. G\u00fcnl\u00fck, Y. Pochet, Mixing mixed-integer inequalities, Math. Programming (2001) 429\u2013458.","DOI":"10.1007\/PL00011430"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB57","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","article-title":"Facets of regular 0\u20131 polytopes","volume":"8","author":"Hammer","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB58","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","article-title":"Solving airline crew-scheduling problems by branch-and-cut","volume":"39","author":"Hoffman","year":"1993","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB59","first-page":"129","article-title":"On an extension of the maximum-flow minimum-cut theorem to multi-commodity flows","volume":"13","author":"Iri","year":"1970","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB60","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0167-5060(08)70741-6","article-title":"Cutting plane theory: disjunctive methods","volume":"1","author":"Jeroslow","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB61","first-page":"169","article-title":"Degree-two inequalities, clique facets, and biperfect graphs","volume":"16","author":"Johnson","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB62","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.12.1.2.11900","article-title":"Progress in linear programming based branch-and-bound algorithms: an exposition","volume":"12","author":"Johnson","year":"2000","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB63","series-title":"Combinatorial Optimization","first-page":"11","article-title":"Practical problem solving with cutting plane algorithms in combinatorial optimization","author":"J\u00fcnger","year":"1995"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB64","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01589098","article-title":"A generalization of antiwebs to independence systems and their canonical facets","volume":"45","author":"Laurent","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB65","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","article-title":"On the Shannon capacity of a graph","volume":"25","author":"Lov\u00e1sz","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB66","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","article-title":"Cones of matrices and set-functions and 0\u20131 optimization","volume":"1","author":"Lov\u00e1sz","year":"1991","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB67","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","article-title":"Modelling and solving the two-facility network loading problem","volume":"43","author":"Magnanti","year":"1995","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB68","unstructured":"H. Marchand, Etude d'un probl\u00e8me d'optimisation li\u00e9 \u00e0 la gestion d'un parc \u00e9lectrique, Engineering Thesis, Facult\u00e9 des Sciences Appliqu\u00e9es, 1994."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB69","unstructured":"H. Marchand, A polyhedral study of the mixed knapsack set and its use to solve mixed integer programs, Ph.D. Thesis, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium, 1998."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB70","unstructured":"H. Marchand, L.A. Wolsey, Aggregation and mixed integer rounding to solve MIPs, CORE DP9839, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium, 1998, Oper. Res., to appear."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB71","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","article-title":"The 0\u20131 knapsack problem with a single continuous variable","volume":"85","author":"Marchand","year":"1999","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB72","unstructured":"A. Martin, Integer programs with block structure, Habilitations-Schrift Technische Universit\u00e4t Berlin, 1998. Available at (ftp:\/\/ftp.zib.de\/pub\/zib-publications\/reports\/SC-99-03.ps)."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB73","first-page":"243","article-title":"The intersection of knapsack polyhedra and extensions","volume":"Vol. 1412","author":"Martin","year":"1998"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB74","unstructured":"MEMIPS, Model enhanced solution methods for integer programming software, Esprit Project 20118, Public Report Reference DR1.1.10, 1997."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB75","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","article-title":"MINTO, a mixed INTeger optimizer","volume":"15","author":"Nemhauser","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB76","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1057\/jors.1992.71","article-title":"A strong cutting plane\/branch-and-bound algorithm for node packing","volume":"43","author":"Nemhauser","year":"1992","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB77","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BF01580222","article-title":"J., Properties of vertex packing and independence system polyhedra","volume":"6","author":"Nemhauser","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB78","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB79","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","article-title":"A recursive procedure to generate all cuts for 0\u20131 mixed integer programs","volume":"46","author":"Nemhauser","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB80","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01589100","article-title":"Facets and lifting procedures for the set covering polytope","volume":"45","author":"Nobili","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB81","unstructured":"P. Nobili, A. Sassano, A separation routine for the set covering polytope, in: E. Balas, G. Cornu\u00e9jols, R. Kannan (Eds.), Integer Programming and Combinatorial Optimization, Proceedings of the 2nd IPCO Conference, 1992, pp. 201\u2013219."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB82","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TCT.1971.1083312","article-title":"On feasibility conditions of multicommodity flows in networks","volume":"18","author":"Onaga","year":"1971","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB83","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/PL00011407","volume":"89","author":"Owen","year":"2001","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB84","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","article-title":"On the facial structure of set packing polyhedra","volume":"5","author":"Padberg","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB85","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/opre.23.4.833","article-title":"A note on zero-one programming","volume":"23","author":"Padberg","year":"1975","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB86","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","article-title":"Valid linear inequalities for fixed charge problems","volume":"33","author":"Padberg","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB87","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0167-6377(88)90076-4","article-title":"Valid inequalities and separation for capacitated economic lot-sizing","volume":"7","author":"Pochet","year":"1988","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB88","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/mnsc.37.1.53","article-title":"Solving multi-item lot-sizing problems using strong cutting planes","volume":"37","author":"Pochet","year":"1991","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB89","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/moor.18.4.767","article-title":"Lot-sizing with constant batches: formulation and valid inequalities","volume":"18","author":"Pochet","year":"1993","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB90","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(95)90600-K","article-title":"Integer knapsacks and flow covers with divisible coefficients: polyhedra, optimization and separation","volume":"59","author":"Pochet","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB91","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0377-2217(93)90263-M","article-title":"Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems","volume":"71","author":"Rardin","year":"1993","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB92","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1109\/9.231462","article-title":"Daily generation management at electricit\u00e9 de France: from planning towards real time","volume":"38","author":"Renaud","year":"1993","journal-title":"IEEE Trans. Automat. Control"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB93","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01587087","article-title":"On the facial structure of the set covering polytope","volume":"44","author":"Sassano","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB94","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0167-5060(08)70085-2","article-title":"On cutting planes","volume":"9","author":"Schrijver","year":"1980","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB95","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB96","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","article-title":"A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems","volume":"3","author":"Sherali","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB97","unstructured":"S. Thienel, ABACUS\u2014a branch-and-cut system, Doctoral Thesis, Universit\u00e4t zu K\u00f6ln, 1995."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB98","unstructured":"R. van de Leensel, Models and algorithms for telecommunications network design, Proefschrift, Universiteit Maastricht, 1999."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB99","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s101070050084","article-title":"Lifting valid inequalities for the precedence constrained knapsack problem","volume":"86","author":"van de Leensel","year":"1999","journal-title":"Math. Programming A"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB100","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(86)90061-2","article-title":"Valid inequalities for mixed 0\u20131 programs","volume":"4","author":"Van Roy","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB101","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","article-title":"Solving mixed 0\u20131 problems by automatic reformulation","volume":"35","author":"Van Roy","year":"1987","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB102","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02614517","article-title":"On the 0\/1 knapsack polytope","volume":"77","author":"Weismantel","year":"1997","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB103","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","article-title":"Faces for a linear inequality in 0\u20131 variables","volume":"8","author":"Wolsey","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB104","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1287\/moor.2.1.66","article-title":"Valid inequalities and superadditivity for 0\/1 integer programs","volume":"2","author":"Wolsey","year":"1977","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB105","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(89)90036-9","article-title":"Submodularity and valid inequalities in capacitated fixed charge networks","volume":"8","author":"Wolsey","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB106","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(90)90148-6","article-title":"Valid inequalities for 0\u20131 knapsacks and MIPS with generalized upper bound constraints","volume":"29","author":"Wolsey","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00348-1_BIB107","series-title":"Integer Programming","author":"Wolsey","year":"1998"},{"key":"10.1016\/S0166-218X(01)00348-1_BIB108","first-page":"27","article-title":"On the membership problem for the elementary closure of a ployhedron","volume":"12","author":"Eisenbrand","year":"1999","journal-title":"Combinatorica"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003481?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003481?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:27:22Z","timestamp":1556584042000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01003481"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":108,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0166218X01003481"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00348-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}