729 search results - page 41 / 146 » Solving subgraph isomorphism problems with constraint progra... |
160
click to vote
CPAIOR
2005
Springer
16 years 1 hour ago
2005
Springer
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
188
click to vote
COLOGNETWENTE
2010
15 years 3 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
140
click to vote
MICCAI
2004
Springer
16 years 7 months ago
2004
Springer
In this paper we discuss image registration techniques with a focus on volume preserving constraints. These constraints can reduce the non-uniqueness of the registration problem si...
138
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the bes...
219
click to vote
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
15 years 1 months ago
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...