Approximate and exact algorithms for the fixed-charge knapsack problem

DOI10.1016/J.EJOR.2004.06.023zbMATH1085.90049OpenAlexW2026884285MaRDI QIDQ2572244FDOQ2572244

Authors 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)

Recommendations

• An exact algorithm for the fixed-charge multiple knapsack problem
• Publication:4204000
• scientific article; zbMATH DE number 4093178
• Publication:3471851
• Exact approaches for the knapsack problem with setups

Cites work

• scientific article; zbMATH DE number 3890754 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Minimal Algorithm for the 0-1 Knapsack Problem
• A branch and bound algorithm for solving the multiple-choice knapsack problem
• A branch and bound algorithm for the generalized assignment problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Exact Algorithms For The Setup Knapsack Problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• New trends in exact algorithms for the \(0-1\) knapsack problem

Cited in

(19)

• Exact and heuristic solution approaches for the mixed integer setup knapsack problem
• Approximation algorithms for knapsack problems with cardinality constraints
• A dynamic programming algorithm for the knapsack problem with setup
• Integer optimization with penalized fractional values: the knapsack case
• The zone hopping problem
• Fixed-charge continuous knapsack problems and pseudogreedy solutions
• On approximating the incremental knapsack problem
• Integer knapsack problems with set-up weights
• Exact approaches for the knapsack problem with setups
• An exact approach for the 0-1 knapsack problem with setups
• Experiments with the ``Oregon Trail knapsack problem
• An optimization algorithm for a penalized knapsack problem
• The knapsack problem with forfeit sets
• scientific article; zbMATH DE number 4123525 (Why is no real title available?)
• Approximate \#knapsack computations to count semi-fair allocations
• Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem
• An exact algorithm for the fixed-charge multiple knapsack problem
• scientific article; zbMATH DE number 4093178 (Why is no real title available?)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems

Describes a project that uses

Uses Software

• Knapsack

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

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