Efficient algorithms for travelling salesman problems arising in warehouse order picking (Q2788859)
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: Efficient algorithms for travelling salesman problems arising in warehouse order picking |
scientific article; zbMATH DE number 6543835
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for travelling salesman problems arising in warehouse order picking |
scientific article; zbMATH DE number 6543835 |
Statements
22 February 2016
0 references
order batching
0 references
order picking
0 references
picker routing
0 references
travelling salesman problem
0 references
minimum spanning tree problem
0 references
0 references
Efficient algorithms for travelling salesman problems arising in warehouse order picking (English)
0 references
