{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:10:52Z","timestamp":1725793852130},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075563"},{"type":"electronic","value":"9783319075570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07557-0_6","type":"book-chapter","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T11:50:30Z","timestamp":1400327430000},"page":"64-75","source":"Crossref","is-referenced-by-count":0,"title":["Sequence Independent, Simultaneous and Multidimensional Lifting of Generalized Flow Covers for the Semi-Continuous Knapsack Problem with Generalized Upper Bounds Constraints"],"prefix":"10.1007","author":[{"given":"Alejandro","family":"Angulo","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Espinoza","sequence":"additional","affiliation":[]},{"given":"Rodrigo","family":"Palma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Atamt\u00fcrk, A.: Sequence independent lifting for mixed-integer programming (2004)","DOI":"10.1287\/opre.1030.0099"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"Balas, E.: Facets of the knapsack polytope. Mathematical Programming\u00a08, 146\u2013164 (1975)","journal-title":"Mathematical Programming"},{"key":"6_CR3","first-page":"61","volume":"23","author":"E. Balas","year":"1972","unstructured":"Balas, E., Jeroslow, R.: Canonical cuts on the unit hypercube. Mathematical Programming\u00a023, 61\u201369 (1972)","journal-title":"Mathematical Programming"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E. Balas","year":"1978","unstructured":"Balas, E., Zemel, E.: Facets of the knapsack polytope from minimal covers. SIAM J. Appl. Math.\u00a034, 119\u2013148 (1978)","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Mathematical Programming\u00a091(2), 201\u2013213 (2002)","journal-title":"Mathematical Programming"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s101070050067","volume":"85","author":"Z. Gu","year":"1999","unstructured":"Gu, Z., Nemhauser, G., Savelsbergh, M.: Lifted flow cover inequalities for mixed 0-1 integer programs. Mathematical Programming\u00a085, 439\u2013468 (1999)","journal-title":"Mathematical Programming"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"Z. Gu","year":"2000","unstructured":"Gu, Z., Nemhauser, G., Savelsbergh, M.: Sequence independent lifting in mixed integer programming. Journal of Combinatorial Optimization\u00a04, 109\u2013129 (2000)","journal-title":"Journal of Combinatorial Optimization"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0167-6377(81)90019-5","volume":"1","author":"E.L. Johnson","year":"1981","unstructured":"Johnson, E.L., Padberg, M.W.: A note on the knapsack problem with special ordered sets. Operational Research Letters\u00a01, 18\u201322 (1981)","journal-title":"Operational Research Letters"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10479-007-0171-7","volume":"153","author":"Q. Louveaux","year":"2007","unstructured":"Louveaux, Q., Wolsey, L.A.: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. Annals OR\u00a0153, 47\u201377 (2007)","journal-title":"Annals OR"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley (1988)","DOI":"10.1002\/9781118627372"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/BF01588301","volume":"18","author":"M. Padberg","year":"1980","unstructured":"Padberg, M. (1,k)-configurations and facets for packing problems. Mathematical Programming\u00a018, 94\u201399 (1980)","journal-title":"Mathematical Programming"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0166-218X(86)90061-2","volume":"14","author":"T.V. Roy","year":"1986","unstructured":"Roy, T.V., Wolsey, L.: Valid inequalities for mixed 0-1 programs. Discrete Applied Mathematics\u00a014, 199\u2013213 (1986)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1137\/S0895480192230607","volume":"8","author":"H. Sherali","year":"1995","unstructured":"Sherali, H., Lee, Y.: Sequential and simultaneous lifting of minimal cover inequalities for generalized upper bound constrained knapsack polytopes. SIAM J. Disc. Math.\u00a08, 133\u2013153 (1995)","journal-title":"SIAM J. Disc. Math."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(90)90148-6","volume":"29","author":"L. Wolsey","year":"1988","unstructured":"Wolsey, L.: Valid inequalities for 0-1 knapsack and mips with generalized upper bound constraints. Discrete Applied Mathematics\u00a029, 251\u2013261 (1988)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"Wolsey, L.A.: Facets of linear inequalities in 0-1 variables. Mathematical Programming\u00a08, 165\u2013178 (1975)","journal-title":"Mathematical Programming"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1287\/moor.2.1.66","volume":"2","author":"L.A. Wolsey","year":"1977","unstructured":"Wolsey, L.A.: Valid inequalities and superadditivity for 0\/1 integer programs. Mathematics of Operations Research\u00a02, 65\u201377 (1977)","journal-title":"Mathematics of Operations Research"},{"key":"6_CR17","unstructured":"Zeng, B.: Efficient Lifting Methods for Unstructured Mixed Integer Programs with Multiple Constraints. Ph.D. thesis, Purdue University. Industrial Engineering Department (2007)"},{"key":"6_CR18","unstructured":"Zeng, B., Richard, J.P.P.: Sequence independent lifting for 0-1 knapsack problems with disjoint cardinality constraints (2006)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-72792-7_17","volume-title":"Integer Programming and Combinatorial Optimization","author":"B. Zeng","year":"2007","unstructured":"Zeng, B., Richard, J.P.P.: A framework to derive multidimensional superadditive lifting functions and its applications. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 210\u2013224. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07557-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:43:31Z","timestamp":1558907011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07557-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075563","9783319075570"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07557-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}