{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T10:02:50Z","timestamp":1768644170218,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1978,12,1]],"date-time":"1978-12-01T00:00:00Z","timestamp":281318400000},"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":[[1978,12]]},"DOI":"10.1007\/bf01609014","type":"journal-article","created":{"date-parts":[[2005,4,30]],"date-time":"2005-04-30T02:12:40Z","timestamp":1114827160000},"page":"155-161","source":"Crossref","is-referenced-by-count":12,"title":["The Collapsing 0\u20131 Knapsack Problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Marc E.","family":"Posner","sequence":"first","affiliation":[]},{"given":"Monique","family":"Guignard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.13.4.517","volume":"13","author":"E. Balas","year":"1965","unstructured":"E. Balas, \u201cAn additive algorithm for solving linear programs with zero\u2013one variables\u201d,Operations Research 13 (1965) 517\u2013546.","journal-title":"Operations Research"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"G.B. Dantzig","year":"1957","unstructured":"G.B. Dantzig, \u201cDiscrete variable extremum problems\u201d,Operations Research 5 (1957) 266\u2013277.","journal-title":"Operations Research"},{"key":"CR3","volume-title":"Integer programming","author":"R. Garfinkel","year":"1972","unstructured":"R. Garfinkel and G. Nemhauser,Integer programming (J. Wiley, New York, 1972)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/opre.17.3.437","volume":"17","author":"A. Geoffrion","year":"1969","unstructured":"A. Geoffrion, \u201cAn improved implicit enumeration approach for integer programming\u201d,Operations Research 17 (1969) 437\u2013454.","journal-title":"Operations Research"},{"key":"CR5","volume-title":"APL\/360 an interactive approach","author":"L. Gilman","year":"1970","unstructured":"L. Gilman and A. Rose,APL\/360 an interactive approach (Wiley, New York, 1970)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1287\/mnsc.16.5.327","volume":"16","author":"H. Greenberg","year":"1970","unstructured":"H. Greenberg and R.L. Hegerish, \u201cA branch search algorithm for the knapsack problem\u201d,Management Science 16 (1970) 327\u2013332.","journal-title":"Management Science"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1147\/rd.164.0424","volume":"16","author":"M. Guignard","year":"1972","unstructured":"M. Guignard and K. Spielberg, \u201cMixed-integer algorithms for the (0, 1) knapsack problem\u201d,IBM Journal of Research & Development 16 (1972) 424\u2013430.","journal-title":"IBM Journal of Research & Development"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/opre.17.2.233","volume":"17","author":"P. Hammer","year":"1969","unstructured":"P. Hammer and S. Rudeanu, \u201cPseudo-Boolean programming\u201d,Operations Research 17 (1969) 233\u2013261.","journal-title":"Operations Research"},{"key":"CR9","first-page":"1700","volume":"270","author":"P. Hansen","year":"1970","unstructured":"P. Hansen, \u201cAlgorithme pour les programmes non lineaires en variables zero\u2014un\u201d,Comptes Rendus 270 (1970) 1700\u20131702.","journal-title":"Comptes Rendus"},{"key":"CR10","volume-title":"Integer programming and network flows","author":"T.C. Hu","year":"1969","unstructured":"T.C. Hu,Integer programming and network flows (Addison Wesley, Reading, MA, 1969)."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"P. Huard, \u201cProgrammes mathematiques non lineaires a variables bivalentes\u201d, in: H.W. Kuhn, ed.,Proceedings of the Princeton symposium on mathematical programming (Princeton University Press, 1970) 313\u2013322.","DOI":"10.1515\/9781400869930-016"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1287\/mnsc.20.4.460","volume":"20","author":"G.P. Ingargiola","year":"1973","unstructured":"G.P. Ingargiola and J.F. Korsh, \u201cReduction algorithm for zero\u2013one single knapsack problems\u201d,Management Science 20 (1973) 460\u2013463.","journal-title":"Management Science"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1287\/mnsc.13.9.723","volume":"13","author":"P.J. Kolesar","year":"1967","unstructured":"P.J. Kolesar, \u201cA branch and bound algorithm for the knapsack problem\u201d,Management Science 13 (1967) 723\u2013735.","journal-title":"Management Science"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1287\/opre.14.6.1098","volume":"14","author":"E. Lawler","year":"1966","unstructured":"E. Lawler and M. Bell, \u201cA method for solving discrete optimization problems\u201d,Operations Research 14 (1966) 1098\u20131112.","journal-title":"Operations Research"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1287\/mnsc.22.10.1147","volume":"22","author":"T.L. Morin","year":"1976","unstructured":"T.L. Morin and R.E. Marsten, \u201cAn algorithm for nonlinear knapsack problem\u201d,Management Science 22 (1976) 1147\u20131158.","journal-title":"Management Science"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/mnsc.23.1.27","volume":"23","author":"R.M. Nauss","year":"1976","unstructured":"R.M. Nauss, \u201cAn efficient algorithm for the 0\u20131 knapsack problem\u201d,Management Science 23 (1976) 27\u201331.","journal-title":"Management Science"},{"key":"CR17","unstructured":"G. Plateau and D. Fayard, \u201cContribution a la resolution de probleme du knapsack: methodes d'exploration\u201d, these presentee a l'universite des Sciences et Techniques de Lille obtenir le titre de Docteur de Specialite, 1971."},{"key":"CR18","unstructured":"M. Posner, \u201cThe generalized knapsack problem\u201d, Ph.D. Thesis, University of Pennsylvania (1974) 112\u2013127."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/opre.15.1.83","volume":"15","author":"H.M. Weingartner","year":"1967","unstructured":"H.M. Weingartner and D.N. Ness, \u201cMethods for the solution of the multi-dimensional 0\/1 knapsack problem\u201d,Operations Research 15 (1967) 83\u2013103.","journal-title":"Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01609014.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01609014\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01609014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T04:53:29Z","timestamp":1586235209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01609014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,12]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,12]]}},"alternative-id":["BF01609014"],"URL":"https:\/\/doi.org\/10.1007\/bf01609014","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,12]]}}}