We study the Uniform Cardinality Constrained Multiple Knapsack problem (...
We consider the classic budgeted maximum weight independent set (BMWIS)
...
In this paper we derive tight lower bounds resolving the hardness status...
We study budgeted variants of well known maximization problems with mult...
We study the uniform 2-dimensional vector multiple knapsack (2VMK) probl...
We study the budgeted laminar matroid independent set problem. The input...
We give a comprehensive study of bin packing with conflicts (BPC). The i...
We consider spatial voting where candidates are located in the Euclidean...
We study the budgeted versions of the well known matching and matroid
in...
We consider the Bin Packing problem with a partition matroid constraint....
We consider the budgeted matroid independent set problem. The input is a...
We study the 2-Dimensional Vector Bin Packing Problem (2VBP), a
generali...
Many algorithms for maximizing a monotone submodular function subject to...
We study the following variant of the classic bin packing problem. The i...
A multiple knapsack constraint over a set of items is defined by a set o...
We study the problem of maximizing a monotone submodular function subjec...
In this paper we introduce randomized branching as a tool for parameteri...
We study a variant of the generalized assignment problem ( GAP)
with gro...
We revisit a classical scheduling model to incorporate modern trends in ...