A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041)
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 5037987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem |
scientific article; zbMATH DE number 5037987 |
Statements
A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (English)
0 references
30 June 2006
0 references
arc routing
0 references
Chinese postman problem
0 references
tabu search
0 references
min-max optimization
0 references
0 references
0 references
0 references
0.8176867365837097
0 references
0.8170397877693176
0 references
0.81451416015625
0 references
