Variable neighborhood search for maximum diverse grouping problem
From MaRDI portal
Publication:2975424
DOI10.2298/YJOR121223003UzbMath1458.90655MaRDI QIDQ2975424
Publication date: 11 April 2017
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
Iterated maxima search for the maximally diverse grouping problem ⋮ A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem ⋮ Solving the clique partitioning problem as a maximally diverse grouping problem ⋮ A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem ⋮ Solving the capacitated clustering problem with variable neighborhood search ⋮ Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
This page was built for publication: Variable neighborhood search for maximum diverse grouping problem
