Pages that link to "Item:Q3169005"

The following pages link to Finding the Exact Integrality Gap for Small Traveling Salesman Problems (Q3169005):

Displaying 9 items.

• Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370) (← links)
• On the core of traveling salesman games (Q1785381) (← links)
• Approximating TSP walks in subcubic graphs (Q2101165) (← links)
• The salesman's improved tours for fundamental classes (Q2227538) (← links)
• The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
• Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
• TSP on Cubic and Subcubic Graphs (Q3009751) (← links)
• Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
• On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)