Pages that link to "Item:Q3030567"
From MaRDI portal
The following pages link to A Multiplier Adjustment Method for the Generalized Assignment Problem (Q3030567):
Displayed 11 items.
- An ejection chain approach for the generalized assignment problem (Q2573015) (← links)
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems (Q2640440) (← links)
- On the variable-depth-search heuristic for the linear-cost generalized assignment problem (Q2752253) (← links)
- A hybrid algorithm for the generalized assignment problem (Q3348709) (← links)
- Generalized cover facet inequalities for the generalized assignment problem (Q3553764) (← links)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)
- A multiplier adjustment technique for the capacitated concentrator location problem (Q4227929) (← links)
- Heuristics for the multi-resource generalized assignment problem (Q4544217) (← links)
- Time-cost Trade-off Relations in Bulk Transportation Problem (Q4718636) (← links)
- A tabu search heuristic for the generalized assignment problem (Q5938390) (← links)
- A dynamic tabu search for large-scale generalized assignment problems (Q5945334) (← links)