Variable neighborhood descent for the capacitated clustering problem

DOI10.1007/978-3-319-44914-2_27zbMATH Open1392.90083OpenAlexW2557958558MaRDI QIDQ3133226FDOQ3133226

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

Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_27

Recommendations

• Solving the capacitated clustering problem with variable neighborhood search
• Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
• An effective VNS for the capacitated \(p\)-median problem
• A general framework for nested variable neighborhood search
• Variable neighborhood search

zbMATH Keywords

optimizationclusteringheuristicvariable neighborhood descent

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)

Cited In (3)

• Solving the capacitated clustering problem with variable neighborhood search
• Variable neighborhood descent applied to multi-way number partitioning problem
• Neighborhood decomposition-driven variable neighborhood search for capacitated clustering

This page was built for publication: Variable neighborhood descent for the capacitated clustering problem

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