An ejection chain approach for the quadratic multiple knapsack problem
From MaRDI portal
Publication:323171
DOI10.1016/j.ejor.2016.02.043zbMath1346.90715OpenAlexW2288620768MaRDI QIDQ323171
Zhipeng Lü, Haibo Wang, Mengqi Liu, Gary Kochengber, Bo Peng
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.02.043
Related Items (6)
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 ⋮ Dual-neighborhood iterated local search for routing and wavelength assignment ⋮ Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems ⋮ A matheuristic for the 0--1 generalized quadratic multiple knapsack problem ⋮ A branch-and-bound algorithm for the quadratic multiple knapsack problem
Cites Work
- Unnamed Item
- A computational study on the quadratic knapsack problem with multiple constraints
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- An Ejection Chain Approach for the Generalized Assignment Problem
- An ejection chain algorithm for the quadratic assignment problem
- Quadratic knapsack problems
- An algorithm for 0-1 multiple-knapsack problems
This page was built for publication: An ejection chain approach for the quadratic multiple knapsack problem