Jul 22, 2014 · We relax the hard constraints for the bin capacities, and introduce for every bin a cost function that is convex in the total load on this bin.

These costs are subtracted from the profits of assigned items, and the task is to find an assignment maximizing the resulting net profit. We show that even ...

These costs are subtracted from the profits of assigned items, and the task is to find an assignment maximizing the resulting net profit. We show that even ...

We study an extension of the well-known generalized maximum flow problem in which the outflow of an edge is a strictly increasing convex function of its inflow.

May 1, 2023 · The main idea is to find the solution with lowest cost in the set of solutions with maximal number of satisfied tasks (The satisfied tasks is ...

Dec 26, 2023 · OP's problem generalizes the maximum coverage problem, a well-studied problem for which the best poly-time approximation ratio possibly is 1−1/e, unless P=NP.

Missing: Convex | Show results with:Convex

We consider a variant of the generalized assignment problem (GAP) where the items have unit size and the amount of space used in each bin is restricted to ...

The Generalized Assignment Problem (GAP) examines the maximum pro t assignment of n jobs to m agents such that each job is assigned to precisely one agent ...

Nov 1, 2022 · In this study, a new variant of this problem called reliability-oriented GAP is proposed under assignment costs variability.