Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918581)
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 7625354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for some min-max and minimum stacker crane cover problems |
scientific article; zbMATH DE number 7625354 |
Statements
Approximation algorithms for some min-max and minimum stacker crane cover problems (English)
0 references
29 November 2022
0 references
approximation algorithm
0 references
stacker crane problem
0 references
rural postman problem
0 references
traveling salesman problem
0 references
stacker crane cover
0 references
0 references
0 references
0.8597749471664429
0 references
0.8278812170028687
0 references
0.8167533278465271
0 references
0.8125749230384827
0 references
0.8089482188224792
0 references
