140 search results - page 19 / 28 » Rewriting Numeric Constraint Satisfaction Problems for Consi... |
AIR
1999
13 years 7 months ago
1999
The timetabling problem consists in scheduling a sequence of lectures between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints...
HEURISTICS
2002
13 years 7 months ago
2002
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
EOR
2008
13 years 7 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
CP
2001
Springer
14 years 2 days ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
TACAS
2010
Springer
14 years 20 days ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...