{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T04:15:05Z","timestamp":1777090505739,"version":"3.51.4"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":[[1996,2]]},"DOI":"10.1007\/bf02601642","type":"journal-article","created":{"date-parts":[[2007,4,7]],"date-time":"2007-04-07T05:16:21Z","timestamp":1175922981000},"page":"129-150","source":"Crossref","is-referenced-by-count":23,"title":["A comparison of two methods for solving 0\u20131 integer programs using a general purpose simulated annealing algorithm"],"prefix":"10.1007","volume":"63","author":[{"given":"David","family":"Abramson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henry","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohan","family":"Krishnamoorthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02601642_CR1","doi-asserted-by":"crossref","unstructured":"D.A. Abramson, A very high speed architecture to support simulated annealing, IEEE Computer (1992).","DOI":"10.1109\/2.144393"},{"key":"BF02601642_CR2","doi-asserted-by":"crossref","unstructured":"D.A. Abramson and H. Dang, School timetables: A case study in simulated annealing, in:Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems, ed. V.V. Rene (Vidal, 1993) pp. 103\u2013124.","DOI":"10.1007\/978-3-642-46787-5_6"},{"key":"BF02601642_CR3","unstructured":"D.A. Abramson, H. Dang and M. Krisnamoorthy, Enhanced simulated annealing through linear programming preprocessing,Proc. 12th Australian Society for Operations Research (ASOR) Conf., Adelaide (1993)."},{"key":"BF02601642_CR4","unstructured":"D.A. Abramson, H. Dang and M. Krisnamoorthy, Cooling schedules for simulated annealing based scheduling algorithms, Technical Report, School of Computing and Information Technology, Griffith University, Nathan, Eld 4111, Australia."},{"key":"BF02601642_CR5","unstructured":"D.A. Abramson, H. Dang and M. Krisnamoorthy, Enhancing simulated annealing for 0\u20131 problems with linear programming preprocessing, Technical Report, School of Computing and Information Technology, Griffith University, Nathan, Qld 4111, Australia."},{"key":"BF02601642_CR6","doi-asserted-by":"crossref","unstructured":"E. Balas and M.W. Padberg, Set partitioning, MSRR No. 351, Carnegie-Mellon University (1974).","DOI":"10.1007\/978-94-011-7557-9_11"},{"key":"BF02601642_CR7","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"E. Balas and M.W. Padberg, Set partitioning: A survey, SIAM Rev. 18(1976)710\u2013760.","journal-title":"SIAM Rev."},{"key":"BF02601642_CR8","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/1026105","volume":"26","author":"E. Bonomi","year":"1984","unstructured":"E. Bonomi and J.L. Lutton, TheN-city travelling salesman problem: Statistical mechanics and the metropolis algorithm, SIAM Rev. 26(1984)551\u2013568.","journal-title":"SIAM Rev."},{"key":"BF02601642_CR9","unstructured":"E. Bonomi and J.L. Lutton, The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach, Euro. J. Oper. Res. 18(1984)."},{"key":"BF02601642_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1051\/ro\/1986200301771","volume":"20","author":"E. Bonomi","year":"1986","unstructured":"E. Bonomi and J.L. Lutton, Simulated annealing algorithm for the minimum weighted perfect Euclidean matching problem, RAIRO Recherche Operationelle 20(1986)177\u20131282.","journal-title":"RAIRO Recherche Operationelle"},{"key":"BF02601642_CR11","volume-title":"Set partitioning approaches to combinatorial optimization problems","author":"D.G. Cattrysse","year":"1990","unstructured":"D.G. Cattrysse, Set partitioning approaches to combinatorial optimization problems, Ph.D. Thesis, Dept. Werktuigkunde, Afdeling Industrieel Beleid, Katholieke Universiteit Leuven, Belgium (1990)."},{"key":"BF02601642_CR12","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","volume":"60","author":"D.G. Cattrysse","year":"1992","unstructured":"D.G. Cattrysse and L.N. Van Wassenhove, A survey of algorithms for the generalized assignment problem, Euro. J. Oper. Res. 60(1992)260\u2013272.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02601642_CR13","unstructured":"N. Christofides et al.,Combinatorial Optimization (Wiley,1979)."},{"key":"BF02601642_CR14","first-page":"209","volume":"8","author":"N.E. Collins","year":"1988","unstructured":"N.E. Collins, R.W. Eglese and B.L. Golden, Simulated annealing: An annotated bibliography, Amer. J. Math. Manag. Sci. 8(1988)209\u2013307.","journal-title":"Amer. J. Math. Manag. Sci."},{"key":"BF02601642_CR15","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1057\/jors.1992.75","volume":"43","author":"D.T. Connolly","year":"1992","unstructured":"D.T. Connolly, General purpose simulated annealing, J. Oper. Res. 43(1992)495\u2013505.","journal-title":"J. Oper. Res."},{"key":"BF02601642_CR16","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"H. Crowder, E.L. Johnson and M. Padberg, Solving large scale zero-one linear programming problems, Oper. Res. 31(1983)803\u2013834.","journal-title":"Oper. Res."},{"key":"BF02601642_CR17","volume-title":"Perspectives on Optimization","author":"R.S. Garfinkel","year":"1972","unstructured":"R.S. Garfinkel, Optimal set covering: A survey, in:Perspectives on Optimization, ed. A. Geoffrion (Addison-Wesley Reading, MA, 1972)."},{"key":"BF02601642_CR18","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1287\/opre.17.5.848","volume":"17","author":"R.S. Garfinkel","year":"1969","unstructured":"R.S. Garfinkel and G.L. Nemhauser, The set partitioning problem: Set covering with equality constraints, Oper. Res. 17(1969)848\u2013956.","journal-title":"Oper. Res."},{"key":"BF02601642_CR19","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1287\/inte.19.4.29","volume":"19","author":"I. Gershkoff","year":"1989","unstructured":"I. Gershkoff, Optimizing flight crew schedules, Interfaces 19(1989)29\u201343.","journal-title":"Interfaces"},{"key":"BF02601642_CR20","unstructured":"M. Hasan and I.H. Osman, Local search strategies for the weighted maximal planar graph problems, Int. Trans. OR 1 (4) (1994)."},{"key":"BF02601642_CR21","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"K.L. Hoffman","year":"1993","unstructured":"K.L. Hoffman and M. Padberg, Solving airline crew-scheduling problems by branch-and-cut, Manag. Sci. 39(1993)657\u2013682.","journal-title":"Manag. Sci."},{"key":"BF02601642_CR22","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02025299","volume":"43","author":"B. Jaumard","year":"1993","unstructured":"B. Jaumard, M. Prais and C.C. Ribeiro, Penalty computations for the set partitioning problem, Ann. Oper. Res. 43(1993)285\u2013293.","journal-title":"Ann. Oper. Res."},{"key":"BF02601642_CR23","unstructured":"D.S. Johnson, C.R. Aragon, L.a. McGeoch and C. Shevon, Optimization by simulated annealing: An experimental evaluation,Workshop on Statistical Physics in Engineering and Biology, Yorktown Heights (1986)."},{"key":"BF02601642_CR24","unstructured":"S. Kirkpatrick, C.D. Gelatt, Jr. and M.P. Vecchi, Optimization by simulated annealing, IBM research Report RC 9355 (1982)."},{"key":"BF02601642_CR25","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt, Jr. and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)671\u2013680.","journal-title":"Science"},{"key":"BF02601642_CR26","unstructured":"H.W. Leong and C.L. Liu, Permutation channel routing,Proc. IEEE Int. Conf. on Computer Design, Port Chesters (1985) pp. 579\u2013584."},{"key":"BF02601642_CR27","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1287\/mnsc.25.12.1175","volume":"25","author":"R.E. Marsten","year":"1979","unstructured":"R.E. Marsten, M.R. Muller and C.L. Killion, Crew planning at Fly Tiger: A successful application of integer programming, Manag. Sci. 25(1979)1175\u20131183.","journal-title":"Manag. Sci."},{"key":"BF02601642_CR28","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/net.3230110208","volume":"11","author":"R.E. Marsten","year":"1981","unstructured":"R.E. Marsten and R. Shepardson, Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications, Networks 11(1981)165\u2013177.","journal-title":"Networks"},{"key":"BF02601642_CR29","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/nav.3800040304","volume":"4","author":"J.F. McCloskey","year":"1957","unstructured":"J.F. McCloskey and F. Hanssman, An analysis of stewardess requirements and scheduling for a major airline, Naval Res. Log. Quart. 4(1957)183\u2013192.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02601642_CR30","series-title":"Technical Report CS86-1","volume-title":"Chromatic number approximation using simulated annealing","author":"C.A. Morgenstern","year":"1986","unstructured":"C.A. Morgenstern and H.D. Shapiro, Chromatic number approximation using simulated annealing, Technical Report CS86-1, Department of Computer Science, The University of New Mexico, Albuquerque (1986)."},{"key":"BF02601642_CR31","doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, 1988).","DOI":"10.1002\/9781118627372"},{"key":"BF02601642_CR32","doi-asserted-by":"crossref","unstructured":"I.H. Osman and N. Christofides, Capacitated clustering by hybrid simulated annealing and tabu search, Int. Trans. OR 1(1994).","DOI":"10.1111\/1475-3995.d01-43"},{"key":"BF02601642_CR33","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I.H. Osman","year":"1993","unstructured":"I.H. Osman, Metrastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Ann. Oper. Res. 41(1993)421\u2013451.","journal-title":"Ann. Oper. Res."},{"key":"BF02601642_CR34","first-page":"1","volume":"33","author":"M. Padberg","year":"1990","unstructured":"M. Padberg and G. Rinaldi, A branch-and-cut algorithm for the solution of large scale travelling salesman problems, SIAM Rev. 33(1990)1\u201341.","journal-title":"SIAM Rev."},{"key":"BF02601642_CR35","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1109\/JSSC.1985.1052337","volume":"20","author":"C. Sechen","year":"1985","unstructured":"C. Sechen and A.L. Sangiovanni-Vincentelli, The Timber Wolf placement and routing package, IEEE J. Sol. Stat. Circuits SC-20(1985)510\u2013522.","journal-title":"IEEE J. Sol. Stat. Circuits"},{"key":"BF02601642_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated Annealing: Theory and Applications","author":"P.J.M. Laarhoven van","year":"1987","unstructured":"P.J.M. van Laarhoven and E.H.L. Aarts,Simulated Annealing: Theory and Applications, (Reidel, Dordrecht, 1987)."},{"key":"BF02601642_CR37","doi-asserted-by":"crossref","unstructured":"S.R. White, Concepts of the scale in simulated annealing,Proc. IEEE Int. Conf. on Computer Design, Port Chester (1984), pp. 646\u2013651.","DOI":"10.1063\/1.34823"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02601642.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02601642\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02601642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T11:27:57Z","timestamp":1683804477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02601642"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["BF02601642"],"URL":"https:\/\/doi.org\/10.1007\/bf02601642","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}