An exact algorithm for the fixed-charge multiple knapsack problem

DOI10.1016/j.ejor.2007.10.024zbMath1157.90485OpenAlexW2057959765MaRDI QIDQ1011207

Takahiro Takeoka, Takeo Yamada

Publication date: 8 April 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.10.024

zbMATH Keywords

integer programmingcombinatorial optimizationfixed-charge problemmultiple knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (7)

Generalized average shadow prices and bottlenecks ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Exact algorithms for the 0-1 time-bomb knapsack problem ⋮ A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem ⋮ The knapsack problem with forfeit sets ⋮ A decomposition approach for multidimensional knapsacks with family‐split penalties ⋮ Upper and lower bounding procedures for the multiple knapsack assignment problem

Uses Software

• CPLEX
• Knapsack
• MULKNAP

Cites Work

• An exact algorithm for large multiple knapsack problems
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An exact algorithm for the fixed-charge multiple knapsack problem