Tabu-enhanced iterated greedy algorithm: A case study in the quadratic multiple knapsack problem
Authors:
- C. García-MartínezCGC. García-Martínez
- F.J. RodriguezFRF.J. Rodriguez
- M. LozanoMLM. Lozano
- 1 February 2014
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 232 (3) , 454-463
Abstract
No abstract availableThis publication has 38 references indexed in Scilit:
- Arbitrary function optimisation with metaheuristicsSoft Computing, 2012
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion timesAnnals of Operations Research, 2012
- Metaheuristics for the linear ordering problem with cumulative costsEuropean Journal of Operational Research, 2012
- An iterated greedy algorithm for the flowshop scheduling problem with blockingOmega, 2011
- Memetic Algorithms for Continuous Optimisation Based on Local Search ChainsEvolutionary Computation, 2010
- Evaluating a local genetic algorithm as context-independent local search operator for metaheuristicsSoft Computing, 2009
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997
- Optimization by Simulated AnnealingScience, 1983
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTSDecision Sciences, 1977
- Individual Comparisons by Ranking MethodsBiometrics Bulletin, 1945