{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T17:53:52Z","timestamp":1648835632490},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1974,12,1]],"date-time":"1974-12-01T00:00:00Z","timestamp":155088000000},"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":[[1974,12]]},"DOI":"10.1007\/bf01580237","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:58:43Z","timestamp":1114667923000},"page":"212-223","source":"Crossref","is-referenced-by-count":10,"title":["Improved penalty calculations for a mixed integer branch-and-bound algorithm"],"prefix":"10.1007","volume":"6","author":[{"given":"Ronald D.","family":"Armstrong","sequence":"first","affiliation":[]},{"given":"Prabhakant","family":"Sinha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"450","volume":"2","author":"E.M.L. Beale","year":"1965","unstructured":"E.M.L. Beale and R.E. Small, \u201cMixed integer programming by a branch-and-bound technique\u201d,Proceedings of the 3 rd IFIP Congress 2 (1965) 450\u2013451.","journal-title":"Proceedings of the 3rd IFIP Congress"},{"key":"CR2","volume-title":"Proceedings of the 5th international conference on operations research","author":"E.M.L. Beale","year":"1969","unstructured":"E.M.L. Beale and J.A. Tomlin, \u201cSpecial facilities in a general mathematical programming system for non-convex problems using ordered sets of variables\u201d, in:Proceedings of the 5 th international conference on operations research (Wiley, New York, 1969)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"J.F. Benders, \u201cPartitioning procedures for solving mixed-variables programming problems\u201d,Numerische Mathematik 4 (1962) 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01584074","volume":"1","author":"M. B\u00e9nichou","year":"1971","unstructured":"M. B\u00e9nichou, J.M. Gauther, P. Girodet, G. Hentg\u00e8s, G. Ribi\u00e8re and O. Vincent, \u201cExperiments in mixed integer linear programming\u201d,Mathematical Programming 1 (1971) 76\u201394.","journal-title":"Mathematical Programming"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/B978-0-12-358350-5.50010-5","volume-title":"Mathematical programming","author":"H.P. Crowder","year":"1973","unstructured":"H.P. Crowder and E.L. Johnson, \u201cCyclic group methods in branch and bound\u201d, in:Mathematical programming Eds. T.C. Hu and S.M. Robinson (Academic Press, New York, 1973) pp. 213\u2013226."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(67)80015-1","volume":"1","author":"G.B. Dantzig","year":"1967","unstructured":"G.B. Dantzig and R.M. Van Slyke, \u201cGeneralized upper bounding techniques\u201d,Journal of Computer Systems Science 1 (1967) 213\u2013226.","journal-title":"Journal of Computer Systems Science"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1287\/opre.19.4.1036","volume":"19","author":"R.E. Davis","year":"1971","unstructured":"R.E. Davis, D.A. Kendrick and M. Weitzman, \u201cA branch-and-bound algorithm for 0\u20131 mixed integer programming problems\u201d,Operations Research 19 (1971) 1036\u20131044.","journal-title":"Operations Research"},{"key":"CR8","series-title":"Working paper","doi-asserted-by":"crossref","DOI":"10.21236\/AD0755118","volume-title":"Lagrangian relaxation and its uses in integer programming","author":"A.M. Geoffrion","year":"1972","unstructured":"A.M. Geoffrion, \u201cLagrangian relaxation and its uses in integer programming\u201d, Working paper No. 195, Western Management Science Institute, University of California, Los Angeles, Calif. (December 1972)."},{"issue":"9","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 (9) (1972) 465\u2013491.","journal-title":"Management Science"},{"key":"CR10","volume-title":"\u201cAn algorithm for the mixed integer problem\u201d, RM-2597","author":"R.E. Gomory","year":"1960","unstructured":"R.E. Gomory, \u201cAn algorithm for the mixed integer problem\u201d, RM-2597, The Rand Corporation, Santa Monica, Calif. (1960)."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1287\/opre.12.1.122","volume":"12","author":"W.C. Healy","year":"1964","unstructured":"W.C. Healy, \u201cMultiple choice programming\u201d,Operations Reserach 12 (1964) 122\u2013138.","journal-title":"Operations Reserach"},{"issue":"4","key":"CR12","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"E.R. Lawler","year":"1966","unstructured":"E.R. Lawler and D.E. Wood, \u201cBranch-and-bound methods: A survey\u201d,Operations Research 14 (4) (1966) 699\u2013719.","journal-title":"Operations Research"},{"key":"CR13","volume-title":"Optimal investment planning for electrical power generation","author":"F. Noonan","year":"1973","unstructured":"F. Noonan, \u201cOptimal investment planning for electrical power generation\u201d, Dissertation, Department of Industrial Engineering and Operations Research, University of Massachusetts, Amherst, Mass. (1973)."},{"key":"CR14","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 projects\u201d,Management Science 13 (1967) 736\u2013750.","journal-title":"Management Science"},{"key":"CR15","first-page":"419","volume-title":"Integer and nonlinear programming","author":"B. Roy","year":"1970","unstructured":"B. Roy, R. Benayoun and J. Tergny, \u201cFrom S.E.P. procedure to OPHELIE program\u201d, in:Integer and nonlinear programming Ed. J. Abadie (North-Holland, Amsterdam, 1970)pp. 419\u2013436."},{"key":"CR16","first-page":"437","volume-title":"Integer and nonlinear programming","author":"J.A. Tomlin","year":"1970","unstructured":"J.A. Tomlin, \u201cBranch-and-bound methods for integer and non-convex programming\u201d, in:Integer and nonlinear programming Ed. J. Abadie (North-Holland, Amsterdam, 1970) pp. 437\u2013450."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580237.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580237\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:05Z","timestamp":1556881925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,12]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,12]]}},"alternative-id":["BF01580237"],"URL":"https:\/\/doi.org\/10.1007\/bf01580237","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,12]]}}}