A cutting plane approach to solve the railway traveling salesman problem (Q3392397)
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: A cutting plane approach to solve the railway traveling salesman problem |
scientific article; zbMATH DE number 5595419
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cutting plane approach to solve the railway traveling salesman problem |
scientific article; zbMATH DE number 5595419 |
Statements
14 August 2009
0 references
generalized traveling salesman problem
0 references
integer programming
0 references
cutting planes
0 references
0.8077117204666138
0 references
0.8064407706260681
0 references
0.8064407706260681
0 references
0.7844521403312683
0 references
0.7721503376960754
0 references
