729 search results - page 74 / 146 » Solving subgraph isomorphism problems with constraint progra... |
158
Voted
CONSTRAINTS
2011
14 years 7 months ago
2011
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
168
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
154
click to vote
COR
2007
15 years 3 months ago
2007
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
113
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-w...
125
Voted
CP
2004
Springer
15 years 9 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...