Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios (Q2294628)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios |
scientific article |
Statements
Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios (English)
0 references
11 February 2020
0 references
scheduling
0 references
versatile TSP approach
0 references
multiple scenarios
0 references
complexity analysis
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
