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 |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.22.2.257 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.22.2.257 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1990603750 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.22.2.257 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
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
