Approximate and exact algorithms for the fixed-charge knapsack problem
From MaRDI portal
Publication:2572244
DOI10.1016/J.EJOR.2004.06.023zbMATH Open1085.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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Title not available (Why is that?)
- A branch and bound algorithm for the generalized assignment problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- New trends in exact algorithms for the \(0-1\) knapsack problem
- A branch and bound algorithm for solving the multiple-choice knapsack problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Exact Algorithms For The Setup Knapsack Problem
Cited In (19)
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem
- Integer knapsack problems with set-up weights
- Title not available (Why is that?)
- Integer optimization with penalized fractional values: the knapsack case
- Exact approaches for the knapsack problem with setups
- Fixed-charge continuous knapsack problems and pseudogreedy solutions
- An exact algorithm for the fixed-charge multiple knapsack problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Experiments with the ``Oregon Trail knapsack problem
- The zone hopping problem
- Approximation algorithms for knapsack problems with cardinality constraints
- A dynamic programming algorithm for the knapsack problem with setup
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem
- On approximating the incremental knapsack problem
- Approximate \#knapsack computations to count semi-fair allocations
- The knapsack problem with forfeit sets
- An exact approach for the 0-1 knapsack problem with setups
- Title not available (Why is that?)
- An optimization algorithm for a penalized knapsack problem
Uses Software
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)
