An integer programming approach for the rural postman problem with time dependent travel times (Q3087968)
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 5940029
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An integer programming approach for the rural postman problem with time dependent travel times |
scientific article; zbMATH DE number 5940029 |
Statements
An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times (English)
0 references
17 August 2011
0 references
time dependent
0 references
rural postman problem
0 references
polyhedral combinatorics
0 references
valid inequalities
0 references
arc-path formulation
0 references
0.9547198414802552
0 references
0.8822749257087708
0 references
0.8407244086265564
0 references
0.80313640832901
0 references
0.7965661287307739
0 references
