{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:19:15Z","timestamp":1649175555940},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1007\/bf02025299","type":"journal-article","created":{"date-parts":[[2005,8,10]],"date-time":"2005-08-10T08:48:16Z","timestamp":1123663696000},"page":"285-293","source":"Crossref","is-referenced-by-count":1,"title":["Penalty computations for the set partitioning problem"],"prefix":"10.1007","volume":"43","author":[{"given":"Brigitte","family":"Jaumard","sequence":"first","affiliation":[]},{"given":"Marcelo","family":"Prais","sequence":"additional","affiliation":[]},{"given":"Celso","family":"Carneiro Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02025299_CR1","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF01580237","volume":"6","author":"R.D. Armstrong","year":"1974","unstructured":"R.D. Armstrong and P. Sinha, Improved penalty calculations for a mixed integer branch-and-bound algorithm, Math. Progr. 6(1974)212\u2013223.","journal-title":"Math. Progr."},{"key":"BF02025299_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0167-6377(83)90045-7","volume":"2","author":"E. Balas","year":"1983","unstructured":"E. Balas and P.R. Landweer, Traffic assignment in communication satellites, Oper. Res. Lett. 2(1983) 141\u2013147.","journal-title":"Oper. Res. Lett."},{"key":"BF02025299_CR3","first-page":"450","volume":"2","author":"E. Beale","year":"1965","unstructured":"E. Beale and R. Small, Mixed integer programming by a branch-and-bound technique,Proc. 3rd IFIP Congress 2 (1965) pp. 450\u2013451.","journal-title":"Proc. 3rd IFIP Congress"},{"key":"BF02025299_CR4","volume-title":"Optimisation des ressources pour des transmissions par satellite utilisant l'AMRT","author":"E. Brandt","year":"1982","unstructured":"E. Brandt, Optimisation des ressources pour des transmissions par satellite utilisant l'AMRT, Th\u00e8se de Doctorat de 3\u00e8me Cycle, Universit\u00e9 Paris-Sud, Paris (1982)."},{"key":"BF02025299_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/nav.3800310115","volume":"31","author":"A.V. Cabot","year":"1984","unstructured":"A.V. Cabot and S.S. Erenguc, Some branch-and-bound procedures for fixed-cost transportation problems, Naval Res. Log. Quart. 31(1984)145\u2013154.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02025299_CR6","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1287\/mnsc.32.7.856","volume":"32","author":"A.V. Cabot","year":"1986","unstructured":"A.V. Cabot and S.S. Erenguc, Improved penalties for fixed cost linear programs using Lagrangian relaxation, Manag. Sci. 32(1986)856\u2013869.","journal-title":"Manag. Sci."},{"key":"BF02025299_CR7","series-title":"Technical Report","volume-title":"A multiplier-adjustment-based branch-and-bound algorithm for the set partitioning problem","author":"T.J. Chan","year":"1987","unstructured":"T.J. Chan, J.C. Bean and C.A. Yano, A multiplier-adjustment-based branch-and-bound algorithm for the set partitioning problem, Technical Report 87-OR-08, Department of Operations Research and Engineering Management, Southern Methodist University, Dallas (1987)."},{"key":"BF02025299_CR8","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/mnsc.12.7.576","volume":"12","author":"N.J. Driebeek","year":"1966","unstructured":"N.J. Driebeek, An algorithm for the solution of mixed integer programming problems, Manag. Sci. 12(1966)576\u2013587.","journal-title":"Manag. Sci."},{"key":"BF02025299_CR9","unstructured":"P. Hansen, Programmes math\u00e9matiques en variables 0\u20131, Th\u00e8se d'Agr\u00e9gation, Universit\u00e9 de Bruxelles (1974)."},{"key":"BF02025299_CR10","unstructured":"N. Mannur, M.H. Karwan and S. Zionts, A comparison of variable setting methods in 0\u20131 linear integer programming,TIMS\/ORSA Joint National Meeting, Washington DC (1988)."},{"key":"BF02025299_CR11","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/355972.355976","volume":"7","author":"R.E. Marsten","year":"1981","unstructured":"R.E. Marsten, The design of the XMP linear programming library, ACM Trans. Math. Software 7(1981)481\u2013497.","journal-title":"ACM Trans. Math. Software"},{"key":"BF02025299_CR12","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1287\/mnsc.36.9.1092","volume":"36","author":"U.S. Palekar","year":"1990","unstructured":"U.S. Palekar, M.H. Karwan and S. Zionts, A branch-and-bound method for the fixed charge transportation problem, Manag. Sci. 36(1990)1092\u20131105.","journal-title":"Manag. Sci."},{"key":"BF02025299_CR13","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/0377-2217(89)90389-5","volume":"41","author":"C.C. Ribeiro","year":"1989","unstructured":"C.C. Ribeiro, M. Minoux and M.C. Penna, An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment, Eur. J. Oper. Res. 41(1989)232\u2013239.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02025299_CR14","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0377-2217(89)90229-4","volume":"43","author":"J.R. Schaffer","year":"1989","unstructured":"J.R. Schaffer and D.E. O'Leary, Use of penalties in a branch-and-bound procedure for the fixed charge transportation problem, Eur. J. Oper. Res. 43(1989)305\u2013312.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02025299_CR15","volume-title":"LINDO - User's Manual","author":"L. Schrage","year":"1989","unstructured":"L. Schrage,LINDO - User's Manual, 4th ed. (The Scientific Press, Redwood City, 1989).","edition":"4th ed."},{"key":"BF02025299_CR16","first-page":"419","volume-title":"Integer and Nonlinear Programming","author":"J.A. Tomlin","year":"1970","unstructured":"J.A. Tomlin, Branch-and-bound methods for integer and non-convex programming, in:Integer and Nonlinear Programming, ed. J. Abadie (North-Holland, Amsterdam, 1970) pp. 419\u2013436."},{"key":"BF02025299_CR17","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1287\/opre.19.4.1070","volume":"19","author":"J.A. Tomlin","year":"1971","unstructured":"J.A. Tomlin, An improved branch-and-bound method for integer programming, Oper. Res. 19(1971)1070\u20131074.","journal-title":"Oper. Res."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02025299.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02025299\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02025299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T18:53:04Z","timestamp":1557773584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02025299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["BF02025299"],"URL":"https:\/\/doi.org\/10.1007\/bf02025299","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}