Advanced probabilistic tabu search for the fair max-min diversity problem
Open Access
- 24 August 2026
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 196
Abstract
No abstract availableFunding Information
- Ministerio de Ciencia e Innovación
This publication has 37 references indexed in Scilit:
- GRASP with Evolutionary Path Relinking for the conditional -Dispersion problemApplied Soft Computing, 2024
- Solving the Capacitated Dispersion Problem with variable neighborhood search approaches: From basic to skewed VNSComputers & Operations Research, 2022
- A kernel search heuristic for a fair facility location problemComputers & Operations Research, 2021
- A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problemComputers & Operations Research, 2018
- Solving the capacitated clustering problem with variable neighborhood searchAnnals of Operations Research, 2017
- A relax-and-repair heuristic for the Swap-Body Vehicle Routing ProblemAnnals of Operations Research, 2015
- GRASP and path relinking for the max–min diversity problemComputers & Operations Research, 2010
- Diversification-driven tabu search for unconstrained binary quadratic problems4OR, 2010
- Equity measurement in facility location analysis: A review and frameworkEuropean Journal of Operational Research, 1994
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)Discrete Applied Mathematics, 1994