The following pages link to (Q4461912):
Displaying 25 items.
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices (Q623315) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- Domination analysis for minimum multiprocessor scheduling (Q858313) (← links)
- A memetic algorithm for the generalized traveling salesman problem (Q968380) (← links)
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)
- Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- When the greedy algorithm fails (Q2386197) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- Solving an urban waste collection problem using ants heuristics (Q2475858) (← links)
- Solution of real-world postman problems (Q2482818) (← links)
- Determination of the candidate arc set for the asymmetric traveling salesman problem (Q2485161) (← links)
- Iterative patching and the asymmetric traveling salesman problem (Q2494813) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
- Metaheuristics for the Asymmetric Hamiltonian Path Problem (Q3075277) (← links)
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order (Q5505660) (← links)
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
