Scippy

SCIP

Solving Constraint Integer Programs

howtoadd.dxy
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 /* 2002-2015 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 email to scip@zib.de. */
13 /* */
14 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
15 
16 /**@file howtoadd.dxy
17  * @brief List of how to add "stuff"
18  * @author Stefan Heinz
19  */
20 
21 /*--+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
22 
23 /** @page HOWTOADD How to add ...
24  *
25  * Below you find for most plugin types a detailed description of how to implement and add them to \SCIP.
26  *
27  * @section HOWTOADDSECTION How to add ...
28  *
29  * - \ref CONS "Constraint handlers"
30  * - \ref PRICER "Variable pricers"
31  * - \ref PRESOL "Presolvers"
32  * - \ref SEPA "Separators"
33  * - \ref PROP "Propagators"
34  * - \ref BRANCH "Branching rules"
35  * - \ref NODESEL "Node selectors"
36  * - \ref HEUR "Primal heuristics"
37  * + \ref DIVINGHEUR "Diving heuristics"
38  * - \ref RELAX "Relaxation handlers"
39  * - \ref READER "File readers"
40  * - \ref DIALOG "Dialogs"
41  * - \ref DISP "Display columns"
42  * - \ref EVENT "Event handler"
43  * - \ref NLPI "Interfaces to NLP solvers"
44  * - \ref EXPRINT "Interfaces to expression interpreters"
45  * - \ref PARAM "additional user parameters"
46  *
47  * @section HOWTOUSESECTION How to use ...
48  *
49  * - \ref CONF "Conflict analysis"
50  - \ref REOPT "Reoptimization"
51  * - \ref TEST "How to run automated tests with SCIP"
52  * - \ref COUNTER "How to use SCIP to count feasible solutions"
53  */