{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T12:49:51Z","timestamp":1744202991503},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,11,16]],"date-time":"2006-11-16T00:00:00Z","timestamp":1163635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2006,11,29]]},"DOI":"10.1007\/s10288-006-0029-x","type":"journal-article","created":{"date-parts":[[2006,11,15]],"date-time":"2006-11-15T07:11:51Z","timestamp":1163574711000},"page":"263-296","source":"Crossref","is-referenced-by-count":27,"title":["Ejection chain and filter-and-fan methods in combinatorial optimization"],"prefix":"10.1007","volume":"4","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9sar","family":"Rego","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,16]]},"reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","volume":"6","author":"EHL Aarts","year":"1994","unstructured":"Aarts EHL, Van Laarhoven PJM, Lenstra JK, Ulder NLJ (1994) A computational study of local search algorithms for job shop scheduling. ORSA J Comput 6(2):118\u2013125","journal-title":"ORSA J Comput"},{"issue":"(3","key":"29_CR2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manage Sci 34 (3):391\u2013401","journal-title":"Manage Sci"},{"key":"29_CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","volume":"91","author":"RK Ahuja","year":"2001","unstructured":"Ahuja RK, Orlin JB, Sharma D (2001) Multi-exchange neighborhood search structures for the capacitated minimum spanning tree problem. Math Program 91:71\u201397","journal-title":"Math Program"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Ahuja RK, Orlin JB, Sharma D (2002) Very large-scale neighborhood search for the quadratic assignment problem. submitted to INFORMS J Comput","DOI":"10.2139\/ssrn.337600"},{"key":"29_CR5","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-6377(02)00236-5","volume":"31","author":"RK Ahuja","year":"2003","unstructured":"Ahuja RK, Orlin JB, Sharma D (2003) A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Operat Res Lett 31:185\u2013194","journal-title":"Operat Res Lett"},{"key":"29_CR6","first-page":"9","volume":"1","author":"A Amberg","year":"1996","unstructured":"Amberg A, Domschke W, Vo\u00df S (1996) Capacitated minimum spanning trees: algorithms using intelligent search. Comb Opt Theory Practice 1:9\u201339","journal-title":"Comb Opt Theory Practice"},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D Applegate","year":"2003","unstructured":"Applegate D, Cook W, Rohe A (2003) Chained Lin-Kernighan for large traveling salesman problems. INFORMS J Comput 15:82\u201392","journal-title":"INFORMS J Comput"},{"issue":"2","key":"29_CR8","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E Balas","year":"1998","unstructured":"Balas E, Vazacopoulos A (1998) Guided local search with shifting bottleneck for job shop scheduling. Manage Sci 44(2):262\u2013275","journal-title":"Manage Sci"},{"key":"29_CR9","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1057\/palgrave.jors.2600728","volume":"50","author":"L Cavique","year":"1999","unstructured":"Cavique L, Rego C, Themido I (1999) Subgraph ejection chains and tabu search for the crew scheduling problem. J Operat Res Soci 50:608\u2013616","journal-title":"J Operat Res Soci"},{"issue":"7","key":"29_CR10","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1287\/mnsc.43.7.908","volume":"43","author":"B Cao","year":"1997","unstructured":"Cao B, Glover F (1997) Tabu search and ejection chains: application to a node weighted version of the cardinality-constrained TSP. Manage Sci 43(7):908\u2013921","journal-title":"Manage Sci"},{"key":"29_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The quadratic assignment problem: theory and algorithms","author":"E Cela","year":"1998","unstructured":"Cela E (1998) The quadratic assignment problem: theory and algorithms. Kluwer, Boston"},{"issue":"2","key":"29_CR12","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1063\/1.881371","volume":"46","author":"HS Chan","year":"1993","unstructured":"Chan HS, Dill KA (1993) The protein folding problem. Phys Today 46(2):24\u201332","journal-title":"Phys Today"},{"key":"29_CR13","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/0304-3975(90)90053-K","volume":"71","author":"M Chrobak","year":"1990","unstructured":"Chrobak M, Szymacha T, Krawczyk A (1990) A data structure useful for finding hamiltonian cycles. Theoret Comput Sci 71:419\u2013424","journal-title":"Theoret Comput Sci"},{"key":"29_CR14","first-page":"315","volume-title":"Combinatorial optimisation","author":"N Christofides","year":"1979","unstructured":"Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimisation. Wiley, Chichester, pp 315\u2013338"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Cirasella J, Johnson DS, McGeoch LA, Zhang W (2001) The asymmetric traveling salesman problem: algorithms, instance generators and tests. In: Proceedings of the algorithm engineering and experimentation, third international workshop, ALENEX 2001, pp 32\u201359","DOI":"10.1007\/3-540-44808-X_3"},{"key":"29_CR16","first-page":"119","volume-title":"Discrete location theory","author":"G Cornu\u00e9jols","year":"1990","unstructured":"Cornu\u00e9jols G, Nemhauser GH, Wolsey L (1990) \u201cThe uncapacitated facility location problem. In: Mirchandani P, Francis R (eds) Discrete location theory. J Wiley, New York, pp 119\u2013171"},{"issue":"6","key":"29_CR17","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1021\/bi00327a032","volume":"24","author":"KA Dill","year":"1985","unstructured":"Dill KA (1985) \u201cTheory for the folding and stability of globular proteins,\u201d. Biochemistry 24(6): 1501-1509","journal-title":"Biochemistry"},{"key":"29_CR18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/ijoc.6.2.141","volume":"6","author":"U Dorndorf","year":"1994","unstructured":"Dorndorf U, Pesch E (1994) Fast clustering algorithms. ORSA J Comput 6:141\u2013153","journal-title":"ORSA J Comput"},{"issue":"4","key":"29_CR19","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","volume":"42","author":"ML Fisher","year":"1994","unstructured":"Fisher ML (1994) Optimal solution of vehicle routing problems using minimum k-trees. Operat Res 42(4):626\u2013642","journal-title":"Operat Res"},{"key":"29_CR20","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1006\/jagm.1995.1018","volume":"18","author":"ML Fredman","year":"1995","unstructured":"Fredman ML, Johnson DS, McGeoch LA, Ostheimer G (1995) Data structures for traveling salesmen. J Algorithms 18:432\u2013479","journal-title":"J Algorithms"},{"key":"29_CR21","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10732-005-0713-6","volume":"11","author":"B Funke","year":"2005","unstructured":"Funke B, Gr\u00fcnert T, Irnich S (2005) A note on single alternating cycle neighborhoods for the TSP. J Heuristics, 11:135\u2013146","journal-title":"J Heuristics,"},{"key":"29_CR22","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.ejor.2004.04.023","volume":"160","author":"D Gamboa","year":"2005","unstructured":"Gamboa D, Rego C, Glover F (2005) Data structures and ejection chains for solving large-scale traveling salesman problems. Eur J Operat Res 160:154\u2013171","journal-title":"Eur J Operat Res"},{"key":"29_CR23","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1016\/j.cor.2005.06.014","volume":"33","author":"D Gamboa","year":"2006","unstructured":"Gamboa D, Rego C, Glover F (2006a) Implementation analysis of efficient heuristic algorithms for the traveling salesman problem. Comput Operat Res 33:1161\u20131179","journal-title":"Comput Operat Res"},{"key":"29_CR24","unstructured":"Gamboa D, Rego C, Glover F, Osterman C (2006b) An experimental evaluation of ejection chain algorithms for the traveling salesman problem. School of Business Administration, University of Mississippi, MS"},{"key":"29_CR25","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/0377-2217(94)90277-1","volume":"76","author":"LL Gao","year":"1994","unstructured":"Gao LL, Robinson EP (1994) Uncapacitated facility location: general solution procedures and computational experience. Eur J Operat Res 76:410\u2013427","journal-title":"Eur J Operat Res"},{"key":"29_CR26","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","volume":"12","author":"B Gavish","year":"1982","unstructured":"Gavish B (1982) Topological design of centralized computer networks: formulations and algorithms. Networks 12:355\u2013377","journal-title":"Networks"},{"key":"29_CR27","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02061657","volume":"33","author":"B Gavish","year":"1991","unstructured":"Gavish B (1991) Topological design telecommunications networks\u2014local access design methods. Ann Operat Res 33:17\u201371","journal-title":"Ann Operat Res"},{"key":"29_CR28","unstructured":"Glover F (1991) Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem. Leeds School of Business, University of Colorado, Boulder"},{"key":"29_CR29","doi-asserted-by":"crossref","unstructured":"Glover F (1992) New ejection chain and alternating path methods for traveling salesman problems. Comput Sci Operat Res 449\u2013509","DOI":"10.1016\/B978-0-08-040806-4.50037-X"},{"key":"29_CR30","doi-asserted-by":"crossref","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 Appli Math 65:223\u2013253","journal-title":"Discrete Appli Math"},{"key":"29_CR31","first-page":"3","volume-title":"Artificial evolution. Lecture notes in computer science, vol. 1363","author":"F Glover","year":"1998","unstructured":"Glover F (1998) A template for scatter search and path relinking. In: Hao J-K, Lutton E, Ronald E, Schoenauer M, Snyers D (eds) Artificial evolution. Lecture notes in computer science, vol. 1363. Springer, Berlin Heidelberg New York, pp 3\u201351"},{"key":"29_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu Search. Kluwer, Boston"},{"key":"29_CR33","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","volume":"167","author":"JF Gon\u00e7alves","year":"2005","unstructured":"Gon\u00e7alves JF, Mendes JJM, Resende MGC (2005) A hybrid genetic algorithm for the job shop scheduling problem. Eur J Operat Res 167:77\u201395","journal-title":"Eur J Operat Res"},{"key":"29_CR34","first-page":"191","volume-title":"Metaheuristic optimization via memory and evolution: tabu search and scatter search","author":"J Grabowski","year":"2005","unstructured":"Grabowski J, Wodecki M (2005) A very fast tabu search algorithm for job shop problem. In: Rego C, Alidaee B (eds) Metaheuristic optimization via memory and evolution: tabu search and scatter search. Kluwer, Boston, pp 191\u2013211"},{"issue":"9","key":"29_CR35","doi-asserted-by":"crossref","first-page":"2590","DOI":"10.1016\/j.cor.2005.07.006","volume":"33","author":"P Greistorfer","year":"2006","unstructured":"Greistorfer P, Rego C (2006) A simple filter-and-fan approach to the facility location problem. Comput Operat Res 33(9):2590\u20132601","journal-title":"Comput Operat Res"},{"key":"29_CR36","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun K (2000) An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur J Operat Res 126:106\u2013130","journal-title":"Eur J Operat Res"},{"key":"29_CR37","unstructured":"Johnson DS, McGeoch LA (1997) The traveling salesman problem: a case study in local optimization. In: Local search in combinatorial optimization: Aarts EHL, Lenstra JK (eds) J Wiley, 215\u2013310"},{"key":"29_CR38","unstructured":"Johnson DS, McGeoch LA, Glover F, Rego C (2000) 8th DIMACS implementation challenge: the traveling salesman problem. http:\/\/www.research. att.com\/~dsj\/chtsp\/"},{"key":"29_CR39","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.28.5.1086","volume":"28","author":"PC Kanellakis","year":"1980","unstructured":"Kanellakis PC, Papadimitriou CH (1980) Local search for the asymmetric traveling salesman problem. Operat Res 28:1086\u20131099","journal-title":"Operat Res"},{"key":"29_CR40","doi-asserted-by":"crossref","unstructured":"Lengauer T (1993) Algorithmic research problems in molecular bioinformatics. In: Proceedings of the second israel symposium on theory of computing systems, ISTCS 1993, Natanya, Israel, 177\u2013192","DOI":"10.1109\/ISTCS.1993.253471"},{"key":"29_CR41","unstructured":"Lesh N, Mitzenmacher M, Whitesides S (2003) A complete and effective move set for simple protein folding. In: Proceedings of the 7th annual international conference on research in computational molecular biology (RECOMB), ACM Press, New York, pp 188\u2013195"},{"key":"29_CR42","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan B (1973) An effective heuristic algorithm for the traveling salesman problem. Operat Res 21:498\u2013516","journal-title":"Operat Res"},{"key":"29_CR43","unstructured":"Mathew F, Rego C (2006) Recent advances in heuristic algorithms for the capacitated minimum spanning tree problem. In: Proceedings of the 37th annual meeting of decision sciences institute (DSI). 31021\u201331026"},{"key":"29_CR44","unstructured":"Mathew F, Rego C, Glover F (2006) A filter-and-fan algorithm for the capacitated minimum spanning tree. School of Business Administration, University of Mississippi, MS"},{"issue":"6","key":"29_CR45","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowichi","year":"1996","unstructured":"Nowichi E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manage Sci 42(6):797\u2013813","journal-title":"Manage Sci"},{"key":"29_CR46","unstructured":"Osterman C, Rego C (2003) The satellite list and new data structures for symmetric traveling salesman problems. School of Business Administration, University of Mississippi, MS"},{"key":"29_CR47","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1009629727566","volume":"5","author":"R Patterson","year":"1999","unstructured":"Patterson R, Pirkul H, Rolland E (1999) Memory adaptive reasoning for solving the capacitated minimum spanning tree problem. J Heuristics 5:159\u2013180","journal-title":"J Heuristics"},{"key":"29_CR48","volume-title":"Planning and scheduling in manufacturing and services. Series in operations research and financial engineering","author":"ML Pinedo","year":"2006","unstructured":"Pinedo ML (2006) Planning and scheduling in manufacturing and services. Series in operations research and financial engineering. Springer, Berlin Heidelberg New York"},{"key":"29_CR49","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/S0377-2217(97)00288-9","volume":"106","author":"C Rego","year":"1998","unstructured":"Rego C (1998a) Relaxed tours and path ejections for the traveling salesman problem. Eur J Operat Res 106:522\u2013538","journal-title":"Eur J Operat Res"},{"issue":"10","key":"29_CR50","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1287\/mnsc.44.10.1447","volume":"44","author":"C Rego","year":"1998","unstructured":"Rego C (1998b) A subpath ejection method for the vehicle routing problem. Manage Sci 44(10):1447\u20131459","journal-title":"Manage Sci"},{"key":"29_CR51","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0167-8191(00)00102-2","volume":"27","author":"C Rego","year":"2001","unstructured":"Rego C (2001) Node ejection chains for the vehicle routing problem: sequential and parallel algorithms. Parallel Comput 27:201\u2013222","journal-title":"Parallel Comput"},{"key":"29_CR52","unstructured":"Rego C, Duarte R (2006) A filter and fan approach for the job shop scheduling problem. School of Business Administration, University of Mississippi, MS"},{"key":"29_CR53","first-page":"309","volume-title":"The traveling salesman problem and its variations","author":"C Rego","year":"2002","unstructured":"Rego C, Glover F (2002) Local search and metaheuristics for the traveling salesman problem. In: Gutin G, Punnen A (eds) The traveling salesman problem and its variations. Kluwer, Boston, pp 309\u2013368"},{"key":"29_CR54","unstructured":"Rego C, Glover F, Gamboa D, Osterman C (2006a) A doubly-rooted stem-and-cycle ejection chain algorithm for asymmetric traveling salesman problems. School of Business Administration, University of Mississippi, MS"},{"key":"29_CR55","unstructured":"Rego C, Li H, Glover F (2006b) A filter-and-fan approach to the 2D HP model of the protein folding problem. School of Business Administration, University of Mississippi, MS"},{"key":"29_CR56","unstructured":"Rego C, James T, Glover F (2006c) \u201cAn ejection chain algorithm for the quadratic assignment problem,\u201d School of Business Ad on, University of Mississippi, MS"},{"key":"29_CR57","doi-asserted-by":"crossref","unstructured":"Richards FM (1991) The protein folding problem. Sci Am 264(1):54\u20137, 60\u20133","DOI":"10.1038\/scientificamerican0191-54"},{"key":"29_CR58","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat Y, Taillard E (1995) Probabilistic intensification and diversification in local search for vehicle routing. J Heuristics. 1:147\u2013167","journal-title":"J Heuristics."},{"key":"29_CR59","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00319-1","volume":"118","author":"I Sabuncuoglu","year":"1999","unstructured":"Sabuncuoglu I, Bayiz M (1999) Job shop scheduling with beam search. Eur J Operat Res 118: 390\u2013412","journal-title":"Eur J Operat Res"},{"key":"29_CR60","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<161::AID-NET4>3.0.CO;2-F","volume":"29","author":"YM Sharaiha","year":"1997","unstructured":"Sharaiha YM, Gendreau M, Laporte G, Osman IH (1997) A tabu search algorithm for the capacitated shortest spanning tree problem. Networks 29:161\u2013171","journal-title":"Networks"},{"key":"29_CR61","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Parallel iterative search methods for vehicle routing problems. Networks 23: 661\u2013673","journal-title":"Networks"},{"key":"29_CR62","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/ijoc.1030.0036","volume":"16","author":"M Yagiura","year":"2004","unstructured":"Yagiura M, Ibaraki T, Glover F (2004) \u201cAn ejection chain approach for the generalized assignment problem\u201d. INFORMS J Comput, 16:133\u2013151","journal-title":"INFORMS J Comput,"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0029-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-006-0029-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0029-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:54Z","timestamp":1559131974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-006-0029-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,16]]},"references-count":62,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,11,29]]}},"alternative-id":["29"],"URL":"https:\/\/doi.org\/10.1007\/s10288-006-0029-x","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,16]]}}}