Scippy

GCG

Branch-and-Price & Column Generation for Everyone

bliss_automorph.hpp
Go to the documentation of this file.
1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
2 /* */
3 /* This file is part of the program */
4 /* GCG --- Generic Column Generation */
5 /* a Dantzig-Wolfe decomposition based extension */
6 /* of the branch-cut-and-price framework */
7 /* SCIP --- Solving Constraint Integer Programs */
8 /* */
9 /* Copyright (C) 2010-2021 Operations Research, RWTH Aachen University */
10 /* Zuse Institute Berlin (ZIB) */
11 /* */
12 /* This program is free software; you can redistribute it and/or */
13 /* modify it under the terms of the GNU Lesser General Public License */
14 /* as published by the Free Software Foundation; either version 3 */
15 /* of the License, or (at your option) any later version. */
16 /* */
17 /* This program is distributed in the hope that it will be useful, */
18 /* but WITHOUT ANY WARRANTY; without even the implied warranty of */
19 /* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the */
20 /* GNU Lesser General Public License for more details. */
21 /* */
22 /* You should have received a copy of the GNU Lesser General Public License */
23 /* along with this program; if not, write to the Free Software */
24 /* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.*/
25 /* */
26 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
27 
28 /**@file bliss_automorph.hpp
29  * @brief automorphism recognition (C++ interface)
30  *
31  * @author Erik Muehmer
32  */
33 
34 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
35 
36 #ifndef GCG_BLISS_AUTOMORPH_HPP
37 #define GCG_BLISS_AUTOMORPH_HPP
38 
39 #include "class_partialdecomp.h"
40 
41 
42 /** compare two graphs w.r.t. automorphism */
43 SCIP_RETCODE cmpGraphPair(
44  SCIP* scip, /**< SCIP data structure */
45  gcg::PARTIALDECOMP* partialdec, /**< partialdec the graphs should be compared for */
46  int block1, /**< index of first pricing prob */
47  int block2, /**< index of second pricing prob */
48  SCIP_RESULT* result, /**< result pointer to indicate success or failure */
49  SCIP_HASHMAP* varmap, /**< hashmap to save permutation of variables */
50  SCIP_HASHMAP* consmap, /**< hashmap to save permutation of constraints */
51  unsigned int searchnodelimit, /**< bliss search node limit (requires patched bliss version) */
52  unsigned int generatorlimit /**< bliss generator limit (requires patched bliss version) */
53 );
54 
55 #endif //GCG_BLISS_AUTOMORPH_HPP
SCIP_RETCODE cmpGraphPair(SCIP *scip, gcg::PARTIALDECOMP *partialdec, int block1, int block2, SCIP_RESULT *result, SCIP_HASHMAP *varmap, SCIP_HASHMAP *consmap, unsigned int searchnodelimit, unsigned int generatorlimit)
class to manage partial decompositions
class storing (potentially incomplete) decompositions