The following pages link to (Q3678962):
Displayed 17 items.
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
- A dynamic programming algorithm for the knapsack problem with setup (Q342065) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
- A hybrid algorithm for the unbounded knapsack problem (Q1013302) (← links)
- Heuristics for the 0-1 multidimensional knapsack problem (Q1042198) (← links)
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← 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)
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
- Two linear approximation algorithms for the subset-sum problem (Q1969831) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem (Q2883626) (← links)