Pages that link to "Item:Q914550"
From MaRDI portal
The following pages link to (1,k)-configuration facets for the generalized assignment problem (Q914550):
Displaying 10 items.
- Knapsack polytopes: a survey (Q827125) (← links)
- The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) (← links)
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
- A new extended formulation of the generalized assignment problem and some associated valid inequalities (Q2009013) (← links)
- Minimization of makespan in generalized assignment problem. (Q2468617) (← links)
- Some integer programs arising in the design of main frame computers (Q3135915) (← links)
- Generalized cover facet inequalities for the generalized assignment problem (Q3553764) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
