Pages that link to "Item:Q2120141"
From MaRDI portal
The following pages link to Worst-case analysis of a new heuristic for the travelling salesman problem (Q2120141):
Displaying 50 items.
- A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring (Q281797) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- On global integer extrema of real-valued box-constrained multivariate quadratic functions (Q1680502) (← links)
- Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length (Q1686555) (← links)
- Tour recommendation for groups (Q1741326) (← links)
- Online covering salesman problem (Q1743496) (← links)
- DNA origami and the complexity of Eulerian circuits with turning costs (Q2003481) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- A greedy algorithm for finding maximum spanning trees in infinite graphs (Q2102829) (← links)
- Approximation algorithms for solving the heterogeneous Chinese postman problem (Q2106868) (← links)
- In memoriam: Nicos Christofides (1942--2019) (Q2120131) (← links)
- Metric violation distance: hardness and approximation (Q2134750) (← links)
- Novel concave hull-based heuristic algorithm for TSP (Q2139346) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
- Maximizing energy efficiency for charger scheduling of WRSNs (Q2151367) (← links)
- An approximation algorithm for a general class of parametric optimization problems (Q2156299) (← links)
- Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
- The simultaneous semi-random model for TSP (Q2164675) (← links)
- Matroid-based TSP rounding for half-integral solutions (Q2164710) (← links)
- \(\frac{13}{9}\)-approximation for graphic TSP (Q2254507) (← links)
- Minimizing data collection latency with unmanned aerial vehicle in wireless sensor networks (Q2279744) (← links)
- Continuous relaxations for the traveling salesman problem (Q2296989) (← links)
- Scheduling ships movements within a canal harbor (Q2317619) (← links)
- Approximating minimum-cost connected \(T\)-joins (Q2345942) (← links)
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications (Q2420657) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- A partitioning column approach for solving LED sorter manipulator path planning problems (Q2673413) (← links)
- Trajectory optimization of laser-charged UAV to minimize the average age of information for wireless rechargeable sensor network (Q2682914) (← links)
- The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme (Q2817793) (← links)
- Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries (Q2948920) (← links)
- Approximating the Minimum Tour Cover with a Compact Linear Program (Q3192959) (← links)
- Routing Under Uncertainty: The a priori Traveling Repairman Problem (Q3453299) (← links)
- One-to-Many-to-One Single Vehicle Pickup and Delivery Problems (Q3564364) (← links)
- On the Metric $s$--$t$ Path Traveling Salesman Problem (Q4641715) (← links)
- The travelling salesman and the PQ-tree (Q4645944) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- On the approximability of the maximum common subgraph problem (Q5096796) (← links)
- SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition (Q5104667) (← links)
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (Q5111717) (← links)
- Algorithms for Euclidean Degree Bounded Spanning Tree Problems (Q5197492) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
- An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs (Q5220466) (← links)
- TSP Tours in Cubic Graphs: Beyond 4/3 (Q5254089) (← links)
- Optimizing Read Reversals for Sequence Compression (Q5283828) (← links)
- Approximation Algorithms for Barrier Sweep Coverage (Q5384125) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)
- On the Metric $s$--$t$ Path Traveling Salesman Problem (Q5499730) (← links)
- (Q5743429) (← links)
- The Power of Recourse for Online MST and TSP (Q5890825) (← links)
