Pages that link to "Item:Q3892037"
From MaRDI portal
The following pages link to Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem (Q3892037):
Displaying 18 items.
- Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach (Q684336) (← links)
- Solving capacitated clustering problems (Q799059) (← links)
- On a discrete nonlinear and nonseparable knapsack problem (Q920849) (← links)
- A study of the bottleneck single source transportation problem (Q1085063) (← links)
- Locational analysis (Q1173002) (← links)
- A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
- An algorithm for the bottleneck generalized assignment problem (Q1260736) (← links)
- Relaxation heuristics for a generalized assignment problem (Q1278258) (← links)
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study (Q1296795) (← links)
- A set partitioning heuristic for the generalized assignment problem (Q1319576) (← links)
- A genetic algorithm for the generalised assignment problem (Q1361390) (← links)
- Tabu search for the multilevel generalized assignment problem (Q1388882) (← links)
- Effective algorithm and heuristic for the generalized assignment problem. (Q1417503) (← links)
- Formulating and solving production planning problems (Q1806882) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
- A hybrid algorithm for the generalized assignment problem (Q3348709) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
