No label defined (Q5075801)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7525493

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7525493

Statements

scholarly article

0 references

10.4230/LIPIcs.ESA.2019.56

0 references

0 references

0 references

publication date

11 May 2022

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

traveling salesman problem

0 references

subtour elimination relaxation

0 references

integrality gap

0 references

gluing subtours

0 references

MaRDI profile type

MaRDI publication profile

0 references

Integer Programming: Methods, Uses, Computations

0 references

Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices

0 references

Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph

0 references

The saleman's improved tours for fundamental classes

0 references

0 references

On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems

0 references

0 references

The traveling salesman problem in graphs with 3-edge cutsets

0 references

Solution of a Large-Scale Traveling-Salesman Problem

0 references

Matching, Euler tours and the Chinese postman

0 references

Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes

0 references

Shorter tours and longer detours: uniform covers and a bit beyond

0 references

Removing and Adding Edges for the Traveling Salesman Problem

0 references

A Randomized Rounding Approach to the Traveling Salesman Problem

0 references

2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture

0 references

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

0 references

Analyzing the Held-Karp TSP bound: A monotonicity property with application

0 references

Heuristic analysis, linear programming and branch and bound

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5075801

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5075801&oldid=36800411"