Scippy

SCIP

Solving Constraint Integer Programs

coloringplugins.h
Go to the documentation of this file.
1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
2 /* */
3 /* This file is part of the program and library */
4 /* SCIP --- Solving Constraint Integer Programs */
5 /* */
6 /* Copyright (C) 2002-2020 Konrad-Zuse-Zentrum */
7 /* fuer Informationstechnik Berlin */
8 /* */
9 /* SCIP is distributed under the terms of the ZIB Academic License. */
10 /* */
11 /* You should have received a copy of the ZIB Academic License */
12 /* along with SCIP; see the file COPYING. If not visit scipopt.org. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15 
16 /**@file coloringplugins.h
17  * @brief SCIP plugins for coloring
18  * @author Gerald Gamrath
19  */
20 
21 /*--+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
22 
23 #ifndef __SCIP_SCIPCOLORINGPLUGINS_H__
24 #define __SCIP_SCIPCOLORINGPLUGINS_H__
25 
26 
27 #include "scip/scip.h"
28 
29 /* include header files here, such that the user only has to include
30  * coloringplugins.h
31  */
33 #include "scip/branch_fullstrong.h"
34 #include "scip/branch_inference.h"
35 #include "scip/branch_mostinf.h"
36 #include "scip/branch_leastinf.h"
37 #include "scip/branch_pscost.h"
38 #include "scip/branch_random.h"
39 #include "scip/branch_relpscost.h"
40 
41 #include "scip/cons_integral.h"
42 #include "scip/cons_linear.h"
43 #include "scip/cons_setppc.h"
44 
45 #include "scip/dialog_default.h"
46 #include "scip/disp_default.h"
47 
48 #include "scip/table_default.h"
49 
51 #include "scip/heur_coefdiving.h"
52 #include "scip/heur_crossover.h"
53 #include "scip/heur_dins.h"
54 #include "scip/heur_feaspump.h"
55 #include "scip/heur_fixandinfer.h"
56 #include "scip/heur_fracdiving.h"
57 #include "scip/heur_guideddiving.h"
58 #include "scip/heur_intdiving.h"
59 #include "scip/heur_intshifting.h"
62 #include "scip/heur_mutation.h"
64 #include "scip/heur_octane.h"
65 #include "scip/heur_oneopt.h"
66 #include "scip/heur_pscostdiving.h"
67 #include "scip/heur_rens.h"
68 #include "scip/heur_rins.h"
70 #include "scip/heur_rounding.h"
71 #include "scip/heur_shifting.h"
73 #include "scip/heur_trivial.h"
74 #include "scip/heur_trysol.h"
75 #include "scip/heur_twoopt.h"
76 #include "scip/heur_undercover.h"
77 #include "scip/heur_veclendiving.h"
78 #include "scip/heur_zirounding.h"
79 
80 #include "scip/nodesel_bfs.h"
81 #include "scip/nodesel_dfs.h"
82 #include "scip/nodesel_estimate.h"
85 
86 #include "scip/prop_pseudoobj.h"
87 #include "scip/prop_rootredcost.h"
88 
89 #include "scip/scipshell.h"
90 
91 /** project plugins */
92 #include "cons_storeGraph.h"
93 #include "branch_coloring.h"
94 #include "branch_strongcoloring.h"
95 #include "reader_col.h"
96 #include "reader_csol.h"
97 #include "heur_init.h"
98 #include "pricer_coloring.h"
99 
100 #ifdef __cplusplus
101 extern "C" {
102 #endif
103 
104 /** includes default SCIP plugins into SCIP */
106  SCIP* scip /**< SCIP data structure */
107  );
108 
109 #ifdef __cplusplus
110 }
111 #endif
112 
113 #endif
reliable pseudo costs branching rule
Primal heuristic to improve incumbent solution by flipping pairs of variables.
primal heuristic that tries a given solution
Improvement heuristic that alters single variable values.
node selector for hybrid best estimate / best bound search
LP rounding heuristic that tries to recover from intermediate infeasibilities and shifts continuous v...
Pseudo objective propagator.
LP rounding heuristic that tries to recover from intermediate infeasibilities.
reduced cost strengthening using root node reduced costs and the cutoff bound
random variable branching rule
trivial primal heuristic
Undercover primal heuristic for MINLPs.
node selector for depth first search with periodical selection of the best node
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:54
default statistics tables
initial primal heuristic for the vertex coloring problem
LP diving heuristic that chooses fixings in direction of incumbent solutions.
default display columns
file reader for vertex coloring instances
LP diving heuristic that chooses fixings w.r.t. the fractionalities.
least infeasible LP branching rule
constraint handler for storing the graph at each node of the tree
LP diving heuristic that chooses fixings w.r.t. the pseudo cost values.
Constraint handler for the set partitioning / packing / covering constraints .
LP diving heuristic that chooses fixings w.r.t. the matrix coefficients.
LP diving heuristic that fixes variables with integral LP value.
LNS heuristic that tries to combine several feasible solutions.
SCIP command line interface.
default branching rule for the vertex coloring problem
variable pricer for the vertex coloring problem
Local branching heuristic according to Fischetti and Lodi.
LP diving heuristic that chooses fixings w.r.t. the active constraints the variable appear in...
LNS heuristic that tries to randomly mutate the incumbent solution.
node selector for best estimate search
LNS heuristic that finds the optimal rounding to a given point.
full strong LP branching rule
LP diving heuristic that changes variables&#39; objective values using root LP solution as guide...
pseudo costs branching rule
fix-and-infer primal heuristic
LNS heuristic that combines the incumbent with the LP optimum.
SCIP_RETCODE SCIPincludeColoringPlugins(SCIP *scip)
Objective Feasibility Pump 2.0.
Constraint handler for linear constraints in their most general form, .
ZI Round primal heuristic.
LP diving heuristic that fixes variables with a large difference to their root solution.
most infeasible LP branching rule
all variables full strong LP branching rule
DINS primal heuristic.
node selector for best first search
LP diving heuristic that rounds variables with long column vectors.
constraint handler for the integrality constraint
default user interface dialog
inference history branching rule
Simple and fast LP rounding heuristic.
branching rule performing strong branching for the vertex coloring problem
octane primal heuristic based on Balas, Ceria, Dawande, Margot, and Pataki
file reader and writer for vertex coloring solutions
LP rounding heuristic that tries to recover from intermediate infeasibilities, shifts integer variabl...
LP diving heuristic that changes variable&#39;s objective value instead of bounds, using pseudo cost valu...
node selector for depth first search
SCIP callable library.