The traveling salesman problem and its variations.

zbMath1113.90134MaRDI QIDQ2369710

No author found.

Publication date: 19 June 2007

Published in: Combinatorial Optimization (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Related Items (60)

Generating subtour elimination constraints for the TSP from pure integer solutions ⋮ On sequential traversal of sets ⋮ Euclidean travelling salesman problem with location-dependent and power-weighted edges ⋮ Novel concave hull-based heuristic algorithm for TSP ⋮ A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths ⋮ On the route construction in changing environments using solutions of the eikonal equation ⋮ One task of routing jobs in high radiation conditions ⋮ A new formulation and approach for the black and white traveling salesman problem ⋮ Evolutionary operators for the Hamiltonian completion problem ⋮ Method of scaling in approximate solution of the traveling salesman problem ⋮ A model variant of the problem about radiation sources utilization (iterations based on optimization insertions) ⋮ Efficient optimization of the Held-Karp lower bound ⋮ Large multiple neighborhood search for the soft-clustered vehicle-routing problem ⋮ Traveling salesman problem with clustering ⋮ Improved approximations for TSP with simple precedence constraints ⋮ Solving the clustered traveling salesman problem with ‐relaxed priority rule ⋮ Sufficient and necessary conditions for an edge in the optimal Hamiltonian cycle based on frequency quadrilaterals ⋮ A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM ⋮ On the longest flip sequence to untangle segments in the plane ⋮ Winding indexes of Max. and Min. Hamiltonians in N-Gons ⋮ Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds ⋮ Minimax routing problem with a system of priority tasks ⋮ Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals ⋮ Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio ⋮ A bottleneck routing problem with a system of priority tasks ⋮ Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing ⋮ New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule ⋮ Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem ⋮ On the question of the optimization of permutations in the problem with dynamic constraints ⋮ Approximation algorithms with constant factors for a series of asymmetric routing problems ⋮ Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity ⋮ Vehicle routing problems with multiple trips ⋮ On one routing task with the optimization of the start-finish point ⋮ Improved filtering for weighted circuit constraints ⋮ Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees ⋮ To the question of optimization of the starting point in the routing problem with restrictions ⋮ On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms ⋮ A linearithmic heuristic for the travelling salesman problem ⋮ POPMUSIC for the travelling salesman problem ⋮ Polynomially solvable cases of the bipartite traveling salesman problem ⋮ Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles ⋮ Solving the traveling repairman problem with profits: a novel variable neighborhood search approach ⋮ Geometric and LP-based heuristics for angular travelling salesman problems in the plane ⋮ Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] ⋮ Exact solution of the soft-clustered vehicle-routing problem ⋮ Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics ⋮ Cover-encodings of fitness landscapes ⋮ The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem ⋮ A new integer programming formulation of the graphical traveling salesman problem ⋮ On one routing problem modeling movement in radiation fields ⋮ Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters ⋮ A new integer programming formulation of the graphical traveling salesman problem ⋮ Dynamic programming in the generalized bottleneck problem and the start point optimization ⋮ Unnamed Item ⋮ ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints ⋮ Improved approximations for ordered TSP on near-metric graphs ⋮ The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem ⋮ The distributed Kolkata paise restaurant game

This page was built for publication: The traveling salesman problem and its variations.