{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T11:34:57Z","timestamp":1681990497991},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,4,12]],"date-time":"2015-04-12T00:00:00Z","timestamp":1428796800000},"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":["Math. Program."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10107-015-0902-5","type":"journal-article","created":{"date-parts":[[2015,4,11]],"date-time":"2015-04-11T10:11:56Z","timestamp":1428747116000},"page":"55-80","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sequence independent lifting for mixed knapsack problems with GUB constraints"],"prefix":"10.1007","volume":"154","author":[{"given":"Alejandro","family":"Angulo","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Espinoza","sequence":"additional","affiliation":[]},{"given":"Rodrigo","family":"Palma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,12]]},"reference":[{"key":"902_CR1","volume-title":"Local Search in Combinatorial Optimization","year":"1997","unstructured":"Aarts, E., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization, 1st edn. Wiley, New York (1997)","edition":"1"},{"issue":"3","key":"902_CR2","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.1030.0099","volume":"52","author":"A Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk, A.: Sequence independent lifting for mixed-integer programming. Oper. Res. 52(3), 487\u2013490 (2004)","journal-title":"Oper. Res."},{"key":"902_CR3","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E Balas","year":"1975","unstructured":"Balas, E.: Facets of the knapsack polytope. Math. Program. 8, 146\u2013164 (1975)","journal-title":"Math. Program."},{"key":"902_CR4","first-page":"61","volume":"23","author":"E Balas","year":"1972","unstructured":"Balas, E., Jeroslow, R.: Canonical cuts on the unit hypercube. Math. Program. 23, 61\u201369 (1972)","journal-title":"Math. Program."},{"key":"902_CR5","doi-asserted-by":"crossref","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. 34, 119\u2013148 (1978)","journal-title":"SIAM J. Appl. Math."},{"key":"902_CR6","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.1109\/TPWRS.2006.876672","volume":"21","author":"M Carrion","year":"2006","unstructured":"Carrion, M., Arroyo, J.M.: A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE Trans. Power Syst. 21, 1371\u20131378 (2006)","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"902_CR7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"902_CR8","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.disopt.2007.05.003","volume":"5","author":"T Easton","year":"2008","unstructured":"Easton, T., Hooker, K.: Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes. Discrete Optim. 5(2), 254\u2013261 (2008). (in Memory of George B. Dantzig)","journal-title":"Discrete Optim."},{"key":"902_CR9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1109\/TPWRS.2008.2004744","volume":"24","author":"A Frangioni","year":"2009","unstructured":"Frangioni, A., Gentile, C., Lacalandra, F.: Tighter approximated milp formulations for unit commitment problems. IEEE Trans. Power Syst. 24, 105\u2013113 (2009)","journal-title":"IEEE Trans. Power Syst."},{"key":"902_CR10","doi-asserted-by":"crossref","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\u20131 integer programs. Math. Program. 85, 439\u2013468 (1999)","journal-title":"Math. Program."},{"key":"902_CR11","doi-asserted-by":"crossref","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. J. Combin. Optim. 4, 109\u2013129 (2000)","journal-title":"J. Combin. Optim."},{"issue":"1","key":"902_CR12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P Hammer","year":"1975","unstructured":"Hammer, P., Johnson, E., Peled, U.: Facet of regular 0\u20131 polytopes. Math. Program. 8(1), 179\u2013206 (1975)","journal-title":"Math. Program."},{"issue":"2","key":"902_CR13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0166-218X(92)90162-4","volume":"39","author":"D Hartvigsen","year":"1992","unstructured":"Hartvigsen, D., Zemel, E.: The complexity of lifted inequalities for the knapsack problem. Discrete Appl. Math. 39(2), 113\u2013123 (1992)","journal-title":"Discrete Appl. Math."},{"key":"902_CR14","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0167-6377(81)90019-5","volume":"1","author":"EL Johnson","year":"1981","unstructured":"Johnson, E.L., Padberg, M.W.: A note on the knapsack problem with special ordered sets. Oper. Res. Lett. 1, 18\u201322 (1981)","journal-title":"Oper. Res. Lett."},{"key":"902_CR15","doi-asserted-by":"crossref","unstructured":"Kaparis, K., Letchford, A.N.: Cover inequalities. Wiley Encyclopedia of Operations Research and Management Science (2010)","DOI":"10.1002\/9780470400531.eorms0204"},{"key":"902_CR16","doi-asserted-by":"crossref","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. Ann. OR 153, 47\u201377 (2007)","journal-title":"Ann. OR"},{"key":"902_CR17","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"902_CR18","doi-asserted-by":"crossref","unstructured":"Ott, A.L.: Evolution of computing requirements in the pjm market: past and future. In: Power and Energy Society General Meeting (2010)","DOI":"10.1109\/PES.2010.5589842"},{"issue":"4","key":"902_CR19","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"MW Padberg","year":"1985","unstructured":"Padberg, M.W., Van Roy, T.J., Wolsey, L.A.: Valid linear inequalities for fixed charge problems. Oper. Res. 33(4), 842\u2013861 (1985)","journal-title":"Oper. Res."},{"key":"902_CR20","doi-asserted-by":"crossref","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. Math. Program. 18, 94\u201399 (1980)","journal-title":"Math. Program."},{"key":"902_CR21","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(86)90061-2","volume":"14","author":"TV Roy","year":"1986","unstructured":"Roy, T.V., Wolsey, L.: Valid inequalities for mixed 0\u20131 programs. Discrete Appl. Math. 14, 199\u2013213 (1986)","journal-title":"Discrete Appl. Math."},{"key":"902_CR22","doi-asserted-by":"crossref","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. 8, 133\u2013153 (1995)","journal-title":"SIAM J. Disc. Math."},{"key":"902_CR23","doi-asserted-by":"crossref","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\u20131 knapsack and mips with generalized upper bound constraints. Discrete Appl. Math. 29, 251\u2013261 (1988)","journal-title":"Discrete Appl. Math."},{"key":"902_CR24","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"LA Wolsey","year":"1975","unstructured":"Wolsey, L.A.: Facets of linear inequalities in 0\u20131 variables. Math. Program. 8, 165\u2013178 (1975)","journal-title":"Math. Program."},{"key":"902_CR25","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1287\/moor.2.1.66","volume":"2","author":"LA Wolsey","year":"1977","unstructured":"Wolsey, L.A.: Valid inequalities and superadditivity for 0\/1 integer programs. Math. Oper. Res. 2, 65\u201377 (1977)","journal-title":"Math. Oper. Res."},{"key":"902_CR26","volume-title":"Power Generation, Operation and Control","author":"AJ Wood","year":"1996","unstructured":"Wood, A.J., Wollemberg, B.F.: Power Generation, Operation and Control, 2nd edn. Wiley, New York (1996)","edition":"2"},{"issue":"1","key":"902_CR27","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BF01609032","volume":"15","author":"E Zemel","year":"1978","unstructured":"Zemel, E.: Lifting the facets of zero-one polytopes. Math. Program. 15(1), 268\u2013277 (1978)","journal-title":"Math. Program."},{"key":"902_CR28","unstructured":"Zeng, B.: Efficient Lifting Methods for Unstructured Mixed Integer Programs with Multiple Constraints. Ph.D. thesis, Purdue University, Industrial Engineering Department (2007)"},{"key":"902_CR29","unstructured":"Zeng, B., Richard, J.P.P.: Sequence independent lifting for 0\u20131 knapsack problems with disjoint cardinality constraints (2006)"},{"key":"902_CR30","doi-asserted-by":"crossref","unstructured":"Zeng, B., Richard, J.P.P.: A framework to derive multidimensional superadditive lifting functions and its applications. In: Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 4513, pp. 210\u2013224 (2007)","DOI":"10.1007\/978-3-540-72792-7_17"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0902-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0902-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0902-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T05:22:10Z","timestamp":1566537730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0902-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,12]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["902"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0902-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,12]]}}}