Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time (Q4346221)
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: Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time |
scientific article; zbMATH DE number 1042545
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time |
scientific article; zbMATH DE number 1042545 |
Statements
Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time (English)
0 references
3 August 1997
0 references
cutting planes
0 references
traveling salesman
0 references
clique tree inequalities
0 references
bipartition inequalities
0 references
