Pages that link to "Item:Q1102193"
From MaRDI portal
The following pages link to A revised bound improvement sequence algorithm (Q1102193):
Displayed 5 items.
- Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
- A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
- A bound-improving approach to discrete programming problems (Q1340059) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)