Separating maximally violated comb inequalities in planar graphs (Q2757587)
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 maximally violated comb inequalities in planar graphs |
scientific article; zbMATH DE number 1677086
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating maximally violated comb inequalities in planar graphs |
scientific article; zbMATH DE number 1677086 |
Statements
26 November 2001
0 references
traveling salesman problem
0 references
comb inequalities
0 references
separation algorithms
0 references
cutting planes
0 references
Separating maximally violated comb inequalities in planar graphs (English)
0 references
