Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time (Q4346221): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.22.2.257 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.22.2.257 / rank | |||
Normal rank | |||
Latest revision as of 09:51, 31 December 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
