{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T11:32:24Z","timestamp":1681990344677},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T00:00:00Z","timestamp":1424131200000},"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":[[2016,3]]},"DOI":"10.1007\/s10107-015-0868-3","type":"journal-article","created":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T11:43:30Z","timestamp":1424173410000},"page":"1-20","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Continuous knapsack sets with divisible capacities"],"prefix":"10.1007","volume":"156","author":[{"given":"Laurence A.","family":"Wolsey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hande","family":"Yaman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,17]]},"reference":[{"key":"868_CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.disopt.2005.10.008","volume":"3","author":"A Agra","year":"2006","unstructured":"Agra, A., Constantino, M.: Description of 2-integer continuous knapsack polyhedra. Discrete Optim. 3, 95\u2013110 (2006)","journal-title":"Discrete Optim."},{"key":"868_CR2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10107-003-0400-z","volume":"98","author":"A Atamt\u00fcrk","year":"2003","unstructured":"Atamt\u00fcrk, A.: On the facets of the mixed integer knapsack polyhedron. Math. Program. B 98, 145\u2013175 (2003)","journal-title":"Math. Program. B"},{"key":"868_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s101070100284","volume":"92","author":"A Atamt\u00fcrk","year":"2002","unstructured":"Atamt\u00fcrk, A., Rajan, D.: On splittable and unsplittable flow capacitated network design arc-set polyhedra. Math. Program. 92, 315\u2013333 (2002)","journal-title":"Math. Program."},{"key":"868_CR4","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Wolsey, L.A.: The continuous knapsack set. In: Core discussion paper DP2014\/7, Core, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium (2014)"},{"key":"868_CR5","unstructured":"Gupte, A.: Convex hulls of superincreasing knapsacks and lexicographic orderings. Optim. Online (2012)"},{"key":"868_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"868_CR7","doi-asserted-by":"crossref","first-page":"1567","DOI":"10.1016\/j.dam.2012.02.025","volume":"160","author":"K Kianfar","year":"2012","unstructured":"Kianfar, K.: On n-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets. Discrete Appl. Math. 160, 1567\u20131582 (2012)","journal-title":"Discrete Appl. Math."},{"key":"868_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0167-6377(92)90041-Z","volume":"11","author":"M Laurent","year":"1992","unstructured":"Laurent, M., Sassano, A.: A characterization of knapsacks with the max-flow min-cut property. Oper. Res. Lett. 11, 105\u2013110 (1992)","journal-title":"Oper. Res. Lett."},{"key":"868_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0167-5060(08)70822-7","volume":"4","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: Graph theory and integer programming. Ann. Discrete Math. 4, 141\u2013158 (1979)","journal-title":"Ann. Discrete Math."},{"key":"868_CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"TL Magnanti","year":"1993","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: The convex hull of two core capacitated network design polyhedra. Math. Program. 60, 233\u2013250 (1993)","journal-title":"Math. Program."},{"key":"868_CR11","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"TL Magnanti","year":"1995","unstructured":"Magnanti, T.L., Mirchandani, P., Vachani, R.: Modeling and solving the two-facility capacitated network loading problem. Oper. Res. 43, 142\u2013157 (1995)","journal-title":"Oper. Res."},{"key":"868_CR12","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H Marchand","year":"1999","unstructured":"Marchand, H., Wolsey, L.A.: The 0\u20131 knapsack problem with a single continuous variable. Math. Program. 85, 15\u201333 (1999)","journal-title":"Math. Program."},{"key":"868_CR13","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BF01582013","volume":"33","author":"O Marcotte","year":"1985","unstructured":"Marcotte, O.: The cutting stock problem and integer rounding. Math. Program. 33, 82\u201392 (1985)","journal-title":"Math. Program."},{"key":"868_CR14","volume-title":"Knapsack Problems: Algorithms and Computer Interpretations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Interpretations. Wiley-Interscience, New York (1990)"},{"key":"868_CR15","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1137\/S1052623495285217","volume":"8","author":"Y Pochet","year":"1998","unstructured":"Pochet, Y., Weismantel, R.: The sequential knapsack polytope. SIAM J. Optim. 8, 248\u2013264 (1998)","journal-title":"SIAM J. Optim."},{"key":"868_CR16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(95)90600-K","volume":"59","author":"Y Pochet","year":"1995","unstructured":"Pochet, Y., Wolsey, L.A.: Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separation. Discrete Appl. Math. 59, 57\u201374 (1995)","journal-title":"Discrete Appl. Math."},{"key":"868_CR17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10107-003-0398-2","volume":"98","author":"J-PP Richard","year":"2003","unstructured":"Richard, J.-P.P., de Farias Jr, I.R.: Lifted inequalities for 0\u20131 mixed integer programming: basic theory and algorithms. Math. Program. B 98, 89\u2013113 (2003)","journal-title":"Math. Program. B"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0868-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0868-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0868-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:00:06Z","timestamp":1559124006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0868-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,17]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["868"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0868-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,17]]}}}