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.
Download full text files
Additional Services
| Author: | J. Kallrath, S. Nickel |
|---|---|
| URN: | urn:nbn:de:hbz:386-kluedo-13141 |
| Series (Serial Number): | Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) (49) |
| Document Type: | Report |
| Language of publication: | English |
| Year of Completion: | 2003 |
| Year of first Publication: | 2003 |
| Publishing Institution: | Fraunhofer-Institut für Techno- und Wirtschaftsmathematik |
| Date of the Publication (Server): | 2004/02/10 |
| Tag: | batch presorting problem; competetive analysis; logistics; online optimization; polynomial algorithms |
| Faculties / Organisational entities: | Fraunhofer (ITWM) |
| DDC-Cassification: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
| Licence (German): |  Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |