673 search results - page 3 / 135 » Preference-Based Problem Solving for Constraint Programming |
CONSTRAINTS
2010
13 years 4 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 ...
CP
1998
Springer
13 years 11 months ago
1998
Springer
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
HEURISTICS
2000
13 years 7 months ago
2000
ICSE
2012
IEEE-ACM
11 years 10 months ago
2012
IEEE-ACM
Abstract—Atomicity, a general correctness criterion in concurrency programs, is often violated in real-world applications. The violations are difficult for developers to fix, m...
HEURISTICS
2002
13 years 7 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...