In this work we investigate the online k-server problem where each request has a penalty
and it is allowed to reject the requests. The goal is to minimize the sum of the total distance …

We deal with a new problem that we call Bin Packing/Covering with Delivery. Mainly we
mean under this expression that we look for not only a good, but a “good and fast” packing …

In the communication aspect of a computer network, data are sent by packets. If the
communication channel is not completely safe, then the arrival of the packets must be …

In on-line computation an algorithm must make its decisions based only on past events
without secure information on future. Such algorithms are called on-line algorithms. On-line …

This paper proposes and evaluates solutions for an online clustering problem and gives a
mathematical model for it. The problem at hand occurs often in the fusion of data streams for …

This paper deals with multiprocessor scheduling with rejection technique where each job is
provided with processing time and a given penalty cost. If the job satisfies the acceptance …

" Az értekezés tartalmazza az új feladathoz tartozó offl ine (elöore ismert az L lista, amely
szerint a tárgyak érkeznek) optimum meghatározásával kapcsolatos állításokat; lényegében …

The first part of the PhD dissertation contains a new, combined NP% hard problem that is
connected to bin packing problems and also to a transportation or scheduling problem." The …

In the first part of the dissertation we discuss a combined problem that is connected to bin
packing problems and delivery or scheduling problems, at the same time. For further …

Disszertációmban a 2006 óta, az on-line klaszterezési és ütemezési problémák területén
végzett kutatásaim eredményeit gyűjtöttem össze. Munkatársaimmal ezeken a területeken …