The traveling salesman problem and its variations.

zbMATH Open1113.90134MaRDI QIDQ2369710FDOQ2369710

Authors:

Publication date: 19 June 2007

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

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

Cited In (67)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369710)