{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T04:03:15Z","timestamp":1747713795704,"version":"3.40.5"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1023\/a:1009631125956","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"207-224","source":"Crossref","is-referenced-by-count":2,"title":["Combinatorial Optimization by Dynamic Contraction"],"prefix":"10.1007","volume":"3","author":[{"given":"Youssef","family":"Saab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"147017_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A. and U.S.R. Murty. (1976). Graph Theory with Applications. New York, NY: North-Holland."},{"issue":"2","key":"147017_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"T. Bui","year":"1987","unstructured":"Bui, T., S. Chaudhuri, T. Leighton, and M. Sipser. (1987). \"Graph Bisection Algorithm with Good Average Case Behavior,\" Combinatorica 7(2), 171\u2013191.","journal-title":"Combinatorica"},{"key":"147017_CR3","doi-asserted-by":"crossref","unstructured":"Bui, T., C. Heigham, C. Jones, and T. Leighton. (1989). \"Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms,\" Design Automation Conference, pp. 775\u2013778.","DOI":"10.1145\/74382.74527"},{"key":"147017_CR4","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., C. Leiserson, and R. Rivest. (1990). Introduction to Algorithms.New York, NY: McGraw-Hill."},{"issue":"3","key":"147017_CR5","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/65950.65954","volume":"36","author":"H.N. Gabow","year":"1988","unstructured":"Gabow, H.N., Z. Galil, and T.H. Spencer. (1988). \"Efficient Implementation of Graph Algorithms Using Contraction,\" Journal of Association for Computing Machinery 36(3), 540\u2013572.","journal-title":"Journal of Association for Computing Machinery"},{"key":"147017_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, NY: W.H. Freeman and Company."},{"key":"147017_CR7","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"Glover, F. (1977). \"Heuristics for Integer Programming Using Surrogate Constraints,\" Decision Sciences 8,156\u2013166.","journal-title":"Decision Sciences"},{"key":"147017_CR8","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F. (1986). \"Future Paths for Integer Programming and Links to Artificial Intelligence,\" Computers and Operations Research 13, 533\u2013549.","journal-title":"Computers and Operations Research"},{"key":"147017_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F. Glover","year":"1996","unstructured":"Glover, F. (1996). \"Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems,\" Discrete Applied Mathematics 65, 223\u2013253.","journal-title":"Discrete Applied Mathematics"},{"key":"147017_CR10","first-page":"70","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"F. Glover","year":"1993","unstructured":"Glover, F. and M. Laguna. (1993). \"Tabu Search.\" In C.R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems, New York, NY: Halsted Press, chapter 3, pp. 70\u2013141."},{"key":"147017_CR11","volume-title":"Genetic Algorithms in Search Optimization and Machine Learning","author":"D. Goldberg","year":"1989","unstructured":"Goldberg, D. (1989). Genetic Algorithms in Search Optimization and Machine Learning. Menlo Park, CA: Addison-Wesley."},{"key":"147017_CR12","unstructured":"Goldberg, M. and M. Burstein. (1983). \"Heuristic Improvement Technique for Bisection of VLSI Networks.\" Proc. Int. Conf. Computer Design: VLSI in Computers, pp. 122\u2013125."},{"key":"147017_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF01586932","volume":"51","author":"M. Gr\u00f6tschel","year":"1991","unstructured":"Gr\u00f6tschel, M. and O. Holland. (1991). \"Solution of Large-Scale Symmetric Traveling Salesman Problems,\" Mathematical Programming 51, 141\u2013202.","journal-title":"Mathematical Programming"},{"key":"147017_CR14","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. Holland","year":"1975","unstructured":"Holland, J. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor, MI: University of Michican Press."},{"issue":"6","key":"147017_CR15","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"Johnson, D.S., C.R. Aragon, L.A. McGeoch, and C. Schevon. (1989). \"Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning,\" Operations Research 37(6), 865\u2013892.","journal-title":"Operations Research"},{"issue":"3","key":"147017_CR16","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D.S. Johnson","year":"1991","unstructured":"Johnson, D.S., C.R. Aragon, L.A. McGeoch, and C. Schevon. (1991). \"Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning,\" Operations Research 39(3), 378\u2013406.","journal-title":"Operations Research"},{"key":"147017_CR17","unstructured":"Jones, C. (1992). \"Vertex and Edge Partitions of Graphs.\" Ph.D. Thesis, Department of Computer Science, Pennsylvania State University."},{"key":"147017_CR18","unstructured":"Karmarkar, N. and R.M. Karp. (1982). \"The Differencing Method of Set Partitioning.\" Report No. UCB\/CSD 82\/113, Computer Science Division, University of California, Berkeley."},{"key":"147017_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., C. Gelatt, and M. Vecchi. (1983). \"Optimization by Simulated Annealing,\" Science 220, 671\u2013680.","journal-title":"Science"},{"key":"147017_CR20","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/0377-2217(93)E0174-V","volume":"82","author":"M. Laguna","year":"1995","unstructured":"Laguna, M., J.P. Kelly, J.L. Gonzales-Velarde, and F. Glover. (1995). \"Tabu Search for the Multilevel Generalized Assignment Problem,\" European Journal of Operational Research 82, 176\u2013189.","journal-title":"European Journal of Operational Research"},{"key":"147017_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"Lengauer, T. (1990). Combinatorial Algorithms for Integrated Circuit Layout. New York, NY: JohnWiley & Sons."},{"key":"147017_CR22","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/0196-6774(88)90013-2","volume":"9","author":"H. Levy","year":"1988","unstructured":"Levy, H. (1988). \"A Contraction Algorithm for Finding Small Cycle Cutsets,\" Journal of Algorithms 9, 470\u2013493.","journal-title":"Journal of Algorithms"},{"key":"147017_CR23","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S. and B.W. Kernighan. (1973). \"An Effective Heuristic Algorithm for the Traveling Salesman Problem,\" Operations Research 21, 498\u2013516.","journal-title":"Operations Research"},{"key":"147017_CR24","volume-title":"Introduction to Algorithms: A Creative Approach","author":"U. Manber","year":"1989","unstructured":"Manber, U. (1989). Introduction to Algorithms: A Creative Approach.Menlo Park, CA: Addison-Wesley."},{"issue":"1","key":"147017_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M. Padberg","year":"1987","unstructured":"Padberg, M. and G. Rinaldi. (1987). \"Optimization of a 532-City Symmetric Traveling Salesman Problem by Branch and Cut,\" Operations Research Letters 6(1), 1\u20137.","journal-title":"Operations Research Letters"},{"key":"147017_CR26","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"M. Padberg","year":"1990","unstructured":"Padberg, M. and G. Rinaldi. (1990). \"Facet Identification for the Symmetric Traveling Salesman, Problem,\" Mathematical Programming 47, 219\u2013257.","journal-title":"Mathematical Programming"},{"key":"147017_CR27","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M. Padberg","year":"1991","unstructured":"Padberg, M. and G. Rinaldi. (1991). \"A Branch and Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problem,\" SIAM Review 33, 60\u2013100.","journal-title":"SIAM Review"},{"issue":"4","key":"147017_CR28","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G. (1991). TSPLIB-\"A Traveling Salesman Problem Library,\" ORSA Journal on Computing 3(4), 376\u2013384.","journal-title":"ORSA Journal on Computing"},{"issue":"7","key":"147017_CR29","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1109\/12.392848","volume":"44","author":"Y. Saab","year":"1995","unstructured":"Saab, Y. (1995). \"A Fast and Robust Network Bisection Algorithm,\" IEEE Transactions on Computers 44(7), 903\u2013913.","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"147017_CR30","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/43.75636","volume":"10","author":"Y. Saab","year":"1991","unstructured":"Saab, Y. and V. Rao. (1991). \"Combinatorial Optimization by Stochastic Evolution,\" IEEE Transactions on Computer-Aided Design 10(4), 525\u2013535.","journal-title":"IEEE Transactions on Computer-Aided Design"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009631125956.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009631125956\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009631125956.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:12:32Z","timestamp":1747653152000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009631125956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["147017"],"URL":"https:\/\/doi.org\/10.1023\/a:1009631125956","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}