We consider non-preemptive scheduling problems on parallel identical mac...
The problem considered is the splittable bin packing with cardinality
co...
We present a new generalization of the bin covering problem that is know...
Makespan minimization on parallel identical machines is a classical and
...
We consider the non-preemptive scheduling problem on identical machines ...
The problem considered is the non-preemptive scheduling of independent j...
We consider the Ordered Open End Bin Packing problem. Items of sizes in
...
We study here several variants of the covariates fine balance problem wh...
In this work, we consider online vector bin packing. It is known that no...
Configuration integer programs (IP) have been key in the design of algor...
We present a new generalization of the extensible bin packing with unequ...
Semi-online models where decisions may be revoked in a limited way have ...
We study the general integer programming problem where the number of
var...
We improve the lower bound on the asymptotic competitive ratio of any on...
We consider a general load balancing problem on parallel machines. Our
m...
The theory of n-fold integer programming has been recently emerging as a...
We consider several previously studied online variants of bin packing an...