A general framework for nested variable neighborhood search

DOI10.1016/J.ENDM.2017.03.021MaRDI QIDQ1687670zbMATH OpenOpenAlexFDO

Authors Jack Brimberg, Nenad Mladenović, Raca Todosijević, Dragan Urošević

Publication date 4 January 2018

Full work available at URL https://doi.org/10.1016/j.endm.2017.03.021

zbMATH Keywords

capacitated clustering problemnested variable neighborhood searchvariable neighborhood descent

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Variable neighborhood search: basics and variants
• Variable Neighborhood Search
• Variable neighbourhood search: Methods and applications
• Developments of variable neighborhood search
• Variable neighbourhood search: methods and applications

Cites work

• Tabu search and GRASP for the capacitated clustering problem

Cited in

(7)

• Exploring variable neighborhood search for automatic algorithm configuration
• Solving the capacitated clustering problem with variable neighborhood search
• Explanation-based large neighborhood search
• A generalized variable neighborhood search for combinatorial optimization problems
• Variable neighborhood descent for the capacitated clustering problem
• Nested general variable neighborhood search for the periodic maintenance problem
• Variable neighborhood search: the power of change and simplicity

This page was built for publication: A general framework for nested variable neighborhood search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1687670)