An exact algorithm for the fixed-charge multiple knapsack problem

DOI10.1016/J.EJOR.2007.10.024MaRDI QIDQ1011207zbMATH OpenOpenAlexFDO

Authors Takeo Yamada, Takahiro Takeoka

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

combinatorial optimizationinteger programmingfixed-charge problemmultiple knapsack problem

Mathematics Subject Classification ID

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

Recommendations

• Approximate and exact algorithms for the fixed-charge knapsack problem
• An exact algorithm for the budget-constrained multiple knapsack problem
• An exact algorithm for large multiple knapsack problems
• Publication:4204000
• A branch and bound algorithm for solving the multiple-choice knapsack problem

Cites work

• scientific article; zbMATH DE number 3687091 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• 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

Cited in

(13)

• Solving Multiple Knapsack Problems by Cutting Planes
• Approximate and exact algorithms for the fixed-charge knapsack problem
• A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
• A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem
• Exact algorithms for the 0-1 time-bomb knapsack problem
• A decomposition approach for multidimensional knapsacks with family‐split penalties
• An exact algorithm for the budget-constrained multiple knapsack problem
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• An exact algorithm for large multiple knapsack problems
• The knapsack problem with forfeit sets
• Upper and lower bounding procedures for the multiple knapsack assignment problem
• Generalized average shadow prices and bottlenecks

Describes a project that uses

Uses Software

• MULKNAP
• Knapsack
• CPLEX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1011207)