{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:17:15Z","timestamp":1765887435874},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,6,8]],"date-time":"2012-06-08T00:00:00Z","timestamp":1339113600000},"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":[[2013,12]]},"DOI":"10.1007\/s10107-012-0566-3","type":"journal-article","created":{"date-parts":[[2012,6,7]],"date-time":"2012-06-07T03:29:05Z","timestamp":1339039745000},"page":"169-203","source":"Crossref","is-referenced-by-count":13,"title":["A polyhedral study of the semi-continuous knapsack problem"],"prefix":"10.1007","volume":"142","author":[{"suffix":"Jr.","given":"Ismael Regis","family":"de Farias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,8]]},"reference":[{"key":"566_CR1","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. Math. Program. 8, 146\u2013164 (1975)","journal-title":"Math. Program."},{"key":"566_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-82450-0_1","volume-title":"Computational Mathematical Programming, NATO ASI Series, vol. f15","author":"E.M.L. Beale","year":"1985","unstructured":"Beale E.M.L.: Integer programming. In: Schittkowski, K. (eds) Computational Mathematical Programming, NATO ASI Series, vol. f15, pp. 1\u201324. Springer, Berlin (1985)"},{"key":"566_CR3","unstructured":"Beale, E.M.L., Tomlin, J.A.: Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables. In: Lawrence, J. (ed.) Proceedings of the Fifth International Conference on Operations Research, pp. 447\u2013454. Tavistock Publications (1970)"},{"key":"566_CR4","volume-title":"Systematic Methods of Chemical Process Design","author":"L.T. Biegler","year":"1997","unstructured":"Biegler L.T., Grossmann I.E., Westerberg A.W.: Systematic Methods of Chemical Process Design. Prentice Hall, Englewood Cliffs (1997)"},{"key":"566_CR5","first-page":"121","volume":"74","author":"D. Bienstock","year":"1996","unstructured":"Bienstock D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74, 121\u2013140 (1996)","journal-title":"Math. Program."},{"key":"566_CR6","first-page":"201","volume":"81","author":"S. Ceria","year":"1998","unstructured":"Ceria S., Cordier C., Marchand H., Wolsey L.A.: Cutting planes for integer programs with general integer variables. Math. Program. 81, 201\u2013214 (1998)","journal-title":"Math. Program."},{"key":"566_CR7","doi-asserted-by":"crossref","unstructured":"de Farias, I.R. Jr.: Semi-Continuous Cuts for Mixed-Integer Programming, Technical Report, State University of New York (2003)","DOI":"10.1007\/978-3-540-25960-2_13"},{"key":"566_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-25960-2_13","volume-title":"Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, vol. 3064","author":"I.R. Farias de Jr.","year":"2004","unstructured":"de Farias I.R.: Semi-continuous cuts for mixed-integer programming. In: Bienstock, D., Nemhauser, G.L. (eds) Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, vol. 3064, pp. 163\u2013177. Springer, Berlin (2004)"},{"key":"566_CR9","unstructured":"de Farias, I.R. Jr., Gupta, R., Kozyreff, E., Zhao, M.: Branch-and-Cut for Separable Piecewise Linear Optimization: Computation, Technical Report, Texas Tech University (2011)"},{"key":"566_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/PL00011392","volume":"89","author":"I.R. Farias de Jr","year":"2000","unstructured":"de Farias I.R. Jr, Johnson E.L., Nemhauser G.L.: A generalized assignment problem with special ordered sets: a polyhedral approach. Math. Program. 89, 187\u2013203 (2000)","journal-title":"Math. Program."},{"key":"566_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1017\/S0269888901000030","volume":"16","author":"I.R. Farias de Jr","year":"2001","unstructured":"de Farias I.R. Jr, Johnson E.L., Nemhauser G.L.: Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. Knowl. Eng. Rev. 16, 25\u201339 (2001)","journal-title":"Knowl. Eng. Rev."},{"key":"566_CR12","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1287\/moor.27.1.210.335","volume":"27","author":"I.R. Farias de Jr","year":"2002","unstructured":"de Farias I.R. Jr, Johnson E.L., Nemhauser G.L.: Facets of the complementarity knapsack polytope. Math. Oper. Res. 27, 210\u2013226 (2002)","journal-title":"Math. Oper. Res."},{"key":"566_CR13","doi-asserted-by":"crossref","unstructured":"de Farias, I.R. Jr., Nemhauser, G.L.: A polyhedral study of the cardinality constrained knapsack problem. In: Cook, W.J., Schulz, A.S. (eds.) Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 2337, pp. 291\u2013303, Springer, Berlin (2002)","DOI":"10.1007\/3-540-47867-1_21"},{"key":"566_CR14","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10107-003-0420-8","volume":"96","author":"I.R. Farias de Jr","year":"2003","unstructured":"de Farias I.R. Jr, Nemhauser G.L.: A polyhedral study of the cardinality constrained knapsack problem. Math. Program. 96, 439\u2013467 (2003)","journal-title":"Math. Program."},{"key":"566_CR15","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1016\/j.orl.2008.08.001","volume":"36","author":"I.R. Farias de Jr","year":"2008","unstructured":"de Farias I.R. Jr, Zhao M., Zhao H.: A special ordered set approach for optimizing a discontinuous separable piecewise linear function. Oper. Res. Lett. 36, 726\u2013733 (2008)","journal-title":"Oper. Res. Lett."},{"key":"566_CR16","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"D.R. Fulkerson","year":"1971","unstructured":"Fulkerson D.R.: Blocking and antiblocking pairs of polyhedra. Math. Program. 1, 168\u2013194 (1971)","journal-title":"Math. Program."},{"key":"566_CR17","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/0095-8956(72)90032-9","volume":"12","author":"D.R. Fulkerson","year":"1972","unstructured":"Fulkerson D.R.: Antiblocking polyhedra. J. Comb. Theory B 12, 56\u201371 (1972)","journal-title":"J. Comb. Theory B"},{"key":"566_CR18","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"4","author":"Z. Gu","year":"1998","unstructured":"Gu Z., Nemhauser G.L., Savelsbergh M.W.P.: Lifted cover inequalities for 0\u20131 integer programs: computation. INFORMS J. Comput. 4, 427\u2013437 (1998)","journal-title":"INFORMS J. Comput."},{"key":"566_CR19","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P.L. Hammer","year":"1975","unstructured":"Hammer P.L., Johnson E.L., Peled U.N.: Facets of regular 0\u20131 polytopes. Math. Program. 8, 179\u2013206 (1975)","journal-title":"Math. Program."},{"key":"566_CR20","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1287\/ijoc.14.4.295.2828","volume":"14","author":"J.N. Hooker","year":"2002","unstructured":"Hooker J.N.: Logic, optimization, and constraint programming. INFORMS J. Comput. 14, 295\u2013321 (2002)","journal-title":"INFORMS J. Comput."},{"key":"566_CR21","unstructured":"http:\/\/www.hpcc.ttu.edu\/index.php"},{"key":"566_CR22","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1287\/opre.21.1.353","volume":"21","author":"T. Ibaraki","year":"1973","unstructured":"Ibaraki T.: The use of cuts in complementary programming. Oper. Res. 21, 353\u2013359 (1973)","journal-title":"Oper. Res."},{"key":"566_CR23","doi-asserted-by":"crossref","first-page":"59","DOI":"10.15807\/jorsj.21.59","volume":"21","author":"T. Ibaraki","year":"1978","unstructured":"Ibaraki T., Hasegawa T., Teranaka K., Iwase J.: The multiple-choice knapsack problem. J. Oper. Res. Soc. Jpn. 21, 59\u201395 (1978)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"566_CR24","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0316005","volume":"16","author":"R.G. Jeroslow","year":"1978","unstructured":"Jeroslow R.G.: Cutting planes for complementarity constraints. SIAM J. Control Optim. 16, 56\u201362 (1978)","journal-title":"SIAM J. Control Optim."},{"key":"566_CR25","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/S0167-6377(03)00059-2","volume":"32","author":"A.B. Keha","year":"2004","unstructured":"Keha A.B., de Farias I.R. Jr, Nemhauser G.L.: Models for representing piecewise linear cost functions. Oper. Res. Lett. 32, 44\u201348 (2004)","journal-title":"Oper. Res. Lett."},{"key":"566_CR26","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1287\/opre.1060.0277","volume":"54","author":"A.B. Keha","year":"2006","unstructured":"Keha A.B., de Farias I.R. Jr, Nemhauser G.L.: A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization. Oper. Res. 54, 847\u2013858 (2006)","journal-title":"Oper. Res."},{"key":"566_CR27","unstructured":"Laundy, R.S.: Some Logically Constrained Mathematical Programming Problems, Ph.D. Dissertation, University of Southampton, Southampton (1983)"},{"key":"566_CR28","first-page":"173","volume":"1","author":"Q. Louveaux","year":"2003","unstructured":"Louveaux Q., Wolsey L.A.: Lifting, superadditivity, mixed integer rounding, and single node flow sets revisited. 4OR 1, 173\u2013207 (2003)","journal-title":"4OR"},{"key":"566_CR29","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"T.L. Magnanti","year":"1993","unstructured":"Magnanti T.L., Mirchandani P., Vachani R.: The convex hull of two core capacitated network design problems. Math. Program. 60, 233\u2013250 (1993)","journal-title":"Math. Program."},{"key":"566_CR30","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-005-0665-5","volume":"105","author":"A. Martin","year":"2006","unstructured":"Martin A., M\u00f6ller M., Moritz S.: Mixed-integer models for the stationary case of gas network optimization. Math. Program. 105, 563\u2013582 (2006)","journal-title":"Math. Program."},{"key":"566_CR31","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"566_CR32","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1109\/TPWRS.2003.821611","volume":"19","author":"N.P. Padhi","year":"2004","unstructured":"Padhi N.P.: Unit commitment: a bibliographical survey. IEEE Trans. Power Syst. 19, 1196\u20131205 (2004)","journal-title":"IEEE Trans. Power Syst."},{"key":"566_CR33","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1287\/mnsc.30.10.1143","volume":"30","author":"A.F. Perold","year":"1984","unstructured":"Perold A.F.: Large-scale portfolio optimization. Manag. Sci. 30, 1143\u20131160 (1984)","journal-title":"Manag. Sci."},{"key":"566_CR34","unstructured":"Rajan, D., Takriti, S.: Minimum up\/down Polytopes of the Unit Commitment Problem with Start-up Costs, IBM Research Report (2005)"},{"key":"566_CR35","doi-asserted-by":"crossref","unstructured":"Richard, J.P.P., de Farias, I.R. Jr., Nemhauser, G.L.: Lifted inequalities for 0\u20131 mixed-integer programming: basic theory and algorithms. In: Cook, W.J., Schulz, A.S. (eds.), Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 2337, pp. 161\u2013175, Springer, Berlin (2002)","DOI":"10.1007\/3-540-47867-1_12"},{"key":"566_CR36","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10107-003-0398-2","volume":"98","author":"J.P.P. Richard","year":"2003","unstructured":"Richard J.P.P., de Farias I.R. Jr, Nemhauser G.L.: Lifted inequalities for 0\u20131 mixed-integer programming: basic theory and algorithms. Math. Program. 98, 89\u2013113 (2003)","journal-title":"Math. Program."},{"key":"566_CR37","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/59.535691","volume":"11","author":"S. Takriti","year":"1996","unstructured":"Takriti S., Birge J.R., Long E.: A stochastic model for the unit commitment problem. IEEE Trans. Power Syst. 11, 1497\u20131508 (1996)","journal-title":"IEEE Trans. Power Syst."},{"key":"566_CR38","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01588974","volume":"14","author":"H.P. Williams","year":"1978","unstructured":"Williams H.P.: The reformulation of two mixed integer programming problems. Math. Program. 14, 325\u2013331 (1978)","journal-title":"Math. Program."},{"key":"566_CR39","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"Wolsey L.A.: Faces for a linear inequality in 0\u20131 variables. Math. Program. 8, 165\u2013178 (1975)","journal-title":"Math. Program."},{"key":"566_CR40","doi-asserted-by":"crossref","unstructured":"Zhao, M., de Farias, I.R. Jr.: Branch-and-Cut for Separable Piecewise Linear Optimization: New Inequalities and Intersection with Semi-Continuous with Constraints, Technical Report, Texas Tech University (2011)","DOI":"10.1007\/s12532-012-0049-9"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0566-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0566-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0566-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0566-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,25]],"date-time":"2024-04-25T01:37:13Z","timestamp":1714009033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0566-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,8]]},"references-count":40,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["566"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0566-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,8]]}}}