729 search results - page 8 / 146 » Solving subgraph isomorphism problems with constraint progra... |
CSCLP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization ...
HEURISTICS
2000
14 years 9 months ago
2000
WWW
2007
ACM
15 years 10 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
IPCO
2008
14 years 11 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
AAIM
2007
Springer
15 years 3 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...