The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129483659, #quickstatements; #temporary_batch_1724709170382
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1710.08455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lovász--Schrijver Lift-and-Project Procedures on the Dantzig--Fulkerson--Johnson Relaxation of the TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxations and Integrality Gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations of Combinatorial Problems Via Association Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of lower bounds for the symmetric circulant traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Semidefinite Programming Relaxations of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Metric $s$--$t$ Path Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Rounding Approach to the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programs and association schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3511011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New inapproximability bounds for TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing and Adding Edges for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\frac{13}{9}\)-approximation for graphic TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing the Held-Karp TSP bound: A monotonicity property with application / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic analysis, linear programming and branch and bound / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129483659 / rank
 
Normal rank

Latest revision as of 00:14, 27 August 2024

scientific article; zbMATH DE number 6913571
Language Label Description Also known as
English
The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem
scientific article; zbMATH DE number 6913571

    Statements

    The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (English)
    0 references
    0 references
    0 references
    0 references
    3 August 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    traveling salesman problem
    0 references
    approximation algorithms
    0 references
    semidefinite programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references