Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks (Q2011598)
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 traveling salesman problem with time windows through dynamically generated time-expanded networks |
scientific article; zbMATH DE number 6756591
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks |
scientific article; zbMATH DE number 6756591 |
Statements
Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks (English)
0 references
4 August 2017
0 references
traveling salesman problem
0 references
time windows
0 references
time-expanded networks
0 references
mixed integer programming
0 references
dynamic discretization discovery
0 references
0 references
0 references
0.8223972916603088
0 references
0.7936389446258545
0 references
0.7896184921264648
0 references
0.788032591342926
0 references
