Bi-Criteria Multiple Knapsack Problem with Grouped Items

by   Francisco Castillo-Zunino, et al.

The multiple knapsack problem with grouped items aims to maximize rewards by assigning groups of items among multiple knapsacks, considering knapsack capacities. Either all items in a group are assigned or none at all. We propose algorithms which guarantee that rewards are not less than the optimal solution, with a bound on exceeded knapsack capacities. To obtain capacity-feasible solutions, we propose a binary-search heuristic combined with these algorithms. We test the performance of the algorithms and heuristics in an extensive set of experiments on randomly generated instances and show they are efficient and effective, i.e., they run reasonably fast and generate good quality solutions.



page 1

page 2

page 3

page 4


Matchings with Group Fairness Constraints: Online and Offline Algorithms

We consider the problem of assigning items to platforms in the presence ...

Efficient Nearly-Fair Division with Capacity Constraints

We consider the problem of fairly and efficiently matching agents to ind...

Optimizing Revenue while showing Relevant Assortments at Scale

Scalable real-time assortment optimization has become essential in e-com...

A Cooperative Coordination Solver for Travelling Thief Problems

In the travelling thief problem (TTP), a thief undertakes a cyclic tour ...

Group-matching algorithms for subjects and items

We consider the problem of constructing matched groups such that the res...

A Minimum-Risk Dynamic Assignment Mechanism Along with an Approximation, Heuristics, and Extension from Single to Batch Assignments

In the classic linear assignment problem, items must be assigned to agen...

In-Route Task Selection in Crowdsourcing

One important problem in crowdsourcing is that of assigning tasks to wor...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.