An ILP-refined tabu search for the directed profitable rural postman problem (Q406489)
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 6341238
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An ILP-refined tabu search for the directed profitable rural postman problem |
scientific article; zbMATH DE number 6341238 |
Statements
An ILP-refined tabu search for the directed profitable rural postman problem (English)
0 references
8 September 2014
0 references
selective arc routing problems
0 references
heuristic algorithms
0 references
ILP-refinement procedures
0 references
0 references
0 references
0.8066233992576599
0 references
0.8018653988838196
0 references
0.7918233871459961
0 references
0.7713066339492798
0 references
0.7650381326675415
0 references
