Pages that link to "Item:Q1296797"
From MaRDI portal
The following pages link to Solving the generalised assignment problem using polyhedral results (Q1296797):
Displaying 9 items.
- An LP-based heuristic procedure for the generalized assignment problem with special ordered sets (Q868998) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
- A new extended formulation of the generalized assignment problem and some associated valid inequalities (Q2009013) (← links)
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem (Q2336062) (← links)
- An ejection chain approach for the generalized assignment problem (Q2573015) (← links)
- Generalized cover facet inequalities for the generalized assignment problem (Q3553764) (← links)
- Preprocessing rules for integer programming solutions to the generalised assignment problem (Q4658442) (← links)
- Reducing the elastic generalized assignment problem to the standard generalized assignment problem (Q4933641) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)