A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108)
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-and-cut algorithm for the profitable windy rural postman problem |
scientific article; zbMATH DE number 6635845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the profitable windy rural postman problem |
scientific article; zbMATH DE number 6635845 |
Statements
A branch-and-cut algorithm for the profitable windy rural postman problem (English)
0 references
7 October 2016
0 references
windy rural postman problem
0 references
arc routing
0 references
profits
0 references
branch-and-cut algorithm
0 references
polyhedron
0 references
0 references
0 references
0 references
0.8610863089561462
0 references
0.8568388223648071
0 references
0.8529476523399353
0 references
0.851797342300415
0 references
0.8516935706138611
0 references
