The following pages link to Tabu search (Q20565):
Displaying 50 items.
- A survey on optimization metaheuristics (Q497180) (← links)
- A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
- Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks (Q511724) (← links)
- Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
- A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
- A mathematical model and a metaheuristic approach for a memory allocation problem (Q519090) (← links)
- Scatter search for the bandpass problem (Q524910) (← links)
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs (Q528766) (← links)
- Local search for the undirected capacitated arc routing problem with profits (Q531469) (← links)
- Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
- Economic application in a finite capacity multi-channel queue with second optional channel (Q535421) (← links)
- Simulation and optimization of sludge hygienization research irradiator (Q536755) (← links)
- Tabu search -- uncharted domains (Q537593) (← links)
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms (Q541729) (← links)
- Assigning judges to competitions of several rounds using tabu search (Q541731) (← links)
- Adaptive memory programming for matrix bandwidth minimization (Q541991) (← links)
- Tabu search approaches for solving the two-group classification problem (Q541993) (← links)
- Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection (Q541996) (← links)
- Hybrid scatter tabu search for unconstrained global optimization (Q542001) (← links)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- The case for strategic oscillation (Q542006) (← links)
- A special combinatorial problem: pitch arrangement for pneumatic tires (Q543503) (← links)
- Using local search to speed up filtering algorithms for some NP-hard constraints (Q545546) (← links)
- A framework for analyzing sub-optimal performance of local search algorithms (Q548682) (← links)
- A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times (Q552221) (← links)
- ATM VP-based network design (Q596263) (← links)
- Periodic complementary binary sequences and combinatorial optimization algorithms (Q604877) (← links)
- Generating meta-heuristic optimization code using ADATE (Q604934) (← links)
- Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
- The gravity multiple server location problem (Q609819) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- Metaheuristic methods based on tabu search for assigning judges to competitions (Q613764) (← links)
- The combinatorial bandwidth packing problem (Q621657) (← links)
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution (Q621684) (← links)
- A hybrid placement strategy for the three-dimensional strip packing problem (Q621967) (← links)
- A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization (Q621968) (← links)
- An effective multilevel tabu search approach for balanced graph partitioning (Q622162) (← links)
- A heuristic method for non-homogeneous redundancy optimization of series-parallel multi-state systems (Q623310) (← links)
- Composing medical crews with equity and efficiency (Q623772) (← links)
- Analyses of location-price game on networks with stochastic customer behavior and its heuristic algorithm (Q625687) (← links)
- On benefits and drawbacks of aging strategies for randomized search heuristics (Q627105) (← links)
- Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
- Tabu search with path relinking for an integrated production-distribution problem (Q632656) (← links)
- A GRASP with evolutionary path relinking for the truck and trailer routing problem (Q632678) (← links)
- An evolutionary approach for the nurse rerostering problem (Q632687) (← links)
- Restart strategies in optimization: parallel and serial cases (Q632718) (← links)
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
- Hybridizing evolutionary algorithms with variable-depth search to overcome local optima (Q633833) (← links)
- Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness (Q639194) (← links)
