Pages that link to "Item:Q1908034"
From MaRDI portal
The following pages link to Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034):
Displaying 33 items.
- Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness (Q319136) (← links)
- Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661) (← links)
- The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
- Two heuristic solution concepts for the vehicle selection problem in line haul transports (Q439400) (← links)
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem (Q614047) (← links)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649) (← links)
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
- A genetic algorithm for the generalised assignment problem (Q1361390) (← links)
- A simple dual algorithm for the generalised assignment problem (Q1365112) (← links)
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls (Q1607978) (← links)
- A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
- Optimizing cane supply decisions within a sugar mill region (Q1806344) (← links)
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) (← links)
- Dynamic tabu search strategies for the traveling purchaser problem (Q1919843) (← links)
- A tabu search algorithm for frequency assignment (Q1919845) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Competence-based assignment of tasks to workers in factories with demand-driven manufacturing (Q2045620) (← links)
- Bees algorithm for generalized assignment problem (Q2266951) (← links)
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
- Improved tabu search heuristics for the dynamic space allocation problem (Q2482383) (← links)
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
- An ejection chain approach for the generalized assignment problem (Q2573015) (← links)
- Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations (Q2830959) (← links)
- Very large-scale variable neighborhood search for the generalized assignment problem (Q3604030) (← links)
- (Q4415704) (← links)
- A tabu search heuristic for the generalized assignment problem (Q5938390) (← links)
- A dynamic tabu search for large-scale generalized assignment problems (Q5945334) (← links)
- Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity (Q6048199) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)