Solving the family traveling salesman problem (Q723922)
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: Solving the family traveling salesman problem |
scientific article; zbMATH DE number 6910023
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the family traveling salesman problem |
scientific article; zbMATH DE number 6910023 |
Statements
Solving the family traveling salesman problem (English)
0 references
25 July 2018
0 references
combinatorial optimization
0 references
traveling salesman problem
0 references
multicommodity flows
0 references
branch-and-cut
0 references
metaheuristics
0 references
0 references
0.8497124314308167
0 references
0.7521405220031738
0 references
0.7443217039108276
0 references
0.7401736378669739
0 references
