Pages that link to "Item:Q1319576"
From MaRDI portal
The following pages link to A set partitioning heuristic for the generalized assignment problem (Q1319576):
Displayed 12 items.
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- Solving the generalised assignment problem using polyhedral results (Q1296797) (← links)
- A genetic algorithm for the generalised assignment problem (Q1361390) (← links)
- Logic cuts for multilevel generalized assignment problems. (Q1406973) (← links)
- Effective algorithm and heuristic for the generalized assignment problem. (Q1417503) (← links)
- A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
- Very large-scale variable neighborhood search for the generalized assignment problem (Q3604030) (← links)
- A tabu search heuristic for the generalized assignment problem (Q5938390) (← links)
- A family of inequalities for the generalized assignment polytope (Q5949919) (← links)
- Genetic clustering algorithms. (Q5952444) (← links)