A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262)
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 7354503
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints |
scientific article; zbMATH DE number 7354503 |
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
0.9402333
0 references
0.89859414
0 references
0.8818261
0 references
0.8739276
0 references
0.8726442
0 references
0.8703024
0 references
0.86954135
0 references
