Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem

DOI10.1007/s10732-005-2634-9zbMath1122.90394MaRDI QIDQ2491319

Ravindra K. Ahuja, Claudio B. Cunha

Publication date: 29 May 2006

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-005-2634-9

zbMATH Keywords

heuristics; knapsack problem; neighborhood search algorithms

Mathematics Subject Classification ID

90B40: Search theory

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Uses Software

• Knapsack
• MULKNAP
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of very large-scale neighborhood search techniques
• A heuristic lagrangean algorithm for the capacitated plant location problem
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• An exact algorithm for large multiple knapsack problems
• A genetic algorithm for the multidimensional knapsack problem
• TSP ejection chains
• A greedy genetic algorithm for the quadratic assignment problem
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
• Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem
• Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem
• An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem