Pages that link to "Item:Q1390271"
From MaRDI portal
The following pages link to An expanding-core algorithm for the exact \(0-1\) knapsack problem (Q1390271):
Displayed 17 items.
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- A fast algorithm for strongly correlated knapsack problems (Q1281395) (← links)
- A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
- Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth (Q1388884) (← links)
- Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming. (Q1416351) (← 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)
- 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 the Knapsack problem with imprecise weight coefficients using genetic algorithms (Q2456412) (← links)
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem (Q2462550) (← links)
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
- An efficient algorithm for the collapsing knapsack problem (Q2489216) (← links)
- The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
- An empirical investigation on parallelization strategies for scatter search (Q2570149) (← links)
- Using fuzzy numbers in knapsack problems (Q5954834) (← links)