Pages that link to "Item:Q918425"

The following pages link to Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem (Q918425):

Displaying 32 items.

• Multi-start iterated tabu search for the minimum weight vertex cover problem (Q306082) (← links)
• SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications (Q743971) (← links)
• Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies (Q1037659) (← links)
• Least-cost network topology design for a new service: An application of tabu search (Q1179745) (← links)
• Experimental analysis of simulated annealing based algorithms for the layout problem (Q1197688) (← links)
• Optimizing tabu list size for the traveling salesman problem (Q1265842) (← links)
• A simple tabu search method to solve the mixed-integer linear bilevel programming problem (Q1266629) (← links)
• Parallel processing for difficult combinatorial optimization problems (Q1268289) (← links)
• The life span method -- a new variant of local search (Q1275844) (← links)
• An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
• Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
• Heuristics for biquadratic assignment problems and their computational comparison (Q1388822) (← links)
• A tabu search algorithm for the routing and capacity assignment problem in computer networks (Q1781553) (← links)
• Two simulated annealing optimization schemas for rational Bézier curve fitting in the presence of noise (Q1793635) (← links)
• Solving the medium newspaper production/distribution problem (Q1809799) (← links)
• Clustering categorical data sets using tabu search techniques (Q1856701) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements (Q1908996) (← links)
• Ejection chains, reference structures and alternating path methods for traveling salesman problems (Q1917273) (← links)
• Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements (Q1919844) (← links)
• Genetic algorithms for the traveling salesman problem (Q1919848) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Parallel local search (Q1922627) (← links)
• Multiperiod multi traveling salesmen problem considering time window constraints with an application to a real world case (Q2005780) (← links)
• An iterative three-component heuristic for the team orienteering problem with time windows (Q2255940) (← links)
• A user's guide to tabu search (Q2366991) (← links)
• Hashing vectors for tabu search (Q2366997) (← links)
• Part type selection problem in flexible manufacturing systems: Tabu search algorithms (Q2367007) (← links)
• Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem (Q5011679) (← links)
• Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling (Q5426585) (← links)
• Optimizing the system of virtual paths by tabu search. (Q5928385) (← links)
• Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs (Q5953158) (← links)