Pages that link to "Item:Q912624"
From MaRDI portal
The following pages link to Analyzing the Held-Karp TSP bound: A monotonicity property with application (Q912624):
Displayed 33 items.
- Approximation algorithms for inventory problems with submodular or routing costs (Q344939) (← links)
- Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370) (← links)
- Deterministic sampling algorithms for network design (Q547282) (← links)
- A note on the prize collecting traveling salesman problem (Q687042) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (Q691417) (← links)
- The indefinite period traveling salesman problem (Q724039) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- Analysis of the Held-Karp lower bound for the asymmetric TSP (Q1200770) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- Estimating the Held-Karp lower bound for the geometric TSP (Q1291588) (← links)
- The parsimonious property of cut covering problems and its applications (Q1375118) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- On the core of traveling salesman games (Q1785381) (← links)
- LP-based algorithms for multistage minimization problems (Q2117680) (← links)
- Matroid-based TSP rounding for half-integral solutions (Q2164710) (← links)
- Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
- The salesman's improved tours for fundamental classes (Q2227538) (← links)
- \(\frac{13}{9}\)-approximation for graphic TSP (Q2254507) (← links)
- The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
- An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197) (← links)
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
- (Q2861509) (← links)
- Approximation algorithms for metric tree cover and generalized tour and tree covers (Q3004205) (← links)
- TSP on Cubic and Subcubic Graphs (Q3009751) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
- (Q5075801) (← links)
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q5096584) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
- (Q5743492) (← links)