Toggle navigation
SCIP Optimization Suite
SCIP
SoPlex
ZIMPL
UG
GCG
Documentation
SCIP 9.2.0
SCIP 8.1.0
SCIP 7.0.3
SCIP 6.0.2
SCIP 5.0.1
SCIP 4.0.1
SCIP 3.2.1
SCIP
Solving Constraint Integer Programs
sepa_closecuts.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-2017 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 sepa_closecuts.h
17
* @ingroup SEPARATORS
18
* @brief closecuts meta separator
19
* @author Marc Pfetsch
20
*
21
* This separator generates a convex combination of the current LP solution and either the best
22
* primal feasible solution or an interior point of the LP relaxation. If the convex combination is
23
* proper, the new point is closer to the convex hull of the feasible points. The separator then
24
* calls all other separators to separate this point. The idea is that in this way possibly "deeper"
25
* cuts are generated. Note, however, that the new point is not a basic solution, i.e., separators
26
* relying basis information, e.g., Gomory cuts, will not work.
27
*/
28
29
/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
30
31
#ifndef __SCIP_SEPA_CLOSECUTS_H__
32
#define __SCIP_SEPA_CLOSECUTS_H__
33
34
35
#include "
scip/scip.h
"
36
37
#ifdef __cplusplus
38
extern
"C"
{
39
#endif
40
41
/** creates the closecuts separator and includes it in SCIP
42
*
43
* @ingroup SeparatorIncludes
44
*/
45
extern
46
SCIP_RETCODE
SCIPincludeSepaClosecuts
(
47
SCIP
*
scip
/**< SCIP data structure */
48
);
49
50
/**@addtogroup SEPARATORS
51
*
52
* @{
53
*/
54
55
/** sets point to be used as base point for computing the point to be separated
56
*
57
* The point is only stored if separation of relative interior points is used. The solution is copied.
58
*/
59
extern
60
SCIP_RETCODE
SCIPsetBasePointClosecuts
(
61
SCIP
*
scip
,
/**< SCIP data structure */
62
SCIP_SOL
* sol
/**< base point solution */
63
);
64
65
/* @} */
66
67
#ifdef __cplusplus
68
}
69
#endif
70
71
#endif
Scip
Definition:
struct_scip.h:58
SCIP_RETCODE
enum SCIP_Retcode SCIP_RETCODE
Definition:
type_retcode.h:53
SCIPsetBasePointClosecuts
SCIP_RETCODE SCIPsetBasePointClosecuts(SCIP *scip, SCIP_SOL *sol)
Definition:
sepa_closecuts.c:462
SCIP_Sol
Definition:
struct_sol.h:51
SCIPincludeSepaClosecuts
SCIP_RETCODE SCIPincludeSepaClosecuts(SCIP *scip)
Definition:
sepa_closecuts.c:393
scip
Definition:
objbranchrule.h:33
scip.h
SCIP callable library.