{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:13:18Z","timestamp":1780765998035,"version":"3.54.1"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,10,30]],"date-time":"2009-10-30T00:00:00Z","timestamp":1256860800000},"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":[[2010,3]]},"DOI":"10.1007\/s10479-009-0656-7","type":"journal-article","created":{"date-parts":[[2009,10,29]],"date-time":"2009-10-29T07:58:16Z","timestamp":1256803096000},"page":"77-105","source":"Crossref","is-referenced-by-count":15,"title":["Ejection chain and filter-and-fan methods in\u00a0combinatorial optimization"],"prefix":"10.1007","volume":"175","author":[{"given":"C\u00e9sar","family":"Rego","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,10,30]]},"reference":[{"issue":"2","key":"656_CR1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","volume":"6","author":"E. H. L. Aarts","year":"1994","unstructured":"Aarts, E. H. L., Van Laarhoven, P. J. M., Lenstra, J. K., & Ulder, N. L. J. (1994). A computational study of local search algorithms for job shop scheduling. ORSA Journal on Computing, 6(2), 118\u2013125.","journal-title":"ORSA Journal on Computing"},{"issue":"3","key":"656_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. Management Science, 34(3), 391\u2013401.","journal-title":"Management Science"},{"key":"656_CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","volume":"91","author":"R. K. Ahuja","year":"2001","unstructured":"Ahuja, R. K., Orlin, J. B., & Sharma, D. (2001). Multi-exchange neighborhood search structures for the capacitated minimum spanning tree problem. Mathematical Programming, 91, 71\u201397.","journal-title":"Mathematical Programming"},{"key":"656_CR4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-6377(02)00236-5","volume":"31","author":"R. K. Ahuja","year":"2003","unstructured":"Ahuja, R. K., Orlin, J. B., & Sharma, D. (2003). A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Operations Research Letters, 31, 185\u2013194.","journal-title":"Operations Research Letters"},{"issue":"4","key":"656_CR5","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1287\/ijoc.1060.0201","volume":"19","author":"R. Ahuja","year":"2007","unstructured":"Ahuja, R., Jha, K., Orlin, J., & Sharma, D. (2007). Very large-scale neighborhood search for the quadratic assignment problem. INFORMS Journal on Computing, 19(4), 646\u2013657.","journal-title":"INFORMS Journal on Computing"},{"key":"656_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. Combinatorial Optimization: Theory and Practice, 1, 9\u201339.","journal-title":"Combinatorial Optimization: Theory and Practice"},{"key":"656_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 Journal on Computing, 15, 82\u201392.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"656_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. Management Science, 44(2), 262\u2013275.","journal-title":"Management Science"},{"issue":"7","key":"656_CR9","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. Management Science, 43(7), 908\u2013921.","journal-title":"Management Science"},{"key":"656_CR10","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. Journal of Operational Research Society, 50, 608\u2013616.","journal-title":"Journal of Operational Research Society"},{"key":"656_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. Boston: Kluwer Academic."},{"issue":"2","key":"656_CR12","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1063\/1.881371","volume":"46","author":"H. S. Chan","year":"1993","unstructured":"Chan, H. S., & Dill, K. A. (1993). The protein folding problem. Physics Today, 46(2), 24\u201332.","journal-title":"Physics Today"},{"key":"656_CR13","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 A. Mingozzi, P. Toth, & C. Sandi (Eds.), Combinatorial optimisation (pp. 315\u2013338). Chichester: Wiley."},{"key":"656_CR14","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. Theoretical Computer Science, 71, 419\u2013424.","journal-title":"Theoretical Computer Science"},{"key":"656_CR15","doi-asserted-by":"crossref","unstructured":"Cirasella, J., Johnson, D. S., McGeoch, L. A., & 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.\u00a032\u201359).","DOI":"10.1007\/3-540-44808-X_3"},{"key":"656_CR16","first-page":"119","volume-title":"Discrete location theory","author":"G. Cornu\u00e9jols","year":"1990","unstructured":"Cornu\u00e9jols, G., Nemhauser, G. H., & Wolsey, L. (1990). The uncapacitated facility location problem. In P.\u00a0Mirchandani & R. Francis (Eds.), Discrete location theory (pp. 119\u2013171). New York: Wiley."},{"issue":"6","key":"656_CR17","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1021\/bi00327a032","volume":"24","author":"K. A. Dill","year":"1985","unstructured":"Dill, K. A. (1985). Theory for the folding and stability of globular proteins. Biochemistry, 24(6), 1501\u20131509.","journal-title":"Biochemistry"},{"key":"656_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 Journal on Computing, 6, 141\u2013153.","journal-title":"ORSA Journal on Computing"},{"issue":"4","key":"656_CR19","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","volume":"42","author":"M. L. Fisher","year":"1994","unstructured":"Fisher, M. L. (1994). Optimal solution of vehicle routing problems using minimum k-trees. Operations Research, 42(4), 626\u2013642.","journal-title":"Operations Research"},{"key":"656_CR20","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1006\/jagm.1995.1018","volume":"18","author":"M. L. Fredman","year":"1995","unstructured":"Fredman, M. L., Johnson, D. S., McGeoch, L. A., & Ostheimer, G. (1995). Data structures for traveling salesman. Journal of Algorithms, 18, 432\u2013479.","journal-title":"Journal of Algorithms"},{"key":"656_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. Journal of Heuristics, 11, 135\u2013146.","journal-title":"Journal of Heuristics"},{"key":"656_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. European Journal of Operational Research, 160, 154\u2013171.","journal-title":"European Journal of Operational Research"},{"key":"656_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. Computers and Operations Research, 33, 1161\u20131179.","journal-title":"Computers and Operations Research"},{"key":"656_CR24","unstructured":"Gamboa, D., Osterman, C., Rego, C., & Glover, F. (2006b). An experimental evaluation of ejection chain algorithms for the traveling salesman problem. School of Business Administration, University of Mississippi, MS."},{"key":"656_CR25","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/0377-2217(94)90277-1","volume":"76","author":"L. L. Gao","year":"1994","unstructured":"Gao, L. L., & Robinson, E. P. (1994). Uncapacitated facility location: general solution procedures and computational experience. European Journal of Operational Research, 76, 410\u2013427.","journal-title":"European Journal of Operational Research"},{"key":"656_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":"656_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. Annals of Operations Research, 33, 17\u201371.","journal-title":"Annals of Operations Research"},{"key":"656_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, CO."},{"key":"656_CR29","doi-asserted-by":"crossref","unstructured":"Glover, F. (1992). New ejection chain and alternating path methods for traveling salesman problems. In Computer science and operations research (pp.\u00a0449\u2013509).","DOI":"10.1016\/B978-0-08-040806-4.50037-X"},{"key":"656_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 Applied Mathematics, 65, 223\u2013253.","journal-title":"Discrete Applied Mathematics"},{"key":"656_CR31","series-title":"Lecture notes in computer science","first-page":"3","volume-title":"Artificial evolution","author":"F. Glover","year":"1998","unstructured":"Glover, F. (1998). A template for scatter search and path relinking. In J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, & D. Snyers (Eds.), Lecture notes in computer science : Vol.\u00a01363. Artificial evolution (pp.\u00a03\u201351). Heidelberg: Springer."},{"key":"656_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. Boston: Kluwer Academic."},{"issue":"4","key":"656_CR33","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10288-006-0029-x","volume":"4","author":"F. Glover","year":"2006","unstructured":"Glover, F., & Rego, C. (2006). Ejection chain and filter-and-fan methods in combinatorial optimization. 4OR: A Quarterly Journal of Operations Research, 4(4), 263\u2013296.","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"key":"656_CR34","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","volume":"167","author":"J. F. Gon\u00e7alves","year":"2005","unstructured":"Gon\u00e7alves, J. F., Mendes, J. J. M., & Resende, M. G. C. (2005). A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research, 167, 77\u201395.","journal-title":"European Journal of Operational Research"},{"key":"656_CR35","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 C. Rego & B. Alidaee (Eds.), Metaheuristic optimization via memory and evolution: tabu search and scatter search (pp. 191\u2013211). Boston: Kluwer Academic."},{"issue":"9","key":"656_CR36","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. Computers and Operations Research, 33(9), 2590\u20132601.","journal-title":"Computers and Operations Research"},{"key":"656_CR37","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. European Journal of Operational Research, 126, 106\u2013130.","journal-title":"European Journal of Operational Research"},{"key":"656_CR38","first-page":"215","volume-title":"Local search in combinatorial optimization","author":"D. S. Johnson","year":"1997","unstructured":"Johnson, D. S., & McGeoch, L. A. ((1997). The traveling salesman problem: a case study in local optimization. In E.H.L. Aarts & J.K. Lenstra (Eds.), Local search in combinatorial optimization (pp. 215\u2013310). Wiley: New York."},{"key":"656_CR39","unstructured":"Johnson, D. S., McGeoch, L. A., Glover, F., & Rego, C. (2000). 8th DIMACS implementation challenge: the traveling salesman problem. http:\/\/www.research.att.com\/~dsj\/chtsp\/ ."},{"key":"656_CR40","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.28.5.1086","volume":"28","author":"P. C. Kanellakis","year":"1980","unstructured":"Kanellakis, P. C., & Papadimitriou, C. H. (1980). Local search for the asymmetric traveling salesman problem. Operations Research, 28, 1086\u20131099.","journal-title":"Operations Research"},{"key":"656_CR41","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 (pp.\u00a0177\u2013192), Natanya, Israel.","DOI":"10.1109\/ISTCS.1993.253471"},{"key":"656_CR42","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.\u00a0188\u2013195)."},{"key":"656_CR43","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. Operations Research, 21, 498\u2013516.","journal-title":"Operations Research"},{"key":"656_CR44","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) (pp.\u00a031021\u201331026)."},{"issue":"6","key":"656_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. Management Science, 42(6), 797\u2013813.","journal-title":"Management Science"},{"key":"656_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":"656_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. Journal of Heuristics, 5, 159\u2013180.","journal-title":"Journal of Heuristics"},{"key":"656_CR48","series-title":"Series in operations research and financial engineering","volume-title":"Planning and scheduling in manufacturing and services","author":"M. L. Pinedo","year":"2006","unstructured":"Pinedo, M. L. (2006). Series in operations research and financial engineering. Planning and scheduling in manufacturing and services. Berlin: Springer."},{"key":"656_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. European Journal of Operational Research, 106, 522\u2013538.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"656_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. Management Science, 44(10), 1447\u20131459.","journal-title":"Management Science"},{"key":"656_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 Computing, 27, 201\u2013222.","journal-title":"Parallel Computing"},{"issue":"3","key":"656_CR52","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.ejor.2007.12.035","volume":"194","author":"C. Rego","year":"2009","unstructured":"Rego, C., & Duarte, R. (2009). A filter fan approach to the job shop scheduling problem. European Journal of Operational Research, 194(3), 650\u2013662.","journal-title":"European Journal of Operational Research"},{"key":"656_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 G.\u00a0Gutin & A. Punnen (Eds.), The traveling salesman problem and its variations (pp. 309\u2013368). Boston: Kluwer Academic."},{"key":"656_CR54","unstructured":"Rego, C., & Mathew, F. (2009). A filter-and-fan algorithm for the capacitated minimum spanning tree. School of Business Administration, University of Mississippi, MS."},{"key":"656_CR55","unstructured":"Rego, C., Glover, F., & Gamboa, D. (2006). A doubly-rooted stem-and-cycle ejection chain algorithm for asymmetric traveling salesman problems. School of Business Administration, University of Mississippi, MS."},{"key":"656_CR56","doi-asserted-by":"crossref","unstructured":"Rego, C., Li, H., & Glover, F. (2009a, to appear). A\u00a0filter-and-fan approach to the 2D lattice model of the protein folding problem. Annals of Operation Research.","DOI":"10.1007\/s10479-009-0666-5"},{"key":"656_CR57","doi-asserted-by":"crossref","unstructured":"Rego, C., James, T., & Glover, F. (2009b, to appear). An ejection chain algorithm for the quadratic assignment problem. Networks.","DOI":"10.1002\/net.20360"},{"issue":"1","key":"656_CR58","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1038\/scientificamerican0191-54","volume":"264","author":"F. M. Richards","year":"1991","unstructured":"Richards, F. M. (1991). The protein folding problem. Scientific American, 264(1), 54\u201360.","journal-title":"Scientific American"},{"key":"656_CR59","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. Journal of Heuristics, 1, 147\u2013167.","journal-title":"Journal of Heuristics"},{"key":"656_CR60","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. European Journal of Operational Research, 118, 390\u2013412.","journal-title":"European Journal of Operational Research"},{"key":"656_CR61","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":"Y. M. Sharaiha","year":"1997","unstructured":"Sharaiha, Y. M., Gendreau, M., Laporte, G., & Osman, I. H. (1997). A tabu search algorithm for the capacitated shortest spanning tree problem. Networks, 29, 161\u2013171.","journal-title":"Networks"},{"key":"656_CR62","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"},{"issue":"2","key":"656_CR63","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). An ejection chain approach for the generalized assignment problem. INFORMS Journal on Computing, 16(2), 133\u2013151.","journal-title":"INFORMS Journal on Computing"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0656-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-009-0656-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0656-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:58Z","timestamp":1559153278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-009-0656-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,30]]},"references-count":63,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["656"],"URL":"https:\/\/doi.org\/10.1007\/s10479-009-0656-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,30]]}}}