1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
// $Id: CglZeroHalf.hpp 1122 2013-04-06 20:39:53Z stefan $
// Copyright (C) 2010, International Business Machines
// Corporation and others. All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).
#ifndef CglZeroHalf_H
#define CglZeroHalf_H
#include <string>
#include "CglCutGenerator.hpp"
#include "CoinPackedMatrix.hpp"
#include "Cgl012cut.hpp"
/** Zero Half Cut Generator Class
This class generates zero half cuts via the following method:
See -
G. Andreello, A. Caprara, M. Fischetti,
“Embedding Cuts in a Branch and Cut Framework: a Computational Study
with {0,1/2}-Cuts”, INFORMS Journal on Computing 19(2), 229-238, 2007.
*/
class CglZeroHalf : public CglCutGenerator {
friend void CglZeroHalfUnitTest(const OsiSolverInterface * siP,
const std::string mpdDir );
public:
/**@name Generate Cuts */
//@{
/** Generate zero half cuts for the model accessed through the solver interface.
Insert generated cuts into the cut set cs.
*/
virtual void generateCuts( const OsiSolverInterface & si, OsiCuts & cs,
const CglTreeInfo info = CglTreeInfo());
//@}
/**@name Sets and Gets */
//@{
/// Get flags
inline int getFlags() const
{ return flags_;}
/// Set flags
inline void setFlags(int value)
{ flags_ = value;}
//@}
/**@name Constructors and destructors */
//@{
/// Default constructor
CglZeroHalf ();
/// Copy constructor
CglZeroHalf (
const CglZeroHalf &);
/// Clone
virtual CglCutGenerator * clone() const;
/// Assignment operator
CglZeroHalf &
operator=(
const CglZeroHalf& rhs);
/// Destructor
virtual
~CglZeroHalf ();
/// Create C++ lines to get to current state
virtual std::string generateCpp( FILE * fp);
/// This can be used to refresh any information
virtual void refreshSolver(OsiSolverInterface * solver);
//@}
private:
// Private member methods
/**@name Private methods */
//@{
//@}
/**@name Private member data */
//@{
/// number of rows in the ILP matrix
int mr_;
/// number of columns in the ILP matrix
int mc_;
/// number of nonzero's in the ILP matrix
int mnz_;
/// starting position of each row in arrays mtind and mtval
int *mtbeg_;
/// number of entries of each row in arrays mtind and mtval
int *mtcnt_;
/// column indices of the nonzero entries of the ILP matrix
int *mtind_;
/// values of the nonzero entries of the ILP matrix
int *mtval_;
/// lower bounds on the variables
int *vlb_;
/// upper bounds on the variables
int *vub_;
/// right hand sides of the constraints
int *mrhs_;
/// senses of the constraints: 'L', 'G' or 'E'
char *msense_;
/// Cgl012Cut object to make thread safe
Cgl012Cut cutInfo_;
/** Flags
1 bit - global cuts
*/
int flags_;
//@}
};
/// A simple Dijkstra shortest path - make better later
#ifndef CGL_NEW_SHORT
void cglShortestPath(cgl_graph * graph, int source, int maximumLength);
#else
void cglShortestPath(auxiliary_graph * graph, int source, int maximumLength);
#endif
//#############################################################################
/** A function that tests the methods in the CglZeroHalf class. The
only reason for it not to be a member method is that this way it doesn't
have to be compiled into the library. And that's a gain, because the
library should be compiled with optimization on, but this method should be
compiled with debugging. */
void CglZeroHalfUnitTest(const OsiSolverInterface * siP,
const std::string mpdDir );
#endif
|
