A new class of cutting planes for the symmetric travelling salesman problem (Q1107441)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new class of cutting planes for the symmetric travelling salesman problem |
scientific article; zbMATH DE number 4064764
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new class of cutting planes for the symmetric travelling salesman problem |
scientific article; zbMATH DE number 4064764 |
Statements
A new class of cutting planes for the symmetric travelling salesman problem (English)
0 references
1988
0 references
A class of inequalities, called ``star-constraints'', is introduced and shown to yield valid inequalities for the classical symmetric as well as the graphical travelling salesman polytope. The class contains the comb-, path-, bicycle- and wheelbarrow-inequalities as special cases. It is, however, disinct from the clique-tree inequalities. Sufficient conditions are stated under which these star-constraints define facets of the graphical travelling salesman polytope.
0 references
star-constraints
0 references
valid inequalities
0 references
graphical travelling salesman polytope
0 references
facets
0 references
0 references
0.9054886
0 references
0.89593047
0 references
0.8931902
0 references
0.88978225
0 references
0.88679266
0 references
0.88535947
0 references
0.88069546
0 references
0.88052464
0 references
