Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:28, 10 July 2024
scientific article; zbMATH DE number 7826814
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for the min-max mixed rural postmen cover problem and its variants |
scientific article; zbMATH DE number 7826814 |
Statements
Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (English)
0 references
2 April 2024
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
0 references
