{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T17:10:23Z","timestamp":1676826623734},"reference-count":27,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0167-6377(03)00014-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T18:47:43Z","timestamp":1049741263000},"page":"245-253","source":"Crossref","is-referenced-by-count":10,"title":["Foundation-penalty cuts for mixed-integer programs"],"prefix":"10.1016","volume":"31","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(03)00014-2_BIB1","unstructured":"D. Applegate, R. Bixby, W. Cook, V. Chvatal, Personal Communication, in: J.T. Linderoth, M.W.P. Savelsbergh (Eds.), A computational study of search strategies for mixed integer programming, INFORMS Comput. 11 (1999) 173\u2013187."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB2","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."},{"issue":"1\u20132","key":"10.1016\/S0167-6377(03)00014-2_BIB3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","article-title":"Disjunctive programming","volume":"89","author":"Balas","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB4","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. Program."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB5","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":"1975","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB6","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","article-title":"Solving large-scale zero\u2013one linear programming problems","volume":"31","author":"Crowder","year":"1983","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB7","series-title":"Integer and Nonlinear Programming II","article-title":"Faces of the Gomory polyhedron","author":"Glover","year":"1970"},{"issue":"1","key":"10.1016\/S0167-6377(03)00014-2_BIB8","first-page":"86","article-title":"Convexity cuts for multiple choice problems","volume":"3","author":"Glover","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01681342","article-title":"Polyhedral annexation in mixed integer and combinatorial programming","volume":"8","author":"Glover","year":"1975","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/S0167-6377(03)00014-2_BIB10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1008621204567","article-title":"Generating cuts from surrogate constraint analysis for zero\u2013one and multiple choice programming","volume":"8","author":"Glover","year":"1997","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB11","series-title":"Combinatorial Analysis, American Mathematical Society","first-page":"211","article-title":"Solving linear programming problems in integers","author":"Gomory","year":"1960"},{"key":"10.1016\/S0167-6377(03)00014-2_BIB12","series-title":"An Algorithm for the Mixed Integer Problem, Research Memorandum RM-2597","author":"Gomory","year":"1960"},{"key":"10.1016\/S0167-6377(03)00014-2_BIB13","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","article-title":"Some polyhedra related to combinatorial problems","volume":"2","author":"Gomory","year":"1969","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB14","unstructured":"Z. Gu, G.L. Nemhauser, M.W.P. Savelsbergh, Sequence Independent Lifting, Working paper, Georgia Institute of Technology, Atlanta, GA, 1995."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s101070050067","article-title":"Lifted flow covers for mixed 0\u20131 integer programs","volume":"85","author":"Gu","year":"1999","journal-title":"Math. Program."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB16","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. Program."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0167-5060(08)70741-6","article-title":"Cutting plane theory","volume":"1","author":"Jeroslow","year":"1977","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"10.1016\/S0167-6377(03)00014-2_BIB18","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","article-title":"Aggregation and mixed integer rounding to solve MIPS","volume":"49","author":"Marchand","year":"2001","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB19","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"2001"},{"key":"10.1016\/S0167-6377(03)00014-2_BIB20","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. Program."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB21","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.32.1.52","article-title":"Surrogate dual multiplier search procedures in integer programming","volume":"32","author":"Rardin","year":"1984","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/S0167-6377(03)00014-2_BIB22","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\u2013one programming problems","volume":"3","author":"Sherali","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB23","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","article-title":"A hierarchy of relaxations and convex hull characterizations for mixed-integer zero\u2013one programming problems","volume":"52","author":"Sherali","year":"1994","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/S0167-6377(03)00014-2_BIB24","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1287\/opre.46.3.396","article-title":"Exploiting special structures in constructing a hierarchy of relaxations for 0\u20131 mixed integer problems","volume":"46","author":"Sherali","year":"1998","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/S0167-6377(03)00014-2_BIB25","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1137\/S0895480192230607","article-title":"Sequential and simultaneous liftings of minimal cover inequalities for generalized upper bound constrained knapsack polytopes","volume":"8","author":"Sherali","year":"1995","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"10.1016\/S0167-6377(03)00014-2_BIB26","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0167-6377(94)00065-E","article-title":"A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope","volume":"17","author":"Sherali","year":"1995","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(03)00014-2_BIB27","doi-asserted-by":"crossref","unstructured":"H.D. Sherali, C.M. Shetty, Optimization with Disjunctive Constraints, Series in Economics and Mathematical Systems, Vol. 181, Springer, Berlin, Heidelberg, New York, 1980.","DOI":"10.1007\/978-3-642-48794-1"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637703000142?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637703000142?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T21:23:54Z","timestamp":1553376234000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637703000142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0167637703000142"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(03)00014-2","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}