Variable Neighborhood Descent for the Capacitated Clustering Problem

DOI10.1007/978-3-319-44914-2_27zbMath1392.90083OpenAlexW2557958558MaRDI QIDQ3133226

Raca Todosijević, Nenad Mladenović, Jack Brimberg, 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

zbMATH Keywords

optimizationclusteringheuristicvariable neighborhood descent

Mathematics Subject Classification ID

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

Related Items (1)

Solving the capacitated clustering problem with variable neighborhood search

This page was built for publication: Variable Neighborhood Descent for the Capacitated Clustering Problem