16 search results - page 1 / 4 » Pruning by Isomorphism in Branch-and-Cut |
IPCO
2001
13 years 6 months ago
2001
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
AI
2010
Springer
13 years 5 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
SLS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
WEA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
DISOPT
2007
13 years 4 months ago
2007
This paper presents techniques for handling symmetries in integer linear programs where variables can take integer values, extending previous work dealing exclusively with binary v...