Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918581): 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.1007/s10878-022-00955-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4310276329 / rank | |||
Normal rank | |||
Revision as of 23:08, 19 March 2024
scientific article; zbMATH DE number 7625354
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
