9 search results - page 2 / 2 » On Decomposing Knapsack Constraints for Length-Lex Bounds Co... |
CPAIOR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ...
CP
2004
Springer
13 years 10 months ago
2004
Springer
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints in conjunction with cardi...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...