Exact algorithms for the equitable traveling salesman problem (Q1753595)
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: Exact algorithms for the equitable traveling salesman problem |
scientific article; zbMATH DE number 6875877
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for the equitable traveling salesman problem |
scientific article; zbMATH DE number 6875877 |
Statements
Exact algorithms for the equitable traveling salesman problem (English)
0 references
29 May 2018
0 references
combinatorial optimization
0 references
traveling salesman problem
0 references
branch-and-bound
0 references
branch-and-price
0 references
exact algorithms
0 references
0 references
0 references
0 references
0 references
0.7755813598632812
0 references
0.7497130632400513
0 references
0.7495600581169128
0 references
0.7455775737762451
0 references
0.739743173122406
0 references
