Bin packing problem (BPP) is one of the fastest-growing research issues within the field of
combinatorial optimization. Over the last years, several studies carried out various BPP …

We improve the lower bound on the asymptotic competitive ratio of any online algorithm for
bin packing to above 1.54278. We demonstrate for the first time the advantage of branching …

The online bin packing problem is a well-known optimization challenge that finds application
in a wide range of real-world scenarios. In the paper, we propose a novel algorithm called …

Balancing electricity demand and supply is one of the most critical tasks that utility firms
perform to maintain grid stability and reduce system cost. Demand-response programs are …

In online load balancing problems, jobs arrive over a list. Upon arrival of a job, the algorithm
is required to assign it immediately and irrevocably to a machine. We consider such a …

We consider several previously studied online variants of bin packing and prove new and
improved lower bounds on the asymptotic competitive ratios for them. For that, we use a …

Makespan minimization on parallel identical machines is a classical and intensively studied
problem in scheduling, and a classic example for online algorithm analysis with Graham's …

In bin packing with cardinality constraints (BPCC), there is an upper bound k≥ 2 on the
number of items that can be packed into each bin, additionally to the standard constraint on …

A lower bound for online rectangle packing | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Search Cart 1.Home 2.Journal of …

We study online algorithms for bin packing and bin covering in two different probabilistic
settings in which the item sizes are drawn randomly or the items are adversarial but arrive in …