Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094)
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: Exploiting planarity in separation routines for the symmetric traveling salesman problem |
scientific article; zbMATH DE number 5358784
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploiting planarity in separation routines for the symmetric traveling salesman problem |
scientific article; zbMATH DE number 5358784 |
Statements
Exploiting planarity in separation routines for the symmetric traveling salesman problem (English)
0 references
29 October 2008
0 references
planar graphs
0 references
cutting planes
0 references
0 references
0 references
0 references
0 references
0.9198768
0 references
0.9109957
0 references
0.9054886
0 references
0.8894379
0 references
0.8823142
0 references
0.88150203
0 references
0.8806069
0 references
0.88036156
0 references
0 references
