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.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:J. Kallrath, S. Nickel
URN (permanent link):urn:nbn:de:hbz:386-kluedo-13141
Serie (Series 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 Publication:2003
Publishing Institute:Fraunhofer-Institut für Techno- und Wirtschaftsmathematik
Tag:batch presorting problem; competetive analysis; logistics; online optimization; polynomial algorithms
Faculties / Organisational entities:Fraunhofer (ITWM)
DDC-Cassification:510 Mathematik

$Rev: 12793 $