Crossmark

A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses

Crossref DOI link: https://doi.org/10.1007/s10951-024-00811-2

Published Online: 2024-07-16

Published Print: 2024-08

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Barbato, Michele https://orcid.org/0000-0002-8521-896X
Ceselli, Alberto https://orcid.org/0000-0002-0983-2706
Righini, Giovanni https://orcid.org/0000-0001-9830-7454
Funding

Funding for this research was provided by:

Regione Lombardia (E97F17000000009)
License Information

Text and Data Mining valid from 2024-07-16

Version of Record valid from 2024-07-16
More Information

Article History

Accepted: 29 April 2024

First Online: 16 July 2024