{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T14:26:49Z","timestamp":1779892009929,"version":"3.53.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,8,7]],"date-time":"2009-08-07T00:00:00Z","timestamp":1249603200000},"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":[[2011,3]]},"DOI":"10.1007\/s10479-009-0597-1","type":"journal-article","created":{"date-parts":[[2009,8,6]],"date-time":"2009-08-06T10:12:28Z","timestamp":1249553548000},"page":"163-173","source":"Crossref","is-referenced-by-count":78,"title":["The case for strategic oscillation"],"prefix":"10.1007","volume":"183","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,8,7]]},"reference":[{"key":"597_CR1","first-page":"243","volume-title":"Modern heuristic techniques for combinatorial problems","author":"J. Beasley","year":"1993","unstructured":"Beasley, J. (1993). Lagrangian relaxation. In Modern heuristic techniques for combinatorial problems (pp.\u00a0243\u2013303). New York: Wiley."},{"issue":"5","key":"597_CR2","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10732-007-9021-7","volume":"13","author":"J. Eckstein","year":"2007","unstructured":"Eckstein, J., & Nediak, M. (2007). Pivot, cut and dive: a heuristic for mixed 0-1 integer programming. Journal of Heuristics, 13(5), 471\u2013503.","journal-title":"Journal of Heuristics"},{"key":"597_CR3","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/0377-2217(86)90042-1","volume":"24","author":"A. Freville","year":"1986","unstructured":"Freville, A., & Plateau, G. (1986). Heuristics and reduction methods for multiple constraint 0-1 linear programming problems. European Journal of Operational Research, 24, 206\u2013215.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"597_CR4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/B:JMMA.0000026709.24659.da","volume":"3","author":"P. Galinier","year":"2004","unstructured":"Galinier, P., & Hao, J.-K. (2004). A general approach for constraint solving by local search. Journal of Mathematical Modelling and Algorithms, 3(1), 73\u201388.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"1","key":"597_CR5","doi-asserted-by":"crossref","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(1), 156\u2013166.","journal-title":"Decision Sciences"},{"issue":"3","key":"597_CR6","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.7.4.426","volume":"7","author":"F. Glover","year":"1995","unstructured":"Glover, F. (1995). Tabu thresholding: improved search by nonmonotonic trajectories. ORSA Journal on Computing, 7(3), 426\u2013442.","journal-title":"ORSA Journal on Computing"},{"key":"597_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4615-4567-5_1","volume-title":"Computing tools for modeling, optimization and simulation: interfaces in computer science and operations research","author":"F. Glover","year":"2000","unstructured":"Glover, F. (2000). Multi-start and strategic oscillation methods\u2014principles to exploit adaptive memory. In M. Laguna & J.L. Gonzales Velarde (Eds.), Computing tools for modeling, optimization and simulation: interfaces in computer science and operations research (pp.\u00a01\u201324). Norwell: Kluwer Academic."},{"issue":"3","key":"597_CR8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1023\/A:1023721723676","volume":"9","author":"F. Glover","year":"2003","unstructured":"Glover, F. (2003). Tutorial on surrogate constraint approaches for optimization in graphs. Journal of Heuristics, 9(3), 175\u2013227.","journal-title":"Journal of Heuristics"},{"issue":"9","key":"597_CR9","doi-asserted-by":"crossref","first-page":"2449","DOI":"10.1016\/j.cor.2005.07.009","volume":"33","author":"F. Glover","year":"2006","unstructured":"Glover, F. (2006). Parametric tabu search for mixed integer programs. Computers and Operations Research, 33(9), 2449\u20132494.","journal-title":"Computers and Operations Research"},{"issue":"6","key":"597_CR10","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s10732-007-9029-z","volume":"13","author":"F. Glover","year":"2007","unstructured":"Glover, F. (2007). Infeasible\/feasible search trajectories and directional rounding in integer programming. Journal of Heuristics, 13(6), 505\u2013542.","journal-title":"Journal of Heuristics"},{"key":"597_CR11","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/978-3-540-72960-0_21","volume-title":"Advances in metaheuristics for hard optimization","author":"F. Glover","year":"2008","unstructured":"Glover, F. (2008). Inequalities and target objectives for metaheuristic search\u2014part I: mixed binary optimization. In P. Siarry & Z. Michalewicz (Eds.), Advances in metaheuristics for hard optimization (pp.\u00a0439\u2013474). New York: Springer."},{"key":"597_CR12","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. Norwell: Kluwer Academic."},{"key":"597_CR13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-1-4615-5775-3_7","volume-title":"MetaHeuristics: advances and trends in local search paradigms for optimization","author":"F. Glover","year":"1999","unstructured":"Glover, F., Kochenberger, G., Alidaee, B., & Amini, M. M. (1999). Tabu with search critical event memory: an enhanced application for binary quadratic programs. In S. Voss, S. Martello, I. Osman & C. Roucairol (Eds.), MetaHeuristics: advances and trends in local search paradigms for optimization (pp.\u00a093\u2013110). Boston: Kluwer Academic."},{"key":"597_CR14","unstructured":"Hvattum, L. M., Lokketangen, A., & Glover, F. (2005). New heuristics and adaptive memory procedures for Boolean optimization problems. In J.K. Karlof (Ed.), Integer programming theory and practice (pp.\u00a01\u201318)."},{"key":"597_CR15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF02022563","volume":"41","author":"J. Kelly","year":"1993","unstructured":"Kelly, J., Golden, B., & Assad, A. (1993). Large scale controlled rounding using tabu search with strategic oscillation. Annals of Operations Research, 41, 69\u201384.","journal-title":"Annals of Operations Research"},{"key":"597_CR16","author":"Z. L\u00fc","year":"2008","unstructured":"L\u00fc, Z., & Hao, J.-K. (2008). Adaptive tabu search for course timetabling. European Journal of Operational Research. doi: 10.1016\/j.ejor.2008.12.007 .","journal-title":"European Journal of Operational Research"},{"key":"597_CR17","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/S0377-2217(97)00294-4","volume":"106","author":"K. Nonobe","year":"1998","unstructured":"Nonobe, K., & Ibaraki, T. (1998). A tabu search approach for the constraint satisfaction problem as a general problem solver. European Journal of Operational Research, 106, 599\u2013623.","journal-title":"European Journal of Operational Research"},{"key":"597_CR18","first-page":"131","volume":"39","author":"K. Nonobe","year":"2001","unstructured":"Nonobe, K., & Ibaraki, T. (2001). An improved tabu search method for the weighted constraint satisfaction problem. INFOR, 39, 131\u2013151.","journal-title":"INFOR"},{"key":"597_CR19","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I. H. Osman","year":"1993","unstructured":"Osman, I. H. (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41, 421\u2013451.","journal-title":"Annals of Operations Research"},{"key":"597_CR20","volume-title":"Search Methodologies","author":"C. R. Reeves","year":"2006","unstructured":"Reeves, C. R. (2006). Fitness landscapes. In Search Methodologies. Berlin: Springer, Chap.\u00a019."},{"key":"597_CR21","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/0-387-23667-8_20","volume-title":"Metaheuristic optimization via memory and evolution: tabu search and scatter search","author":"C. Rego","year":"2005","unstructured":"Rego, C. (2005). RAMP: a new metaheuristic framework for combinatorial optimization. In C. Rego & B. Alidaee (Eds.), Metaheuristic optimization via memory and evolution: tabu search and scatter search (pp.\u00a0441\u2013460). Norwell: Kluwer Academic."},{"key":"597_CR22","volume-title":"Metaheuristic optimization via memory and evolution: tabu search and scatter search","author":"C. Rego","year":"2005","unstructured":"Rego, C., & Alidaee, B. (2005). Metaheuristic optimization via memory and evolution: tabu search and scatter search. Norwell: Kluwer Academic."},{"issue":"5","key":"597_CR23","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1023\/A:1011373828276","volume":"7","author":"M. Vasquez","year":"2001","unstructured":"Vasquez, M., & Hao, J.-K. (2001a). A heuristic approach for antenna positioning in cellular networks. Journal of Heuristics, 7(5), 443\u2013472.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"597_CR24","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1011203002719","volume":"20","author":"M. Vasquez","year":"2001","unstructured":"Vasquez, M., & Hao, J.-K. (2001b). A \u2018logic-constrained\u2019 knapsack formulation and a Tabu algorithm for the daily photograph scheduling of an earth observation satellite. Computational Optimization and Applications, 20(2), 137\u2013157.","journal-title":"Computational Optimization and Applications"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0597-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-009-0597-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0597-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:55Z","timestamp":1559138875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-009-0597-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,7]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["597"],"URL":"https:\/\/doi.org\/10.1007\/s10479-009-0597-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,7]]}}}