Pages that link to "Item:Q975754"
From MaRDI portal
The following pages link to A Lagrangian bound for many-to-many assignment problems (Q975754):
Displaying 9 items.
- Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
- A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
- Integer programming formulations for approximate packing circles in a rectangular container (Q1718120) (← links)
- Improved Lagrangian bounds and heuristics for the generalized assignment problem (Q1745880) (← links)
- A hierarchical solution approach for a multicommodity distribution problem under a special cost structure (Q1761205) (← links)
- Studying properties of Lagrangian bounds for many-to-many assignment problems (Q2017507) (← links)
- Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking (Q2634668) (← links)
- Comparison of Lagrangian bounds for one class of generalized assignment problems (Q3545175) (← links)
- (Q3812045) (← links)