592 search results - page 7 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
103
Voted
CONSTRAINTS
2010
14 years 6 months ago
2010
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
AIPS
2008
14 years 11 months ago
2008
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
86
Voted
QSHINE
2005
IEEE
15 years 3 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
92
Voted
CSR
2009
Springer
14 years 10 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
CPAIOR
2010
Springer
15 years 2 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...