Strategic oscillation for the quadratic multiple knapsack problem
From MaRDI portal
Publication:2450910
DOI10.1007/s10589-013-9623-yzbMath1295.90061OpenAlexW2014691946MaRDI QIDQ2450910
Rafael Martí, Fred Glover, Manuel Lozano, Carlos García-Martínez, Francisco J. Rodriguez
Publication date: 23 May 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9623-y
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem, Lagrangian matheuristics for the quadratic multiple knapsack problem, Responsive strategic oscillation for solving the disjunctively constrained knapsack problem, An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating, Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem, Iterated responsive threshold search for the quadratic multiple knapsack problem, Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Approximations of the critical region of the fbietkan statistic
