A new mathematical programming formulation for the single-picker routing problem (Q323113)
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: A new mathematical programming formulation for the single-picker routing problem |
scientific article; zbMATH DE number 6636373
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new mathematical programming formulation for the single-picker routing problem |
scientific article; zbMATH DE number 6636373 |
Statements
A new mathematical programming formulation for the single-picker routing problem (English)
0 references
7 October 2016
0 references
traveling salesman
0 references
order picking
0 references
picker routing
0 references
0 references
0 references
0 references
0 references
0 references
0.8086783289909363
0 references
0.8048068284988403
0 references
0.7991881966590881
0 references
0.7946795225143433
0 references
