14 search results - page 1 / 3 » Facets of an Assignment Problem with 0-1 Side Constraint |
JCO
2000
13 years 4 months ago
2000
We show that the problem of finding a perfect matching satisfying a single equality constraint with a 0
CP
2006
Springer
13 years 8 months ago
2006
Springer
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
MST
2010
13 years 3 months ago
2010
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...