Sciweavers

16 search results - page 1 / 4
» Pruning by Isomorphism in Branch-and-Cut
Sort
View
IPCO
2001
117views Optimization» more  IPCO 2001»
13 years 7 months ago
Pruning by Isomorphism in Branch-and-Cut
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 ...
François Margot
AI
2010
Springer
13 years 5 months ago
AllDifferent-based filtering for subgraph isomorphism
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 ...
Christine Solnon
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
13 years 11 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
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...
Roberto Battiti, Franco Mascia
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
14 years 10 days ago
Fast Algorithm for Graph Isomorphism Testing
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...
José Luis López-Presa, Antonio Fern&...
DISOPT
2007
96views more  DISOPT 2007»
13 years 5 months ago
Symmetric ILP: Coloring and small integers
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...
François Margot