{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T12:15:56Z","timestamp":1648642556322},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540436768","type":"print"},{"value":"9783540478676","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47867-1_12","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T18:47:17Z","timestamp":1179946037000},"page":"161-175","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms"],"prefix":"10.1007","author":[{"given":"Jean-Philippe P.","family":"Richard","sequence":"first","affiliation":[]},{"suffix":"Jr","given":"Ismael R.","family":"de Farias","sequence":"additional","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,21]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas, S. Ceria, and G. Cornu\u00e9jols. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming, 58:295\u2013324, 1993.","journal-title":"Mathematical Programming"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E. Balas","year":"1978","unstructured":"E. Balas and E. Zemel. Facets of the knapsack polytope from minimal covers. SIAM Journal on Applied Mathematics, 34:119\u2013148, 1978.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"E. Balas. Facets of the knapsack polytope. Mathematical Programming, 8:146\u2013164, 1975.","journal-title":"Mathematical Programming"},{"key":"12_CR4","unstructured":"T. Christof and A. L\u00f6bel. PORTA: A POlyhedron Representation Transformation Algorithm. \n http:\/\/www.zib.de\/Optimization\/Software\/Porta\/\n \n , 1997."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H.P. Crowder","year":"1983","unstructured":"H.P. Crowder, E.L. Johnson, and M.W. Padberg. Solving large-scale zero-one linear programming problems. Operations Research, 31:803\u2013834, 1983.","journal-title":"Operations Research"},{"key":"12_CR6","unstructured":"I.R. de Farias, Johnson E.L., and Nemhauser G.L. A polyhedral study of the cardinality constrained knapsack problem. Technical Report 01-05, Georgia Institute of Technology, 2001."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/PL00011392","volume":"89","author":"I.R. Farias de","year":"2000","unstructured":"I.R. de Farias, E.L. Johnson, and G.L. Nemhauser. A generalized assignment problem with special ordered sets: A polyhedral approach. Mathematical Programming, 89:187\u2013203, 2000.","journal-title":"Mathematical Programming"},{"key":"12_CR8","unstructured":"I.R. de Farias, E.L. Johnson, and G.L. Nemhauser. Facets of the complementarity knapsack polytope. To appear in Mathematics of Operations Research."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0167-6377(01)00086-4","volume":"29","author":"I.R. Farias de","year":"2001","unstructured":"I.R. de Farias and G.L. Nemhauser. A family of inequalities for the generalized assignment polytope. Operations Research Letters, 29:49\u201351, 2001.","journal-title":"Operations Research Letters"},{"key":"12_CR10","unstructured":"I.R. de Farias. A Polyhedral Approach to Combinatorial Problems. PhD thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, 1995."},{"key":"12_CR11","unstructured":"R.E. Gomory. An algorithm for the mixed integer problem. Technical Report RM-2597, RAND Corporation, 1960."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R.E. Gomory","year":"1969","unstructured":"R.E. Gomory. Some polyhedra related to combinatorial problems. Linear Algebra and Its Applications, 2:451\u2013558, 1969.","journal-title":"Linear Algebra and Its Applications"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"10","author":"Z. Gu","year":"1998","unstructured":"Z. Gu, G.L. Nemhauser, and M.W.P. Savelsbergh. Lifted cover inequalities for 0-1 integer programs: Computation. INFORMS Journal on Computing, 10:427\u2013437, 1998.","journal-title":"INFORMS Journal on Computing"},{"key":"12_CR14","unstructured":"Z. Gu. Lifted Cover Inequalities for 0-1 and Mixed 0-1 Integer Programs. PhD thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, 1995."},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P.L. Hammer","year":"1975","unstructured":"P.L. Hammer, E.L. Johnson, and U.N. Peled. Facets of regular 0-1 polytopes. Mathematical Programming, 8:179\u2013206, 1975.","journal-title":"Mathematical Programming"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H. Marchand","year":"1999","unstructured":"H. Marchand and L.A. Wolsey. The 0-1 knapsack problem with a single continuous variable. Mathematical Programming, 85:15\u201333, 1999.","journal-title":"Mathematical Programming"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G.L. Nemhauser","year":"1990","unstructured":"G.L. Nemhauser and L.A. Wolsey. A recursive procedure for generating all cuts for 0-1 mixed integer programs. Mathematical Programming, 46:379\u2013390, 1990.","journal-title":"Mathematical Programming"},{"key":"12_CR18","doi-asserted-by":"publisher","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:199\u2013215, 1973.","journal-title":"Mathematical Programming"},{"key":"12_CR19","unstructured":"J.-P. P. Richard, I.R. de Farias, and G.L. Nemhauser. A simplex based algorithm for 0-1 mixed integer programming. Technical Report 01-09, Georgia Institute of Technology, 2001."},{"key":"12_CR20","unstructured":"J.-P. P. Richard, I.R. de Farias, and G.L. Nemhauser. Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms. Technical report, Georgia Institute of Technology, (in preparation)."},{"key":"12_CR21","unstructured":"J.-P. P. Richard, I.R. de Farias, and G.L. Nemhauser. Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting. Technical report, Georgia Institute of Technology, (in preparation)."},{"key":"12_CR22","first-page":"49","volume":"77","author":"R. Weismantel","year":"1997","unstructured":"R. Weismantel. On the 0\/1 knapsack polytope. Mathematical Programming, 77:49\u201368, 1997.","journal-title":"Mathematical Programming"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"L.A. Wolsey. Faces for a linear inequality in 0-1 variables. Mathematical Programming, 8:165\u2013178, 1975.","journal-title":"Mathematical Programming"},{"key":"12_CR24","doi-asserted-by":"publisher","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:367\u2013372, 1976.","journal-title":"Operations Research"},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BF01609032","volume":"15","author":"E. Zemel","year":"1978","unstructured":"E. Zemel. Lifting the facets of zero-one polytopes. Mathematical Programming, 15:268\u2013277, 1978.","journal-title":"Mathematical Programming"}],"container-title":["Integer Programming and Combinatorial Optimization","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47867-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T13:47:50Z","timestamp":1580305670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47867-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540436768","9783540478676"],"references-count":25,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-47867-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[2002]]},"assertion":[{"value":"21 May 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}