{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:46Z","timestamp":1759847806516},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1976,12,1]],"date-time":"1976-12-01T00:00:00Z","timestamp":218246400000},"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":[[1976,12]]},"DOI":"10.1007\/bf01580382","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:55:54Z","timestamp":1114682154000},"page":"150-157","source":"Crossref","is-referenced-by-count":13,"title":["Shortest path algorithms for knapsack type problems"],"prefix":"10.1007","volume":"11","author":[{"given":"A. M.","family":"Frieze","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra, \u201cA note on two problemsm connection with graphs\u201d,Numerische Mathematik 1 (1959) 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"P.C. Gilmore","year":"1965","unstructured":"P.C. Gilmore and R.E. Gomory, \u201cMultistage cutting stock problems of two and more dimensions\u201d,Operations Research 13 (1965) 94\u2013120.","journal-title":"Operations Research"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"P.C. Gilmore","year":"1966","unstructured":"P.C. Gilmore and R.E. Gomory, \u201cThe theory and computation of knapsack functions\u201d,Operations Research 14 (1966) 1045\u20131074.","journal-title":"Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1073\/pnas.53.2.260","volume":"53","author":"R.E. Gomory","year":"1965","unstructured":"R.E. Gomory, \u201cOn the relation between integer and non-integer solutions to linear programs\u201d,Proceedings of the National Academy of Sciences 53 (1965) 250\u2013265.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R.E. Gomory","year":"1969","unstructured":"R.E. Gomory, \u201cSome polyhedra related to combinatorial problems\u201d,Linear Algebra and its Applications 2 (1969) 451\u2013558.","journal-title":"Linear Algebra and its Applications"},{"key":"CR6","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, Mass., 1969)."},{"key":"CR7","volume-title":"Proceedings of an international symposium on the theory of switching, Part II, Apr. 2\u20135, 1957","author":"E.P. Moore","year":"1959","unstructured":"E.P. Moore, \u201cThe shortest path through a maze\u201d, in:Proceedings of an international symposium on the theory of switching, Part II, Apr. 2\u20135, 1957 (Harvard University Press, Cambridge, Ma., 1959)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/opre.16.1.103","volume":"16","author":"J.F. Shapiro","year":"1968","unstructured":"J.F. Shapiro, \u201cDynamic programming algorithms for the integer programming problem I: The integer programming problem viewed as a knapsack problem\u201d,Operations Research 16 (1968) 103\u2013131.","journal-title":"Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1287\/opre.16.5.928","volume":"16","author":"J.F. Shapiro","year":"1968","unstructured":"J.F. Shapiro, \u201cGroup theoretic algorithms for the integer programming problem II: Extension to a general algorithm\u201d,Operations Research 16 (1968) 928\u2013947.","journal-title":"Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580382.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580382\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580382","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:07Z","timestamp":1556896327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580382"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,12]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,12]]}},"alternative-id":["BF01580382"],"URL":"https:\/\/doi.org\/10.1007\/bf01580382","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,12]]}}}