Learn More
A signicant aspect of the transport companies is to decrease their operational costs. This can be done by optimizing their public transport services. Usually the operational cost of the transportation consists of the cost of the used vehicles and their drivers. It is a very complex task to solve such optimization problems and usually the optimized planning(More)
In 1996 Ivkovič and Lloyd [A fundamental restriction on fully dynamic maintenance of bin packing, Inform. on the asymptotic worst-case ratio for so-called fully dynamic bin packing algorithms, where the number of repackable items in each step is restricted by a constant. In this paper we improve this result to about 1.3871. We present our proof for a(More)
In online bin packing problems, items of sizes in [0, 1] are to be partitioned into subsets of total size at most 1, called bins. We introduce a new variant where items are of two types, called black and white, and the item types must alternate in each bin, that is, two items of the same type cannot be assigned consecutively into a bin. This variant(More)
Text{compression problems are considered where substrings are substituted by code{ words according to a static dictionary such that the original text is encoded by a shorter code sequence. We introduce a new eecient on{line heuristic which locally maximizes the com-paction ratio. The worst{case behaviour of this fractional greedy heuristic is investigated(More)
In the area of optimization of public transportation there are several methods for modeling and solving vehicle and driver scheduling problems. We designed a sequential heuristic method for solving the combined (vehicle and driver scheduling) problem. Our model is based on a modification of the vehicle schedules to satisfy driver requirements. We introduced(More)