Separating maximally violated comb inequalities in planar graphs (Q4645943)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7000369
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Separating maximally violated comb inequalities in planar graphs |
scientific article; zbMATH DE number 7000369 |
Statements
Separating maximally violated comb inequalities in planar graphs (English)
0 references
11 January 2019
0 references
planar graph
0 references
travel salesman problem
0 references
Hamiltonian cycle
0 references
fractional solution
0 references
separation algorithm
0 references
0.9933941960334778
0 references
0.9933941960334778
0 references
0.9246435165405272
0 references
