Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time (Q4346221): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:22, 6 February 2024
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
