Pages that link to "Item:Q1061001"
From MaRDI portal
The following pages link to The bound improving sequence algorithm (Q1061001):
Displaying 6 items.
- Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
- Constructive dual methods for discrete programming (Q1101341) (← links)
- A revised bound improvement sequence algorithm (Q1102193) (← 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)
