{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T15:41:36Z","timestamp":1770478896734,"version":"3.49.0"},"reference-count":31,"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\/bf01588949","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T16:58:49Z","timestamp":1114707529000},"page":"21-40","source":"Crossref","is-referenced-by-count":76,"title":["A hybrid approach to discrete mathematical programming"],"prefix":"10.1007","volume":"14","author":[{"given":"Roy E.","family":"Marsten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas L.","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1287\/opre.23.6.1099","volume":"23","author":"J.H. Ahrens","year":"1975","unstructured":"J.H. Ahrens and G. Finke, \u201cMerging and sorting applied to the zero\u2013one knapsack problem\u201d,Operations Research 23 (1975) 1099\u20131109.","journal-title":"Operations Research"},{"issue":"4","key":"CR2","first-page":"557","volume":"37","author":"O.G. Alekseev","year":"1976","unstructured":"O.G. Alekseev and I.F. Volodos, \u201cCombined use of dynamic programming and branch-andbound methods in discrete programming problems\u201d,Automation and Remote Control 37 (4) Pt. 2 (1976) 557\u2013565.","journal-title":"Automation and Remote Control"},{"key":"CR3","volume-title":"Management Science Research Report No. 375","author":"N. Christofides","year":"1975","unstructured":"N. Christofides, \u201cA minimax-facility location problem and the cardinality constrained set covering problem\u201d, Management Science Research Report No. 375, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA (1975)."},{"key":"CR4","unstructured":"E.V. Denardo and B.L. Fox, \u201cShortest route methods: reaching, pruning, and buckets\u201d, Yale University (May 1977)."},{"key":"CR5","volume-title":"Technical Report CP-74009","author":"V. Dharmadhikari","year":"1974","unstructured":"V. Dharmadhikari, \u201cDiscrete dynamic programming and the nonlinear resource allocation problem\u201d, Technical Report CP-74009, Dept. of Computer Science and Operations Research, Southern Methodist University, Dallas, TX (1974)."},{"key":"CR6","first-page":"105","volume":"19","author":"S.E. Elmaghraby","year":"1968","unstructured":"S.E. Elmaghraby, \u201cThe one-machine sequencing problem with delay costs\u201d,Journal of Industrial Engineering 19 (1968) 105\u2013108.","journal-title":"Journal of Industrial Engineering"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01580393","volume":"11","author":"M.L. Fisher","year":"1976","unstructured":"M.L. Fisher, \u201cA dual algorithm for the one-machine scheduling problem\u201d,Mathematical Programming 11 (1976) 229\u2013251.","journal-title":"Mathematical Programming"},{"key":"CR8","volume-title":"Integer Programming","author":"R.S. Garfinkel","year":"1972","unstructured":"R.S. Garfinkel and G.L. Nemhauser,Integer Programming (Wiley\u2014Interscience, New York, 1972)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1287\/mnsc.18.9.465","volume":"18","author":"A.M. Geoffrion","year":"1972","unstructured":"A.M. Geoffrion and R.E. Marsten, \u201cInteger programming algorithms: a framework and state-of-the art survey\u201d,Management Science 18 (1972) 465\u2013491.","journal-title":"Management Science"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F. Glover","year":"1975","unstructured":"F. Glover, \u201cImproved linear integer programming formulations of nonlinear integer problems\u201d,Management Science 22 (1975) 455\u2013460.","journal-title":"Management Science"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/0022-247X(70)90148-4","volume":"30","author":"R.E. Haymond","year":"1970","unstructured":"R.E. Haymond, \u201cDiscontinuities in the optimal return in dynamic programming\u201d,Journal of Mathematical Analysis and Applications 30 (1970) 639\u2013644.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1287\/opre.17.4.600","volume":"17","author":"F.S. Hillier","year":"1969","unstructured":"F.S. Hillier, \u201cEfficient heuristic procedures for integer linear programming with an interior\u201d,Operations Research 17 (1969) 600\u2013637.","journal-title":"Operations Research"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/322003.322010","volume":"24","author":"T. Ibaraki","year":"1977","unstructured":"T. Ibaraki, \u201cThe power of dominance relations in branch-and-bound algorithms\u201d,Journal of the Association for Computing Machinery 24 (1977) 264\u2013279.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/opre.13.3.400","volume":"11","author":"E. Ignall","year":"1965","unstructured":"E. Ignall and L. Schrage, \u201cApplication of the branch-and-bound technique to some flow-shop scheduling problems\u201d,Operations Research 11 (1965) 400\u2013412.","journal-title":"Operations Research"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1111\/j.1540-5915.1974.tb00593.x","volume":"5","author":"G.A. Kochenberger","year":"1974","unstructured":"G.A. Kochenberger, B.A. McCarl, and F.P. Wyman, \u201cA heuristic for general integer programming\u201d,Decision Sciences 5 (1974) 36\u201344.","journal-title":"Decision Sciences"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/opre.23.2.207","volume":"23","author":"M.J. Magazine","year":"1975","unstructured":"M.J. Magazine, G.L. Nemhauser, and L.E. Trotter, Jr., \u201cWhen the greedy solution solves a class of knapsack problems\u201d,Operations Research 23 (1975) 207\u2013217.","journal-title":"Operations Research"},{"key":"CR17","volume-title":"SEXOP: subroutines for experimental optimization","author":"R.E. Marsten","year":"1974","unstructured":"R.E. Marsten, \u201cSEXOP: subroutines for experimental optimization\u201d, Sloan School of Management, MIT, Cambridge, MA (1974)."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0167-5060(08)70745-3","volume":"1","author":"R.E. Marsten","year":"1977","unstructured":"R.E. Marsten and T.L. Morin, \u201cParametric integer programming: the right-hand-side case\u201d,Annals of Discrete Mathematics 1 (1977) 375\u2013390.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR19","series-title":"Working Paper","volume-title":"Implicit enumeration procedures","author":"L.G. Mitten","year":"1973","unstructured":"L.G. Mitten and A.R. Warburton, \u201cImplicit enumeration procedures\u201d, Working Paper 251, Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, B.C., Canada (1973)."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/0022-247X(74)90154-1","volume":"48","author":"T.L. Morin","year":"1974","unstructured":"T.L. Morin and A.M.O. Esogbue, \u201cThe imbedded state space approach to reducing dimensionality in dynamic programs of higher dimensions\u201d,Journal of Mathematical Analysis and Applications 48 (1974) 801\u2013810.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"CR21","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 problems\u201d,Management Science 22 (1976) 1147\u20131158.","journal-title":"Management Science"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.24.4.611","volume":"24","author":"T.L. Morin","year":"1976","unstructured":"T.L. Morin and R.E. Marsten, \u201cBranch-and-bound strategies for dynamic programming\u201d,Operations Research 24 (1976) 611\u2013627.","journal-title":"Operations Research"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0022-247X(72)90091-1","volume":"38","author":"G.L. Nemhauser","year":"1972","unstructured":"G.L. Nemhauser, \u201cA generalized permanent label setting algorithm for the shortest path between specified nodes\u201d,Journal of Mathematical Analysis and Applications 38 (1972) 328\u2013334.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1287\/mnsc.15.9.494","volume":"15","author":"G.L. Nemhauser","year":"1969","unstructured":"G.L. Nemhauser and Z. Ullman, \u201cDiscrete dynamic programming and capital allocation\u201d,Management Science 15 (1969) 494\u2013505.","journal-title":"Management Science"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.13.9.736","volume":"13","author":"C.C. Petersen","year":"1967","unstructured":"C.C. Petersen, \u201cComputational experience with variants of the Balas algorithm applied to the selection of R & D project\u201d,Management Science 13 (1967) 736\u2013750.","journal-title":"Management Science"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1080\/05695557408974946","volume":"6","author":"C.C. Petersen","year":"1974","unstructured":"C.C. Petersen, \u201cA capital budgeting heuristic algorithm using exchange operations\u201d,AIIE Transactions 6 (1974) 143\u2013150.","journal-title":"AIIE Transactions"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1287\/opre.13.5.800","volume":"13","author":"F. Proschan","year":"1965","unstructured":"F. Proschan and T.A. Bray, \u201cOptimal redundancy under multiple constraints\u201d,Operations Research 13 (1965) 143\u2013150.","journal-title":"Operations Research"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/nav.3800220110","volume":"22","author":"H.M. Salkin","year":"1975","unstructured":"H.M. Salkin and C.A. DeKluyver, \u201cThe knapsack problem: a survey\u201d,Naval Research Logistics Quarterly 22 (1975) 127\u2013144.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"B196","DOI":"10.1287\/mnsc.15.4.B196","volume":"15","author":"S. Senju","year":"1968","unstructured":"S. Senju and Y. Toyoda, \u201cAn approach to linear programming with 0\/1 variables\u201d,Management Science 15 (1968) B196-B207.","journal-title":"Management Science"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1287\/mnsc.21.12.1417","volume":"21","author":"Y. Toyoda","year":"1975","unstructured":"Y. Toyoda, \u201cA simplified algorithm for obtaining approximate solutions to zero\u2013one programming problems\u201d,Management Science 21 (1975) 1417\u20131427.","journal-title":"Management Science"},{"key":"CR31","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\/BF01588949.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01588949\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588949","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:36:29Z","timestamp":1556897789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01588949"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,12]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,12]]}},"alternative-id":["BF01588949"],"URL":"https:\/\/doi.org\/10.1007\/bf01588949","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,12]]}}}