We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G = (A P, E) with weights on the edges in E, and with lower and upper quotas on the vertices in P.We seek a maximum weight many-to-one matching satisfying two sets of...

Stable flows generalize the well-known concept of stable matchings to markets in which transactions may involve several agents, forwarding flow from one to another. An instance of the problem consists of a capacitated directed network in which vertices express their preferences over their...

We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G = (A P, E) with weights on the edges in E, and with lower and upper quotas on the vertices in P.We seek a maximum weight many-to-one matching satisfying two sets of...

Stable flows generalize the well-known concept of stable matchings to markets in which transactions may involve several agents, forwarding flow from one to another. An instance of the problem consists of a capacitated directed network in which vertices express their preferences over their...

The stable allocation problem is one of the broadest extensions of the well-known stable marriage problem. In an allocation problem, edges of a bipartite graph have capacities and vertices have quotas to fill. Here we investigate the case of uncoordinated processes in stable allocation...

The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cost for opening a facility and also for connecting a customer to a facility, the goal being to minimize the total cost....

We consider the problem of scheduling unrelated parallel machines subject to release dates so as to minimize the total weighted completion time of jobs. The main contribution of this paper is a probably good convex quadratic programming relaxation of strongly polynomial size for this problem....

We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the strong sense. The best approximation result known so far was a 1/2(1 + √2)-approximation algorithm that has been...