Scippy

SCIP

Solving Constraint Integer Programs

heur_dps.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-2023 Zuse Institute Berlin (ZIB) */
7 /* */
8 /* Licensed under the Apache License, Version 2.0 (the "License"); */
9 /* you may not use this file except in compliance with the License. */
10 /* You may obtain a copy of the License at */
11 /* */
12 /* http://www.apache.org/licenses/LICENSE-2.0 */
13 /* */
14 /* Unless required by applicable law or agreed to in writing, software */
15 /* distributed under the License is distributed on an "AS IS" BASIS, */
16 /* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. */
17 /* See the License for the specific language governing permissions and */
18 /* limitations under the License. */
19 /* */
20 /* You should have received a copy of the Apache-2.0 license */
21 /* along with SCIP; see the file LICENSE. If not visit scipopt.org. */
22 /* */
23 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
24 
25 /**@file heur_dps.h
26  * @ingroup PRIMALHEURISTICS
27  * @brief dynamic partition search
28  * @author Katrin Halbig
29  *
30  * The dynamic partition search (DPS) is a construction heuristic which additionally needs a
31  * user decomposition with linking constraints only.
32  *
33  * This heuristic splits the problem into several sub-SCIPs according to the given decomposition. Thereby the linking constraints
34  * with their right-hand and left-hand sides are also split. DPS searches for a partition of the sides on the blocks
35  * so that a feasible solution is obtained.
36  * For each block the parts of the original linking constraints are extended by slack variables. Moreover, the objective function
37  * is replaced by the sum of these additional variables weighted by penalty parameters lambda. If all blocks have an optimal solution
38  * of zero, the algorithm terminates with a feasible solution for the main problem. Otherwise, the partition and the penalty parameters
39  * are updated, and the sub-SCIPs are solved again.
40  */
41 
42 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
43 
44 #ifndef __SCIP_HEUR_DPS_H__
45 #define __SCIP_HEUR_DPS_H__
46 
47 
48 #include "scip/def.h"
49 #include "scip/type_retcode.h"
50 #include "scip/type_scip.h"
51 
52 #ifdef __cplusplus
53 extern "C" {
54 #endif
55 
56 /** creates the dps primal heuristic and includes it in SCIP
57  *
58  * @ingroup PrimalHeuristicIncludes
59  */
60 SCIP_EXPORT
62  SCIP* scip /**< SCIP data structure */
63  );
64 
65 #ifdef __cplusplus
66 }
67 #endif
68 
69 #endif
enum SCIP_Retcode SCIP_RETCODE
Definition: type_retcode.h:63
type definitions for return codes for SCIP methods
type definitions for SCIP&#39;s main datastructure
common defines and data types used in all packages of SCIP
SCIP_RETCODE SCIPincludeHeurDps(SCIP *scip)
Definition: heur_dps.c:2044