An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:47, 5 March 2024
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
