Note from the Editor

References

• Fleurent C, Glover F (1999) Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J. Comput. 11(2):198–204.Google Scholar
• Glover F (2000) Multi-start and strategic oscillation methods—Principles to exploit adaptive memory. Laguna M, Gonzáles-Velarde JL, eds. Computing Tools for Modeling, Optimization and Simulation, Interfaces in Computer Science and Operations Research, vol. 12 (Springer, Boston), 1–24.Google Scholar
• Glover F (2016) Multi-wave algorithms for metaheuristic optimization. J. Heuristics 22(3):331–358.Google Scholar
• James T, Rego C, Glover F (2009) Multistart tabu search and diversification strategies for the quadratic assignment problem. IEEE Trans. Systems Man Cybernetics—Part A: Systems Humans 39(3):579–596.Google Scholar
• Lasdon L, Plummer J (2008) Multistart algorithms for seeking feasibility. Comput. Oper. Res. 35(5):1379–1393.Crossref, Google Scholar
• Martí R, Lozano JA, Mendiburu A, Hernando L (2018) Multi-start methods. Martí R, Pardalos P, Resende M, eds. Handbook of Heuristics (Springer, Cham, Switzerland), 155–175.Google Scholar
• Ugray Z, Lasdon L, Plummer J, Bussieck M (2009) Dynamic filters and randomized drivers for the multi-start global optimization algorithm MSNLP. Optim. Methods Software 24(4–5):635–656.Crossref, Google Scholar