The following pages link to Tabu search (Q20565):
Displaying 50 items.
- A nonmonotone GRASP (Q340011) (← links)
- Scheduling parallel-machine batch operations to maximize on-time delivery performance (Q341468) (← links)
- A leader-follower model for discrete competitive facility location (Q342067) (← links)
- A parallel tabu search for solving the primal buffer allocation problem in serial production systems (Q342074) (← links)
- Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
- A tabu search based memetic algorithm for the Max-Mean dispersion problem (Q342388) (← links)
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling (Q342395) (← links)
- The dynamic vehicle allocation problem with application in trucking companies in Brazil (Q342558) (← links)
- Acquisition planning and scheduling of computing resources (Q342569) (← links)
- A new heuristic algorithm for the circular packing problem with equilibrium constraints (Q350917) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Fitness landscape analysis and metaheuristics efficiency (Q367228) (← links)
- A hyper-heuristic approach to sequencing by hybridization of DNA sequences (Q367628) (← links)
- Solving the quadratic minimum spanning tree problem (Q387698) (← links)
- Scheduling satellite launch missions: an MILP approach (Q398832) (← links)
- Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery (Q405689) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- Genetic tabu search for robust fixed channel assignment under dynamic traffic data (Q409273) (← links)
- The linehaul-feeder vehicle routing problem with virtual depots and time windows (Q410539) (← links)
- Multipath adaptive tabu search for a vehicle control problem (Q411085) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- A tabu search algorithm for the covering design problem (Q415558) (← links)
- A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661) (← links)
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking (Q421715) (← links)
- A discrete model for optimal operation of fossil-fuel generators of electricity (Q421796) (← links)
- The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
- Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- Using Markov chains to analyze the effectiveness of local search algorithms (Q429676) (← links)
- Sidelobe level reduction in linear array pattern synthesis using particle swarm optimization (Q430945) (← links)
- Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions (Q436910) (← links)
- The freight allocation problem with lane cost balancing constraint (Q439318) (← links)
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) (← links)
- Two heuristic solution concepts for the vehicle selection problem in line haul transports (Q439400) (← links)
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW (Q439557) (← links)
- Product line pricing for services with capacity constraints and dynamic substitution (Q439681) (← links)
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- Exact and approximate algorithms for variable selection in linear discriminant analysis (Q452539) (← links)
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem (Q463377) (← links)
- Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information (Q473662) (← links)
- Timetable construction: the algorithms and complexity perspective (Q475200) (← links)
- On hypercube packings, blocking sets and a covering problem (Q477608) (← links)
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965) (← links)
- The maximin gradual cover location problem (Q480773) (← links)
- Hybridizing local search algorithms for global optimization (Q480947) (← links)
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem (Q490211) (← links)
- A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks (Q490218) (← links)
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
- On minimum reload cost cycle cover (Q496639) (← links)
