A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2005.02.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2115114028 / rank | |||
Normal rank | |||
Revision as of 23:22, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem |
scientific article |
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
