A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem (Q2811322)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem |
scientific article; zbMATH DE number 6591803
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem |
scientific article; zbMATH DE number 6591803 |
Statements
10 June 2016
0 references
rural postman problem
0 references
windy rural postman problem
0 references
multivehicle
0 references
column generation
0 references
branch-and-price
0 references
cutting planes
0 references
0 references
0 references
0 references
0.9518825
0 references
0.95174825
0 references
0.9451962
0 references
0.92372507
0 references
0.91792095
0 references
0.90734386
0 references
0.8905947
0 references
0.8882128
0 references
0.88067317
0 references
A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem (English)
0 references
