An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An integer programming approach for the Chinese postman problem with time-dependent travel time |
scientific article |
Statements
An integer programming approach for the Chinese postman problem with time-dependent travel time (English)
0 references
11 May 2015
0 references
time-dependent
0 references
Chinese postman problem
0 references
polyhedral combinatorics
0 references
valid inequalities
0 references
cycle-path formulation
0 references
0 references
0 references
0 references
