Approximate and exact algorithms for the fixed-charge knapsack problem

DOI10.1016/j.ejor.2004.06.023zbMath1085.90049OpenAlexW2026884285MaRDI QIDQ2572244

Umit Akinc

Publication date: 16 November 2005

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

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

zbMATH Keywords

Branch-and-boundKnapsack problemsFixed-charge

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (6)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ An exact approach for the 0-1 knapsack problem with setups ⋮ Exact approaches for the knapsack problem with setups ⋮ A dynamic programming algorithm for the knapsack problem with setup ⋮ The knapsack problem with forfeit sets ⋮ Exact and heuristic solution approaches for the mixed integer setup knapsack problem

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for solving the multiple-choice knapsack problem
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• A branch and bound algorithm for the generalized assignment problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Exact Algorithms For The Setup Knapsack Problem
• A Minimal Algorithm for the 0-1 Knapsack Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II

This page was built for publication: Approximate and exact algorithms for the fixed-charge knapsack problem