Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
From MaRDI portal
Publication:4393124
Recommendations
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- New trends in exact algorithms for the \(0-1\) knapsack problem
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
- A new class of hard problem instances for the 0-1 knapsack problem
- A New Algorithm for the 0-1 Knapsack Problem
Cited in
(32)- Some computational results on real 0-1 knapsack problems
- The knapsack problem with generalized upper bounds
- A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
- A fast algorithm for strongly correlated knapsack problems
- Some thoughts on combinatorial optimisation
- The multidimensional 0-1 knapsack problem: an overview.
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- Where are the hard knapsack problems?
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- A new class of hard problem instances for the 0-1 knapsack problem
- Analysis of divide-and-conquer strategies for the 0-1 minimization knapsack problem
- An exact algorithm for the knapsack sharing problem
- Tree knapsack approaches for local access network design
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Robust efficiency measures for linear knapsack problem variants
- A rigorous method for solving 0-1 polynomial knapsack problem
- scientific article; zbMATH DE number 4152148 (Why is no real title available?)
- A hard knapsack problem
- Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- Hard Equality Constrained Integer Knapsacks
- A novel reformulation for the single-sink fixed-charge transportation problem
- A two state reduction based dynamic programming algorithm for the bi-objective 0-1 knapsack problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A new lower bound for the linear knapsack problem with general integer variables
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
This page was built for publication: Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4393124)
