Pages that link to "Item:Q4393124"
From MaRDI portal
The following pages link to Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems (Q4393124):
Displaying 30 items.
- Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109) (← links)
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- A new lower bound for the linear knapsack problem with general integer variables (Q859686) (← links)
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds (Q914548) (← links)
- Some computational results on real 0-1 knapsack problems (Q1079123) (← links)
- The knapsack problem with generalized upper bounds (Q1122484) (← links)
- A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (Q1208445) (← links)
- A fast algorithm for strongly correlated knapsack problems (Q1281395) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- Where are the hard knapsack problems? (Q1772862) (← links)
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
- Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464) (← links)
- A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem (Q2003457) (← links)
- Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
- A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
- Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem (Q2185833) (← links)
- An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
- Tree knapsack approaches for local access network design (Q2503262) (← links)
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← links)
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem (Q3116647) (← links)
- A hard knapsack problem (Q3780004) (← links)
- Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem (Q3796962) (← links)
- Hard Equality Constrained Integer Knapsacks (Q5704196) (← links)
- A novel reformulation for the single-sink fixed-charge transportation problem (Q6052058) (← links)
