Pages that link to "Item:Q611434"
From MaRDI portal
The following pages link to Lagrangian heuristic for a class of the generalized assignment problems (Q611434):
Displaying 13 items.
- An LP-based heuristic procedure for the generalized assignment problem with special ordered sets (Q868998) (← links)
- A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
- Relaxation heuristics for a generalized assignment problem (Q1278258) (← links)
- Improved Lagrangian bounds and heuristics for the generalized assignment problem (Q1745880) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← links)
- Studying properties of Lagrangian bounds for many-to-many assignment problems (Q2017507) (← links)
- Packing convex polygons in minimum-perimeter convex hulls (Q2679237) (← links)
- An LP-based metaheuristic procedure for the k-sequential generalized assignment problem (Q3093042) (← links)
- Comparison of Lagrangian bounds for one class of generalized assignment problems (Q3545175) (← links)
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem<sup>*</sup> (Q3821921) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- Digital model of natural cores using geometric design (Q6198093) (← links)