The traveling salesman problem and its variations.
From MaRDI portal
Publication:2369710
Cited in
(73)- Polynomially solvable cases of the bipartite traveling salesman problem
- Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles
- Cover-encodings of fitness landscapes
- POPMUSIC for the travelling salesman problem
- 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]
- The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
- The distributed Kolkata paise restaurant game
- Euclidean travelling salesman problem with location-dependent and power-weighted edges
- Novel concave hull-based heuristic algorithm for TSP
- Evolutionary operators for the Hamiltonian completion problem
- Efficient optimization of the Held-Karp lower bound
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
- A linearithmic heuristic for the travelling salesman problem
- Exact solution of the soft-clustered vehicle-routing problem
- Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Method of scaling in approximate solution of the traveling salesman problem
- Sufficient and necessary conditions for an edge in the optimal Hamiltonian cycle based on frequency quadrilaterals
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem
- Traveling Salesman Problem and Statistical Physics
- scientific article; zbMATH DE number 6347354 (Why is no real title available?)
- A new formulation and approach for the black and white traveling salesman problem
- Improved approximations for TSP with simple precedence constraints
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
- scientific article; zbMATH DE number 1499191 (Why is no real title available?)
- A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
- Winding indexes of max. and min. Hamiltonians in N-gons
- Improved filtering for weighted circuit constraints
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
- On one routing problem modeling movement in radiation fields
- On routing problem with starting point optimization
- On sequential traversal of sets
- On the route construction in changing environments using solutions of the eikonal equation
- One task of routing jobs in high radiation conditions
- On the question of the optimization of permutations in the problem with dynamic constraints
- Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity
- On one routing task with the optimization of the start-finish point
- To the question of optimization of the starting point in the routing problem with restrictions
- Dynamic programming in the generalized bottleneck problem and the start point optimization
- Improved approximations for ordered TSP on near-metric graphs
- A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths
- Vehicle routing problems with multiple trips
- A new integer programming formulation of the graphical traveling salesman problem
- A new integer programming formulation of the graphical traveling salesman problem
- Solving the clustered traveling salesman problem with ‐relaxed priority rule
- 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
- 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
- Traveling salesman problem with clustering
- Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio
- A bottleneck routing problem with a system of priority tasks
- New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule
- Approximation algorithms with constant factors for a series of asymmetric routing problems
- Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem
- The polynomial randomized algorithm to compute bounded degree graph for TSP based on frequency quadrilaterals
- The routing bottlenecks problem (optimization within zones)
- 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
- Multi-level dynamic programming in routing problems with constraints
- On polynomial kernels for traveling salesperson problem and its generalizations
- Some constructions for solving routing problems using decompositions and transformations of target sets
- A survey on the traveling salesman problem and its variants in a warehousing context
- A \(\frac{4}{3} \)-approximation algorithm for half-integral cycle cut instances of the TSP
- Constraint answer set programming: integrational and translational (or SMT-based) approaches
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)
