Heuristic solution approaches for the maximum minsum dispersion problem

DOI10.1007/s10898-016-0429-1zbMath1365.90266OpenAlexW2189440767MaRDI QIDQ513174

Vicente Campos, Rafael Martí, Anna Martínez-Gavara, Manuel Laguna

Publication date: 3 March 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-016-0429-1

zbMATH Keywords

metaheuristicstabu searchGRASPequitable dispersion problems

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem, A review on discrete diversity and dispersion maximization from an OR perspective, Heuristics for the capacitated dispersion problem, Measuring diversity. A review and an empirical analysis

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• GRASP and path relinking for the equitable dispersion problem
• Good solutions to discrete noxious location problems via metaheuristics
• An exact algorithm for the knapsack sharing problem with common items
• Tabu search and GRASP for the maximum diversity problem
• The discrete p-dispersion problem
• Tabu search versus GRASP for the maximum diversity problem
• The equitable dispersion problem
• GRASP and path relinking for the max-min diversity problem
• Analytical models for locating undesirable facilities
• Computational aspects of the maximum diversity problem
• Approximation algorithms for maximum dispersion
• A hybrid heuristic for the \(p\)-median problem
• A discrete optimization model for preserving biological diversity
• A branch and bound algorithm for the maximum diversity problem
• Iterated tabu search for the maximum diversity problem
• Upper bounds and exact algorithms for \(p\)-dispersion problems
• Hybrid heuristics for the maximum diversity problem
• Heuristic and Special Case Algorithms for Dispersion Problems
• Heuristic algorithms for the maximum diversity problem
• Lagrangian solution of maximum dispersion problems