One fits all: a flexible branch-and-cut algorithm for picker routing in scattered storage warehouses
Crossref DOI link: https://doi.org/10.1007/s00291-025-00845-8
Published Online: 2026-01-14
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Wildt, Constantin
Weidinger, Felix https://orcid.org/0000-0002-1814-397X
Funding for this research was provided by:
Technische Universität Darmstadt
Text and Data Mining valid from 2026-01-14
Version of Record valid from 2026-01-14
Article History
Received: 8 May 2025
Accepted: 16 December 2025
First Online: 14 January 2026