CP
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we present a Lagrange-multiplier formulation of discrete constrained optimization problems, the associated discrete-space first-order necessary and sufficient condit...
CP
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
CP
1999
Springer
13 years 11 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
CP
1999
Springer
13 years 11 months ago
1999
Springer
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
CP
1999
Springer
13 years 11 months ago
1999
Springer
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...
CP
1999
Springer
13 years 11 months ago
1999
Springer
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
CP
1999
Springer
13 years 11 months ago
1999
Springer
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
CP
1999
Springer
13 years 11 months ago
1999
Springer
