TY  - RPRT
A1  - Kallrath, J.
A1  - Nickel, S.
T1  - A Polynomial Case of the Batch Presorting Problem
N2  - This paper presents new theoretical results for a special case of the batch presorting problem (BPSP). We will show tht this case can be solved in polynomial time. Offline and online algorithms are presented for solving the BPSP. Competetive analysis is used for comparing the algorithms.
T3  - Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) - 49 
KW  - batch presorting problem
KW  - online optimization
KW  - competetive analysis
KW  - polynomial algorithms
KW  - logistics
Y1  - 2003
UR  - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1506
UR  - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-13141
ER  -