{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T19:01:00Z","timestamp":1771959660683,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,4,3]],"date-time":"2013-04-03T00:00:00Z","timestamp":1364947200000},"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":[[2014,6]]},"DOI":"10.1007\/s10107-013-0675-7","type":"journal-article","created":{"date-parts":[[2013,4,2]],"date-time":"2013-04-02T00:47:03Z","timestamp":1364863623000},"page":"565-599","source":"Crossref","is-referenced-by-count":5,"title":["Semi-continuous network flow problems"],"prefix":"10.1007","volume":"145","author":[{"given":"Gustavo","family":"Angulo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shabbir","family":"Ahmed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santanu S.","family":"Dey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,3]]},"reference":[{"key":"675_CR1","first-page":"3","volume-title":"Annals of Discrete Mathematics, Discrete Optimization II","author":"E Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. In: Johnson, E.L., Hammer, P.L., Korte, B.H. (eds.) Annals of Discrete Mathematics, Discrete Optimization II, vol. 5, pp. 3\u201351. Elsevier, Amsterdam (1979)"},{"key":"675_CR2","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":"675_CR3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.orl.2011.02.002","volume":"39","author":"D Dadush","year":"2011","unstructured":"Dadush, D., Dey, S.S., Vielma, J.P.: The split closure of a strictly convex body. Oper. Res. Lett. 39, 121\u2013126 (2011)","journal-title":"Oper. Res. Lett."},{"key":"675_CR4","doi-asserted-by":"crossref","unstructured":"de Farias, I.R.: Semi-continuous cuts for mixed-integer programming. In: Bienstock D., Nemhauser G.L. (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 3064, pp. 163\u2013177. Springer, Berlin, Heidelberg (2004)","DOI":"10.1007\/978-3-540-25960-2_13"},{"key":"675_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1017\/S0269888901000030","volume":"16","author":"IR Farias de","year":"2001","unstructured":"de Farias, I.R., 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":"675_CR6","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s10107-003-0420-8","volume":"96","author":"IR Farias de","year":"2003","unstructured":"de Farias, I.R., Nemhauser, G.L.: A polyhedral study of the cardinality constrained knapsack problem. Math. Program. 96, 439\u2013467 (2003)","journal-title":"Math. Program."},{"key":"675_CR7","doi-asserted-by":"crossref","unstructured":"de Farias, I.R., Zhao, M.: A polyhedral study of the semi-continuous knapsack problem. Math. Program. (2012). doi: 10.1007\/s10107-012-0566-3","DOI":"10.1007\/s10107-012-0566-3"},{"key":"675_CR8","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1205\/026387600528012","volume":"78","author":"J Kallrath","year":"2000","unstructured":"Kallrath, J.: Mixed integer optimization in the chemical process industry: experience, potential and future perspectives. Chem. Eng. Res. Des. 78, 809\u2013822 (2000)","journal-title":"Chem. Eng. Res. Des."},{"key":"675_CR9","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s00291-002-0102-6","volume":"24","author":"J Kallrath","year":"2002","unstructured":"Kallrath, J.: Combined strategic and operational planning\u2014an MILP success story in chemical industry. OR Spectr. 24, 315\u2013341 (2002)","journal-title":"OR Spectr."},{"key":"675_CR10","unstructured":"Li, Y., Richard, J.-P.P.: Cook, Kannan and Schrijver\u2019s example revisited. Discret. Optim. 5, 724\u2013734 (2008)"},{"key":"675_CR11","first-page":"141","volume-title":"Annals of Discrete Mathematics, Discrete Optimization I","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: Graph theory and integer programming. In: Johnson, E.L., Hammer, P.L., Korte, B.H. (eds.) Annals of Discrete Mathematics, Discrete Optimization I, vol. 4, pp. 141\u2013158. Elsevier, Amsterdam (1979)"},{"key":"675_CR12","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1287\/mnsc.30.10.1143","volume":"30","author":"AF Perold","year":"1984","unstructured":"Perold, A.F.: Large-scale portfolio optimization. Manag. Sci. 30, 1143\u20131160 (1984)","journal-title":"Manag. Sci."},{"key":"675_CR13","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1996","unstructured":"Rockafellar, R.T.: Convex Analysis, vol. 28. Princeton University Press, Princeton (1996)"},{"key":"675_CR14","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/S0377-2217(99)00301-X","volume":"126","author":"CH Timpe","year":"2000","unstructured":"Timpe, C.H., Kallrath, J.: Optimal planning in large multi-site production networks. Eur. J. Oper. Res. 126, 422\u2013435 (2000)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0675-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-013-0675-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0675-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:00:03Z","timestamp":1559109603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-013-0675-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,3]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["675"],"URL":"https:\/\/doi.org\/10.1007\/s10107-013-0675-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,3]]}}}