Worst-case analysis of a new heuristic for the travelling salesman problem
From MaRDI portal
Publication:2120141
Recommendations
Cites work
Cited in
(81)- Move schedules: fast persistence computations in coarse dynamic settings
- Lower bounds of functions on finite abelian groups
- Improved approximation algorithms for multidepot capacitated vehicle routing
- The heterogeneous rooted tree cover problem
- An improved approximation guarantee for prize-collecting TSP
- Time complexity of the analyst's traveling salesman algorithm
- Heuristic sequencing methods for time optimal tracking of nested, open and closed paths
- A one pass streaming algorithm for finding Euler tours
- An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs
- Heuristic Hungarian method to solve the traveling salesman problem
- Approximation algorithms with constant factors for a series of asymmetric routing problems
- Spanning closed walks and TSP in 3-connected planar graphs
- Ordered scheduling in control-flow distributed transactional memory
- The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem
- On minimum spanning trees for random Euclidean bipartite graphs
- SFCDecomp: multicriteria optimized tool path planning in 3D printing using space-filling curve based domain decomposition
- Maximizing energy efficiency for charger scheduling of WRSNs
- The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
- Novel concave hull-based heuristic algorithm for TSP
- From symmetry to asymmetry: generalizing TSP approximations by parametrization
- Minimizing data collection latency with unmanned aerial vehicle in wireless sensor networks
- Fat computational complexity and heuristic design for the TSP
- DNA origami and the complexity of Eulerian circuits with turning costs
- One-to-many-to-one single vehicle pickup and delivery problems
- In memoriam: Nicos Christofides (1942--2019)
- Approximating the Minimum Tour Cover with a Compact Linear Program
- scientific article; zbMATH DE number 91020 (Why is no real title available?)
- A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring
- On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices
- Simple algorithms for gilmore-gomory's traveling salesman and related problems
- Optimizing Read Reversals for Sequence Compression
- Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length
- On the metric \(s\)-\(t\) path traveling salesman problem
- Metric violation distance: hardness and approximation
- The traveling salesman problem: An overview of exact and approximate algorithms
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Weighted amplifiers and inapproximability results for travelling salesman problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Approximating minimum-cost connected \(T\)-joins
- The traveling-salesman problem
- The parameterized complexity of local search for TSP, more refined
- TSP tours in cubic graphs: beyond 4/3
- On the approximability of the maximum common subgraph problem
- An approximation algorithm for the TSP
- The power of recourse for online MST and TSP
- On global integer extrema of real-valued box-constrained multivariate quadratic functions
- The travelling salesman and the PQ-tree
- scientific article; zbMATH DE number 3918121 (Why is no real title available?)
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- Algorithms for Euclidean degree bounded spanning tree problems
- An approximation algorithm for the clustered path travelling salesman problem
- scientific article; zbMATH DE number 3848953 (Why is no real title available?)
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
- Trajectory optimization of laser-charged UAV to minimize the average age of information for wireless rechargeable sensor network
- \(\frac{13}{9}\)-approximation for graphic TSP
- A minimum spanning tree based heuristic for the travelling salesman tour
- A 3/2-Approximation for the Metric Many-Visits Path TSP
- Computing in combinatorial optimization
- Online covering salesman problem
- A greedy algorithm for finding maximum spanning trees in infinite graphs
- An approximation algorithm for a general class of parametric optimization problems
- On the Hardness of Reoptimization
- Strategies for generating well centered tetrahedral meshes on industrial geometries
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
- Heuristics and bounds for the travelling salesman location problem on the plane
- A partitioning column approach for solving LED sorter manipulator path planning problems
- On the Metric $s$--$t$ Path Traveling Salesman Problem
- Tour recommendation for groups
- scientific article; zbMATH DE number 4199979 (Why is no real title available?)
- Approximation Algorithms for Barrier Sweep Coverage
- Improving TSP tours using dynamic programming over tree decompositions
- Approximation algorithms for solving the heterogeneous Chinese postman problem
- Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems
- Characterizing the integrality gap of the subtour LP for the circulant traveling salesman problem
- Scheduling ships movements within a canal harbor
- Matroid-based TSP rounding for half-integral solutions
- The simultaneous semi-random model for TSP
- Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization
- Continuous relaxations for the traveling salesman problem
- Routing under uncertainty: the \textit{a priori} traveling repairman problem
This page was built for publication: Worst-case analysis of a new heuristic for the travelling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2120141)
