{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T23:56:35Z","timestamp":1769817395096,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,2,19]],"date-time":"2011-02-19T00:00:00Z","timestamp":1298073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10479-011-0857-8","type":"journal-article","created":{"date-parts":[[2011,2,18]],"date-time":"2011-02-18T21:04:05Z","timestamp":1298063045000},"page":"217-234","source":"Crossref","is-referenced-by-count":15,"title":["Cascading Knapsack Inequalities: reformulation of\u00a0a\u00a0crude oil distribution problem"],"prefix":"10.1007","volume":"203","author":[{"given":"Roger","family":"Rocha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignacio E.","family":"Grossmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus V. S.","family":"Poggi de Arag\u00e3o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,19]]},"reference":[{"issue":"1","key":"857_CR1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10107-006-0705-9","volume":"109","author":"A. Agra","year":"2007","unstructured":"Agra, A., & Constantino, M. F. (2007). Lifting two-integer knapsack inequalities. Mathematical Programming, 109(1), 115\u2013154.","journal-title":"Mathematical Programming"},{"key":"857_CR2","volume-title":"Network flows: theory, algorithms and applications","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network flows: theory, algorithms and applications. Englewood Cliffs: Prentice Hall."},{"issue":"3","key":"857_CR3","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.tcs.2007.02.046","volume":"379","author":"H. Alex","year":"2007","unstructured":"Alex, H., Steffen, H., & Martin, S. (2007). Multicommodity flows over time: efficient algorithms and complexity. Theoretical Computer Science, 379(3), 387\u2013404.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"857_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10479-006-0092-x","volume":"149","author":"R. Ashford","year":"2007","unstructured":"Ashford, R. (2007). Mixed integer programming: a historical perspective with xpress-mp. Annals of Operation Research, 149(1), 5\u201317.","journal-title":"Annals of Operation Research"},{"issue":"1","key":"857_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10479-005-3968-2","volume":"140","author":"A. Atamturk","year":"2005","unstructured":"Atamturk, A., & Savelsbergh, M. (2005). Integer-programming software systems. Annals of Operation Research, 140(1), 67\u2013124.","journal-title":"Annals of Operation Research"},{"issue":"2","key":"857_CR6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"Balas, E. (1975). Facets of knapsack polytope. Mathematical Programming, 8(2), 146\u2013164.","journal-title":"Mathematical Programming"},{"issue":"1","key":"857_CR7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10479-006-0091-y","volume":"149","author":"R. Bixby","year":"2007","unstructured":"Bixby, R., & Rothberg, E. (2007). Progress in computational mixed integer programming\u2014a look back from the other side of the tipping point. Annals of Operation Research, 149(1), 37\u201341.","journal-title":"Annals of Operation Research"},{"issue":"1","key":"857_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2004.01.054","volume":"168","author":"N. Brahimi","year":"2006","unstructured":"Brahimi, N., Dauzere-Peres, S., Najib, N. M., & Nordli, A. (2006). Single item lot sizing problems. European Journal of Operational Research, 168(1), 1\u201316.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"857_CR9","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1147\/rd.164.0424","volume":"16","author":"M. M. Guignard","year":"1972","unstructured":"Guignard, M. M., & Spielberg, K. (1972). Mixed-integer algorithms for (0,1) knapsack problem. IBM Journal of Research and Development, 16(4), 424\u2013430.","journal-title":"IBM Journal of Research and Development"},{"issue":"1","key":"857_CR10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/321921.321936","volume":"23","author":"D. S. Hirschberg","year":"1976","unstructured":"Hirschberg, D. S., & Wong, C. K. (1976). A polynomial-time algorithm for the knapsack problem with two variables. Journal of the ACM, 23(1), 147\u2013154.","journal-title":"Journal of the ACM"},{"key":"857_CR11","unstructured":"ILOG, Inc. (2007). ILOG CPLEX C++ API 11.0 Reference Manual."},{"key":"857_CR12","volume-title":"Fundamental concepts of algebra","author":"B. E. Meserve","year":"1993","unstructured":"Meserve, B. E. (1993). Fundamental concepts of algebra. New York: Dover."},{"issue":"4","key":"857_CR13","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1287\/opre.51.4.557.16094","volume":"51","author":"A. J. Miller","year":"2003","unstructured":"Miller, A. J., & Wolsey, L. A. (2003). Tight mip formulations for multi-item discrete lot-sizing problems. Operations Research, 51(4), 557\u2013565.","journal-title":"Operations Research"},{"issue":"9","key":"857_CR14","first-page":"35","volume":"20","author":"J. A. Parsons","year":"1969","unstructured":"Parsons, J. A. (1969). Branch and bound algorithms\u2014knapsack problem. Journal of Systems Management, 20(9), 35\u201337.","journal-title":"Journal of Systems Management"},{"issue":"12","key":"857_CR15","doi-asserted-by":"crossref","first-page":"2123","DOI":"10.1016\/j.compchemeng.2009.06.017","volume":"33","author":"R. Rocha","year":"2009","unstructured":"Rocha, R., Grossmann, I. E., & Poggi\u00a0de\u00a0Arag\u00e3o, M. V. S. (2009). Petroleum allocation at petrobras: mathematical model and a solution algorithm. Computers and Chemical Engineering, 33(12), 2123\u20132133.","journal-title":"Computers and Chemical Engineering"},{"issue":"3","key":"857_CR16","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0166-218X(92)00182-L","volume":"48","author":"S. Hoesel van","year":"1994","unstructured":"van Hoesel, S., Kuik, R., Salomon, M., & van Wassenhove, L. N. (1994). The single-item discrete lotsizing and scheduling problem: optimization by linear and dynamic programming. Discrete Applied Mathematics, 48(3), 289\u2013303.","journal-title":"Discrete Applied Mathematics"},{"key":"857_CR17","volume-title":"Lectures on polytopes","author":"G. M. Ziegler","year":"1998","unstructured":"Ziegler, G. M. (1998). Lectures on polytopes (2nd\u00a0ed.). New York: Springer.","edition":"2"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0857-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0857-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0857-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:05Z","timestamp":1559153285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0857-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,19]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["857"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0857-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,19]]}}}