A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7212669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the generalized traveling salesman problem with time windows |
scientific article; zbMATH DE number 7212669 |
Statements
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (English)
0 references
17 June 2020
0 references
generalized traveling salesman problem
0 references
time-windows
0 references
branch-and-cut
0 references
delivery options
0 references
trunk delivery
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8208670020103455
0 references
0.8208670020103455
0 references
0.8024995923042297
0 references
0.7875040769577026
0 references
0.7802525758743286
0 references
