A Polynomial Case of the Batch Presorting Problem

• 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.

Additional Services

Author: J. Kallrath, S. Nickel urn:nbn:de:hbz:386-kluedo-13141 Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) (49) Report English 2003 2003 Fraunhofer-Institut für Techno- und Wirtschaftsmathematik batch presorting problem; competetive analysis; logistics; online optimization; polynomial algorithms Fraunhofer (ITWM) 510 Mathematik

$Rev: 12793$