12 search results - page 1 / 3 » Efficient Algorithms for Constraint Description Problems ove... |
CADE
2004
Springer
14 years 6 months ago
2004
Springer
MST
2008
13 years 5 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
EAAI
2008
13 years 5 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
INFORMS
1998
13 years 5 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
CONSTRAINTS
2010
13 years 5 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...