Pages that link to "Item:Q1745880"
From MaRDI portal
The following pages link to Improved Lagrangian bounds and heuristics for the generalized assignment problem (Q1745880):
Displaying 10 items.
- Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
- An LP-based heuristic procedure for the generalized assignment problem with special ordered sets (Q868998) (← links)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
- A new Lagrangian relaxation approach to the generalized assignment problem (Q1088908) (← links)
- Studying properties of Lagrangian bounds for many-to-many assignment problems (Q2017507) (← links)
- A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem (Q2784114) (← links)
- A Multiplier Adjustment Method for the Generalized Assignment Problem (Q3030567) (← links)
- Comparison of Lagrangian bounds for one class of generalized assignment problems (Q3545175) (← links)
- Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity (Q6048199) (← links)