A heuristic for large-scale p-median instances.
Pasquale AvellaAntonio SassanoIgor Vasil'evPublished in: Electron. Notes Discret. Math. (2003)
Keyphrases
- neighbourhood search
- lagrangean relaxation
- closest string
- initial solution
- constant factor approximation
- timetabling problem
- search procedures
- cpu times
- small scale
- benchmark instances
- linear programming relaxation
- stochastic local search
- constructive heuristic
- search algorithm
- lower and upper bounds
- lower bound
- training instances
- exact methods
- produce high quality solutions
- optimal solution
- real world
- heuristic methods
- randomly generated
- tabu search
- linear program
- real life
- active learning
- dynamic programming
- metaheuristic
- suboptimal solutions
- constraint satisfaction
- exact algorithms
- combinatorial optimization
- search strategies
- integer programming
- test instances
- lagrangian relaxation