{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:16Z","timestamp":1751282836210},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"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,4]]},"DOI":"10.1007\/bf02125455","type":"journal-article","created":{"date-parts":[[2005,9,15]],"date-time":"2005-09-15T10:32:03Z","timestamp":1126780323000},"page":"209-232","source":"Crossref","is-referenced-by-count":49,"title":["Tabu search for graph partitioning"],"prefix":"10.1007","volume":"63","author":[{"given":"Erik","family":"Rolland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hasan","family":"Pirkul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02125455_CR1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1080\/07408179308964284","volume":"25","author":"J.W. Barnes","year":"1993","unstructured":"J.W. Barnes and M. Laguna, Solving the multiple-machine weighted flow time problem using tabu search, IIE Trans. 25(1993)121\u2013127.","journal-title":"IIE Trans."},{"key":"BF02125455_CR2","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02022999","volume":"41","author":"J. Chakrapani","year":"1993","unstructured":"J. Chakrapani and J. Skorin-Kapov, Massively parallel tabu search for the quadratic assignment problem, Ann. Oper. Res. 41(1993)327\u2013341.","journal-title":"Ann. Oper. Res."},{"key":"BF02125455_CR3","unstructured":"W. Dai and E. Kuh, Simultaneous floor planning and global routing for hierarchical building block layout, IEEE Trans. Comp. Aided Design ICs Syst. (1987)."},{"key":"BF02125455_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01720782","volume":"11","author":"D. Werra de","year":"1989","unstructured":"D. de Werra and A. Hertz, Tabu search techniques: A tutorial and an application to neural networks, OR Spektrum 11(1989)131\u2013141.","journal-title":"OR Spektrum"},{"key":"BF02125455_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230200205","volume":"20","author":"T.A. Feo","year":"1990","unstructured":"T.A. Feo and M. Khellaf, A class of bounded approximation algorithms for graph partitioning, Networks 20(1990)181\u2013195.","journal-title":"Networks"},{"key":"BF02125455_CR6","unstructured":"C.M. Fiduccia and R.M. Mettheyses, A linear time heuristic for improving network partitions,Proc. 19th Design Automation Conf., ACM\/IEEE (1982) pp. 175\u2013181."},{"key":"BF02125455_CR7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02243141","volume":"42","author":"C. Friden","year":"1989","unstructured":"C. Friden, A. Hertz and D. de Werra, Stabulus: A technique for finding stable sets in large graphs with tabu search, Computing 42(1989)35\u201344.","journal-title":"Computing"},{"key":"BF02125455_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey, D.S. Johnson and L. Stockmeyer, Some simplified NP-complete graph probems, Theor. Comput. Sci. 1(1976)237\u2013267.","journal-title":"Theor. Comput. Sci."},{"key":"BF02125455_CR9","doi-asserted-by":"crossref","unstructured":"M. Gendreau, A. Hertz and G. Laporte, A tabu search heuristic for the vehicle routing problem, Manag. Sci., to appear.","DOI":"10.1287\/mnsc.40.10.1276"},{"key":"BF02125455_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0377-2217(89)90185-9","volume":"39","author":"F. Glover","year":"1989","unstructured":"F. Glover and H.J. Greenberg, New approaches for heuristic search: A bilateral linkage with artificial intelligence, Euro. J. Oper. Res. 39(1989)119\u2013130.","journal-title":"Euro. J. Oper. Res."},{"key":"BF02125455_CR11","doi-asserted-by":"crossref","unstructured":"F. Glover, Tabu search \u2014 Part II, ORSA J. Comp. 2 (1990).","DOI":"10.1287\/ijoc.2.1.4"},{"key":"BF02125455_CR12","unstructured":"F. Glover and M. Laguna, Tabu search, in:Modern Heuristic Techniques for Combinatorial Problems, ed. C. Reeves (Blackwell, 1993)."},{"key":"BF02125455_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","volume":"41","author":"F. Glover","year":"1993","unstructured":"F. Glover, E. Taillard and D. de Werra, A user's guide to tabu search, Ann. Oper. Res. 41(1993)3\u201328.","journal-title":"Ann. Oper. Res."},{"key":"BF02125455_CR14","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF02023611","volume":"5","author":"F. Glover","year":"1985","unstructured":"F. Glover, C. McMillan and B. Novick, Interactive decision software and computer graphics for architectural and space planning, Ann. Oper. Res. 5(1985)557\u2013573.","journal-title":"Ann. Oper. Res."},{"key":"BF02125455_CR15","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"29","author":"A. Hertz","year":"1987","unstructured":"A. Hertz and D. de Werra, Using tabu search techniques for graph coloring, Computing 29(1987)345\u2013351.","journal-title":"Computing"},{"key":"BF02125455_CR16","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation. Part I: Graph partitioning, Oper. Res. 37 (1989).","DOI":"10.1287\/opre.37.6.865"},{"key":"BF02125455_CR17","doi-asserted-by":"crossref","unstructured":"B.W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Syst. Tech. J. 49(1970).","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"BF02125455_CR18","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 and M.P. Vecchi, Optimization by simulated annealing. Science 220(1983)671\u2013680.","journal-title":"Science"},{"key":"BF02125455_CR19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02060483","volume":"40","author":"J.G. Klincewicz","year":"1992","unstructured":"J.G. Klincewicz, Avoiding local optima in thep-hub location problem using tabu search and grasp, Ann. Oper. Res. 40(1992)121\u2013132.","journal-title":"Ann. Oper. Res."},{"key":"BF02125455_CR20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01471219","volume":"2","author":"M. Laguna","year":"1991","unstructured":"M. Laguna, J.W. Barnes and F. Glover, Tabu search methods for a single machine scheduling systems, J. Int. Manufact. 2(1991)63\u201374.","journal-title":"J. Int. Manufact."},{"key":"BF02125455_CR21","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0957-4174(93)90056-C","volume":"6","author":"M. Laguna","year":"1993","unstructured":"M. Laguna and F. Glover, Integrating target analysis and tabu search for improved scheduling systems, Expert Syst. Appl. 6(1993)287\u2013297.","journal-title":"Expert Syst. Appl."},{"key":"BF02125455_CR22","series-title":"Technical Report","volume-title":"A fast tabu search algorithm for the job shop problem","author":"E. Nowicki","year":"1993","unstructured":"E. Nowicki and C. Smutnicki, A fast tabu search algorithm for the job shop problem, Technical Report, Technical University of Wroclaw, Poland (1993)."},{"key":"BF02125455_CR23","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I.H. Osman","year":"1993","unstructured":"I.H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Ann. Oper. Res. 41(1993)421\u2013451.","journal-title":"Ann. Oper. Res."},{"key":"BF02125455_CR24","volume-title":"Abstract heuristic search methods for graph partitioning","author":"E. Rolland","year":"1991","unstructured":"E. Rolland, Abstract heuristic search methods for graph partitioning, Ph.D. Dissertation, The Ohio State University, Colombus, OH (1991)."},{"key":"BF02125455_CR25","unstructured":"D. Skorin-Kapov and J. Skorin-Kapov, On tabu search for the location of interacting hub facilities, Harriman School for Management and Policy, SUNY at Stony Brook (1992)."},{"key":"BF02125455_CR26","doi-asserted-by":"crossref","unstructured":"J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA J. Comp. 2 (1990).","DOI":"10.1287\/ijoc.2.1.33"},{"key":"BF02125455_CR27","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E. Taillard","year":"1991","unstructured":"E. Taillard, Robust tabu search for the quadratic assignment problem, Parallel Comp. 17(1991)443\u2013455.","journal-title":"Parallel Comp."},{"key":"BF02125455_CR28","unstructured":"S. Voss, An enhanced tabu search method for the quadratic assignment problem, Technical Report, Technische Hochschule Darmstadt (1993), to appear in Discr. Appl. Math."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02125455.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02125455\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02125455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T14:00:20Z","timestamp":1586440820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02125455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["BF02125455"],"URL":"https:\/\/doi.org\/10.1007\/bf02125455","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}