{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:09:59Z","timestamp":1773324599233,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2005,10,12]],"date-time":"2005-10-12T00:00:00Z","timestamp":1129075200000},"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":[[2006,2]]},"DOI":"10.1007\/s10107-005-0664-6","type":"journal-article","created":{"date-parts":[[2005,10,12]],"date-time":"2005-10-12T11:10:17Z","timestamp":1129115417000},"page":"523-561","source":"Crossref","is-referenced-by-count":10,"title":["Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds"],"prefix":"10.1007","volume":"105","author":[{"given":"S.","family":"Shebalov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Klabjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,12]]},"reference":[{"key":"664_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01581103","volume":"81","author":"Aardal","year":"1998","unstructured":"Aardal, K.: Capacitated facility location: Separation algorithms and computational experience. Mathematical Programming, 81, 149\u2013175 (1998)","journal-title":"Mathematical Programming,"},{"key":"664_CR2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s101070100235","volume":"91","author":"Atamt\u00fcrk","year":"2001","unstructured":"Atamt\u00fcrk, A., Nemhauser, G., Savelsbergh, M.: Valid inequalities for problems with additive variable upper bounds. Mathematical Programming, 91, 145\u2013162 (2001)","journal-title":"Mathematical Programming,"},{"key":"664_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/ijoc.8.3.243","volume":"8","author":"Bienstock","year":"1996","unstructured":"Bienstock, D., G\u00fcnl\u00fck, O.: Capacitated network design \u2013 Polyhedral structure and computation. INFORMS Journal on Computing, 8, 165\u2013192 (1996)","journal-title":"INFORMS Journal on Computing,"},{"key":"664_CR4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0167-6377(89)90016-3","volume":"8","author":"Goemans","year":"1989","unstructured":"Goemans, M.: Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds. Operations Research Letters 8, 315\u2013322 (1989)","journal-title":"Operations Research Letters"},{"key":"664_CR5","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s101070050067","volume":"85","author":"Gu","year":"1999","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.: Lifted flow cover inequalities for mixed 0-1 integer programs. Mathematical Programming 85, 439\u2013467 (1999)","journal-title":"Mathematical Programming"},{"key":"664_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"Gu","year":"2000","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.: Sequence independent lifting in mixed integer programming. Journal of Combinatorial Optimization 4, 109\u2013129 (2000)","journal-title":"Journal of Combinatorial Optimization"},{"key":"664_CR7","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.12.1.2.11900","volume":"12","author":"Johnson","year":"2000","unstructured":"Johnson, E., Nemhauser, G., Savelsbergh, M.: Progress in linear programming based branch-and-bound algorithms: An exposition. INFORMS Journal on Computing 12, 2\u201323 (2000)","journal-title":"INFORMS Journal on Computing"},{"key":"664_CR8","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1287\/moor.27.4.711.300","volume":"27","author":"Klabjan","year":"2002","unstructured":"Klabjan, D., Nemhauser, G.: A polyhedral study of integer variable upper bounds. Mathematics of Operations Research 27, 711\u2013739 (2002)","journal-title":"Mathematics of Operations Research"},{"key":"664_CR9","unstructured":"Louveaux, Q., Wolsey, L.: Lifting, superadditivity, mixed integer rounding, and single node flow sets revisited. 4OR 1, 173\u2013207 (2003)"},{"key":"664_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"Marchand","year":"1999","unstructured":"Marchand, H., Wolsey, L.: The 0-1 knapsack problem with a single continuous variable. Mathematical Programming 85, 15\u201333 (1999)","journal-title":"Mathematical Programming"},{"key":"664_CR11","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0166-218X(01)00348-1","volume":"123","author":"Marchand","year":"2002","unstructured":"Marchand, H., Martin, A., Weismantel, R., Wolsey, L.: Cutting planes in integer and mixed integer programming. Discrete Applied Mathematics 123, 397\u2013446 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"664_CR12","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10107-002-0325-y","volume":"94","author":"Miller","year":"2003","unstructured":"Miller, A., Nemhauser, G., Savelsbergh, M.: On the polyhedral structure of a multi-item production planning model with setup times. Mathematical Programming 94, 375\u2013407 (2003)","journal-title":"Mathematical Programming"},{"key":"664_CR13","doi-asserted-by":"crossref","unstructured":"Nemhauser, G., Wolsey, L.: Integer and combinatorial optimization. John Wiley & Sons, 1988","DOI":"10.1002\/9781118627372"},{"key":"664_CR14","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"Padberg","year":"1985","unstructured":"Padberg, M., Van Roy, T., Wolsey, L.: Valid linear inequalities for fixed charge problems. Operations Research 33, 842\u2013861 (1985)","journal-title":"Operations Research"},{"key":"664_CR15","doi-asserted-by":"crossref","unstructured":"Richard, J., de Farias Jr., I., Nemhauser, G.: Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms. Mathematical Programming 98, 369\u2013385 (2003a)","DOI":"10.1007\/s10107-003-0398-2"},{"key":"664_CR16","doi-asserted-by":"crossref","unstructured":"Richard, J., de Farias Jr., I., Nemhauser, G.: Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting. Mathematical Programming, 98, 385\u2013415 (2003b)","DOI":"10.1007\/s10107-003-0399-1"},{"key":"664_CR17","doi-asserted-by":"crossref","unstructured":"Salomon, M.: Deterministic lotsizing models for production planning. Volume 355 of Lecture notes in economics and mathematical systems. Springer-Verlag, 1991","DOI":"10.1007\/978-3-642-51649-8"},{"key":"664_CR18","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.: Preprocessing and probing for mixed integer programming problems. ORSA Journal on Computing 6, 445\u2013454 (1994)","journal-title":"ORSA Journal on Computing"},{"key":"664_CR19","unstructured":"Shebalov, S.: Mixed integer programming with variable upper bounds. Ph.D. thesis, University of Illinois at Urbana-Champaign, 2004"},{"key":"664_CR20","unstructured":"Shebalov, S. and Klabjan, D.: Sequence dependent lifting for mixed integer programs with variable upper bounds. Technical report, University of Illinois at Urbana-Champaign, Urbana, IL. Available from http:\/\/netfiles.uiuc.edu\/klabjan\/www. 2004"},{"key":"664_CR21","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(86)90061-2","volume":"14","author":"Roy","year":"1986","unstructured":"Van Roy, T., Wolsey, L.: Valid inequalities for mixed 0-1 programs. Discrete Applied Mathematics 14, 199\u2013213 (1986)","journal-title":"Discrete Applied Mathematics"},{"key":"664_CR22","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\/1 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-005-0664-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-005-0664-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0664-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:59Z","timestamp":1559108999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-005-0664-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,12]]},"references-count":22,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["664"],"URL":"https:\/\/doi.org\/10.1007\/s10107-005-0664-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,12]]}}}