A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints |
scientific article |
Statements
A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (English)
0 references
3 June 2021
0 references
traveling salesman
0 references
profitable tour problem
0 references
time-dependent travel times
0 references
integer programming
0 references
branch and cut
0 references
0 references
0 references
0 references
0 references
0 references
