{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T23:03:21Z","timestamp":1696979001080},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,4,25]],"date-time":"2006-04-25T00:00:00Z","timestamp":1145923200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s10107-006-0705-9","type":"journal-article","created":{"date-parts":[[2006,4,25]],"date-time":"2006-04-25T12:15:59Z","timestamp":1145967359000},"page":"115-154","source":"Crossref","is-referenced-by-count":14,"title":["Lifting two-integer knapsack inequalities"],"prefix":"10.1007","volume":"109","author":[{"given":"A.","family":"Agra","sequence":"first","affiliation":[]},{"given":"M.F.","family":"Constantino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,4,25]]},"reference":[{"key":"705_CR1","doi-asserted-by":"crossref","unstructured":"Agra, A., Constantino, M.: Description of 2-integer continuous knapsack polyhedra. Discrete Optimization (in press) (2006)","DOI":"10.1016\/j.disopt.2005.10.008"},{"key":"705_CR2","unstructured":"Agra, A., Constantino, M.: Lifting 2-integer knapsack inequalities. Technical report, University of Lisbon, Centro de Investiga\u00e7\u00e3o Operacional (2005)"},{"key":"705_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-6377(01)00100-6","volume":"29","author":"Atamt\u00fcrk","year":"2001","unstructured":"Atamt\u00fcrk, A.: Flow pack facets of single node fixed-charge flow polytope. Operations Research Letters 29, 107\u2013114 (2001)","journal-title":"Operations Research Letters"},{"key":"705_CR4","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s101070100284","volume":"92","author":"Atamt\u00fcrk","year":"2002","unstructured":"Atamt\u00fcrk, A.: On capacitated network design cut-set polyhedra. Mathematical Programming 92, 425\u2013437 (2002)","journal-title":"Mathematical Programming"},{"key":"705_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10107-003-0400-z","volume":"98","author":"Atamt\u00fcrk","year":"2003","unstructured":"Atamt\u00fcrk, A.: On the facets of the mixed-integer knapsack polyhedron. Mathematical Programming 98, 145\u2013175 (2003)","journal-title":"Mathematical Programming"},{"key":"705_CR6","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.1030.0099","volume":"52","author":"Atamt\u00fcrk","year":"3","unstructured":"Atamt\u00fcrk, A.: Sequence independent lifting for mixed-integer programming. Operations Research 52 (3), 487\u2013490 (2004)","journal-title":"Operations Research"},{"key":"705_CR7","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"Gomory","year":"1969","unstructured":"Gomory, R.: Some polyhedra related to combinatorial problems. Linear algebra and its applications 2, 451\u2013558 (1969)","journal-title":"Linear algebra and its applications"},{"key":"705_CR8","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s101070050067","volume":"85","author":"Gu","year":"3","unstructured":"Gu, Z., Nemhauser, G., Savelsbergh, M.: Lifted flow cover inequalities for mixed 0\u20131 integer programs. Mathematical Programming 85 (3), 439\u2013467 (1999)","journal-title":"Mathematical Programming"},{"key":"705_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"Gu","year":"2000","unstructured":"Gu, Z., Nemhauser, G., Savelsbergh, M.: Sequence independent lifting in mixed integer programming. Journal of Combinatorial Optimization 4, 109\u2013129 (2000)","journal-title":"Journal of Combinatorial Optimization"},{"key":"705_CR10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/321921.321936","volume":"23","author":"Hirschberg","year":"1","unstructured":"Hirschberg, D., Wong, C.: A polynomial-time algorithm for the knapsack problem with two variables. Journal of the Association for Computing Machinery 23 (1), 147\u2013154 (1976)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"705_CR11","unstructured":"Louveaux, Q., Wolsey, L.: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. 4OR 1 (3), 173\u2013207 (2003)"},{"key":"705_CR12","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"Marchand","year":"1","unstructured":"Marchand, H., Wolsey, L.: The 0\u20131 knapsack problem with a single continuous variable. Mathematical Programming 85 (1), 15\u201333 (1999)","journal-title":"Mathematical Programming"},{"key":"705_CR13","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"Marchand","year":"3","unstructured":"Marchand, H., Wolsey, L.: Aggregation and mixed integer rounding to solve mips. Operations Research 49 (3), 363\u2013371 (2001)","journal-title":"Operations Research"},{"key":"705_CR14","doi-asserted-by":"crossref","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley (&) Sons (1988)","DOI":"10.1002\/9781118627372"},{"key":"705_CR15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(95)90600-K","volume":"59","author":"Pochet","year":"1995","unstructured":"Pochet, Y., Wolsey, L.: Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization, and separation. Discrete Applied Mathematics 59, 57\u201374 ( 1995)","journal-title":"Discrete Applied Mathematics"},{"key":"705_CR16","unstructured":"Rajan, D.: Designing capacitated survivable networks: Polyhedral analysis and algorithms, PhD thesis, University of California, Berkeley (2004)"},{"key":"705_CR17","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1287\/moor.21.4.886","volume":"21","author":"Weismantel","year":"1996","unstructured":"Weismantel, R.: Hilbert bases and the facets of special knapsack polytopes. Mathematics of Operations Research 21, 886\u2013904 (1996)","journal-title":"Mathematics of Operations Research"},{"key":"705_CR18","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1287\/moor.2.1.66","volume":"2","author":"Wolsey","year":"1977","unstructured":"Wolsey, L.: Valid inequalities and superadditivity for 0\u20131 integer programs. Mathematics of Operations Research 2, 66\u201377 (1977)","journal-title":"Mathematics of Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0705-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0705-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0705-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:02Z","timestamp":1559109002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0705-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4,25]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["705"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0705-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4,25]]}}}