Metaheuristics for the linear ordering problem with cumulative costs
- 1 January 2012
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 216 (2) , 270-277
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A benchmark library and a comparison of heuristic methods for the linear ordering problemComputational Optimization and Applications, 2011
- GRASP and path relinking for the max–min diversity problemComputers & Operations Research, 2010
- Tabu search for the linear ordering problem with cumulative costsComputational Optimization and Applications, 2009
- The Linear Ordering Problem with cumulative costsEuropean Journal of Operational Research, 2008
- A branch-and-bound algorithm for the linear ordering problem with cumulative costsEuropean Journal of Operational Research, 2008
- A Hybrid Heuristic for the p-Median ProblemJournal of Heuristics, 2004
- Intensification and diversification with elite tabu search solutions for the linear ordering problemComputers & Operations Research, 1999
- Note: A local-search heuristic for large set-covering problemsNaval Research Logistics (NRL), 1995
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent SetOperations Research, 1994
- A probabilistic heuristic for a computationally difficult set covering problemOperations Research Letters, 1989