Pages that link to "Item:Q1342103"

The following pages link to Tabu search performance on the symmetric travelling salesman problem (Q1342103):

Displaying 17 items.

• A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
• A framework for analyzing sub-optimal performance of local search algorithms (Q548682) (← links)
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem (Q918425) (← links)
• Randomized gravitational emulation search algorithm for symmetric traveling salesman problem (Q990542) (← links)
• Optimizing tabu list size for the traveling salesman problem (Q1265842) (← links)
• An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
• An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups (Q1296704) (← links)
• Solving large batches of traveling salesman problems with parallel and distributed computing (Q1652354) (← links)
• Routing heuristics for automated pick and place machines (Q1806942) (← links)
• Guided local search and its application to the traveling salesman problem (Q1808420) (← links)
• A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem (Q1870831) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
• A user's guide to tabu search (Q2366991) (← links)
• (Q4350076) (← links)
• Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)