scientific article; zbMATH DE number 2064413
From MaRDI portal
Publication:4461912
zbMath1113.90355MaRDI QIDQ4461912
Gregory Gutin, Anders Yeo, L. A. McGeoch, Alexey Zverovich, Weixiong Zhang, David S. Johnson
Publication date: 18 May 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem, Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP, When the greedy algorithm fails, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, Domination analysis for minimum multiprocessor scheduling, The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems, Large multiple neighborhood search for the soft-clustered vehicle-routing problem, On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices, Traveling salesman problem heuristics: leading methods, implementations and latest advances, Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times, Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs, Experimental analysis of heuristics for the bottleneck traveling salesman problem, Solving an urban waste collection problem using ants heuristics, Large multiple neighborhood search for the clustered vehicle-routing problem, Solution of real-world postman problems, Measuring instance difficulty for combinatorial optimization problems, A memetic algorithm for the generalized traveling salesman problem, Determination of the candidate arc set for the asymmetric traveling salesman problem, Iterative patching and the asymmetric traveling salesman problem, Metaheuristics for the Asymmetric Hamiltonian Path Problem, Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems, Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order, A review of TSP based approaches for flowshop scheduling
Uses Software
