{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T05:43:24Z","timestamp":1775627004645,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1975,12,1]],"date-time":"1975-12-01T00:00:00Z","timestamp":186624000000},"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":[[1975,12]]},"DOI":"10.1007\/bf01580430","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:57:06Z","timestamp":1114678626000},"page":"91-103","source":"Crossref","is-referenced-by-count":362,"title":["A branch and bound algorithm for the generalized assignment problem"],"prefix":"10.1007","volume":"8","author":[{"given":"G. Terry","family":"Ross","sequence":"first","affiliation":[]},{"given":"Richard M.","family":"Soland","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","series-title":"Working Paper","volume-title":"An integer generalized transportation model for optimal job assignment in computer networks","author":"V. Balachandran","year":"1972","unstructured":"V. Balachandran, \u201cAn integer generalized transportation model for optimal job assignment in computer networks\u201d, Working Paper 34-72-3, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pa. (November, 1972)."},{"key":"CR2","volume-title":"\u201cStatic and dynamic biased quadratic multi-attribute assignment models: solutions and equivalents\u201d, Center for Cybernetic Studies, Research Report CS 115","author":"A. Charnes","year":"1973","unstructured":"A. Charnes, W.W. Cooper, D. Klingman and R. Niehaus, \u201cStatic and dynamic biased quadratic multi-attribute assignment models: solutions and equivalents\u201d, Center for Cybernetic Studies, Research Report CS 115, The University of Texas, Austin, Texas (January, 1973)."},{"issue":"3","key":"CR3","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"R.J. Dakin","year":"1965","unstructured":"R.J. Dakin, \u201cA tree search algorithm for mixed integer programming problems\u201d,Computer Journal 8 (3) (1965) 250\u2013255.","journal-title":"Computer Journal"},{"issue":"6","key":"CR4","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1287\/opre.19.6.1406","volume":"19","author":"A. DeMaio","year":"1971","unstructured":"A. DeMaio and C. Roveda, \u201cAn all zero\u2013one algorithm for a certain class of transportation problems\u201d,Operations Research 19 (6) (1971) 1406\u20131418.","journal-title":"Operations Research"},{"issue":"3","key":"CR5","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/opre.17.3.437","volume":"17","author":"A.M. Geoffrion","year":"1969","unstructured":"A.M. Geoffrion, \u201cAn improved implicit enumeration approach for integer programming\u201d,Operations Research 17 (3) (1969) 437\u2013454.","journal-title":"Operations Research"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"A.M. Geoffrion, \u201cLagrangean relaxation for integer programming\u201d,Mathematical Programming Study 2 (1974) 82\u2013114.","journal-title":"Mathematical Programming Study"},{"issue":"5","key":"CR7","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"20","author":"A.M. Geoffrion","year":"1974","unstructured":"A.M. Geoffrion and G.W. Graves, \u201cMulticommodity distribution system design by benders decomposition\u201d,Management Science 20 (5) (1974) 822\u2013844.","journal-title":"Management Science"},{"issue":"5","key":"CR8","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. Hegerich, \u201cA branch search algorithm for the knapsack problem\u201d,Management Science 16 (5) (1970) 327\u2013332.","journal-title":"Management Science"},{"key":"CR9","unstructured":"M.D. Grigoriadis, D.T. Tang and L.S. Woo, \u201cConsiderations in the optimal synthesis of some communication networks\u201d, Presented at the 45th Joint National Meeting of the Operations Research Society of America and The Institute of Management Sciences, Boston, Mass., April 22\u201324, 1974."},{"key":"CR10","series-title":"Tech. Memorandum","volume-title":"Optimal allocation of ships to yards for regular overhauls","author":"D. Gross","year":"1972","unstructured":"D. Gross and C.E. Pinkus, \u201cOptimal allocation of ships to yards for regular overhauls\u201d, Tech. Memorandum 63095, Institute for Management Science and Engineering, The George Washington University, Washington, D.C. (May, 1972)."},{"issue":"4","key":"CR11","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 (4) Part I (1973) 460\u2013463.","journal-title":"Management Science"},{"key":"CR12","unstructured":"D. Klingman and J. Stutz, \u201cComputational testing on an integer generalized network code\u201d, Presented at the 45th Joint National Meeting of the Operations Research Society of America and The Institute of Management Sciences, Boston, Mass., April 22\u201324, 1974."},{"issue":"1","key":"CR13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/mnsc.11.1.177","volume":"11","author":"J.R. Lourie","year":"1964","unstructured":"J.R. Lourie, \u201cTopology and computation of the generalized transportation problem\u201d,Management Science 11 (1) (1964) 177\u2013187.","journal-title":"Management Science"},{"issue":"1","key":"CR14","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/opre.21.1.284","volume":"21","author":"V. Srinivasan","year":"1973","unstructured":"V. Srinivasan and G. Thompson, \u201cAn algorithm for assigning uses to sources in a speical class of transportation problems\u201d,Operations Research 21 (1) (1973) 284\u2013295.","journal-title":"Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580430.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580430\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:08Z","timestamp":1556896328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,12]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1975,12]]}},"alternative-id":["BF01580430"],"URL":"https:\/\/doi.org\/10.1007\/bf01580430","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1975,12]]}}}