On the H-free extension complexity of the TSP

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10368356" target="_blank" >RIV/00216208:11320/17:10368356 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/s11590-016-1029-1" target="_blank" >http://dx.doi.org/10.1007/s11590-016-1029-1</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s11590-016-1029-1" target="_blank" >10.1007/s11590-016-1029-1</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On the H-free extension complexity of the TSP

Popis výsledku v původním jazyce

It is known that the extension complexity of the TSP polytope for the complete graph is exponential in n even if the subtour inequalities are excluded. In this article we study the polytopes formed by removing other subsets of facet-defining inequalities of the TSP polytope. In particular, we consider the case when is either the set of blossom inequalities or the simple comb inequalities. These inequalities are routinely used in cutting plane algorithms for the TSP. We show that the extension complexity remains exponential even if we exclude these inequalities. In addition we show that the extension complexity of polytope formed by all comb inequalities is exponential. For our proofs, we introduce a subclass of comb inequalities, called (h, t)-uniform inequalities, which may be of independent interest.

Název v anglickém jazyce

On the H-free extension complexity of the TSP

Popis výsledku anglicky

It is known that the extension complexity of the TSP polytope for the complete graph is exponential in n even if the subtour inequalities are excluded. In this article we study the polytopes formed by removing other subsets of facet-defining inequalities of the TSP polytope. In particular, we consider the case when is either the set of blossom inequalities or the simple comb inequalities. These inequalities are routinely used in cutting plane algorithms for the TSP. We show that the extension complexity remains exponential even if we exclude these inequalities. In addition we show that the extension complexity of polytope formed by all comb inequalities is exponential. For our proofs, we introduce a subclass of comb inequalities, called (h, t)-uniform inequalities, which may be of independent interest.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA15-11559S" target="_blank" >GA15-11559S: Rozšířené formulace polytopů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Optimization Letters

ISSN

1862-4472

e-ISSN

—

Svazek periodika

11

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

11

Strana od-do

445-455

Kód UT WoS článku

000395206800001

EID výsledku v databázi Scopus

—