729 search results - page 7 / 146 » Solving subgraph isomorphism problems with constraint progra... |
AAAI
2007
14 years 11 months ago
2007
A facility with front room and back room operations has the option of hiring specialized or, more expensive, cross-trained workers. Assuming stochastic customer arrival and servic...
PATAT
2004
Springer
15 years 2 months ago
2004
Springer
Timetabling problems have been frequently studied due to their wide range of applications. However, they are often solved manually because of the lack of appropriate computer tools...
CP
2003
Springer
15 years 2 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...
111
click to vote
CP
1998
Springer
15 years 1 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...
JDA
2010
14 years 4 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...