Solving the large-scale min-max \(k\)-rural postman problem for snow plowing (Q6496352)
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: Solving the large-scale min-max \(k\)-rural postman problem for snow plowing |
scientific article; zbMATH DE number 7841987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the large-scale min-max \(k\)-rural postman problem for snow plowing |
scientific article; zbMATH DE number 7841987 |
Statements
Solving the large-scale min-max \(k\)-rural postman problem for snow plowing (English)
0 references
3 May 2024
0 references
winter maintenance
0 references
adaptive large neighborhood search
0 references
rural postman problem
0 references
large-scale real-life applications
0 references
arc grouping
0 references
network topology
0 references
0 references
