16596 search results - page 211 / 3320 » Generalized Assignment Problems |
142
Voted
DAM
2011
14 years 9 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
131
Voted
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
124
Voted
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since...
150
Voted
CP
2006
Springer
15 years 6 months ago
2006
Springer
We describe some new propagators for breaking symmetries in constraint satisfaction problems. We also introduce symmetry breaking constraints to deal with symmetries acting simulta...
131
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Given a weighted graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtain a...