The following pages link to (Q3931037):
Displayed 35 items.
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- Learning to sparsify travelling salesman problem instances (Q2117244) (← links)
- Two-machine routing open shop: How long is the optimal makespan? (Q2117636) (← links)
- Matroid-based TSP rounding for half-integral solutions (Q2164710) (← links)
- Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows (Q2185641) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- Hard to solve instances of the Euclidean traveling salesman problem (Q2246186) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- Slightly improved upper bound on the integrality ratio for the \(s - t\) path TSP (Q2661533) (← links)
- Improving on best-of-many-Christofides for \(T\)-tours (Q2661569) (← links)
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)
- An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
- Approximation algorithms for multi-vehicle stacker crane problems (Q2687683) (← links)
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio (Q2839206) (← links)
- The travelling salesman and the PQ-tree (Q4645944) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
- SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition (Q5104667) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- O(log m)-approximation for the routing open shop problem (Q5247701) (← links)
- A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem (Q5443376) (← links)
- Reducing Path TSP to TSP (Q5860476) (← links)
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem (Q5863328) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5918417) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)
- A 4/3-approximation algorithm for half-integral cycle cut instances of the TSP (Q6086003) (← links)
- A deterministic better-than-3/2 approximation algorithm for metric TSP (Q6086006) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- The Approximation Ratio of the <i>k</i>-Opt Heuristic for the Euclidean Traveling Salesman Problem (Q6115413) (← links)
- Approximation algorithms with constant factors for a series of asymmetric routing problems (Q6194441) (← links)
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910) (← links)