16596 search results - page 224 / 3320 » Generalized Assignment Problems |
158
click to vote
DM
2008
15 years 6 months ago
2008
: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451
117
click to vote
DM
2007
15 years 6 months ago
2007
Recently, Sloane and Sellers solved a certain box stacking problem related to non– squashing partitions. These are defined as partitions n = p1 + p2 + · · · + pk with
149
click to vote
AIR
2004
15 years 6 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
140
click to vote
CPAIOR
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such...