Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6168929)
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: Approximation algorithms for the min-max mixed rural postmen cover problem and its variants |
scientific article; zbMATH DE number 7724731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the min-max mixed rural postmen cover problem and its variants |
scientific article; zbMATH DE number 7724731 |
Statements
Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (English)
0 references
10 August 2023
0 references
approximation algorithm
0 references
mixed Chinese postman problem
0 references
mixed rural postman problem
0 references
stacker crane problem
0 references
postmen cover problem
0 references
0 references
