{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:14:05Z","timestamp":1648926845370},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1007\/bf02592953","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T12:12:13Z","timestamp":1175170333000},"page":"207-214","source":"Crossref","is-referenced-by-count":0,"title":["A dual approach for the continuous collapsing knapsack problem"],"prefix":"10.1007","volume":"39","author":[{"given":"Marc E.","family":"Posner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisatoshi","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1987,6,1]]},"reference":[{"key":"BF02592953_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02591729","volume":"29","author":"M.E. Dyer","year":"1984","unstructured":"M.E. Dyer, \u201cAn O(n) algorithm for the multiple choice knapsack problem,\u201dMathematical Programming 29 (1984) 57\u201363.","journal-title":"Mathematical Programming"},{"key":"BF02592953_CR2","unstructured":"D. Fayard and G. Plateau, \u201cOn the collapsing 0\u20131 knapsack problem,\u201d contributed paper Tenth International Symposium on Mathematical Programming, Montreal (August 1979)."},{"key":"BF02592953_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01588255","volume":"17","author":"F. Glover","year":"1979","unstructured":"F. Glover and D. Klingman, \u201cAn O(n logn) algorithm for LP knapsacks with GUB constraints,\u201dMathematical Programming 17 (1979) 345\u2013361.","journal-title":"Mathematical Programming"},{"key":"BF02592953_CR4","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R.L. Graham","year":"1972","unstructured":"R.L. Graham, \u201cAn efficient algorithm for determining the convex hull of a finite planar set,\u201dInformation Processing Letters 1 (1972) 132\u2013133.","journal-title":"Information Processing Letters"},{"key":"BF02592953_CR5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.15807\/jorsj.21.59","volume":"21","author":"T. Ibaraki","year":"1978","unstructured":"T. Ibaraki, T. Hasegawa, T. Teranaka and J. Iwase, \u201cThe multiple choice knapsack problem,\u201dJournal of the Operations Research Society of Japan 21 (1978) 59\u201395.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"BF02592953_CR6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.15807\/jorsj.23.28","volume":"23","author":"T. Ibaraki","year":"1980","unstructured":"T. Ibaraki, \u201cApproximate algorithms for the multiple choice continuous knapsak problem,\u201dJournal of the Operations Research Society of Japan 23 (1980) 28\u201363.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"BF02592953_CR7","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF02591894","volume":"26","author":"M.E. Posner","year":"1983","unstructured":"M.E. Posner, \u201cThe continuous collapsing knapsack problem,\u201dMathematical Programming 26 (1983) 76\u201386.","journal-title":"Mathematical Programming"},{"key":"BF02592953_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01609014","volume":"15","author":"M.E. Posner","year":"1978","unstructured":"M.E. Posner and M. Guignard, \u201cThe 0\u20131 collapsing knapsack problem,\u201dMathematical Programming 15 (1978) 155\u2013161.","journal-title":"Mathematical Programming"},{"key":"BF02592953_CR9","series-title":"Working Paper 80\/101","volume-title":"The integer collapsing knapsack problem","author":"M.E. Posner","year":"1980","unstructured":"M.E. Posner and M. Guignard, \u201cThe integer collapsing knapsack problem,\u201d Working Paper 80\/101, University of Wisconsin-Milwaukee, Milwaukee, WI (1980)."},{"key":"BF02592953_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/359423.359430","volume":"20","author":"F.P. Preparata","year":"1979","unstructured":"F.P. Preparata and S.J. Hong, \u201cConvex hulls of finite sets of points in two and three dimensions,\u201dCommunications of the ACM 20 (1979) 87\u201393.","journal-title":"Communications of the ACM"},{"key":"BF02592953_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01588948","volume":"14","author":"L. Schrage","year":"1978","unstructured":"L. Schrage, \u201cImplicit representation of generalized variable upper bounds in linear programming,\u201dMathematical Programming 14 (1978) 11\u201320.","journal-title":"Mathematical Programming"},{"key":"BF02592953_CR12","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1287\/opre.27.3.503","volume":"27","author":"P. Sinha","year":"1979","unstructured":"P. Sinha and A. Zoltners, \u201cThe multiple choice knapsack problem,\u201dOperations Research 27 (1979) 503\u2013515.","journal-title":"Operations Research"},{"key":"BF02592953_CR13","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1287\/opre.28.6.1412","volume":"28","author":"E. Zemel","year":"1980","unstructured":"E. Zemel, \u201cThe linear multiple choice knapsack problem,\u201dOperations Research 28 (1980) 1412\u20131423.","journal-title":"Operations Research"},{"key":"BF02592953_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(84)90014-0","volume":"18","author":"E. Zemel","year":"1984","unstructured":"E. Zemel, \u201cAn O(n) algorithm for the multiple choice knapsack problem and related problems,\u201dInformation Processing Letters 18 (1984) 123\u2013128.","journal-title":"Information Processing Letters"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592953.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592953\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592953","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592953.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T04:13:34Z","timestamp":1558325614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592953"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["BF02592953"],"URL":"https:\/\/doi.org\/10.1007\/bf02592953","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}