Pages that link to "Item:Q1908019"
From MaRDI portal
The following pages link to Worst-case comparison of valid inequalities for the TSP (Q1908019):
Displaying 46 items.
- A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (Q298977) (← links)
- Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370) (← links)
- A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts (Q433114) (← links)
- Spanning closed walks and TSP in 3-connected planar graphs (Q462924) (← links)
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
- The worst case analysis of strong knapsack facets (Q517314) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- The indefinite period traveling salesman problem (Q724039) (← links)
- On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
- Approximating polyhedra with sparse inequalities (Q896289) (← links)
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982) (← links)
- The nonidealness index of rank-ideal matrices (Q987680) (← links)
- Properties of some ILP formulations of a class of partitioning problems (Q1270767) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
- Improved integrality gap upper bounds for traveling salesperson problems with distances one and two (Q1754106) (← links)
- Lift-and-project ranks of the set covering polytope of circulant matrices (Q1759829) (← links)
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
- On the core of traveling salesman games (Q1785381) (← links)
- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes (Q2067494) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering (Q2118143) (← links)
- Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
- The salesman's improved tours for fundamental classes (Q2227538) (← links)
- Integrality gap of the vertex cover linear programming relaxation (Q2294318) (← links)
- On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← 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)
- Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
- Strength of facets for the set covering and set packing polyhedra on circulant matrices (Q2840523) (← links)
- (Q3348715) (← links)
- On the worst case performance of TESSA (Q4230283) (← links)
- The strongest facets of the acyclic subgraph polytope are unknown (Q4645939) (← links)
- A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering (Q5041760) (← links)
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
- TSP Tours in Cubic Graphs: Beyond 4/3 (Q5254089) (← links)
- (Q5743429) (← links)
- (Q5743492) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- A new integer programming formulation of the graphical traveling salesman problem (Q5925646) (← links)
- A review on quantum approximate optimization algorithm and its variants (Q6546559) (← links)
- Easy and hard separation of sparse and dense odd-set constraints in matching (Q6670496) (← links)