Scippy

GCG

Branch-and-Price & Column Generation for Everyone

bliss_automorph.h
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.h
29  * @brief automorphism recognition of SCIPs
30  *
31  * @author Martin Bergner
32  * @author Daniel Peters
33  */
34 
35 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
36 #include "scip/type_scip.h"
37 #include "scip/type_result.h"
38 #include "scip/type_misc.h"
39 
40 #ifndef BLISS_AUTOMORPH_H_
41 #define BLISS_AUTOMORPH_H_
42 
43 
44 
45 #ifdef __cplusplus
46 extern "C" {
47 #endif
48 
49 /** compare two graphs w.r.t. automorphism */
50 SCIP_RETCODE cmpGraphPair(
51  SCIP* origscip, /**< SCIP data structure */
52  SCIP* scip1, /**< first SCIP data structure to compare */
53  SCIP* scip2, /**< second SCIP data structure to compare */
54  int prob1, /**< index of first pricing prob */
55  int prob2, /**< index of second pricing prob */
56  SCIP_RESULT* result, /**< result pointer to indicate success or failure */
57  SCIP_HASHMAP* varmap, /**< hashmap to save permutation of variables */
58  SCIP_HASHMAP* consmap, /**< hashmap to save permutation of constraints */
59  unsigned int searchnodelimit, /**< bliss search node limit (requires patched bliss version) */
60  unsigned int generatorlimit /**< bliss generator limit (requires patched bliss version) */
61  );
62 
63 #ifdef __cplusplus
64 }
65 #endif
66 #endif /* BLISS_AUTOMORPH_H_ */
SCIP_RETCODE cmpGraphPair(SCIP *origscip, SCIP *scip1, SCIP *scip2, int prob1, int prob2, SCIP_RESULT *result, SCIP_HASHMAP *varmap, SCIP_HASHMAP *consmap, unsigned int searchnodelimit, unsigned int generatorlimit)