706 search results - page 18 / 142 » Super Solutions in Constraint Programming |
108
click to vote
CP
2003
Springer
15 years 4 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
103
click to vote
AAAI
2007
15 years 2 months ago
2007
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy...
CPAIOR
2010
Springer
15 years 4 months ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
EACL
2009
ACL Anthology
14 years 9 months ago
2009
ACL Anthology
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...