diff --git a/Doxygen/0.94/BlisBranchObjectBilevel_8h.html b/Doxygen/0.94/BlisBranchObjectBilevel_8h.html new file mode 100644 index 0000000..48b601f --- /dev/null +++ b/Doxygen/0.94/BlisBranchObjectBilevel_8h.html @@ -0,0 +1,136 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisBranchObjectBilevel.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisBranchObjectBilevel.h File Reference
+
+
+
#include "BcpsBranchObject.h"
+#include "BlisModel.h"
+
+ + Include dependency graph for BlisBranchObjectBilevel.h:
+
+
+ +
+

Go to the source code of this file.

+ + + + +

+Classes

class  BlisBranchObjectBilevel
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisBranchObjectBilevel_8h__incl.map b/Doxygen/0.94/BlisBranchObjectBilevel_8h__incl.map new file mode 100644 index 0000000..8ffa3da --- /dev/null +++ b/Doxygen/0.94/BlisBranchObjectBilevel_8h__incl.map @@ -0,0 +1,36 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisBranchObjectBilevel_8h__incl.md5 b/Doxygen/0.94/BlisBranchObjectBilevel_8h__incl.md5 new file mode 100644 index 0000000..2851fca --- /dev/null +++ b/Doxygen/0.94/BlisBranchObjectBilevel_8h__incl.md5 @@ -0,0 +1 @@ +4be3d27cdf7707e22ab522e914c3054a \ No newline at end of file diff --git a/Doxygen/0.94/BlisBranchObjectBilevel_8h__incl.png b/Doxygen/0.94/BlisBranchObjectBilevel_8h__incl.png new file mode 100644 index 0000000..5bcda77 Binary files /dev/null and b/Doxygen/0.94/BlisBranchObjectBilevel_8h__incl.png differ diff --git a/Doxygen/0.94/BlisBranchObjectBilevel_8h_source.html b/Doxygen/0.94/BlisBranchObjectBilevel_8h_source.html new file mode 100644 index 0000000..222250f --- /dev/null +++ b/Doxygen/0.94/BlisBranchObjectBilevel_8h_source.html @@ -0,0 +1,212 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisBranchObjectBilevel.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisBranchObjectBilevel.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 
+
25 //#############################################################################
+
26 // Borrow ideas from COIN/Cbc
+
27 //#############################################################################
+
28 
+
29 
+
30 #include "BcpsBranchObject.h"
+
31 
+
32 #include "BlisModel.h"
+
33 
+
34 
+
35 //#############################################################################
+
36 
+
37 
+
38 class BlisBranchObjectBilevel : public BcpsBranchObject {
+
39 
+
40  protected:
+
41 
+
43  std::deque<int> *branchingSet_;
+
44 
+
45  public:
+
46 
+
48  BlisBranchObjectBilevel() : BcpsBranchObject()
+
49  {
+
50  type_ = BlisBranchingObjectTypeBilevel;
+
51  branchingSet_ = new std::deque<int>();
+
52  }
+
53 
+
55  BlisBranchObjectBilevel(BcpsModel * model)
+
56  : BcpsBranchObject(model) {
+
57  type_ = BlisBranchingObjectTypeBilevel;
+
58  branchingSet_ = new std::deque<int>();
+
59  }
+
60 
+
62  BlisBranchObjectBilevel(const BlisBranchObjectBilevel &rhs)
+
63  :
+
64  BcpsBranchObject(rhs), branchingSet_(rhs.branchingSet_) {}
+
65 
+
67  BlisBranchObjectBilevel & operator = (const BlisBranchObjectBilevel& rhs);
+
68 
+
70  virtual BcpsBranchObject * clone() const {
+
71  return (new BlisBranchObjectBilevel(*this));
+
72  }
+
73 
+
75  virtual ~BlisBranchObjectBilevel() { delete branchingSet_; }
+
76 
+
78  std::deque<int> *getBranchingSet() const {return branchingSet_;}
+
79 
+
81  void addToBranchingSet(int item) {branchingSet_->push_back(item);}
+
82 
+
86  virtual double branch(bool normalBranch = false);
+
87 
+
89  virtual void print(bool normalBranch);
+
90 
+
91  protected:
+
92 
+
94  AlpsReturnStatus encodeBlis(AlpsEncoded *encoded) const {
+
95  assert(encoded);
+
96  AlpsReturnStatus status = AlpsReturnStatusOk;
+
97  return status;
+
98  }
+
99 
+
101  AlpsReturnStatus decodeBlis(AlpsEncoded &encoded) {
+
102  AlpsReturnStatus status = AlpsReturnStatusOk;
+
103  return status;
+
104  }
+
105 
+
106  public:
+
107 
+
109  virtual AlpsReturnStatus encode(AlpsEncoded *encoded) const {
+
110  AlpsReturnStatus status = AlpsReturnStatusOk;
+
111 
+
112  status = encodeBcps(encoded);
+
113  status = encodeBlis(encoded);
+
114 
+
115  return status;
+
116  }
+
117 
+
119  virtual AlpsReturnStatus decode(AlpsEncoded &encoded) {
+
120 
+
121  AlpsReturnStatus status = AlpsReturnStatusOk;
+
122 
+
123  status = decodeBcps(encoded);
+
124  status = decodeBlis(encoded);
+
125 
+
126  return status;
+
127  }
+
128 
+
129 };
+
130 
+
+
BlisBranchObjectBilevel::operator=
BlisBranchObjectBilevel & operator=(const BlisBranchObjectBilevel &rhs)
Assignment operator.
+
BlisBranchObjectBilevel::encode
virtual AlpsReturnStatus encode(AlpsEncoded *encoded) const
Pack to an encoded object.
Definition: BlisBranchObjectBilevel.h:109
+
BlisBranchObjectBilevel::encodeBlis
AlpsReturnStatus encodeBlis(AlpsEncoded *encoded) const
Pack Blis portion to an encoded object.
Definition: BlisBranchObjectBilevel.h:94
+
BlisBranchObjectBilevel::branchingSet_
std::deque< int > * branchingSet_
The indices of variables in the branching set.
Definition: BlisBranchObjectBilevel.h:43
+
BlisBranchObjectBilevel::clone
virtual BcpsBranchObject * clone() const
Clone.
Definition: BlisBranchObjectBilevel.h:70
+
BlisBranchObjectBilevel::getBranchingSet
std::deque< int > * getBranchingSet() const
Get a pointer to the branching set.
Definition: BlisBranchObjectBilevel.h:78
+
BlisModel.h
+
BlisBranchObjectBilevel::addToBranchingSet
void addToBranchingSet(int item)
Get a pointer to the branching set.
Definition: BlisBranchObjectBilevel.h:81
+
BlisBranchObjectBilevel::BlisBranchObjectBilevel
BlisBranchObjectBilevel(BcpsModel *model)
Another useful constructor.
Definition: BlisBranchObjectBilevel.h:55
+
BlisBranchObjectBilevel
Definition: BlisBranchObjectBilevel.h:38
+
BlisBranchObjectBilevel::BlisBranchObjectBilevel
BlisBranchObjectBilevel(const BlisBranchObjectBilevel &rhs)
Copy constructor.
Definition: BlisBranchObjectBilevel.h:62
+
BlisBranchObjectBilevel::~BlisBranchObjectBilevel
virtual ~BlisBranchObjectBilevel()
Destructor.
Definition: BlisBranchObjectBilevel.h:75
+
BlisBranchObjectBilevel::BlisBranchObjectBilevel
BlisBranchObjectBilevel()
Default constructor.
Definition: BlisBranchObjectBilevel.h:48
+
BlisBranchObjectBilevel::branch
virtual double branch(bool normalBranch=false)
Set the bounds for the variable according to the current arm of the branch and advances the object st...
+
BlisBranchObjectBilevel::print
virtual void print(bool normalBranch)
Print something about branch - only if log level high.
+
BlisBranchObjectBilevel::decode
virtual AlpsReturnStatus decode(AlpsEncoded &encoded)
Unpack a branching object from an encoded object.
Definition: BlisBranchObjectBilevel.h:119
+
BlisBranchObjectBilevel::decodeBlis
AlpsReturnStatus decodeBlis(AlpsEncoded &encoded)
Unpack Blis portion from an encoded object.
Definition: BlisBranchObjectBilevel.h:101
+
BlisBranchingObjectTypeBilevel
@ BlisBranchingObjectTypeBilevel
Definition: Blis.h:127
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisBranchObjectInt_8h.html b/Doxygen/0.94/BlisBranchObjectInt_8h.html new file mode 100644 index 0000000..9fdb019 --- /dev/null +++ b/Doxygen/0.94/BlisBranchObjectInt_8h.html @@ -0,0 +1,136 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisBranchObjectInt.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisBranchObjectInt.h File Reference
+
+
+
#include "BcpsBranchObject.h"
+#include "BlisModel.h"
+
+ + Include dependency graph for BlisBranchObjectInt.h:
+
+
+ +
+

Go to the source code of this file.

+ + + + +

+Classes

class  BlisBranchObjectInt
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisBranchObjectInt_8h__incl.map b/Doxygen/0.94/BlisBranchObjectInt_8h__incl.map new file mode 100644 index 0000000..7c90fd2 --- /dev/null +++ b/Doxygen/0.94/BlisBranchObjectInt_8h__incl.map @@ -0,0 +1,36 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisBranchObjectInt_8h__incl.md5 b/Doxygen/0.94/BlisBranchObjectInt_8h__incl.md5 new file mode 100644 index 0000000..50ca313 --- /dev/null +++ b/Doxygen/0.94/BlisBranchObjectInt_8h__incl.md5 @@ -0,0 +1 @@ +d16797d5775846dec1b2dc50d8dfbb24 \ No newline at end of file diff --git a/Doxygen/0.94/BlisBranchObjectInt_8h__incl.png b/Doxygen/0.94/BlisBranchObjectInt_8h__incl.png new file mode 100644 index 0000000..3fd840e Binary files /dev/null and b/Doxygen/0.94/BlisBranchObjectInt_8h__incl.png differ diff --git a/Doxygen/0.94/BlisBranchObjectInt_8h_source.html b/Doxygen/0.94/BlisBranchObjectInt_8h_source.html new file mode 100644 index 0000000..d447983 --- /dev/null +++ b/Doxygen/0.94/BlisBranchObjectInt_8h_source.html @@ -0,0 +1,292 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisBranchObjectInt.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisBranchObjectInt.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 
+
25 //#############################################################################
+
26 // Borrow ideas from COIN/Cbc
+
27 //#############################################################################
+
28 
+
29 
+
30 #include "BcpsBranchObject.h"
+
31 
+
32 #include "BlisModel.h"
+
33 
+
34 
+
35 //#############################################################################
+
36 
+
37 
+
38 class BlisBranchObjectInt : public BcpsBranchObject {
+
39 
+
40  protected:
+
41 
+
44  double down_[2];
+
45 
+
48  double up_[2];
+
49 
+
50  public:
+
51 
+
53  BlisBranchObjectInt()
+
54  :
+
55  BcpsBranchObject()
+
56  {
+
57  type_ = BlisBranchingObjectTypeInt;
+
58  down_[0] = 0.0;
+
59  down_[1] = 0.0;
+
60  up_[0] = 0.0;
+
61  up_[1] = 0.0;
+
62  }
+
63 
+
69  BlisBranchObjectInt(BlisModel * model,
+
70  int varInd,
+
71  int direction,
+
72  double value)
+
73  :
+
74  BcpsBranchObject(model, varInd, direction, value)
+
75  {
+
76  type_ = BlisBranchingObjectTypeInt;
+
77  int iColumn = model->getIntColIndices()[objectIndex_];
+
78  down_[0] = model->solver()->getColLower()[iColumn];
+
79  down_[1] = floor(value_);
+
80  up_[0] = ceil(value_);
+
81  up_[1] = model->getColUpper()[iColumn];
+
82  //start:sahar
+
83  if (up_[0]==down_[1]) {
+
84  if (up_[0]==floor(up_[1])) {
+
85  down_[1]-=1;
+
86  }
+
87  else {
+
88  up_[0]+=1;
+
89  }
+
90  }//end:sahar
+
91  }
+
92 
+
100  BlisBranchObjectInt(BlisModel * model,
+
101  int varInd,
+
102  int intScore,
+
103  double dblScore,
+
104  int direction,
+
105  double value)
+
106  :
+
107  BcpsBranchObject(model, varInd, intScore, dblScore, direction, value)
+
108  {
+
109  type_ = BlisBranchingObjectTypeInt;
+
110  int iColumn = model->getIntColIndices()[objectIndex_];
+
111  down_[0] = model->solver()->getColLower()[iColumn];
+
112  down_[1] = floor(value_);
+
113  up_[0] = ceil(value_);
+
114  up_[1] = model->getColUpper()[iColumn];
+
115  }
+
116 
+
122  BlisBranchObjectInt(BlisModel * model,
+
123  int varInd,
+
124  int direction,
+
125  double lowerValue,
+
126  double upperValue)
+
127  :
+
128  BcpsBranchObject(model, varInd, direction, lowerValue)
+
129  {
+
130  type_ = BlisBranchingObjectTypeInt;
+
131  numBranchesLeft_ = 1;
+
132  down_[0] = lowerValue;
+
133  down_[1] = upperValue;
+
134  up_[0] = lowerValue;
+
135  up_[1] = upperValue;
+
136  }
+
137 
+
139  BlisBranchObjectInt(const BlisBranchObjectInt &);
+
140 
+
142  BlisBranchObjectInt & operator = (const BlisBranchObjectInt& rhs);
+
143 
+
145  virtual BcpsBranchObject * clone() const {
+
146  return (new BlisBranchObjectInt(*this));
+
147  }
+
148 
+
150  virtual ~BlisBranchObjectInt() {}
+
151 
+
155  virtual double branch(bool normalBranch = false);
+
156 
+
158  virtual void print(bool normalBranch);
+
159 
+
161  const double *getDown() const { return down_; }
+
162 
+
164  const double *getUp() const { return up_; }
+
165 
+
166  protected:
+
167 
+
169  AlpsReturnStatus encodeBlis(AlpsEncoded *encoded) const {
+
170  assert(encoded);
+
171  AlpsReturnStatus status = AlpsReturnStatusOk;
+
172  int j;
+
173  // TODO: N-way.
+
174  for (j = 0; j < 2; ++j) {
+
175  encoded->writeRep(down_[j]);
+
176  }
+
177  for (j = 0; j < 2; ++j) {
+
178  encoded->writeRep(up_[j]);
+
179  }
+
180 
+
181  return status;
+
182  }
+
183 
+
185  AlpsReturnStatus decodeBlis(AlpsEncoded &encoded) {
+
186  AlpsReturnStatus status = AlpsReturnStatusOk;
+
187  int j;
+
188  // TODO: N-way.
+
189  for (j = 0; j < 2; ++j) {
+
190  encoded.readRep(down_[j]);
+
191  }
+
192  for (j = 0; j < 2; ++j) {
+
193  encoded.readRep(up_[j]);
+
194  }
+
195 
+
196  return status;
+
197  }
+
198 
+
199  public:
+
200 
+
202  virtual AlpsReturnStatus encode(AlpsEncoded *encoded) const {
+
203  AlpsReturnStatus status = AlpsReturnStatusOk;
+
204 
+
205  status = encodeBcps(encoded);
+
206  status = encodeBlis(encoded);
+
207 
+
208  return status;
+
209  }
+
210 
+
212  virtual AlpsReturnStatus decode(AlpsEncoded &encoded) {
+
213 
+
214  AlpsReturnStatus status = AlpsReturnStatusOk;
+
215 
+
216  status = decodeBcps(encoded);
+
217  status = decodeBlis(encoded);
+
218 
+
219  return status;
+
220  }
+
221 
+
222 };
+
223 
+
+
BlisBranchObjectInt::operator=
BlisBranchObjectInt & operator=(const BlisBranchObjectInt &rhs)
Assignment operator.
+
BlisBranchObjectInt::encode
virtual AlpsReturnStatus encode(AlpsEncoded *encoded) const
Pack to an encoded object.
Definition: BlisBranchObjectInt.h:202
+
BlisModel
Definition: BlisModel.h:69
+
BlisBranchObjectInt::branch
virtual double branch(bool normalBranch=false)
Set the bounds for the variable according to the current arm of the branch and advances the object st...
+
BlisBranchObjectInt::decode
virtual AlpsReturnStatus decode(AlpsEncoded &encoded)
Unpack a branching object from an encoded object.
Definition: BlisBranchObjectInt.h:212
+
BlisModel::getColUpper
const double * getColUpper()
Get column upper bound.
Definition: BlisModel.h:492
+
BlisBranchObjectInt::clone
virtual BcpsBranchObject * clone() const
Clone.
Definition: BlisBranchObjectInt.h:145
+
BlisBranchObjectInt::getUp
const double * getUp() const
Get upper arm bounds.
Definition: BlisBranchObjectInt.h:164
+
BlisBranchObjectInt::BlisBranchObjectInt
BlisBranchObjectInt(BlisModel *model, int varInd, int direction, double value)
Construct a branching object, which branching on variable varInd.
Definition: BlisBranchObjectInt.h:69
+
BlisBranchObjectInt::down_
double down_[2]
Down_[0]: the lower bound of down arm; Down_[1]: the upper bound of down arm;.
Definition: BlisBranchObjectInt.h:44
+
BlisModel.h
+
BlisBranchObjectInt::up_
double up_[2]
Up_[0]: the lower bound of upper arm; Up_[1]: the upper bound of upper arm;.
Definition: BlisBranchObjectInt.h:48
+
BlisBranchObjectInt
Definition: BlisBranchObjectInt.h:38
+
BlisBranchObjectInt::BlisBranchObjectInt
BlisBranchObjectInt(BlisModel *model, int varInd, int direction, double lowerValue, double upperValue)
Create a degenerate branching object.
Definition: BlisBranchObjectInt.h:122
+
BlisBranchObjectInt::decodeBlis
AlpsReturnStatus decodeBlis(AlpsEncoded &encoded)
Unpack Blis portion from an encoded object.
Definition: BlisBranchObjectInt.h:185
+
BlisBranchObjectInt::getDown
const double * getDown() const
Get down arm bounds.
Definition: BlisBranchObjectInt.h:161
+
BlisBranchObjectInt::encodeBlis
AlpsReturnStatus encodeBlis(AlpsEncoded *encoded) const
Pack Blis portion to an encoded object.
Definition: BlisBranchObjectInt.h:169
+
BlisBranchObjectInt::~BlisBranchObjectInt
virtual ~BlisBranchObjectInt()
Destructor.
Definition: BlisBranchObjectInt.h:150
+
BlisBranchingObjectTypeInt
@ BlisBranchingObjectTypeInt
Definition: Blis.h:125
+
BlisBranchObjectInt::BlisBranchObjectInt
BlisBranchObjectInt(BlisModel *model, int varInd, int intScore, double dblScore, int direction, double value)
Construct a branching object, which branching on variable varInd.
Definition: BlisBranchObjectInt.h:100
+
BlisBranchObjectInt::print
virtual void print(bool normalBranch)
Print something about branch - only if log level high.
+
BlisModel::getIntColIndices
int * getIntColIndices() const
Get integers' column indices.
Definition: BlisModel.h:660
+
BlisBranchObjectInt::BlisBranchObjectInt
BlisBranchObjectInt()
Default constructor.
Definition: BlisBranchObjectInt.h:53
+
BlisModel::solver
virtual OsiSolverInterface * solver()
Get lp solver.
Definition: BlisModel.h:449
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisBranchStrategyBilevel_8h.html b/Doxygen/0.94/BlisBranchStrategyBilevel_8h.html new file mode 100644 index 0000000..3857249 --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyBilevel_8h.html @@ -0,0 +1,138 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisBranchStrategyBilevel.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisBranchStrategyBilevel.h File Reference
+
+
+
#include "BcpsBranchObject.h"
+#include "BcpsBranchStrategy.h"
+#include "BlisModel.h"
+
+ + Include dependency graph for BlisBranchStrategyBilevel.h:
+
+
+ +
+

Go to the source code of this file.

+ + + + + +

+Classes

class  BlisBranchStrategyBilevel
 This class implements maximum infeasibility branching. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisBranchStrategyBilevel_8h__incl.map b/Doxygen/0.94/BlisBranchStrategyBilevel_8h__incl.map new file mode 100644 index 0000000..9a98c67 --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyBilevel_8h__incl.map @@ -0,0 +1,36 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisBranchStrategyBilevel_8h__incl.md5 b/Doxygen/0.94/BlisBranchStrategyBilevel_8h__incl.md5 new file mode 100644 index 0000000..87b873f --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyBilevel_8h__incl.md5 @@ -0,0 +1 @@ +7d8b3b37f4fa94c1ff81ebfdfe11504f \ No newline at end of file diff --git a/Doxygen/0.94/BlisBranchStrategyBilevel_8h__incl.png b/Doxygen/0.94/BlisBranchStrategyBilevel_8h__incl.png new file mode 100644 index 0000000..8f3877b Binary files /dev/null and b/Doxygen/0.94/BlisBranchStrategyBilevel_8h__incl.png differ diff --git a/Doxygen/0.94/BlisBranchStrategyBilevel_8h_source.html b/Doxygen/0.94/BlisBranchStrategyBilevel_8h_source.html new file mode 100644 index 0000000..0123e0f --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyBilevel_8h_source.html @@ -0,0 +1,153 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisBranchStrategyBilevel.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisBranchStrategyBilevel.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * ALPS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 #ifndef BlisBranchStrategyBilevel_h_
+
25 #define BlisBranchStrategyBilevel_h_
+
26 
+
27 #include "BcpsBranchObject.h"
+
28 #include "BcpsBranchStrategy.h"
+
29 #include "BlisModel.h"
+
30 
+
32 class BlisBranchStrategyBilevel : public BcpsBranchStrategy {
+
33 
+
34  private:
+
35 
+
37  BlisBranchStrategyBilevel& operator=(const BlisBranchStrategyBilevel& rhs);
+
38 
+
39  public:
+
40 
+
42  BlisBranchStrategyBilevel(){
+
43  type_ = static_cast<int>(BlisBranchingStrategyBilevel);
+
44  }
+
45 
+
47  BlisBranchStrategyBilevel(BlisModel *model) : BcpsBranchStrategy(model) {
+
48  type_ = static_cast<int>(BlisBranchingStrategyBilevel);
+
49  }
+
50 
+
52  virtual ~BlisBranchStrategyBilevel() {}
+
53 
+
55  BlisBranchStrategyBilevel(const BlisBranchStrategyBilevel &);
+
56 
+
58  virtual BcpsBranchStrategy * clone() const {
+
59  return new BlisBranchStrategyBilevel(*this);
+
60  }
+
61 
+
63  virtual int createCandBranchObjects(int numPassesLeft, double ub);
+
64 
+
70  virtual int betterBranchObject(BcpsBranchObject * thisOne,
+
71  BcpsBranchObject * bestSoFar);
+
72 };
+
73 
+
74 #endif
+
+
BlisBranchStrategyBilevel::~BlisBranchStrategyBilevel
virtual ~BlisBranchStrategyBilevel()
Destructor.
Definition: BlisBranchStrategyBilevel.h:52
+
BlisBranchStrategyBilevel::createCandBranchObjects
virtual int createCandBranchObjects(int numPassesLeft, double ub)
Create a set of candidate branching objects.
+
BlisModel
Definition: BlisModel.h:69
+
BlisBranchStrategyBilevel::operator=
BlisBranchStrategyBilevel & operator=(const BlisBranchStrategyBilevel &rhs)
Illegal Assignment operator.
+
BlisBranchStrategyBilevel
This class implements maximum infeasibility branching.
Definition: BlisBranchStrategyBilevel.h:32
+
BlisBranchStrategyBilevel::betterBranchObject
virtual int betterBranchObject(BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)
Compare branching object thisOne to bestSoFar.
+
BlisModel.h
+
BlisBranchingStrategyBilevel
@ BlisBranchingStrategyBilevel
Definition: Blis.h:107
+
BlisBranchStrategyBilevel::clone
virtual BcpsBranchStrategy * clone() const
Clone a brancing strategy.
Definition: BlisBranchStrategyBilevel.h:58
+
BlisBranchStrategyBilevel::BlisBranchStrategyBilevel
BlisBranchStrategyBilevel(BlisModel *model)
Bilevel Constructor.
Definition: BlisBranchStrategyBilevel.h:47
+
BlisBranchStrategyBilevel::BlisBranchStrategyBilevel
BlisBranchStrategyBilevel()
Bilevel Constructor.
Definition: BlisBranchStrategyBilevel.h:42
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisBranchStrategyMaxInf_8h.html b/Doxygen/0.94/BlisBranchStrategyMaxInf_8h.html new file mode 100644 index 0000000..191d30f --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyMaxInf_8h.html @@ -0,0 +1,138 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisBranchStrategyMaxInf.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisBranchStrategyMaxInf.h File Reference
+
+
+
#include "BcpsBranchObject.h"
+#include "BcpsBranchStrategy.h"
+#include "BlisModel.h"
+
+ + Include dependency graph for BlisBranchStrategyMaxInf.h:
+
+
+ +
+

Go to the source code of this file.

+ + + + + +

+Classes

class  BlisBranchStrategyMaxInf
 This class implements maximum infeasibility branching. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisBranchStrategyMaxInf_8h__incl.map b/Doxygen/0.94/BlisBranchStrategyMaxInf_8h__incl.map new file mode 100644 index 0000000..4906b55 --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyMaxInf_8h__incl.map @@ -0,0 +1,36 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisBranchStrategyMaxInf_8h__incl.md5 b/Doxygen/0.94/BlisBranchStrategyMaxInf_8h__incl.md5 new file mode 100644 index 0000000..419ab18 --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyMaxInf_8h__incl.md5 @@ -0,0 +1 @@ +57ae51aa4dfc54b15ba073afcf52507f \ No newline at end of file diff --git a/Doxygen/0.94/BlisBranchStrategyMaxInf_8h__incl.png b/Doxygen/0.94/BlisBranchStrategyMaxInf_8h__incl.png new file mode 100644 index 0000000..c2c2157 Binary files /dev/null and b/Doxygen/0.94/BlisBranchStrategyMaxInf_8h__incl.png differ diff --git a/Doxygen/0.94/BlisBranchStrategyMaxInf_8h_source.html b/Doxygen/0.94/BlisBranchStrategyMaxInf_8h_source.html new file mode 100644 index 0000000..5bd31e6 --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyMaxInf_8h_source.html @@ -0,0 +1,153 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisBranchStrategyMaxInf.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisBranchStrategyMaxInf.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * ALPS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 #ifndef BlisBranchStrategyMaxInf_h_
+
25 #define BlisBranchStrategyMaxInf_h_
+
26 
+
27 #include "BcpsBranchObject.h"
+
28 #include "BcpsBranchStrategy.h"
+
29 #include "BlisModel.h"
+
30 
+
32 class BlisBranchStrategyMaxInf : public BcpsBranchStrategy {
+
33 
+
34  private:
+
35 
+
37  BlisBranchStrategyMaxInf& operator=(const BlisBranchStrategyMaxInf& rhs);
+
38 
+
39  public:
+
40 
+
42  BlisBranchStrategyMaxInf() {
+
43  type_ = static_cast<int>(BlisBranchingStrategyMaxInfeasibility);
+
44  }
+
45 
+
47  BlisBranchStrategyMaxInf(BlisModel *model) : BcpsBranchStrategy(model) {
+
48  type_ = static_cast<int>(BlisBranchingStrategyMaxInfeasibility);
+
49  }
+
50 
+
52  virtual ~BlisBranchStrategyMaxInf() {}
+
53 
+
55  BlisBranchStrategyMaxInf(const BlisBranchStrategyMaxInf &);
+
56 
+
58  virtual BcpsBranchStrategy * clone() const {
+
59  return new BlisBranchStrategyMaxInf(*this);
+
60  }
+
61 
+
63  virtual int createCandBranchObjects(int numPassesLeft, double ub);
+
64 
+
70  virtual int betterBranchObject(BcpsBranchObject * thisOne,
+
71  BcpsBranchObject * bestSoFar);
+
72 };
+
73 
+
74 #endif
+
+
BlisModel
Definition: BlisModel.h:69
+
BlisBranchStrategyMaxInf::operator=
BlisBranchStrategyMaxInf & operator=(const BlisBranchStrategyMaxInf &rhs)
Illegal Assignment operator.
+
BlisBranchStrategyMaxInf::createCandBranchObjects
virtual int createCandBranchObjects(int numPassesLeft, double ub)
Create a set of candidate branching objects.
+
BlisBranchingStrategyMaxInfeasibility
@ BlisBranchingStrategyMaxInfeasibility
Definition: Blis.h:103
+
BlisBranchStrategyMaxInf::BlisBranchStrategyMaxInf
BlisBranchStrategyMaxInf(BlisModel *model)
MaxInf Constructor.
Definition: BlisBranchStrategyMaxInf.h:47
+
BlisModel.h
+
BlisBranchStrategyMaxInf::clone
virtual BcpsBranchStrategy * clone() const
Clone a brancing strategy.
Definition: BlisBranchStrategyMaxInf.h:58
+
BlisBranchStrategyMaxInf::betterBranchObject
virtual int betterBranchObject(BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)
Compare branching object thisOne to bestSoFar.
+
BlisBranchStrategyMaxInf
This class implements maximum infeasibility branching.
Definition: BlisBranchStrategyMaxInf.h:32
+
BlisBranchStrategyMaxInf::~BlisBranchStrategyMaxInf
virtual ~BlisBranchStrategyMaxInf()
Destructor.
Definition: BlisBranchStrategyMaxInf.h:52
+
BlisBranchStrategyMaxInf::BlisBranchStrategyMaxInf
BlisBranchStrategyMaxInf()
MaxInf Constructor.
Definition: BlisBranchStrategyMaxInf.h:42
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisBranchStrategyPseudo_8h.html b/Doxygen/0.94/BlisBranchStrategyPseudo_8h.html new file mode 100644 index 0000000..ccd19a1 --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyPseudo_8h.html @@ -0,0 +1,138 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisBranchStrategyPseudo.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisBranchStrategyPseudo.h File Reference
+
+
+
#include "BcpsBranchObject.h"
+#include "BcpsBranchStrategy.h"
+#include "BlisModel.h"
+
+ + Include dependency graph for BlisBranchStrategyPseudo.h:
+
+
+ +
+

Go to the source code of this file.

+ + + + + +

+Classes

class  BlisBranchStrategyPseudo
 Blis branching strategy. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisBranchStrategyPseudo_8h__incl.map b/Doxygen/0.94/BlisBranchStrategyPseudo_8h__incl.map new file mode 100644 index 0000000..5bf53c7 --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyPseudo_8h__incl.map @@ -0,0 +1,36 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisBranchStrategyPseudo_8h__incl.md5 b/Doxygen/0.94/BlisBranchStrategyPseudo_8h__incl.md5 new file mode 100644 index 0000000..035da45 --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyPseudo_8h__incl.md5 @@ -0,0 +1 @@ +f6bece345bf47730dcf37df4f23ef851 \ No newline at end of file diff --git a/Doxygen/0.94/BlisBranchStrategyPseudo_8h__incl.png b/Doxygen/0.94/BlisBranchStrategyPseudo_8h__incl.png new file mode 100644 index 0000000..3bd81d4 Binary files /dev/null and b/Doxygen/0.94/BlisBranchStrategyPseudo_8h__incl.png differ diff --git a/Doxygen/0.94/BlisBranchStrategyPseudo_8h_source.html b/Doxygen/0.94/BlisBranchStrategyPseudo_8h_source.html new file mode 100644 index 0000000..75edfcb --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyPseudo_8h_source.html @@ -0,0 +1,168 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisBranchStrategyPseudo.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisBranchStrategyPseudo.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * ALPS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 
+
25 //#############################################################################
+
26 // NOTE: Borrow ideas from COIN/Cbc
+
27 //#############################################################################
+
28 
+
29 
+
30 #ifndef BlisBranchStrategyPseudo_h_
+
31 #define BlisBranchStrategyPseudo_h_
+
32 
+
33 #include "BcpsBranchObject.h"
+
34 #include "BcpsBranchStrategy.h"
+
35 #include "BlisModel.h"
+
36 
+
37 
+
40 class BlisBranchStrategyPseudo : public BcpsBranchStrategy {
+
41 
+
42  private:
+
44  BlisBranchStrategyPseudo& operator=(const BlisBranchStrategyPseudo& rhs);
+
45 
+
46  int relibility_;
+
47 
+
48  public:
+
49 
+
51  BlisBranchStrategyPseudo() : relibility_(1) {
+
52  relibility_ = 1;
+
53  type_ = static_cast<int>(BlisBranchingStrategyPseudoCost);
+
54  }
+
55 
+
57  BlisBranchStrategyPseudo(BlisModel *model, int rel)
+
58  : BcpsBranchStrategy(model) {
+
59  relibility_ = rel;
+
60  type_ = static_cast<int>(BlisBranchingStrategyPseudoCost);
+
61  }
+
62 
+
64  virtual ~BlisBranchStrategyPseudo() {}
+
65 
+
67  BlisBranchStrategyPseudo(const BlisBranchStrategyPseudo &);
+
68 
+
70  void setRelibility(int rel) { relibility_ = rel; }
+
71 
+
73  virtual BcpsBranchStrategy * clone() const {
+
74  return new BlisBranchStrategyPseudo(*this);
+
75  }
+
76 
+
82  virtual int betterBranchObject(BcpsBranchObject * thisOne,
+
83  BcpsBranchObject * bestSoFar);
+
84 
+
86  virtual int createCandBranchObjects(int numPassesLeft, double ub);
+
87 };
+
88 
+
89 #endif
+
+
BlisBranchStrategyPseudo::~BlisBranchStrategyPseudo
virtual ~BlisBranchStrategyPseudo()
Destructor.
Definition: BlisBranchStrategyPseudo.h:64
+
BlisBranchingStrategyPseudoCost
@ BlisBranchingStrategyPseudoCost
Definition: Blis.h:104
+
BlisModel
Definition: BlisModel.h:69
+
BlisBranchStrategyPseudo::setRelibility
void setRelibility(int rel)
Set relibility.
Definition: BlisBranchStrategyPseudo.h:70
+
BlisBranchStrategyPseudo::BlisBranchStrategyPseudo
BlisBranchStrategyPseudo(BlisModel *model, int rel)
Useful Constructor.
Definition: BlisBranchStrategyPseudo.h:57
+
BlisBranchStrategyPseudo::relibility_
int relibility_
Definition: BlisBranchStrategyPseudo.h:46
+
BlisModel.h
+
BlisBranchStrategyPseudo::BlisBranchStrategyPseudo
BlisBranchStrategyPseudo()
Default Constructor.
Definition: BlisBranchStrategyPseudo.h:51
+
BlisBranchStrategyPseudo::createCandBranchObjects
virtual int createCandBranchObjects(int numPassesLeft, double ub)
Create a set of candidate branching objects.
+
BlisBranchStrategyPseudo::betterBranchObject
virtual int betterBranchObject(BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)
Compare branching object thisOne to bestSoFar.
+
BlisBranchStrategyPseudo
Blis branching strategy.
Definition: BlisBranchStrategyPseudo.h:40
+
BlisBranchStrategyPseudo::operator=
BlisBranchStrategyPseudo & operator=(const BlisBranchStrategyPseudo &rhs)
Illegal Assignment operator.
+
BlisBranchStrategyPseudo::clone
virtual BcpsBranchStrategy * clone() const
Clone a brancing strategy.
Definition: BlisBranchStrategyPseudo.h:73
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisBranchStrategyRel_8h.html b/Doxygen/0.94/BlisBranchStrategyRel_8h.html new file mode 100644 index 0000000..89f6dbf --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyRel_8h.html @@ -0,0 +1,138 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisBranchStrategyRel.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisBranchStrategyRel.h File Reference
+
+
+
#include "BcpsBranchObject.h"
+#include "BcpsBranchStrategy.h"
+#include "BlisModel.h"
+
+ + Include dependency graph for BlisBranchStrategyRel.h:
+
+
+ +
+

Go to the source code of this file.

+ + + + + +

+Classes

class  BlisBranchStrategyRel
 Blis branching strategy. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisBranchStrategyRel_8h__incl.map b/Doxygen/0.94/BlisBranchStrategyRel_8h__incl.map new file mode 100644 index 0000000..6a2d08e --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyRel_8h__incl.map @@ -0,0 +1,36 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisBranchStrategyRel_8h__incl.md5 b/Doxygen/0.94/BlisBranchStrategyRel_8h__incl.md5 new file mode 100644 index 0000000..29dd5af --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyRel_8h__incl.md5 @@ -0,0 +1 @@ +a6d1f5d6decc42d12bfea5d056d1bb85 \ No newline at end of file diff --git a/Doxygen/0.94/BlisBranchStrategyRel_8h__incl.png b/Doxygen/0.94/BlisBranchStrategyRel_8h__incl.png new file mode 100644 index 0000000..3ecdd9f Binary files /dev/null and b/Doxygen/0.94/BlisBranchStrategyRel_8h__incl.png differ diff --git a/Doxygen/0.94/BlisBranchStrategyRel_8h_source.html b/Doxygen/0.94/BlisBranchStrategyRel_8h_source.html new file mode 100644 index 0000000..b64dcfd --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyRel_8h_source.html @@ -0,0 +1,170 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisBranchStrategyRel.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisBranchStrategyRel.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * ALPS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 
+
25 //#############################################################################
+
26 // NOTE: Borrow ideas from COIN/Cbc
+
27 //#############################################################################
+
28 
+
29 
+
30 #ifndef BlisBranchStrategyRel_h_
+
31 #define BlisBranchStrategyRel_h_
+
32 
+
33 #include "BcpsBranchObject.h"
+
34 #include "BcpsBranchStrategy.h"
+
35 #include "BlisModel.h"
+
36 
+
37 
+
40 class BlisBranchStrategyRel : public BcpsBranchStrategy {
+
41 
+
42  private:
+
44  BlisBranchStrategyRel& operator=(const BlisBranchStrategyRel& rhs);
+
45 
+
46  protected:
+
47 
+
48  int relibility_;
+
49 
+
50  public:
+
51 
+
53  BlisBranchStrategyRel() {
+
54  relibility_ = 1;
+
55  type_ = static_cast<int>(BlisBranchingStrategyReliability);
+
56  }
+
57 
+
59  BlisBranchStrategyRel(BlisModel *model, int rel)
+
60  : BcpsBranchStrategy(model) {
+
61  relibility_ = 1;
+
62  type_ = static_cast<int>(BlisBranchingStrategyReliability);
+
63  }
+
64 
+
66  virtual ~BlisBranchStrategyRel() {}
+
67 
+
69  BlisBranchStrategyRel(const BlisBranchStrategyRel &);
+
70 
+
72  void setRelibility(int rel) { relibility_ = rel; }
+
73 
+
75  virtual BcpsBranchStrategy * clone() const {
+
76  return new BlisBranchStrategyRel(*this);
+
77  }
+
78 
+
84  virtual int betterBranchObject(BcpsBranchObject * thisOne,
+
85  BcpsBranchObject * bestSoFar);
+
86 
+
88  virtual int createCandBranchObjects(int numPassesLeft, double ub);
+
89 };
+
90 
+
91 #endif
+
+
BlisBranchStrategyRel::createCandBranchObjects
virtual int createCandBranchObjects(int numPassesLeft, double ub)
Create a set of candidate branching objects.
+
BlisBranchStrategyRel
Blis branching strategy.
Definition: BlisBranchStrategyRel.h:40
+
BlisModel
Definition: BlisModel.h:69
+
BlisBranchingStrategyReliability
@ BlisBranchingStrategyReliability
Definition: Blis.h:105
+
BlisModel.h
+
BlisBranchStrategyRel::betterBranchObject
virtual int betterBranchObject(BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)
Compare branching object thisOne to bestSoFar.
+
BlisBranchStrategyRel::~BlisBranchStrategyRel
virtual ~BlisBranchStrategyRel()
Destructor.
Definition: BlisBranchStrategyRel.h:66
+
BlisBranchStrategyRel::clone
virtual BcpsBranchStrategy * clone() const
Clone a brancing strategy.
Definition: BlisBranchStrategyRel.h:75
+
BlisBranchStrategyRel::BlisBranchStrategyRel
BlisBranchStrategyRel(BlisModel *model, int rel)
Useful Constructor.
Definition: BlisBranchStrategyRel.h:59
+
BlisBranchStrategyRel::relibility_
int relibility_
Definition: BlisBranchStrategyRel.h:48
+
BlisBranchStrategyRel::setRelibility
void setRelibility(int rel)
Set relibility.
Definition: BlisBranchStrategyRel.h:72
+
BlisBranchStrategyRel::BlisBranchStrategyRel
BlisBranchStrategyRel()
Default Constructor.
Definition: BlisBranchStrategyRel.h:53
+
BlisBranchStrategyRel::operator=
BlisBranchStrategyRel & operator=(const BlisBranchStrategyRel &rhs)
Illegal Assignment operator.
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisBranchStrategyStrong_8h.html b/Doxygen/0.94/BlisBranchStrategyStrong_8h.html new file mode 100644 index 0000000..3391b33 --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyStrong_8h.html @@ -0,0 +1,140 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisBranchStrategyStrong.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisBranchStrategyStrong.h File Reference
+
+
+
#include "BcpsBranchObject.h"
+#include "BcpsBranchStrategy.h"
+#include "BlisModel.h"
+
+ + Include dependency graph for BlisBranchStrategyStrong.h:
+
+
+ +
+

Go to the source code of this file.

+ + + + + + + +

+Classes

struct  BlisStrong
 
class  BlisBranchStrategyStrong
 This class implements strong branching. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisBranchStrategyStrong_8h__incl.map b/Doxygen/0.94/BlisBranchStrategyStrong_8h__incl.map new file mode 100644 index 0000000..77b25ee --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyStrong_8h__incl.map @@ -0,0 +1,36 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisBranchStrategyStrong_8h__incl.md5 b/Doxygen/0.94/BlisBranchStrategyStrong_8h__incl.md5 new file mode 100644 index 0000000..8b765a5 --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyStrong_8h__incl.md5 @@ -0,0 +1 @@ +77fd797b1b2a722da805387aeacc5b59 \ No newline at end of file diff --git a/Doxygen/0.94/BlisBranchStrategyStrong_8h__incl.png b/Doxygen/0.94/BlisBranchStrategyStrong_8h__incl.png new file mode 100644 index 0000000..6b4302f Binary files /dev/null and b/Doxygen/0.94/BlisBranchStrategyStrong_8h__incl.png differ diff --git a/Doxygen/0.94/BlisBranchStrategyStrong_8h_source.html b/Doxygen/0.94/BlisBranchStrategyStrong_8h_source.html new file mode 100644 index 0000000..2575b41 --- /dev/null +++ b/Doxygen/0.94/BlisBranchStrategyStrong_8h_source.html @@ -0,0 +1,188 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisBranchStrategyStrong.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisBranchStrategyStrong.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * ALPS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 
+
25 //#############################################################################
+
26 // NOTE: Borrow ideas from COIN/Cbc
+
27 //#############################################################################
+
28 
+
29 
+
30 #ifndef BlisBranchStrategyStrong_h_
+
31 #define BlisBranchStrategyStrong_h_
+
32 
+
33 #include "BcpsBranchObject.h"
+
34 #include "BcpsBranchStrategy.h"
+
35 #include "BlisModel.h"
+
36 
+
37 
+
38 //#############################################################################
+
39 
+
40 
+
41 typedef struct {
+
42  int objectIndex; // object index
+
43  BcpsBranchObject * bObject; // the branching object
+
44  int numIntInfUp; // without odd ones
+
45  int numObjInfUp; // just odd ones
+
46  bool finishedUp; // true if solver finished
+
47  int numIntInfDown; // without odd ones
+
48  int numObjInfDown; // just odd ones
+
49  bool finishedDown; // true if solver finished
+
50 } BlisStrong;
+
51 
+
52 
+
53 //#############################################################################
+
54 
+
55 
+
57 class BlisBranchStrategyStrong : public BcpsBranchStrategy {
+
58 
+
59  private:
+
60 
+
62  BlisBranchStrategyStrong& operator=(const BlisBranchStrategyStrong& rhs);
+
63 
+
64  public:
+
65 
+
67  BlisBranchStrategyStrong() {
+
68  type_ = static_cast<int>(BlisBranchingStrategyStrong);
+
69  }
+
70 
+
72  BlisBranchStrategyStrong(BlisModel *model)
+
73  : BcpsBranchStrategy(model) {
+
74  type_ = static_cast<int>(BlisBranchingStrategyStrong);
+
75  }
+
76 
+
78  virtual ~BlisBranchStrategyStrong() {}
+
79 
+
81  BlisBranchStrategyStrong(const BlisBranchStrategyStrong &);
+
82 
+
84  virtual BcpsBranchStrategy * clone() const {
+
85  return new BlisBranchStrategyStrong(*this);
+
86  }
+
87 
+
89  virtual int createCandBranchObjects(int numPassesLeft, double ub);
+
90 
+
96  virtual int betterBranchObject(BcpsBranchObject * thisOne,
+
97  BcpsBranchObject * bestSoFar);
+
98 };
+
99 
+
100 #endif
+
+
BlisStrong::numIntInfDown
int numIntInfDown
Definition: BlisBranchStrategyStrong.h:47
+
BlisBranchStrategyStrong::betterBranchObject
virtual int betterBranchObject(BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)
Compare branching object thisOne to bestSoFar.
+
BlisStrong::numObjInfDown
int numObjInfDown
Definition: BlisBranchStrategyStrong.h:48
+
BlisModel
Definition: BlisModel.h:69
+
BlisStrong
Definition: BlisBranchStrategyStrong.h:41
+
BlisStrong::numIntInfUp
int numIntInfUp
Definition: BlisBranchStrategyStrong.h:44
+
BlisStrong::finishedUp
bool finishedUp
Definition: BlisBranchStrategyStrong.h:46
+
BlisStrong::finishedDown
bool finishedDown
Definition: BlisBranchStrategyStrong.h:49
+
BlisModel.h
+
BlisBranchStrategyStrong
This class implements strong branching.
Definition: BlisBranchStrategyStrong.h:57
+
BlisBranchStrategyStrong::clone
virtual BcpsBranchStrategy * clone() const
Clone a brancing strategy.
Definition: BlisBranchStrategyStrong.h:84
+
BlisBranchStrategyStrong::BlisBranchStrategyStrong
BlisBranchStrategyStrong()
Strong Constructor.
Definition: BlisBranchStrategyStrong.h:67
+
BlisBranchStrategyStrong::operator=
BlisBranchStrategyStrong & operator=(const BlisBranchStrategyStrong &rhs)
Illegal Assignment operator.
+
BlisBranchStrategyStrong::~BlisBranchStrategyStrong
virtual ~BlisBranchStrategyStrong()
Destructor.
Definition: BlisBranchStrategyStrong.h:78
+
BlisBranchingStrategyStrong
@ BlisBranchingStrategyStrong
Definition: Blis.h:106
+
BlisStrong::objectIndex
int objectIndex
Definition: BlisBranchStrategyStrong.h:42
+
BlisStrong::bObject
BcpsBranchObject * bObject
Definition: BlisBranchStrategyStrong.h:43
+
BlisBranchStrategyStrong::createCandBranchObjects
virtual int createCandBranchObjects(int numPassesLeft, double ub)
Create a set of candidate branching objects.
+
BlisBranchStrategyStrong::BlisBranchStrategyStrong
BlisBranchStrategyStrong(BlisModel *model)
Strong Constructor.
Definition: BlisBranchStrategyStrong.h:72
+
BlisStrong::numObjInfUp
int numObjInfUp
Definition: BlisBranchStrategyStrong.h:45
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisConGenerator_8h.html b/Doxygen/0.94/BlisConGenerator_8h.html new file mode 100644 index 0000000..0091cef --- /dev/null +++ b/Doxygen/0.94/BlisConGenerator_8h.html @@ -0,0 +1,130 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisConGenerator.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisConGenerator.h File Reference
+
+
+
#include "OsiSolverInterface.hpp"
+#include "OsiCuts.hpp"
+
+ + Include dependency graph for BlisConGenerator.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + + +

+Classes

class  BlisConGenerator
 Interface between Blis and Cut Generation Library. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisConGenerator_8h__dep__incl.map b/Doxygen/0.94/BlisConGenerator_8h__dep__incl.map new file mode 100644 index 0000000..8ae0d04 --- /dev/null +++ b/Doxygen/0.94/BlisConGenerator_8h__dep__incl.map @@ -0,0 +1,17 @@ + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisConGenerator_8h__dep__incl.md5 b/Doxygen/0.94/BlisConGenerator_8h__dep__incl.md5 new file mode 100644 index 0000000..e884603 --- /dev/null +++ b/Doxygen/0.94/BlisConGenerator_8h__dep__incl.md5 @@ -0,0 +1 @@ +04de24c126ac8074022cab28282b98aa \ No newline at end of file diff --git a/Doxygen/0.94/BlisConGenerator_8h__dep__incl.png b/Doxygen/0.94/BlisConGenerator_8h__dep__incl.png new file mode 100644 index 0000000..cc95200 Binary files /dev/null and b/Doxygen/0.94/BlisConGenerator_8h__dep__incl.png differ diff --git a/Doxygen/0.94/BlisConGenerator_8h__incl.map b/Doxygen/0.94/BlisConGenerator_8h__incl.map new file mode 100644 index 0000000..cda83a2 --- /dev/null +++ b/Doxygen/0.94/BlisConGenerator_8h__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/BlisConGenerator_8h__incl.md5 b/Doxygen/0.94/BlisConGenerator_8h__incl.md5 new file mode 100644 index 0000000..4eca20a --- /dev/null +++ b/Doxygen/0.94/BlisConGenerator_8h__incl.md5 @@ -0,0 +1 @@ +1f1f37c23cd3e37655914343eeddfff8 \ No newline at end of file diff --git a/Doxygen/0.94/BlisConGenerator_8h__incl.png b/Doxygen/0.94/BlisConGenerator_8h__incl.png new file mode 100644 index 0000000..322685d Binary files /dev/null and b/Doxygen/0.94/BlisConGenerator_8h__incl.png differ diff --git a/Doxygen/0.94/BlisConGenerator_8h_source.html b/Doxygen/0.94/BlisConGenerator_8h_source.html new file mode 100644 index 0000000..c588826 --- /dev/null +++ b/Doxygen/0.94/BlisConGenerator_8h_source.html @@ -0,0 +1,305 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisConGenerator.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisConGenerator.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 
+
25 //#############################################################################
+
26 // This file is modified from COIN/Cbc/CbcCutGenerator.hpp
+
27 //#############################################################################
+
28 
+
29 
+
30 #ifndef BlisConGenerator_h_
+
31 #define BlisConGenerator_h_
+
32 
+
33 #include "OsiSolverInterface.hpp"
+
34 #include "OsiCuts.hpp"
+
35 
+
36 
+
37 class BlisModel;
+
38 
+
39 class OsiRowCut;
+
40 class OsiRowCutDebugger;
+
41 class CglCutGenerator;
+
42 
+
43 
+
44 //#############################################################################
+
45 
+
58 class BlisConGenerator {
+
59 
+
60 protected:
+
62  BlisModel *model_;
+
63 
+
65  CglCutGenerator * generator_;
+
66 
+
67  //------------------------------------------------------
+
68  // CON CONTROL
+
69  //------------------------------------------------------
+
70 
+
77  BlisCutStrategy strategy_;
+
78 
+
80  int cutGenerationFrequency_;
+
81 
+
83  std::string name_;
+
84 
+
86  bool normal_;
+
87 
+
89  bool atSolution_;
+
90 
+
93  bool whenInfeasible_;
+
94 
+
95  //------------------------------------------------------
+
96  // CON STATISTICS
+
97  //------------------------------------------------------
+
98 
+
100  int numConsGenerated_;
+
101 
+
103  int numConsUsed_;
+
104 
+
106  double time_;
+
107 
+
109  int calls_;
+
110 
+
112  int noConsCalls_;
+
113 
+
114  public:
+
115 
+
119  BlisConGenerator()
+
120  :
+
121  model_(NULL),
+
122  generator_(NULL),
+
123  strategy_(BlisCutStrategyAuto),
+
124  cutGenerationFrequency_(1),
+
125  normal_(true),
+
126  atSolution_(false),
+
127  whenInfeasible_(false),
+
128  numConsGenerated_(0),
+
129  numConsUsed_(0),
+
130  time_(0),
+
131  calls_(0),
+
132  noConsCalls_(0)
+
133  { name_ = "UNKNOWN"; }
+
134 
+
136  BlisConGenerator(BlisModel * model,
+
137  CglCutGenerator * generator,
+
138  const char * name = NULL,
+
139  BlisCutStrategy strategy = BlisCutStrategyAuto,
+
140  int cutGenerationFrequency_ = 1,
+
141  bool normal = true,
+
142  bool atSolution = false,
+
143  bool infeasible = false);
+
144 
+
146  BlisConGenerator (const BlisConGenerator &);
+
147 
+
149  BlisConGenerator & operator=(const BlisConGenerator& rhs);
+
150 
+
152  virtual ~BlisConGenerator()
+
153  {
+
154  if (generator_) {
+
155  delete generator_;
+
156  generator_ = NULL;
+
157  }
+
158  }
+
160 
+
172  virtual bool generateConstraints(BcpsConstraintPool &conPool);
+
174 
+
182  inline BlisModel *getModel() { return model_; }
+
183 
+
185  inline void setModel(BlisModel *m) { model_ = m; }
+
186 
+
188  void refreshModel(BlisModel * model);
+
189 
+
191  void setName(const char *str) { name_ = str; }
+
192 
+
194  inline std::string name() const { return name_; }
+
195 
+
197  void setStrategy(BlisCutStrategy value) { strategy_ = value; }
+
198 
+
200  inline BlisCutStrategy strategy() const { return strategy_; }
+
201 
+
203  void setCutGenerationFreq(int freq) { cutGenerationFrequency_ = freq; }
+
204 
+
206  inline int cutGenerationFreq() const { return cutGenerationFrequency_; }
+
207 
+
209  inline bool normal() const { return normal_; }
+
210 
+
212  inline void setNormal(bool value) { normal_ = value; }
+
213 
+
216  inline bool atSolution() const { return atSolution_; }
+
217 
+
220  inline void setAtSolution(bool value) { atSolution_ = value; }
+
221 
+
224  inline bool whenInfeasible() const { return whenInfeasible_; }
+
225 
+
228  inline void setWhenInfeasible(bool value) { whenInfeasible_ = value; }
+
229 
+
231  inline CglCutGenerator * generator() const { return generator_; }
+
232 
+
234  inline int numConsGenerated() { return numConsGenerated_; }
+
235 
+
237  inline void addNumConsGenerated(int n) { numConsGenerated_ += n; }
+
238 
+
240  inline int numConsUsed() { return numConsUsed_; }
+
241 
+
243  inline void addNumConsUsed(int n) { numConsUsed_ += n; }
+
244 
+
246  inline double time() const { return time_; }
+
247 
+
249  inline void addTime(double t) { time_ += t; }
+
250 
+
252  inline int calls() const { return calls_; }
+
253 
+
255  inline void addCalls(int n=1) { calls_ += n; }
+
256 
+
258  inline int noConsCalls() const { return noConsCalls_; }
+
259 
+
261  inline void addNoConsCalls(int n=1) { noConsCalls_ += n; }
+
263 };
+
264 
+
265 #endif
+
+
BlisConGenerator::refreshModel
void refreshModel(BlisModel *model)
Refresh the model.
+
BlisConGenerator::atSolution_
bool atSolution_
Whether to call the generator when a new solution is found.
Definition: BlisConGenerator.h:89
+
BlisConGenerator
Interface between Blis and Cut Generation Library.
Definition: BlisConGenerator.h:58
+
BlisConGenerator::setNormal
void setNormal(bool value)
Set whether the con generator should be called in the normal place.
Definition: BlisConGenerator.h:212
+
BlisConGenerator::operator=
BlisConGenerator & operator=(const BlisConGenerator &rhs)
Assignment operator.
+
BlisConGenerator::addNumConsGenerated
void addNumConsGenerated(int n)
Increase the number of generated cons.
Definition: BlisConGenerator.h:237
+
BlisConGenerator::calls_
int calls_
The times of calling this generator.
Definition: BlisConGenerator.h:109
+
BlisModel
Definition: BlisModel.h:69
+
BlisConGenerator::time_
double time_
Used CPU/User time.
Definition: BlisConGenerator.h:106
+
BlisConGenerator::generator
CglCutGenerator * generator() const
Get the CglCutGenerator bound to this BlisConGenerator.
Definition: BlisConGenerator.h:231
+
BlisConGenerator::strategy_
BlisCutStrategy strategy_
When to call CglCutGenerator::generateCuts routine.
Definition: BlisConGenerator.h:77
+
BlisConGenerator::addTime
void addTime(double t)
Increase Cpu time used.
Definition: BlisConGenerator.h:249
+
BlisConGenerator::noConsCalls
int noConsCalls() const
Number called and no cons found.
Definition: BlisConGenerator.h:258
+
BlisConGenerator::time
double time() const
Cpu time used.
Definition: BlisConGenerator.h:246
+
BlisConGenerator::setCutGenerationFreq
void setCutGenerationFreq(int freq)
Set the con generation strategy.
Definition: BlisConGenerator.h:203
+
BlisConGenerator::addCalls
void addCalls(int n=1)
Increase the number of called.
Definition: BlisConGenerator.h:255
+
BlisConGenerator::setStrategy
void setStrategy(BlisCutStrategy value)
Set the con generation strategy.
Definition: BlisConGenerator.h:197
+
BlisConGenerator::generateConstraints
virtual bool generateConstraints(BcpsConstraintPool &conPool)
Generate cons for the client model.
+
BlisConGenerator::atSolution
bool atSolution() const
Get whether the con generator should be called when a solution is found.
Definition: BlisConGenerator.h:216
+
BlisConGenerator::whenInfeasible
bool whenInfeasible() const
Get whether the con generator should be called when the subproblem is found to be infeasible.
Definition: BlisConGenerator.h:224
+
BlisConGenerator::calls
int calls() const
Number called.
Definition: BlisConGenerator.h:252
+
BlisConGenerator::strategy
BlisCutStrategy strategy() const
Get the con generation interval.
Definition: BlisConGenerator.h:200
+
BlisConGenerator::setWhenInfeasible
void setWhenInfeasible(bool value)
Set whether the con generator should be called when the subproblem is found to be infeasible.
Definition: BlisConGenerator.h:228
+
BlisConGenerator::setAtSolution
void setAtSolution(bool value)
Set whether the con generator should be called when a solution is found.
Definition: BlisConGenerator.h:220
+
BlisConGenerator::whenInfeasible_
bool whenInfeasible_
Whether to call generator when a subproblem is found to be infeasible.
Definition: BlisConGenerator.h:93
+
BlisConGenerator::numConsUsed
int numConsUsed()
Get number of used cons.
Definition: BlisConGenerator.h:240
+
BlisCutStrategy
BlisCutStrategy
Definition: Blis.h:69
+
BlisConGenerator::setModel
void setModel(BlisModel *m)
Set the model.
Definition: BlisConGenerator.h:185
+
BlisConGenerator::addNoConsCalls
void addNoConsCalls(int n=1)
Increase the number of no cons called.
Definition: BlisConGenerator.h:261
+
BlisConGenerator::generator_
CglCutGenerator * generator_
The CglCutGenerator object.
Definition: BlisConGenerator.h:65
+
BlisConGenerator::model_
BlisModel * model_
The client model.
Definition: BlisConGenerator.h:62
+
BlisConGenerator::noConsCalls_
int noConsCalls_
The times of calling this generator and no cons found.
Definition: BlisConGenerator.h:112
+
BlisConGenerator::addNumConsUsed
void addNumConsUsed(int n)
Increase the number of generated cons.
Definition: BlisConGenerator.h:243
+
BlisConGenerator::numConsGenerated_
int numConsGenerated_
Number of cons generated.
Definition: BlisConGenerator.h:100
+
BlisConGenerator::~BlisConGenerator
virtual ~BlisConGenerator()
Destructor.
Definition: BlisConGenerator.h:152
+
BlisConGenerator::BlisConGenerator
BlisConGenerator()
Default constructor.
Definition: BlisConGenerator.h:119
+
BlisCutStrategyAuto
@ BlisCutStrategyAuto
Definition: Blis.h:73
+
BlisConGenerator::getModel
BlisModel * getModel()
Set the client model.
Definition: BlisConGenerator.h:182
+
BlisConGenerator::normal
bool normal() const
Get whether the con generator should be called in the normal place.
Definition: BlisConGenerator.h:209
+
BlisConGenerator::setName
void setName(const char *str)
return name of generator.
Definition: BlisConGenerator.h:191
+
BlisConGenerator::cutGenerationFreq
int cutGenerationFreq() const
Get the con generation interval.
Definition: BlisConGenerator.h:206
+
BlisConGenerator::numConsGenerated
int numConsGenerated()
Get number of generated cons.
Definition: BlisConGenerator.h:234
+
BlisConGenerator::cutGenerationFrequency_
int cutGenerationFrequency_
The frequency of calls to the cut generator.
Definition: BlisConGenerator.h:80
+
BlisConGenerator::name
std::string name() const
return name of generator.
Definition: BlisConGenerator.h:194
+
BlisConGenerator::name_
std::string name_
Name of generator.
Definition: BlisConGenerator.h:83
+
BlisConGenerator::numConsUsed_
int numConsUsed_
Number of cons used.
Definition: BlisConGenerator.h:103
+
BlisConGenerator::normal_
bool normal_
Whether to call the generator in the normal place.
Definition: BlisConGenerator.h:86
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisConfig_8h.html b/Doxygen/0.94/BlisConfig_8h.html new file mode 100644 index 0000000..a9d5771 --- /dev/null +++ b/Doxygen/0.94/BlisConfig_8h.html @@ -0,0 +1,124 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisConfig.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisConfig.h File Reference
+
+
+
#include "config_blis_default.h"
+
+ + Include dependency graph for BlisConfig.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisConfig_8h__dep__incl.map b/Doxygen/0.94/BlisConfig_8h__dep__incl.map new file mode 100644 index 0000000..5095d93 --- /dev/null +++ b/Doxygen/0.94/BlisConfig_8h__dep__incl.map @@ -0,0 +1,22 @@ + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisConfig_8h__dep__incl.md5 b/Doxygen/0.94/BlisConfig_8h__dep__incl.md5 new file mode 100644 index 0000000..af93607 --- /dev/null +++ b/Doxygen/0.94/BlisConfig_8h__dep__incl.md5 @@ -0,0 +1 @@ +4e5d93edc607cb8d7e6df51d27aa09e9 \ No newline at end of file diff --git a/Doxygen/0.94/BlisConfig_8h__dep__incl.png b/Doxygen/0.94/BlisConfig_8h__dep__incl.png new file mode 100644 index 0000000..f0815cd Binary files /dev/null and b/Doxygen/0.94/BlisConfig_8h__dep__incl.png differ diff --git a/Doxygen/0.94/BlisConfig_8h__incl.map b/Doxygen/0.94/BlisConfig_8h__incl.map new file mode 100644 index 0000000..4e597c3 --- /dev/null +++ b/Doxygen/0.94/BlisConfig_8h__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/BlisConfig_8h__incl.md5 b/Doxygen/0.94/BlisConfig_8h__incl.md5 new file mode 100644 index 0000000..48a92e1 --- /dev/null +++ b/Doxygen/0.94/BlisConfig_8h__incl.md5 @@ -0,0 +1 @@ +aad972c0761bd3b1a50c6cec3ed40d82 \ No newline at end of file diff --git a/Doxygen/0.94/BlisConfig_8h__incl.png b/Doxygen/0.94/BlisConfig_8h__incl.png new file mode 100644 index 0000000..51a9146 Binary files /dev/null and b/Doxygen/0.94/BlisConfig_8h__incl.png differ diff --git a/Doxygen/0.94/BlisConfig_8h_source.html b/Doxygen/0.94/BlisConfig_8h_source.html new file mode 100644 index 0000000..0881cf9 --- /dev/null +++ b/Doxygen/0.94/BlisConfig_8h_source.html @@ -0,0 +1,147 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisConfig.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisConfig.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 /* Include file for the configuration of Alps.
+
25  *
+
26  * On systems where the code is configured with the configure script
+
27  * (i.e., compilation is always done with HAVE_CONFIG_H defined), this
+
28  * header file includes the automatically generated header file, and
+
29  * undefines macros that might configure with other Config.h files.
+
30  *
+
31  * On systems that are compiled in other ways (e.g., with the
+
32  * Developer Studio), a header files is included to define those
+
33  * macros that depend on the operating system and the compiler. The
+
34  * macros that define the configuration of the particular user setting
+
35  * (e.g., presence of other COIN-OR packages or third party code) are set
+
36  * by the files config_*default.h. The project maintainer needs to remember
+
37  * to update these file and choose reasonable defines.
+
38  * A user can modify the default setting by editing the config_*default.h files.
+
39  *
+
40  */
+
41 
+
42 #ifndef __BLISCONFIG_H__
+
43 #define __BLISCONFIG_H__
+
44 
+
45 #ifdef HAVE_CONFIG_H
+
46 #ifdef BLIS_BUILD
+
47 #include "config.h"
+
48 #else
+
49 #include "config_blis.h"
+
50 #endif
+
51 
+
52 #else /* HAVE_CONFIG_H */
+
53 
+
54 #ifdef BLIS_BUILD
+
55 #include "config_default.h"
+
56 #else
+
57 #include "config_blis_default.h"
+
58 #endif
+
59 
+
60 #endif /* HAVE_CONFIG_H */
+
61 
+
62 #endif /*__BLISCONFIG_H__*/
+
+
config_default.h
+
config_blis_default.h
+
config_blis.h
+
config.h
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisConstraint_8h.html b/Doxygen/0.94/BlisConstraint_8h.html new file mode 100644 index 0000000..51e835e --- /dev/null +++ b/Doxygen/0.94/BlisConstraint_8h.html @@ -0,0 +1,103 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisConstraint.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisConstraint.h File Reference
+
+
+
#include "BcpsObject.h"
+
+ + Include dependency graph for BlisConstraint.h:
+
+
+ +
+

Go to the source code of this file.

+ + + + +

+Classes

class  BlisConstraint
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisConstraint_8h__incl.map b/Doxygen/0.94/BlisConstraint_8h__incl.map new file mode 100644 index 0000000..b8a8835 --- /dev/null +++ b/Doxygen/0.94/BlisConstraint_8h__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/BlisConstraint_8h__incl.md5 b/Doxygen/0.94/BlisConstraint_8h__incl.md5 new file mode 100644 index 0000000..6adecb4 --- /dev/null +++ b/Doxygen/0.94/BlisConstraint_8h__incl.md5 @@ -0,0 +1 @@ +6fd0540a65da3385a6f36572a7ec36ab \ No newline at end of file diff --git a/Doxygen/0.94/BlisConstraint_8h__incl.png b/Doxygen/0.94/BlisConstraint_8h__incl.png new file mode 100644 index 0000000..ce8ba45 Binary files /dev/null and b/Doxygen/0.94/BlisConstraint_8h__incl.png differ diff --git a/Doxygen/0.94/BlisConstraint_8h_source.html b/Doxygen/0.94/BlisConstraint_8h_source.html new file mode 100644 index 0000000..4181644 --- /dev/null +++ b/Doxygen/0.94/BlisConstraint_8h_source.html @@ -0,0 +1,188 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisConstraint.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisConstraint.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 #ifndef BlisConstraint_h_
+
25 #define BlisConstraint_h_
+
26 
+
27 #include "BcpsObject.h"
+
28 
+
29 class OsiRowCut;
+
30 
+
31 //#############################################################################
+
32 
+
33 class BlisConstraint : public BcpsConstraint {
+
34 
+
35  protected:
+
37  int size_;
+
39  int *indices_;
+
41  double *values_;
+
42 
+
43  public:
+
44 
+
46  BlisConstraint();
+
47 
+
49  BlisConstraint(int s, const int *ind, const double *val);
+
50 
+
52  BlisConstraint(double lbh, double ubh, double lbs, double ubs);
+
53 
+
55  BlisConstraint(double lbh, double ubh, double lbs, double ubs,
+
56  int size, const int *ind, const double *val);
+
58  virtual ~BlisConstraint();
+
59 
+
61  BlisConstraint(const BlisConstraint & rhs);
+
62 
+
65  int getSize() const { return size_; }
+
66  int* getIndices() const { return indices_; }
+
67  double* getValues() const { return values_; }
+
72  void setData(int s, const int *ind, const double *val) {
+
73  if (size_ < s) {
+
74  delete [] indices_;
+
75  delete [] values_;
+
76  indices_ = new int [s];
+
77  values_ = new double [s];
+
78  }
+
79  size_ = s;
+
80  memcpy(indices_, ind, sizeof(int) * s);
+
81  memcpy(values_, val, sizeof(double) * s);
+
82  }
+
85  protected:
+
86 
+
88  AlpsReturnStatus encodeBlis(AlpsEncoded *encoded);
+
89 
+
91  AlpsReturnStatus decodeBlis(AlpsEncoded &encoded);
+
92 
+
93  public:
+
94 
+
96  OsiRowCut *createOsiRowCut();
+
97 
+
99  virtual void hashing(BcpsModel *model=NULL);
+
100 
+
102  double violation(const double *lpSolution);
+
103 
+
104  using AlpsKnowledge::encode ;
+
106  virtual AlpsReturnStatus encode(AlpsEncoded *encoded);
+
107 
+
109  virtual AlpsKnowledge* decode(AlpsEncoded& encoded) const;
+
110 };
+
111 
+
112 //#############################################################################
+
113 
+
114 #endif
+
+
BlisConstraint::encode
virtual AlpsReturnStatus encode(AlpsEncoded *encoded)
Pack into a encode object.
+
BlisConstraint::getValues
double * getValues() const
Definition: BlisConstraint.h:67
+
BlisConstraint::getIndices
int * getIndices() const
Definition: BlisConstraint.h:66
+
BlisConstraint::values_
double * values_
Value of nonzero coefficients.
Definition: BlisConstraint.h:41
+
BlisConstraint::size_
int size_
Number of nonzero coefficients.
Definition: BlisConstraint.h:37
+
BlisConstraint::setData
void setData(int s, const int *ind, const double *val)
Set data
Definition: BlisConstraint.h:72
+
BlisConstraint::decode
virtual AlpsKnowledge * decode(AlpsEncoded &encoded) const
Decode a constraint from an encoded object.
+
BlisConstraint::~BlisConstraint
virtual ~BlisConstraint()
Destructor.
+
BlisConstraint::getSize
int getSize() const
Return data
Definition: BlisConstraint.h:65
+
BlisConstraint::BlisConstraint
BlisConstraint()
Default constructor.
+
BlisConstraint::hashing
virtual void hashing(BcpsModel *model=NULL)
Compute a hash key.
+
BlisConstraint
Definition: BlisConstraint.h:33
+
BlisConstraint::indices_
int * indices_
Variable indices.
Definition: BlisConstraint.h:39
+
BlisConstraint::violation
double violation(const double *lpSolution)
Check if violates a given lp solution.
+
BlisConstraint::createOsiRowCut
OsiRowCut * createOsiRowCut()
Create a OsiRowCut based on this constraint.
+
BlisConstraint::encodeBlis
AlpsReturnStatus encodeBlis(AlpsEncoded *encoded)
Pack Blis part into an encoded object.
+
BlisConstraint::decodeBlis
AlpsReturnStatus decodeBlis(AlpsEncoded &encoded)
Unpack Blis part from a encode object.
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisHelp_8h.html b/Doxygen/0.94/BlisHelp_8h.html new file mode 100644 index 0000000..042d93c --- /dev/null +++ b/Doxygen/0.94/BlisHelp_8h.html @@ -0,0 +1,452 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisHelp.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Functions
+
+
BlisHelp.h File Reference
+
+
+
#include "AlpsEncoded.h"
+#include "Blis.h"
+
+ + Include dependency graph for BlisHelp.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

BlisConstraint * BlisOsiCutToConstraint (const OsiRowCut *rowCut)
 Convert a OsiRowCut to a Blis Contraint. More...
 
BlisReturnStatus BlisStrongBranch (BlisModel *model, double objValue, int colInd, double x, const double *saveLower, const double *saveUpper, bool &downKeep, bool &downFinished, double &downDeg, bool &upKeep, bool &upFinished, double &upDeg)
 Strong branching on a variable colInd. More...
 
int BlisEncodeWarmStart (AlpsEncoded *encoded, const CoinWarmStartBasis *ws)
 Pack coin warm start into an encoded object. More...
 
CoinWarmStartBasis * BlisDecodeWarmStart (AlpsEncoded &encoded, AlpsReturnStatus *rc)
 Unpack coin warm start from an encoded object. More...
 
double BlisHashingOsiRowCut (const OsiRowCut *rowCut, const BlisModel *model)
 Compute and return a hash value of an Osi row cut. More...
 
bool BlisParallelCutCut (OsiRowCut *rowCut1, OsiRowCut *rowCut2, double threshold=1.0)
 Check if a row cut parallel with another row cut. More...
 
bool BlisParallelCutCon (OsiRowCut *rowCut, BlisConstraint *con, double threshold=1.0)
 Check if a row cut parallel with a constraint. More...
 
bool BlisParallelConCon (BlisConstraint *con1, BlisConstraint *con2, double threshold=1.0)
 Check if a row cut parallel with a constraint. More...
 
+

Function Documentation

+ +

◆ BlisOsiCutToConstraint()

+ +
+
+ + + + + + + + +
BlisConstraint* BlisOsiCutToConstraint (const OsiRowCut * rowCut)
+
+ +

Convert a OsiRowCut to a Blis Contraint.

+ +
+
+ +

◆ BlisStrongBranch()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisReturnStatus BlisStrongBranch (BlisModel * model,
double objValue,
int colInd,
double x,
const double * saveLower,
const double * saveUpper,
bool & downKeep,
bool & downFinished,
double & downDeg,
bool & upKeep,
bool & upFinished,
double & upDeg 
)
+
+ +

Strong branching on a variable colInd.

+ +
+
+ +

◆ BlisEncodeWarmStart()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int BlisEncodeWarmStart (AlpsEncoded * encoded,
const CoinWarmStartBasis * ws 
)
+
+ +

Pack coin warm start into an encoded object.

+ +
+
+ +

◆ BlisDecodeWarmStart()

+ +
+
+ + + + + + + + + + + + + + + + + + +
CoinWarmStartBasis* BlisDecodeWarmStart (AlpsEncoded & encoded,
AlpsReturnStatus * rc 
)
+
+ +

Unpack coin warm start from an encoded object.

+ +
+
+ +

◆ BlisHashingOsiRowCut()

+ +
+
+ + + + + + + + + + + + + + + + + + +
double BlisHashingOsiRowCut (const OsiRowCut * rowCut,
const BlisModel * model 
)
+
+ +

Compute and return a hash value of an Osi row cut.

+ +
+
+ +

◆ BlisParallelCutCut()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool BlisParallelCutCut (OsiRowCut * rowCut1,
OsiRowCut * rowCut2,
double threshold = 1.0 
)
+
+ +

Check if a row cut parallel with another row cut.

+ +
+
+ +

◆ BlisParallelCutCon()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool BlisParallelCutCon (OsiRowCut * rowCut,
BlisConstraint * con,
double threshold = 1.0 
)
+
+ +

Check if a row cut parallel with a constraint.

+ +
+
+ +

◆ BlisParallelConCon()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool BlisParallelConCon (BlisConstraint * con1,
BlisConstraint * con2,
double threshold = 1.0 
)
+
+ +

Check if a row cut parallel with a constraint.

+ +
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisHelp_8h__dep__incl.map b/Doxygen/0.94/BlisHelp_8h__dep__incl.map new file mode 100644 index 0000000..127b989 --- /dev/null +++ b/Doxygen/0.94/BlisHelp_8h__dep__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/BlisHelp_8h__dep__incl.md5 b/Doxygen/0.94/BlisHelp_8h__dep__incl.md5 new file mode 100644 index 0000000..bfddef4 --- /dev/null +++ b/Doxygen/0.94/BlisHelp_8h__dep__incl.md5 @@ -0,0 +1 @@ +36a0b900d31f2e4503800e85f98df696 \ No newline at end of file diff --git a/Doxygen/0.94/BlisHelp_8h__dep__incl.png b/Doxygen/0.94/BlisHelp_8h__dep__incl.png new file mode 100644 index 0000000..8be14f5 Binary files /dev/null and b/Doxygen/0.94/BlisHelp_8h__dep__incl.png differ diff --git a/Doxygen/0.94/BlisHelp_8h__incl.map b/Doxygen/0.94/BlisHelp_8h__incl.map new file mode 100644 index 0000000..4321326 --- /dev/null +++ b/Doxygen/0.94/BlisHelp_8h__incl.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/Doxygen/0.94/BlisHelp_8h__incl.md5 b/Doxygen/0.94/BlisHelp_8h__incl.md5 new file mode 100644 index 0000000..a2b8c64 --- /dev/null +++ b/Doxygen/0.94/BlisHelp_8h__incl.md5 @@ -0,0 +1 @@ +1232d56d0950de773fa4e39099276a25 \ No newline at end of file diff --git a/Doxygen/0.94/BlisHelp_8h__incl.png b/Doxygen/0.94/BlisHelp_8h__incl.png new file mode 100644 index 0000000..24be794 Binary files /dev/null and b/Doxygen/0.94/BlisHelp_8h__incl.png differ diff --git a/Doxygen/0.94/BlisHelp_8h_source.html b/Doxygen/0.94/BlisHelp_8h_source.html new file mode 100644 index 0000000..72159f8 --- /dev/null +++ b/Doxygen/0.94/BlisHelp_8h_source.html @@ -0,0 +1,161 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisHelp.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisHelp.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 //#############################################################################
+
25 
+
26 #ifndef BlisHelp_h_
+
27 #define BlisHelp_h_
+
28 
+
29 #include "AlpsEncoded.h"
+
30 
+
31 #include "Blis.h"
+
32 
+
33 class CoinWarmStartBasis;
+
34 class OsiRowCut;
+
35 class BlisConstraint;
+
36 class BlisModel;
+
37 
+
38 //#############################################################################
+
39 
+
41 BlisConstraint * BlisOsiCutToConstraint(const OsiRowCut *rowCut);
+
42 
+
44 BlisReturnStatus BlisStrongBranch(BlisModel *model, double objValue, int colInd, double x,
+
45  const double *saveLower, const double *saveUpper,
+
46  bool &downKeep, bool &downFinished, double &downDeg,
+
47  bool &upKeep, bool &upFinished, double &upDeg);
+
48 
+
50 int BlisEncodeWarmStart(AlpsEncoded *encoded, const CoinWarmStartBasis *ws);
+
51 
+
53 CoinWarmStartBasis *BlisDecodeWarmStart(AlpsEncoded &encoded,
+
54  AlpsReturnStatus *rc);
+
55 
+
57 double BlisHashingOsiRowCut(const OsiRowCut *rowCut,
+
58  const BlisModel *model);
+
59 
+
61 bool BlisParallelCutCut(OsiRowCut * rowCut1,
+
62  OsiRowCut * rowCut2,
+
63  double threshold = 1.0);
+
64 
+
66 bool BlisParallelCutCon(OsiRowCut * rowCut,
+
67  BlisConstraint * con,
+
68  double threshold = 1.0);
+
69 
+
71 bool BlisParallelConCon(BlisConstraint * con1,
+
72  BlisConstraint * con2,
+
73  double threshold = 1.0);
+
74 
+
75 
+
76 #endif
+
+
BlisModel
Definition: BlisModel.h:69
+
BlisParallelCutCut
bool BlisParallelCutCut(OsiRowCut *rowCut1, OsiRowCut *rowCut2, double threshold=1.0)
Check if a row cut parallel with another row cut.
+
BlisReturnStatus
BlisReturnStatus
Definition: Blis.h:48
+
BlisParallelCutCon
bool BlisParallelCutCon(OsiRowCut *rowCut, BlisConstraint *con, double threshold=1.0)
Check if a row cut parallel with a constraint.
+
BlisHashingOsiRowCut
double BlisHashingOsiRowCut(const OsiRowCut *rowCut, const BlisModel *model)
Compute and return a hash value of an Osi row cut.
+
BlisEncodeWarmStart
int BlisEncodeWarmStart(AlpsEncoded *encoded, const CoinWarmStartBasis *ws)
Pack coin warm start into an encoded object.
+
Blis.h
+
BlisParallelConCon
bool BlisParallelConCon(BlisConstraint *con1, BlisConstraint *con2, double threshold=1.0)
Check if a row cut parallel with a constraint.
+
BlisStrongBranch
BlisReturnStatus BlisStrongBranch(BlisModel *model, double objValue, int colInd, double x, const double *saveLower, const double *saveUpper, bool &downKeep, bool &downFinished, double &downDeg, bool &upKeep, bool &upFinished, double &upDeg)
Strong branching on a variable colInd.
+
BlisConstraint
Definition: BlisConstraint.h:33
+
BlisOsiCutToConstraint
BlisConstraint * BlisOsiCutToConstraint(const OsiRowCut *rowCut)
Convert a OsiRowCut to a Blis Contraint.
+
BlisDecodeWarmStart
CoinWarmStartBasis * BlisDecodeWarmStart(AlpsEncoded &encoded, AlpsReturnStatus *rc)
Unpack coin warm start from an encoded object.
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisHeurRound_8h.html b/Doxygen/0.94/BlisHeurRound_8h.html new file mode 100644 index 0000000..0815517 --- /dev/null +++ b/Doxygen/0.94/BlisHeurRound_8h.html @@ -0,0 +1,117 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisHeurRound.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisHeurRound.h File Reference
+
+
+
#include <string>
+#include <vector>
+#include "CoinPackedMatrix.hpp"
+#include "OsiCuts.hpp"
+#include "BlisHeuristic.h"
+
+ + Include dependency graph for BlisHeurRound.h:
+
+
+ +
+

Go to the source code of this file.

+ + + + + +

+Classes

class  BlisHeurRound
 Rounding Heuristic. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisHeurRound_8h__incl.map b/Doxygen/0.94/BlisHeurRound_8h__incl.map new file mode 100644 index 0000000..1f127ad --- /dev/null +++ b/Doxygen/0.94/BlisHeurRound_8h__incl.map @@ -0,0 +1,13 @@ + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisHeurRound_8h__incl.md5 b/Doxygen/0.94/BlisHeurRound_8h__incl.md5 new file mode 100644 index 0000000..0d14cad --- /dev/null +++ b/Doxygen/0.94/BlisHeurRound_8h__incl.md5 @@ -0,0 +1 @@ +bf45c7d9803529bdb15a4100ddb156e0 \ No newline at end of file diff --git a/Doxygen/0.94/BlisHeurRound_8h__incl.png b/Doxygen/0.94/BlisHeurRound_8h__incl.png new file mode 100644 index 0000000..2dad24d Binary files /dev/null and b/Doxygen/0.94/BlisHeurRound_8h__incl.png differ diff --git a/Doxygen/0.94/BlisHeurRound_8h_source.html b/Doxygen/0.94/BlisHeurRound_8h_source.html new file mode 100644 index 0000000..4ce7478 --- /dev/null +++ b/Doxygen/0.94/BlisHeurRound_8h_source.html @@ -0,0 +1,180 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisHeurRound.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisHeurRound.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 //#############################################################################
+
25 // This file is modified from CbcHeuristic.hpp
+
26 //#############################################################################
+
27 
+
28 #ifndef BlisHeurRound_h_
+
29 #define BlisHeurRound_h_
+
30 
+
31 #include <string>
+
32 #include <vector>
+
33 
+
34 #include "CoinPackedMatrix.hpp"
+
35 #include "OsiCuts.hpp"
+
36 
+
37 #include "BlisHeuristic.h"
+
38 
+
39 class BlisModel;
+
40 
+
41 //#############################################################################
+
42 
+
44 class BlisHeurRound : public BlisHeuristic {
+
45  private:
+
47  BlisHeurRound & operator=(const BlisHeurRound& rhs);
+
48 
+
49  protected:
+
51  CoinPackedMatrix matrix_;
+
52 
+
54  CoinPackedMatrix matrixByRow_;
+
55 
+
57  int seed_;
+
58 
+
59  public:
+
61  BlisHeurRound() {}
+
62 
+
64  BlisHeurRound(BlisModel * model, const char *name,
+
65  BlisHeurStrategy strategy, int freq)
+
66  :
+
67  BlisHeuristic(model, name, strategy, freq)
+
68  {
+
69  assert(model->solver());
+
70  }
+
71 
+
73  ~BlisHeurRound() {}
+
74 
+
76  BlisHeurRound( const BlisHeurRound &);
+
77 
+
79  virtual BlisHeuristic * clone() const;
+
80 
+
82  virtual void setModel(BlisModel * model);
+
83 
+
84  //using BlisHeuristic::searchSolution ;
+
90  virtual bool searchSolution(double & objectiveValue,
+
91  double * newSolution);
+
92 
+
94  void setSeed(int value) { seed_ = value; }
+
95 
+
96 };
+
97 #endif
+
+
BlisHeuristic
Heuristic base class.
Definition: BlisHeuristic.h:48
+
BlisHeurRound::setModel
virtual void setModel(BlisModel *model)
update model (This is needed if cliques update matrix etc).
+
BlisHeuristic::name
const char * name() const
return name of generator.
Definition: BlisHeuristic.h:177
+
BlisHeuristic.h
+
BlisHeurRound::operator=
BlisHeurRound & operator=(const BlisHeurRound &rhs)
Illegal Assignment operator.
+
BlisModel
Definition: BlisModel.h:69
+
BlisHeurRound::BlisHeurRound
BlisHeurRound(BlisModel *model, const char *name, BlisHeurStrategy strategy, int freq)
Constructor with model - assumed before cuts.
Definition: BlisHeurRound.h:64
+
BlisHeurRound::seed_
int seed_
Seed for random stuff.
Definition: BlisHeurRound.h:57
+
BlisHeurRound::clone
virtual BlisHeuristic * clone() const
Clone a rounding heuristic.
+
BlisHeurRound::BlisHeurRound
BlisHeurRound()
Default Constructor.
Definition: BlisHeurRound.h:61
+
BlisHeurStrategy
BlisHeurStrategy
Definition: Blis.h:77
+
BlisHeurRound::matrix_
CoinPackedMatrix matrix_
Column majored matrix.
Definition: BlisHeurRound.h:51
+
BlisHeurRound::searchSolution
virtual bool searchSolution(double &objectiveValue, double *newSolution)
returns 0 if no solution, 1 if valid solution with better objective value than one passed in Sets sol...
+
BlisHeuristic::strategy
virtual BlisHeurStrategy strategy() const
Definition: BlisHeuristic.h:140
+
BlisHeurRound::matrixByRow_
CoinPackedMatrix matrixByRow_
Row majored matrix.
Definition: BlisHeurRound.h:54
+
BlisHeurRound::~BlisHeurRound
~BlisHeurRound()
Destructor.
Definition: BlisHeurRound.h:73
+
BlisHeurRound
Rounding Heuristic.
Definition: BlisHeurRound.h:44
+
BlisModel::solver
virtual OsiSolverInterface * solver()
Get lp solver.
Definition: BlisModel.h:449
+
BlisHeurRound::setSeed
void setSeed(int value)
Set seed.
Definition: BlisHeurRound.h:94
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisHeuristic_8h.html b/Doxygen/0.94/BlisHeuristic_8h.html new file mode 100644 index 0000000..d762152 --- /dev/null +++ b/Doxygen/0.94/BlisHeuristic_8h.html @@ -0,0 +1,141 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisHeuristic.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisHeuristic.h File Reference
+
+
+
#include <string>
+#include <vector>
+#include "CoinPackedMatrix.hpp"
+#include "OsiCuts.hpp"
+#include "Blis.h"
+
+ + Include dependency graph for BlisHeuristic.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + + +

+Classes

class  BlisHeuristic
 Heuristic base class. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisHeuristic_8h__dep__incl.map b/Doxygen/0.94/BlisHeuristic_8h__dep__incl.map new file mode 100644 index 0000000..04d759a --- /dev/null +++ b/Doxygen/0.94/BlisHeuristic_8h__dep__incl.map @@ -0,0 +1,18 @@ + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisHeuristic_8h__dep__incl.md5 b/Doxygen/0.94/BlisHeuristic_8h__dep__incl.md5 new file mode 100644 index 0000000..df015b9 --- /dev/null +++ b/Doxygen/0.94/BlisHeuristic_8h__dep__incl.md5 @@ -0,0 +1 @@ +4c0497aba5a59a18af52d2b0b2e167c2 \ No newline at end of file diff --git a/Doxygen/0.94/BlisHeuristic_8h__dep__incl.png b/Doxygen/0.94/BlisHeuristic_8h__dep__incl.png new file mode 100644 index 0000000..0fcd922 Binary files /dev/null and b/Doxygen/0.94/BlisHeuristic_8h__dep__incl.png differ diff --git a/Doxygen/0.94/BlisHeuristic_8h__incl.map b/Doxygen/0.94/BlisHeuristic_8h__incl.map new file mode 100644 index 0000000..5b061e6 --- /dev/null +++ b/Doxygen/0.94/BlisHeuristic_8h__incl.map @@ -0,0 +1,12 @@ + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisHeuristic_8h__incl.md5 b/Doxygen/0.94/BlisHeuristic_8h__incl.md5 new file mode 100644 index 0000000..aa54ecd --- /dev/null +++ b/Doxygen/0.94/BlisHeuristic_8h__incl.md5 @@ -0,0 +1 @@ +b6718c1703901d0459f3a63b3aedd420 \ No newline at end of file diff --git a/Doxygen/0.94/BlisHeuristic_8h__incl.png b/Doxygen/0.94/BlisHeuristic_8h__incl.png new file mode 100644 index 0000000..0ff0376 Binary files /dev/null and b/Doxygen/0.94/BlisHeuristic_8h__incl.png differ diff --git a/Doxygen/0.94/BlisHeuristic_8h_source.html b/Doxygen/0.94/BlisHeuristic_8h_source.html new file mode 100644 index 0000000..ca6bc9f --- /dev/null +++ b/Doxygen/0.94/BlisHeuristic_8h_source.html @@ -0,0 +1,273 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisHeuristic.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisHeuristic.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 
+
25 //#############################################################################
+
26 // This file is modified from COIN/Cbc/CbcHeuristic.hpp
+
27 //#############################################################################
+
28 
+
29 
+
30 #ifndef BlisHeuristic_h_
+
31 #define BlisHeuristic_h_
+
32 
+
33 #include <string>
+
34 #include <vector>
+
35 
+
36 #include "CoinPackedMatrix.hpp"
+
37 #include "OsiCuts.hpp"
+
38 
+
39 #include "Blis.h"
+
40 
+
41 class BlisModel;
+
42 
+
43 
+
44 //#############################################################################
+
45 
+
46 
+
48 class BlisHeuristic {
+
49 
+
50  private:
+
51 
+
53  BlisHeuristic & operator = (const BlisHeuristic& rhs);
+
54 
+
55  protected:
+
56 
+
58  BlisModel *model_;
+
59 
+
61  char *name_;
+
62 
+
70  BlisHeurStrategy strategy_;
+
71 
+
73  int heurCallFrequency_;
+
74 
+
76  int numSolutions_;
+
77 
+
79  double time_;
+
80 
+
82  int calls_;
+
83 
+
85  int noSolsCalls_;
+
86 
+
87 public:
+
88 
+
90  BlisHeuristic() {
+
91  model_ = NULL;
+
92  name_ = strdup("Unknown");
+
93  strategy_ = BlisHeurStrategyAuto;
+
94  heurCallFrequency_ = 1;
+
95  numSolutions_ = 0;
+
96  time_ = 0.0;
+
97  calls_ = 0;
+
98  noSolsCalls_ = 0;
+
99  }
+
100 
+
102  BlisHeuristic(BlisModel *model, const char *name,
+
103  BlisHeurStrategy strategy, int heurCallFrequency) {
+
104  model_ = model;
+
105  if (name) {
+
106  name_ = strdup(name);
+
107  }
+
108  else {
+
109  name_ = strdup("Unknown");
+
110  }
+
111  strategy_ = strategy;
+
112  heurCallFrequency_ = heurCallFrequency;
+
113  numSolutions_ = 0;
+
114  time_ = 0.0;
+
115  calls_ = 0;
+
116  noSolsCalls_ = 0;
+
117  }
+
118 
+
120  virtual ~BlisHeuristic() { if (name_) free(name_); }
+
121 
+
123  BlisHeuristic(const BlisHeuristic & rhs) {
+
124  model_ = rhs.model_;
+
125  name_ = strdup(rhs.name_);
+
126  strategy_ = rhs.strategy_; // What if disabled?
+
127  heurCallFrequency_ = rhs.heurCallFrequency_;
+
128  numSolutions_ = 0;
+
129  time_ = 0.0;
+
130  calls_ = 0;
+
131  noSolsCalls_ = 0;
+
132  }
+
133 
+
135  virtual void setModel(BlisModel * model) { model_ = model ;}
+
136 
+
139  virtual void setStrategy(BlisHeurStrategy strategy) {strategy_ = strategy;}
+
140  virtual BlisHeurStrategy strategy() const { return strategy_; }
+
141  //@]
+
142 
+
145  virtual void setHeurCallFrequency(int freq) { heurCallFrequency_ = freq; }
+
146  virtual int heurCallFrequency() const { return heurCallFrequency_; }
+
147  //@]
+
148 
+
150  virtual BlisHeuristic * clone() const {
+
151  BlisHeuristic *h = NULL;
+
152  assert(0);
+
153  return h;
+
154  }
+
155 
+
161  virtual bool searchSolution(double & objectiveValue,
+
162  double * newSolution)=0;
+
163 
+
172  virtual bool searchSolution(double & objectiveValue,
+
173  double * newSolution,
+
174  OsiCuts & cs) { return 0; }
+
175 
+
177  inline const char * name() const { return name_; }
+
178 
+
180  inline void addNumSolutions(int num=1) { numSolutions_ += num; }
+
181 
+
183  inline int numSolutions() const { return numSolutions_; }
+
184 
+
186  inline void addTime(double t=0.0) { time_ += t; }
+
187 
+
189  inline double time() const { return time_; }
+
190 
+
192  inline void addCalls(int c=1) { calls_ += c; }
+
193 
+
195  inline int calls() const { return calls_; }
+
196 
+
198  inline int noSolCalls() const { return noSolsCalls_; }
+
199 
+
201  inline void addNoSolCalls(int n=1) { noSolsCalls_ += n; }
+
202 };
+
203 
+
204 #endif
+
205 
+
+
BlisHeuristic::setStrategy
virtual void setStrategy(BlisHeurStrategy strategy)
Get/set strategy.
Definition: BlisHeuristic.h:139
+
BlisHeuristic::model_
BlisModel * model_
Pointer to the model.
Definition: BlisHeuristic.h:58
+
BlisHeuristic::time_
double time_
Used CPU/User time.
Definition: BlisHeuristic.h:79
+
BlisHeuristic::searchSolution
virtual bool searchSolution(double &objectiveValue, double *newSolution, OsiCuts &cs)
returns 0 if no solution, 1 if valid solution, -1 if just returning an estimate of best possible solu...
Definition: BlisHeuristic.h:172
+
BlisHeuristic
Heuristic base class.
Definition: BlisHeuristic.h:48
+
BlisHeuristic::name
const char * name() const
return name of generator.
Definition: BlisHeuristic.h:177
+
BlisHeuristic::BlisHeuristic
BlisHeuristic()
Default Constructor.
Definition: BlisHeuristic.h:90
+
BlisHeuristic::setHeurCallFrequency
virtual void setHeurCallFrequency(int freq)
Get/set call frequency.
Definition: BlisHeuristic.h:145
+
BlisHeuristic::~BlisHeuristic
virtual ~BlisHeuristic()
Distructor.
Definition: BlisHeuristic.h:120
+
BlisHeuristic::addCalls
void addCalls(int c=1)
Record number of times called.
Definition: BlisHeuristic.h:192
+
BlisModel
Definition: BlisModel.h:69
+
BlisHeuristic::calls_
int calls_
The times of calling this heuristic.
Definition: BlisHeuristic.h:82
+
BlisHeuristic::operator=
BlisHeuristic & operator=(const BlisHeuristic &rhs)
Illegal Assignment operator.
+
BlisHeuristic::name_
char * name_
Heuristics name.
Definition: BlisHeuristic.h:61
+
BlisHeuristic::searchSolution
virtual bool searchSolution(double &objectiveValue, double *newSolution)=0
returns 0 if no solution, 1 if valid solution with better objective value than one passed in Sets sol...
+
BlisHeuristic::addNoSolCalls
void addNoSolCalls(int n=1)
Increase the number of no cons called.
Definition: BlisHeuristic.h:201
+
BlisHeuristic::noSolsCalls_
int noSolsCalls_
The times of calling this heuristic and no solutions found.
Definition: BlisHeuristic.h:85
+
BlisHeurStrategyAuto
@ BlisHeurStrategyAuto
Definition: Blis.h:81
+
Blis.h
+
BlisHeuristic::numSolutions
int numSolutions() const
Number of solutions found.
Definition: BlisHeuristic.h:183
+
BlisHeuristic::numSolutions_
int numSolutions_
Number of solutions found.
Definition: BlisHeuristic.h:76
+
BlisHeuristic::heurCallFrequency
virtual int heurCallFrequency() const
Definition: BlisHeuristic.h:146
+
BlisHeurStrategy
BlisHeurStrategy
Definition: Blis.h:77
+
BlisHeuristic::noSolCalls
int noSolCalls() const
Number called and no cons found.
Definition: BlisHeuristic.h:198
+
BlisHeuristic::addTime
void addTime(double t=0.0)
Record Cpu time used.
Definition: BlisHeuristic.h:186
+
BlisHeuristic::BlisHeuristic
BlisHeuristic(const BlisHeuristic &rhs)
Copy constructor.
Definition: BlisHeuristic.h:123
+
BlisHeuristic::strategy
virtual BlisHeurStrategy strategy() const
Definition: BlisHeuristic.h:140
+
BlisHeuristic::strategy_
BlisHeurStrategy strategy_
When to call findSolution() routine.
Definition: BlisHeuristic.h:70
+
BlisHeuristic::BlisHeuristic
BlisHeuristic(BlisModel *model, const char *name, BlisHeurStrategy strategy, int heurCallFrequency)
Useful constructor.
Definition: BlisHeuristic.h:102
+
BlisHeuristic::heurCallFrequency_
int heurCallFrequency_
The frequency with which to call the heuristic.
Definition: BlisHeuristic.h:73
+
BlisHeuristic::time
double time() const
Cpu time used.
Definition: BlisHeuristic.h:189
+
BlisHeuristic::calls
int calls() const
Number of times called.
Definition: BlisHeuristic.h:195
+
BlisHeuristic::addNumSolutions
void addNumSolutions(int num=1)
Record number of solutions found.
Definition: BlisHeuristic.h:180
+
BlisHeuristic::setModel
virtual void setModel(BlisModel *model)
update model (This is needed if cliques update matrix etc).
Definition: BlisHeuristic.h:135
+
BlisHeuristic::clone
virtual BlisHeuristic * clone() const
Clone a heuristic.
Definition: BlisHeuristic.h:150
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisLicense_8h.html b/Doxygen/0.94/BlisLicense_8h.html new file mode 100644 index 0000000..1feb302 --- /dev/null +++ b/Doxygen/0.94/BlisLicense_8h.html @@ -0,0 +1,83 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisLicense.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisLicense.h File Reference
+
+
+ +

Go to the source code of this file.

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisLicense_8h_source.html b/Doxygen/0.94/BlisLicense_8h_source.html new file mode 100644 index 0000000..e1f8eac --- /dev/null +++ b/Doxygen/0.94/BlisLicense_8h_source.html @@ -0,0 +1,103 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisLicense.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisLicense.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisMessage_8h.html b/Doxygen/0.94/BlisMessage_8h.html new file mode 100644 index 0000000..55d79c7 --- /dev/null +++ b/Doxygen/0.94/BlisMessage_8h.html @@ -0,0 +1,186 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisMessage.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes | +Enumerations
+
+
BlisMessage.h File Reference
+
+
+
#include "CoinMessageHandler.hpp"
+
+ + Include dependency graph for BlisMessage.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + +

+Classes

class  BlisMessage
 
+ + + + +

+Enumerations

enum  BLIS_Message {
+  BLIS_CUTOFF_INC, +BLIS_CUT_STAT_FINAL, +BLIS_CUT_STAT_NODE, +BLIS_GAP_NO, +
+  BLIS_GAP_YES, +BLIS_HEUR_BEFORE_ROOT, +BLIS_HEUR_STAT_FINAL, +BLIS_HEUR_STAT_NODE, +
+  BLIS_ROOT_PROCESS, +BLIS_ROOT_TIME, +BLIS_FEAS_CHECK_TIME, +BLIS_W_LP, +
+  BLIS_DUMMY_END +
+ }
 This deals with Blis messages. More...
 
+

Enumeration Type Documentation

+ +

◆ BLIS_Message

+ +
+
+ + + + +
enum BLIS_Message
+
+ +

This deals with Blis messages.

+ + + + + + + + + + + + + + +
Enumerator
BLIS_CUTOFF_INC 
BLIS_CUT_STAT_FINAL 
BLIS_CUT_STAT_NODE 
BLIS_GAP_NO 
BLIS_GAP_YES 
BLIS_HEUR_BEFORE_ROOT 
BLIS_HEUR_STAT_FINAL 
BLIS_HEUR_STAT_NODE 
BLIS_ROOT_PROCESS 
BLIS_ROOT_TIME 
BLIS_FEAS_CHECK_TIME 
BLIS_W_LP 
BLIS_DUMMY_END 
+ +

Definition at line 39 of file BlisMessage.h.

+ +
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisMessage_8h__dep__incl.map b/Doxygen/0.94/BlisMessage_8h__dep__incl.map new file mode 100644 index 0000000..fca6d11 --- /dev/null +++ b/Doxygen/0.94/BlisMessage_8h__dep__incl.map @@ -0,0 +1,17 @@ + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisMessage_8h__dep__incl.md5 b/Doxygen/0.94/BlisMessage_8h__dep__incl.md5 new file mode 100644 index 0000000..2808a8c --- /dev/null +++ b/Doxygen/0.94/BlisMessage_8h__dep__incl.md5 @@ -0,0 +1 @@ +7aa519cb5cf18c701dbf1efb6ba6a41b \ No newline at end of file diff --git a/Doxygen/0.94/BlisMessage_8h__dep__incl.png b/Doxygen/0.94/BlisMessage_8h__dep__incl.png new file mode 100644 index 0000000..8c4f5b5 Binary files /dev/null and b/Doxygen/0.94/BlisMessage_8h__dep__incl.png differ diff --git a/Doxygen/0.94/BlisMessage_8h__incl.map b/Doxygen/0.94/BlisMessage_8h__incl.map new file mode 100644 index 0000000..64e12a8 --- /dev/null +++ b/Doxygen/0.94/BlisMessage_8h__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/BlisMessage_8h__incl.md5 b/Doxygen/0.94/BlisMessage_8h__incl.md5 new file mode 100644 index 0000000..9f72926 --- /dev/null +++ b/Doxygen/0.94/BlisMessage_8h__incl.md5 @@ -0,0 +1 @@ +02fbbd6e6ef4f18d8201ef730368bf04 \ No newline at end of file diff --git a/Doxygen/0.94/BlisMessage_8h__incl.png b/Doxygen/0.94/BlisMessage_8h__incl.png new file mode 100644 index 0000000..e45242c Binary files /dev/null and b/Doxygen/0.94/BlisMessage_8h__incl.png differ diff --git a/Doxygen/0.94/BlisMessage_8h_source.html b/Doxygen/0.94/BlisMessage_8h_source.html new file mode 100644 index 0000000..de0def5 --- /dev/null +++ b/Doxygen/0.94/BlisMessage_8h_source.html @@ -0,0 +1,163 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisMessage.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisMessage.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 #ifndef BlisMessage_H_
+
25 #define BlisMessage_H_
+
26 
+
27 //#############################################################################
+
28 
+
29 #if defined(_MSC_VER)
+
30 // Turn off compiler warning about long names
+
31 # pragma warning(disable:4786)
+
32 #endif
+
33 
+
35 #include "CoinMessageHandler.hpp"
+
36 
+
37 //#############################################################################
+
38 
+
39 enum BLIS_Message
+
40 {
+
41  BLIS_CUTOFF_INC,
+
42  BLIS_CUT_STAT_FINAL,
+
43  BLIS_CUT_STAT_NODE,
+
44  BLIS_GAP_NO,
+
45  BLIS_GAP_YES,
+
46  BLIS_HEUR_BEFORE_ROOT,
+
47  BLIS_HEUR_STAT_FINAL,
+
48  BLIS_HEUR_STAT_NODE,
+
49  BLIS_ROOT_PROCESS,
+
50  BLIS_ROOT_TIME,
+
51  BLIS_FEAS_CHECK_TIME,
+
52  BLIS_W_LP,
+
54  BLIS_DUMMY_END
+
55 };
+
56 
+
57 //#############################################################################
+
58 
+
59 class BlisMessage : public CoinMessages
+
60 {
+
61 public:
+
62 
+
66  BlisMessage(Language language=us_en);
+
68 };
+
69 
+
70 //#############################################################################
+
71 
+
72 #endif
+
+
BlisMessage::BlisMessage
BlisMessage(Language language=us_en)
Constructor.
+
BLIS_FEAS_CHECK_TIME
@ BLIS_FEAS_CHECK_TIME
Definition: BlisMessage.h:51
+
BLIS_CUT_STAT_NODE
@ BLIS_CUT_STAT_NODE
Definition: BlisMessage.h:43
+
BLIS_CUTOFF_INC
@ BLIS_CUTOFF_INC
Definition: BlisMessage.h:41
+
BLIS_ROOT_TIME
@ BLIS_ROOT_TIME
Definition: BlisMessage.h:50
+
BLIS_HEUR_STAT_NODE
@ BLIS_HEUR_STAT_NODE
Definition: BlisMessage.h:48
+
BLIS_DUMMY_END
@ BLIS_DUMMY_END
Definition: BlisMessage.h:54
+
BLIS_Message
BLIS_Message
This deals with Blis messages.
Definition: BlisMessage.h:39
+
BLIS_W_LP
@ BLIS_W_LP
Definition: BlisMessage.h:52
+
BLIS_ROOT_PROCESS
@ BLIS_ROOT_PROCESS
Definition: BlisMessage.h:49
+
BlisMessage
Definition: BlisMessage.h:59
+
BLIS_CUT_STAT_FINAL
@ BLIS_CUT_STAT_FINAL
Definition: BlisMessage.h:42
+
BLIS_GAP_NO
@ BLIS_GAP_NO
Definition: BlisMessage.h:44
+
BLIS_GAP_YES
@ BLIS_GAP_YES
Definition: BlisMessage.h:45
+
BLIS_HEUR_STAT_FINAL
@ BLIS_HEUR_STAT_FINAL
Definition: BlisMessage.h:47
+
BLIS_HEUR_BEFORE_ROOT
@ BLIS_HEUR_BEFORE_ROOT
Definition: BlisMessage.h:46
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisModel_8h.html b/Doxygen/0.94/BlisModel_8h.html new file mode 100644 index 0000000..b356d4f --- /dev/null +++ b/Doxygen/0.94/BlisModel_8h.html @@ -0,0 +1,176 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisModel.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisModel.h File Reference
+
+
+
#include <vector>
+#include "CoinMpsIO.hpp"
+#include "CoinLpIO.hpp"
+#include "CoinPackedMatrix.hpp"
+#include "CglCutGenerator.hpp"
+#include "OsiCuts.hpp"
+#include "OsiSolverInterface.hpp"
+#include "AlpsEnumProcessT.h"
+#include "AlpsParams.h"
+#include "AlpsTreeNode.h"
+#include "BcpsBranchStrategy.h"
+#include "BcpsObject.h"
+#include "BcpsObjectPool.h"
+#include "BcpsModel.h"
+#include "Blis.h"
+#include "BlisConGenerator.h"
+#include "BlisHeuristic.h"
+#include "BlisMessage.h"
+#include "BlisParams.h"
+#include "BlisPseudo.h"
+#include "BlisPresolve.h"
+
+ + Include dependency graph for BlisModel.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + +

+Classes

class  BlisModel
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisModel_8h__dep__incl.map b/Doxygen/0.94/BlisModel_8h__dep__incl.map new file mode 100644 index 0000000..f5aa4b4 --- /dev/null +++ b/Doxygen/0.94/BlisModel_8h__dep__incl.map @@ -0,0 +1,16 @@ + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisModel_8h__dep__incl.md5 b/Doxygen/0.94/BlisModel_8h__dep__incl.md5 new file mode 100644 index 0000000..2b02b2a --- /dev/null +++ b/Doxygen/0.94/BlisModel_8h__dep__incl.md5 @@ -0,0 +1 @@ +13ba4db1843e0aaa423132174812dca1 \ No newline at end of file diff --git a/Doxygen/0.94/BlisModel_8h__dep__incl.png b/Doxygen/0.94/BlisModel_8h__dep__incl.png new file mode 100644 index 0000000..beec0bb Binary files /dev/null and b/Doxygen/0.94/BlisModel_8h__dep__incl.png differ diff --git a/Doxygen/0.94/BlisModel_8h__incl.map b/Doxygen/0.94/BlisModel_8h__incl.map new file mode 100644 index 0000000..36ae6c1 --- /dev/null +++ b/Doxygen/0.94/BlisModel_8h__incl.map @@ -0,0 +1,34 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisModel_8h__incl.md5 b/Doxygen/0.94/BlisModel_8h__incl.md5 new file mode 100644 index 0000000..980ab25 --- /dev/null +++ b/Doxygen/0.94/BlisModel_8h__incl.md5 @@ -0,0 +1 @@ +ed40a3e03f35a6a440f587411e7e6bbc \ No newline at end of file diff --git a/Doxygen/0.94/BlisModel_8h__incl.png b/Doxygen/0.94/BlisModel_8h__incl.png new file mode 100644 index 0000000..5683a0f Binary files /dev/null and b/Doxygen/0.94/BlisModel_8h__incl.png differ diff --git a/Doxygen/0.94/BlisModel_8h_source.html b/Doxygen/0.94/BlisModel_8h_source.html new file mode 100644 index 0000000..e80df33 --- /dev/null +++ b/Doxygen/0.94/BlisModel_8h_source.html @@ -0,0 +1,966 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisModel.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisModel.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 //#############################################################################
+
25 
+
26 #ifndef BlisModel_h_
+
27 #define BlisModel_h_
+
28 
+
29 //#############################################################################
+
30 
+
31 #include <vector>
+
32 
+
33 #include "CoinMpsIO.hpp"
+
34 #include "CoinLpIO.hpp"
+
35 #include "CoinPackedMatrix.hpp"
+
36 
+
37 #include "CglCutGenerator.hpp"
+
38 
+
39 #include "OsiCuts.hpp"
+
40 #include "OsiSolverInterface.hpp"
+
41 
+
42 #include "AlpsEnumProcessT.h"
+
43 #include "AlpsParams.h"
+
44 #include "AlpsTreeNode.h"
+
45 
+
46 #include "BcpsBranchStrategy.h"
+
47 #include "BcpsObject.h"
+
48 #include "BcpsObjectPool.h"
+
49 #include "BcpsModel.h"
+
50 
+
51 #include "Blis.h"
+
52 #include "BlisConGenerator.h"
+
53 #include "BlisHeuristic.h"
+
54 #include "BlisMessage.h"
+
55 #include "BlisParams.h"
+
56 #include "BlisPseudo.h"
+
57 #include "BlisPresolve.h"
+
58 
+
59 //#############################################################################
+
60 
+
61 class BlisConstraint;
+
62 class BlisSolution;
+
63 class BcpsVariable;
+
64 class BlisVariable;
+
65 
+
66 //#############################################################################
+
67 
+
68 /* Declare a BLIS model */
+
69 class BlisModel : public BcpsModel {
+
70 
+
71 protected:
+
72 
+
73  //------------------------------------------------------
+
74  // LP SOLVER.
+
75  //------------------------------------------------------
+
76 
+
78  OsiSolverInterface *origLpSolver_;
+
80  OsiSolverInterface *presolvedLpSolver_;
+
83  OsiSolverInterface *lpSolver_;
+
84 
+
85  //------------------------------------------------------
+
86  // PROBLEM DATA. Populate when loadProblem(),
+
87  //------------------------------------------------------
+
88 
+
90  CoinPackedMatrix *colMatrix_;
+
91 
+
94  double *varLB_;
+
95  double *varUB_;
+
96  double *conLB_;
+
97  double *conUB_;
+
99 
+
102  int numCols_;
+
103  int numRows_;
+
104  int numElems_;
+
106 
+
109  double objSense_;
+
110  double *objCoef_;
+
112 
+
115  int numIntObjects_;
+
116  int *intColIndices_; // size of numIntObjects_
+
118 
+
121  std::vector<BcpsVariable *> inputVar_;
+
122  std::vector<BcpsConstraint *> inputCon_;
+
124 
+
125  //------------------------------------------------------
+
126  // PRESOLVE
+
127  //------------------------------------------------------
+
128 
+
129  BlisPresolve *presolve_;
+
130  // AT - Begin
+
131  bool presolved;
+
132  bool problemSetup;
+
133  // AT - End
+
134 
+
135  //------------------------------------------------------
+
136  // SOLUTION.
+
137  //------------------------------------------------------
+
138 
+
139  int numSolutions_;
+
140  int numHeurSolutions_;
+
141 
+
143  double incObjValue_;
+
144 
+
146  double *incumbent_;
+
147 
+
149  double cutoff_;
+
150 
+
152  double cutoffInc_;
+
153 
+
154  //------------------------------------------------------
+
155  // SEARCHING.
+
156  //------------------------------------------------------
+
157 
+
158  int *intObjIndices_; // size of numCols_
+
159  char *colType_;
+
160 
+
163  double *startVarLB_;
+
164  double *startVarUB_;
+
165  double *startConLB_;
+
166  double *startConUB_;
+
168 
+
170  BcpsBranchStrategy * branchStrategy_;
+
171  BcpsBranchStrategy * rampUpBranchStrategy_;
+
172 
+
173  // Hotstart strategy 0 = off,
+
174  // 1 = branch if incorrect,
+
175  // 2 = branch even if correct, ....
+
176  BlisHotStartStrategy hotstartStrategy_;
+
177 
+
179  int numObjects_;
+
180 
+
182  BcpsObject **objects_;
+
183 
+
185  char *sharedObjectMark_;
+
186 
+
188  int *priority_;
+
189 
+
191  AlpsTreeNode *activeNode_;
+
192 
+
194  int numStrong_;
+
195 
+
196  // Not used.
+
197  double nodeWeight_;
+
198 
+
200  int numBranchResolve_;
+
201 
+
202  //------------------------------------------------------
+
203  // HEURISTICS.
+
204  //------------------------------------------------------
+
205 
+
207  int numHeuristics_;
+
208 
+
210  BlisHeuristic **heuristics_;
+
211 
+
212  //------------------------------------------------------
+
213  // CONSTRAINTS.
+
214  //------------------------------------------------------
+
215 
+
217  BlisCutStrategy cutStrategy_;
+
218 
+
220  int cutGenerationFrequency_;
+
221 
+
223  int numCutGenerators_;
+
224 
+
226  int maxNumCons_;
+
227 
+
229  BlisConGenerator **generators_;
+
230 
+
232  BcpsConstraintPool *constraintPool_;
+
233 
+
235  BlisConstraint **oldConstraints_;
+
236 
+
238  int oldConstraintsSize_;
+
239 
+
241  int numOldConstraints_;
+
242 
+
244  double *conRandoms_;
+
245 
+
247  int denseConCutoff_;
+
248 
+
249  //------------------------------------------------------
+
250  // PARAMETERS, STATISTICS, and MESSAGE
+
251  //------------------------------------------------------
+
252 
+
254  BlisParams *BlisPar_;
+
255 
+
257  CoinMessageHandler *blisMessageHandler_;
+
258 
+
260  CoinMessages blisMessages_;
+
261 
+
263  int numNodes_;
+
264 
+
266  int numIterations_;
+
267 
+
269  int aveIterations_;
+
270 
+
272  double feasCheckTime_;
+
273 
+
274  //------------------------------------------------------
+
275  // TEMPORARY STORAGE
+
276  //------------------------------------------------------
+
277 
+
280  int *tempVarLBPos_;
+
281  int *tempVarUBPos_;
+
282  int *tempConLBPos_;
+
283  int *tempConUBPos_;
+
285 
+
286  //------------------------------------------------------
+
287  // Knowledge shared
+
288  //------------------------------------------------------
+
289 
+
291  BcpsConstraintPool *constraintPoolSend_;
+
292 
+
294  BcpsConstraintPool *constraintPoolReceive_;
+
295 
+
296  public:
+
297 
+
299  bool isRoot_;
+
300 
+
302  int boundingPass_;
+
303 
+
305  double integerTol_;
+
306 
+
308  double optimalRelGap_;
+
309 
+
311  double optimalAbsGap_;
+
312 
+
314  double currRelGap_;
+
315 
+
317  double currAbsGap_;
+
318 
+
320  BlisHeurStrategy heurStrategy_;
+
321 
+
323  int heurCallFrequency_;
+
324 
+
326  OsiCuts newCutPool_;
+
327 
+
329  std::vector<AlpsTreeNode *> leafToRootPath;
+
330 
+
331  protected:
+
332 
+
334  void init();
+
335 
+
337  void createObjects();
+
338 
+
339  public:
+
340 
+
342  BlisModel()
+
343  {
+
344  init();
+
345  }
+
346 
+
348  virtual ~BlisModel();
+
349 
+
351  void gutsOfDestructor();
+
352 
+
353  //------------------------------------------------------
+
354  // SETUP, LP SOLVER
+
355  //------------------------------------------------------
+
356 
+
358  void setColMatrix(CoinPackedMatrix *mat){ colMatrix_ = mat; }
+
359 
+
361  void setNumCons(int num){ numRows_ = num; }
+
362 
+
364  void setNumVars(int num){ numCols_ = num; }
+
365 
+
367  void setNumElems(int num){ numElems_ = num; }
+
368 
+
370  void setConLb(double *cl){ conLB_ = cl; }
+
371 
+
373  void setConUb(double *cu){ conUB_ = cu; }
+
374 
+
376  void setVarLb(double *lb){ varLB_ = lb; }
+
377 
+
379  void setVarUb(double *ub){ varUB_ = ub; }
+
380 
+
382  void setColType(char *colType){
+
383  colType_ = colType;
+
384  }
+
385 
+
387  void setObjCoef(double *obj){ objCoef_ = obj; }
+
388 
+
398  virtual void readInstance(const char* dataFile);
+
399 
+
411  virtual void importModel(std::vector<BlisVariable *> vars,
+
412  std::vector<BlisConstraint *> cons);
+
413 
+
415  virtual void readParameters(const int argnum, const char * const *arglist);
+
416 
+
418  virtual void writeParameters(std::ostream& outstream) const;
+
419 
+
423  virtual AlpsTreeNode * createRoot();
+
424 
+
434  virtual bool setupSelf();
+
435 
+
437  virtual void preprocess();
+
438 
+
440  virtual void postprocess();
+
441 
+
443  virtual void setSolver(OsiSolverInterface *si) { origLpSolver_ = si; }
+
444 
+
446  virtual OsiSolverInterface *getSolver() { return origLpSolver_; }
+
447 
+
449  virtual OsiSolverInterface *solver() { return lpSolver_; }
+
450 
+
452  bool resolve();
+
453 
+
455  void setActiveNode(AlpsTreeNode *node) { activeNode_ = node; }
+
456 
+
458  void setSolEstimate(double est) { activeNode_->setSolEstimate(est); }
+
459 
+
461  int getNumStrong() { return numStrong_; }
+
462 
+
464  void addNumStrong(int num=1) { numStrong_ += num; }
+
465 
+
467  int getNumBranchResolve() { return numBranchResolve_; }
+
468 
+
470  void setNumBranchResolve(int num) { numBranchResolve_ = num; }
+
471 
+
473  double getFeasCheckTime() { return feasCheckTime_; }
+
474 
+
476  void setFeasCheckTime(double t) { feasCheckTime_ = t; }
+
477 
+
479  void addFeasCheckTime(double t) { feasCheckTime_ += t; }
+
480 
+
481  //------------------------------------------------------
+
482  // PROBLEM DATA
+
483  //------------------------------------------------------
+
484 
+
486  double* getObjCoef() const { return objCoef_; }
+
487 
+
489  const double * getColLower() { return lpSolver_->getColLower(); }
+
490 
+
492  const double * getColUpper() { return lpSolver_->getColUpper(); }
+
493 
+
495  int getNumCols() { return lpSolver_->getNumCols(); }
+
496 
+
498  int getNumRows() { return lpSolver_->getNumRows(); }
+
499 
+
501  double *varLB() { return varLB_; }
+
502  double *varUB() { return varUB_; }
+
503 
+
505  double *conLB() { return conLB_; }
+
506  double *conUB() { return conUB_; }
+
507 
+
509  double *startVarLB() { return startVarLB_; }
+
510  double *startVarUB() { return startVarUB_; }
+
511 
+
513  double *startConLB() { return startConLB_; }
+
514  double *startConUB() { return startConUB_; }
+
515 
+
517  int *tempVarLBPos() { return tempVarLBPos_; }
+
518  int *tempVarUBPos() { return tempVarUBPos_; }
+
519  int *tempConLBPos() { return tempConLBPos_; }
+
520  int *tempConUBPos() { return tempConUBPos_; }
+
521 
+
522  //------------------------------------------------------
+
523  // LP SOLUTION
+
524  //------------------------------------------------------
+
525 
+
527  double getLpObjValue() const { return lpSolver_->getObjValue(); }
+
528 
+
530  const double * getLpSolution() const { return lpSolver_->getColSolution();}
+
531 
+
532  //------------------------------------------------------
+
533  // MILP SOLUTION
+
534  //------------------------------------------------------
+
535 
+
537  int getNumSolutions() const { return numSolutions_; }
+
538 
+
540  int getNumHeurSolutions() const { return numHeurSolutions_;}
+
541 
+
543  double * incumbent() { return incumbent_; }
+
544 
+
546  int storeSolution(BlisSolutionType how, BlisSolution* sol);
+
547 
+
549  inline double getCutoff() const { return cutoff_; }
+
550 
+
552  inline void setCutoff(double co) {
+
553  double inc = BlisPar_->entry(BlisParams::cutoffInc);
+
554 #if 0
+
555  std::cout << "3. cutoff_ = "<< cutoff_
+
556  << "; inc = " << inc << std::endl;
+
557 #endif
+
558  co += inc;
+
559  if (co < cutoff_) {
+
560  cutoff_ = co;
+
561  lpSolver_->setDblParam(OsiDualObjectiveLimit, co);
+
562  }
+
563  }
+
564 
+
566  BlisSolution *feasibleSolutionHeur(const double *solution);
+
567 
+
572  virtual BlisSolution *feasibleSolution(int & numIntegerInfs,
+
573  int & numObjectInfs);
+
574 
+
583  virtual BlisSolution *userFeasibleSolution(const double * solution,
+
584  bool &feasible) {
+
585  BlisSolution *sol = NULL;
+
586  feasible = true; // Feasible by default
+
587  return sol;
+
588  }
+
589 
+
590  //------------------------------------------------------
+
591  // BRANCHING
+
592  //------------------------------------------------------
+
593 
+
599  inline BcpsBranchStrategy * branchStrategy() const
+
600  { return branchStrategy_; }
+
601 
+
603  inline void setBranchingMethod(BcpsBranchStrategy * method) {
+
604  if (branchStrategy_) delete branchStrategy_;
+
605  branchStrategy_ = method;
+
606  }
+
607 
+
609  inline void setBranchingMethod(BcpsBranchStrategy & method) {
+
610  if (branchStrategy_) delete branchStrategy_;
+
611  branchStrategy_ = &method;
+
612  }
+
613  inline BcpsBranchStrategy * rampUpBranchStrategy() const
+
614  { return rampUpBranchStrategy_; }
+
616 
+
621  inline int numObjects() const { return numObjects_; }
+
622 
+
624  inline void setNumObjects(int num) { numObjects_ = num; }
+
625 
+
627  inline BcpsObject ** objects() { return objects_;}
+
628 
+
630  inline BcpsObject * objects(int which) { return objects_[which]; }
+
631 
+
633  void setSharedObjectMark(int i) { sharedObjectMark_[i] = 1; }
+
634 
+
636  void clearSharedObjectMark() {
+
637  for (int k = 0; k < numIntObjects_; ++k) {
+
638  sharedObjectMark_[k] = 0;
+
639  }
+
640  }
+
641 
+
643  void deleteObjects();
+
644 
+
647  void addObjects(int numObjects, BcpsObject ** objects);
+
649 
+
651  void createIntgerObjects(bool startAgain);
+
652 
+
654  int* getIntObjIndices() const { return intObjIndices_; }
+
655 
+
657  int getNumIntObjects() const { return numIntObjects_; }
+
658 
+
660  int* getIntColIndices() const { return intColIndices_; }
+
661 
+
663  bool checkInteger(double value) const {
+
664  double integerTolerance = 1.0e-5;
+
665  double nearest = floor(value + 0.5);
+
666  if (fabs(value - nearest) <= integerTolerance) {
+
667  return true;
+
668  }
+
669  else {
+
670  return false;
+
671  }
+
672  }
+
673 
+
674  void analyzeObjective();
+
675 
+
676  //------------------------------------------------------
+
677  // HEURISTICS.
+
678  //------------------------------------------------------
+
679 
+
681  void addHeuristic(BlisHeuristic * heur);
+
682 
+
684  BlisHeuristic * heuristics(int i) const { return heuristics_[i]; }
+
685 
+
687  int numHeuristics() const { return numHeuristics_; }
+
688 
+
689  //------------------------------------------------------
+
690  // CONSTRAINTS.
+
691  //------------------------------------------------------
+
692 
+
694  void addCutGenerator(BlisConGenerator * generator);
+
695 
+
697  void addCutGenerator(CglCutGenerator * generator,
+
698  const char * name = NULL,
+
699  BlisCutStrategy strategy = BlisCutStrategyAuto,
+
700  int cutGenerationFrequency = 1,
+
701  bool normal = true,
+
702  bool atSolution = false,
+
703  bool whenInfeasible = false);
+
704 
+
706  BlisConGenerator *cutGenerators(int i) const { return generators_[i]; }
+
707 
+
709  int numCutGenerators() const { return numCutGenerators_; }
+
710 
+
712  int getMaxNumCons() const { return maxNumCons_; }
+
713 
+
715  void setMaxNumCons(int m) { maxNumCons_ = m; }
+
716 
+
718  BcpsConstraintPool *constraintPool() { return constraintPool_; }
+
719 
+
721  BcpsConstraintPool *constraintPoolReceive()
+
722  { return constraintPoolReceive_; }
+
723 
+
725  BcpsConstraintPool *constraintPoolSend() { return constraintPoolSend_; }
+
726 
+
728 
+
729  int getNumOldConstraints() const { return numOldConstraints_; }
+
730 
+
732  void setNumOldConstraints(int num) { numOldConstraints_ = num; }
+
733 
+
735  int getOldConstraintsSize() const { return oldConstraintsSize_; }
+
736 
+
738  void setOldConstraintsSize(int num) { oldConstraintsSize_ = num; }
+
739 
+
741  BlisConstraint **oldConstraints() { return oldConstraints_; }
+
742 
+
744  void setOldConstraints(BlisConstraint **old) { oldConstraints_ = old; }
+
745 
+
747  void delOldConstraints() {
+
748  delete [] oldConstraints_;
+
749  oldConstraints_ = NULL;
+
750  }
+
752 
+
754  BlisCutStrategy getCutStrategy() const {
+
755  return cutStrategy_;
+
756  }
+
757 
+
759  void setCutStrategy(BlisCutStrategy u) { cutStrategy_ = u; }
+
760 
+
762  int getCutGenerationFrequency() const { return cutGenerationFrequency_; }
+
763 
+
765  void setCutStrategy(int f) { cutGenerationFrequency_ = f; }
+
766 
+
768  int getDenseConCutoff() const { return denseConCutoff_; }
+
769 
+
771  void setDenseConCutoff(int cutoff) { denseConCutoff_ = cutoff; }
+
772 
+
774  double *getConRandoms() const { return conRandoms_; }
+
775 
+
776  //------------------------------------------------------
+
777  // PRIORITY AND WEITGHT.
+
778  //------------------------------------------------------
+
779 
+
794  void passInPriorities(const int * priorities,
+
795  bool ifNotSimpleIntegers,
+
796  int defaultValue = 1000);
+
797 
+
799  inline const int * priority() const { return priority_; }
+
800 
+
802  inline int priority(int sequence) const {
+
803  if (priority_) return priority_[sequence];
+
804  else return 1000;
+
805  }
+
806 
+
807  inline double getNodeWeight() const { return nodeWeight_; }
+
808 
+
809  inline void setNodeWeight(double nw) { nodeWeight_ = nw; }
+
811 
+
812  //------------------------------------------------------
+
813  // STATISTICS.
+
814  //------------------------------------------------------
+
815 
+
817  virtual void modelLog();
+
818 
+
820  int getNumNodes() const { return numNodes_; }
+
821 
+
823  int getNumIterations() const { return numIterations_; }
+
824 
+
826  int getAveIterations() const { return aveIterations_; }
+
827 
+
829  void addNumNodes(int newNodes = 1) { numNodes_ += newNodes; }
+
830 
+
832  void addNumIterations(int newIter) {
+
833  numIterations_ += newIter;
+
834  aveIterations_ = numIterations_ / numNodes_;
+
835  }
+
836 
+
838  CoinMessageHandler * blisMessageHandler() const
+
839  { return blisMessageHandler_; }
+
840 
+
842  CoinMessages blisMessages() { return blisMessages_; }
+
843 
+
846  BlisParams * BlisPar() { return BlisPar_; }
+
848 
+
850  virtual void nodeLog(AlpsTreeNode *node, bool force);
+
851 
+
853  virtual bool fathomAllNodes();
+
854 
+
855  //------------------------------------------------------
+
856  // PARALLEL
+
857  //------------------------------------------------------
+
858 
+
859  protected:
+
860 
+
862  AlpsReturnStatus encodeBlis(AlpsEncoded *encoded) const;
+
863 
+
865  AlpsReturnStatus decodeBlis(AlpsEncoded &encoded);
+
866 
+
868  void packSharedPseudocost(AlpsEncoded *encoded, int numToShare);
+
869 
+
871  void unpackSharedPseudocost(AlpsEncoded &encoded);
+
872 
+
874  void packSharedConstraints(AlpsEncoded *encoded);
+
875 
+
877  void unpackSharedConstraints(AlpsEncoded &encoded);
+
878 
+
880  void packSharedVariables(AlpsEncoded *encoded);
+
881 
+
883  void unpackSharedVariables(AlpsEncoded &encoded);
+
884 
+
885  public:
+
886 
+
889  virtual void registerKnowledge();
+
890 
+
891  using AlpsKnowledge::encode ;
+
893  virtual AlpsEncoded* encode() const;
+
894 
+
896  virtual void decodeToSelf(AlpsEncoded&);
+
897 
+
900  virtual AlpsEncoded* packSharedKnowlege();
+
901 
+
903  virtual void unpackSharedKnowledge(AlpsEncoded&);
+
904 
+
905  //AT - Begin
+
906  virtual void presolveForTheWholeTree();
+
907  //AT - end
+
908 };
+
909 
+
910 #endif /* End of file */
+
+
BlisModel::createRoot
virtual AlpsTreeNode * createRoot()
For parallel code, only the master calls this function.
+
BlisModel::getObjCoef
double * getObjCoef() const
Get objective coefficients.
Definition: BlisModel.h:486
+
BlisSolution
This class contains the solutions generated by the LP solver (either primal or dual.
Definition: BlisSolution.h:36
+
BlisModel::setOldConstraintsSize
void setOldConstraintsSize(int num)
Set max number of old constraints.
Definition: BlisModel.h:738
+
BlisModel::delOldConstraints
void delOldConstraints()
Set max number of old constraints.
Definition: BlisModel.h:747
+
BlisModel::branchStrategy_
BcpsBranchStrategy * branchStrategy_
Variable selection function.
Definition: BlisModel.h:170
+
BlisModel::currAbsGap_
double currAbsGap_
Current absolute optimal gap.
Definition: BlisModel.h:317
+
BlisModel::intObjIndices_
int * intObjIndices_
Definition: BlisModel.h:158
+
BlisModel::setSharedObjectMark
void setSharedObjectMark(int i)
Mark object to be shared.
Definition: BlisModel.h:633
+
BlisModel::rampUpBranchStrategy
BcpsBranchStrategy * rampUpBranchStrategy() const
Definition: BlisModel.h:613
+
BlisModel::cutoff_
double cutoff_
Cutoff in lp solver.
Definition: BlisModel.h:149
+
BlisModel::setBranchingMethod
void setBranchingMethod(BcpsBranchStrategy &method)
Set the branching stratedy.
Definition: BlisModel.h:609
+
BlisModel::getConRandoms
double * getConRandoms() const
Get randoms for check parallel constraints.
Definition: BlisModel.h:774
+
BlisModel::numIntObjects_
int numIntObjects_
Column types.
Definition: BlisModel.h:115
+
BlisModel::constraintPoolSend
BcpsConstraintPool * constraintPoolSend()
Access send constraint pool.
Definition: BlisModel.h:725
+
BlisModel::encodeBlis
AlpsReturnStatus encodeBlis(AlpsEncoded *encoded) const
Pack Blis portion of the model into an encoded object.
+
BlisModel::addHeuristic
void addHeuristic(BlisHeuristic *heur)
Add a heuristic.
+
BlisModel::createObjects
void createObjects()
Create variables and constraints.
+
BlisModel::unpackSharedConstraints
void unpackSharedConstraints(AlpsEncoded &encoded)
Unpack and store shared constraints.
+
BlisModel::userFeasibleSolution
virtual BlisSolution * userFeasibleSolution(const double *solution, bool &feasible)
User's criteria for a feasible solution.
Definition: BlisModel.h:583
+
BlisModel::feasibleSolution
virtual BlisSolution * feasibleSolution(int &numIntegerInfs, int &numObjectInfs)
Test the current LP solution for feasiblility.
+
BlisModel::encode
virtual AlpsEncoded * encode() const
The method that encodes the model into an encoded object.
+
BlisHeuristic
Heuristic base class.
Definition: BlisHeuristic.h:48
+
BlisModel::unpackSharedVariables
void unpackSharedVariables(AlpsEncoded &encoded)
Unpack and store shared variables.
+
BlisModel::problemSetup
bool problemSetup
Definition: BlisModel.h:132
+
BlisPresolve
A interface to Osi/Coin Presolve.
Definition: BlisPresolve.h:37
+
BlisModel::varLB
double * varLB()
Get variable bounds arrary.
Definition: BlisModel.h:501
+
BlisConGenerator
Interface between Blis and Cut Generation Library.
Definition: BlisConGenerator.h:58
+
BlisModel::numObjects_
int numObjects_
Number of objects.
Definition: BlisModel.h:179
+
BlisModel::leafToRootPath
std::vector< AlpsTreeNode * > leafToRootPath
Record the path from leaf to root.
Definition: BlisModel.h:329
+
BlisModel::numRows_
int numRows_
Definition: BlisModel.h:103
+
BlisModel::numBranchResolve_
int numBranchResolve_
Maximum number of resolve during branching.
Definition: BlisModel.h:200
+
BlisModel::constraintPoolReceive
BcpsConstraintPool * constraintPoolReceive()
Access receive constraint pool.
Definition: BlisModel.h:721
+
BlisModel::setCutoff
void setCutoff(double co)
Set cut off value.
Definition: BlisModel.h:552
+
BlisModel::numNodes_
int numNodes_
Number of processed nodes.
Definition: BlisModel.h:263
+
BlisModel::registerKnowledge
virtual void registerKnowledge()
Register knowledge.
+
BlisModel::addObjects
void addObjects(int numObjects, BcpsObject **objects)
Add in object information.
+
BlisModel::writeParameters
virtual void writeParameters(std::ostream &outstream) const
Write out parameters.
+
BlisModel::getNumBranchResolve
int getNumBranchResolve()
Get the maximum number of resolve during branching.
Definition: BlisModel.h:467
+
BlisModel::setNodeWeight
void setNodeWeight(double nw)
Definition: BlisModel.h:809
+
BlisModel::presolve_
BlisPresolve * presolve_
Definition: BlisModel.h:129
+
BlisModel::fathomAllNodes
virtual bool fathomAllNodes()
Return true, if all nodes can be fathomed.
+
BlisModel::getFeasCheckTime
double getFeasCheckTime()
Get the total time spent checking solutions for feasibility.
Definition: BlisModel.h:473
+
BlisHeuristic.h
+
BlisModel::boundingPass_
int boundingPass_
The number of passes during bounding procedure.
Definition: BlisModel.h:302
+
BlisPseudo.h
+
BlisModel::oldConstraintsSize_
int oldConstraintsSize_
The memory size allocated for oldConstraints_.
Definition: BlisModel.h:238
+
BlisModel::setOldConstraints
void setOldConstraints(BlisConstraint **old)
set old constraints.
Definition: BlisModel.h:744
+
BlisModel::cutGenerators
BlisConGenerator * cutGenerators(int i) const
Get a specific cut generator.
Definition: BlisModel.h:706
+
BlisModel::nodeWeight_
double nodeWeight_
Definition: BlisModel.h:197
+
BlisModel::resolve
bool resolve()
Resolving a lp.
+
BlisModel::init
void init()
Intialize member data.
+
BlisModel::presolveForTheWholeTree
virtual void presolveForTheWholeTree()
+
BlisModel::priority
int priority(int sequence) const
Returns priority level for an object (or 1000 if no priorities exist)
Definition: BlisModel.h:802
+
BlisModel::generators_
BlisConGenerator ** generators_
The list of cut generators used.
Definition: BlisModel.h:229
+
BlisModel::numOldConstraints_
int numOldConstraints_
Number of old constraints.
Definition: BlisModel.h:241
+
BlisModel
Definition: BlisModel.h:69
+
BlisModel::constraintPool
BcpsConstraintPool * constraintPool()
Access constraint pool.
Definition: BlisModel.h:718
+
BlisModel::getMaxNumCons
int getMaxNumCons() const
Get the max number of cuts can be generated.
Definition: BlisModel.h:712
+
BlisModel::tempVarUBPos
int * tempVarUBPos()
Definition: BlisModel.h:518
+
BlisModel::conLB_
double * conLB_
Definition: BlisModel.h:96
+
BlisModel::getNumSolutions
int getNumSolutions() const
Get number of solutions.
Definition: BlisModel.h:537
+
BlisModel::getNumRows
int getNumRows()
Get number of rows.
Definition: BlisModel.h:498
+
BlisModel::colMatrix_
CoinPackedMatrix * colMatrix_
Column majored matrix.
Definition: BlisModel.h:90
+
BlisModel::packSharedKnowlege
virtual AlpsEncoded * packSharedKnowlege()
Pack knowledge to be shared with others into an encoded object.
+
BlisModel::numHeuristics_
int numHeuristics_
Number of heuristics.
Definition: BlisModel.h:207
+
BlisHotStartStrategy
BlisHotStartStrategy
Definition: Blis.h:95
+
BlisModel::clearSharedObjectMark
void clearSharedObjectMark()
Clear all the share mark.
Definition: BlisModel.h:636
+
BlisModel::numStrong_
int numStrong_
Number of strong branching.
Definition: BlisModel.h:194
+
BlisModel::priority
const int * priority() const
Priorities.
Definition: BlisModel.h:799
+
BlisModel::presolved
bool presolved
Definition: BlisModel.h:131
+
BlisModel::varUB_
double * varUB_
Definition: BlisModel.h:95
+
BlisVariable
Definition: BlisVariable.h:31
+
BlisModel::decodeToSelf
virtual void decodeToSelf(AlpsEncoded &)
The method that decodes the model from an encoded object.
+
BlisModel::setFeasCheckTime
void setFeasCheckTime(double t)
Set the total time spent checking solutions for feasibility.
Definition: BlisModel.h:476
+
BlisModel::startVarLB_
double * startVarLB_
Starting var/con bounds for processing each node.
Definition: BlisModel.h:163
+
BlisModel::numObjects
int numObjects() const
Get the number of objects.
Definition: BlisModel.h:621
+
BlisModel::getNumIterations
int getNumIterations() const
Get how many iterations it took to solve the problem.
Definition: BlisModel.h:823
+
BlisModel::objSense_
double objSense_
Objective function.
Definition: BlisModel.h:109
+
BlisModel::blisMessages
CoinMessages blisMessages()
Return messages.
Definition: BlisModel.h:842
+
BlisModel::lpSolver_
OsiSolverInterface * lpSolver_
Actually used.
Definition: BlisModel.h:83
+
BlisModel::addNumIterations
void addNumIterations(int newIter)
Increment Iteration count.
Definition: BlisModel.h:832
+
BlisModel::setNumBranchResolve
void setNumBranchResolve(int num)
Set the maximum number of resolve during branching.
Definition: BlisModel.h:470
+
BlisModel::getColUpper
const double * getColUpper()
Get column upper bound.
Definition: BlisModel.h:492
+
BlisModel::addNumStrong
void addNumStrong(int num=1)
Add num to number of strong branchings.
Definition: BlisModel.h:464
+
BlisModel::incumbent_
double * incumbent_
Incumbent.
Definition: BlisModel.h:146
+
BlisModel::getLpObjValue
double getLpObjValue() const
Get current objective function value.
Definition: BlisModel.h:527
+
BlisModel::tempVarUBPos_
int * tempVarUBPos_
Definition: BlisModel.h:281
+
BlisModel::passInPriorities
void passInPriorities(const int *priorities, bool ifNotSimpleIntegers, int defaultValue=1000)
Pass in branching priorities.
+
BlisModel::tempConUBPos_
int * tempConUBPos_
Definition: BlisModel.h:283
+
BlisModel::packSharedVariables
void packSharedVariables(AlpsEncoded *encoded)
Retrieve and pack shared variables.
+
BlisModel::numHeurSolutions_
int numHeurSolutions_
Definition: BlisModel.h:140
+
BlisModel::createIntgerObjects
void createIntgerObjects(bool startAgain)
Identify integer variable.
+
BlisParams::cutoffInc
@ cutoffInc
The value added to relaxation value when deciding fathom.
Definition: BlisParams.h:142
+
BlisModel::objects
BcpsObject * objects(int which)
Get the specified object.
Definition: BlisModel.h:630
+
BlisModel::getLpSolution
const double * getLpSolution() const
Get active lp solution.
Definition: BlisModel.h:530
+
BlisModel::denseConCutoff_
int denseConCutoff_
Dense constraint cutoff.
Definition: BlisModel.h:247
+
BlisModel::setConUb
void setConUb(double *cu)
Pass column lower bounds.
Definition: BlisModel.h:373
+
BlisModel::packSharedPseudocost
void packSharedPseudocost(AlpsEncoded *encoded, int numToShare)
Retrieve and pack shared pseudocost.
+
BlisModel::setNumCons
void setNumCons(int num)
Pass column upper bounds.
Definition: BlisModel.h:361
+
BlisModel::heuristics
BlisHeuristic * heuristics(int i) const
Get a specific heuristic.
Definition: BlisModel.h:684
+
BlisModel::cutGenerationFrequency_
int cutGenerationFrequency_
Frequency of cut generation.
Definition: BlisModel.h:220
+
BlisModel::deleteObjects
void deleteObjects()
Delete all object information.
+
BlisModel::postprocess
virtual void postprocess()
Postprocessing the searching results.
+
BlisModel::startVarUB_
double * startVarUB_
Definition: BlisModel.h:164
+
BlisSolutionType
BlisSolutionType
Definition: Blis.h:112
+
BlisModel::numCutGenerators
int numCutGenerators() const
Get the number of cut generators.
Definition: BlisModel.h:709
+
BlisModel::incObjValue_
double incObjValue_
Incumbent objective value.
Definition: BlisModel.h:143
+
BlisModel::getSolver
virtual OsiSolverInterface * getSolver()
Get lp solver.
Definition: BlisModel.h:446
+
BlisModel::numCols_
int numCols_
Number of columns/rows/elements.
Definition: BlisModel.h:102
+
BlisModel::constraintPoolSend_
BcpsConstraintPool * constraintPoolSend_
Constraints that can be sent/broadcasted to other processes.
Definition: BlisModel.h:291
+
BlisModel::startConLB_
double * startConLB_
Definition: BlisModel.h:165
+
BlisModel::getCutStrategy
BlisCutStrategy getCutStrategy() const
Query constraint generation strategy.
Definition: BlisModel.h:754
+
BlisModel::storeSolution
int storeSolution(BlisSolutionType how, BlisSolution *sol)
Record a new incumbent solution and update objectiveValue.
+
BlisModel::maxNumCons_
int maxNumCons_
Number of cuts can be generators.
Definition: BlisModel.h:226
+
BlisModel::readInstance
virtual void readInstance(const char *dataFile)
For parallel code, only the master calls this function.
+
BlisModel::varLB_
double * varLB_
Variable and constraint bounds.
Definition: BlisModel.h:94
+
BlisModel::getDenseConCutoff
int getDenseConCutoff() const
Get the thresheld to be considered as a dense constraint.
Definition: BlisModel.h:768
+
BlisParams
Definition: BlisParams.h:35
+
BlisModel::setSolver
virtual void setSolver(OsiSolverInterface *si)
Set lp solver.
Definition: BlisModel.h:443
+
BlisModel::tempConLBPos
int * tempConLBPos()
Definition: BlisModel.h:519
+
BlisModel::setNumElems
void setNumElems(int num)
Pass column upper bounds.
Definition: BlisModel.h:367
+
BlisModel::getNumHeurSolutions
int getNumHeurSolutions() const
Get number of heuristic solutions.
Definition: BlisModel.h:540
+
BlisModel::blisMessageHandler_
CoinMessageHandler * blisMessageHandler_
Message handler.
Definition: BlisModel.h:257
+
BlisParams::entry
bool entry(const chrParams key) const
Definition: BlisParams.h:237
+
BlisMessage.h
+
BlisModel::objects_
BcpsObject ** objects_
The set of objects.
Definition: BlisModel.h:182
+
BlisModel::getCutoff
double getCutoff() const
Get cut off value.
Definition: BlisModel.h:549
+
BlisModel::constraintPool_
BcpsConstraintPool * constraintPool_
Store all the cuts.
Definition: BlisModel.h:232
+
BlisModel::oldConstraints_
BlisConstraint ** oldConstraints_
Temporary store old cuts at a node when installing a node.
Definition: BlisModel.h:235
+
BlisModel::setupSelf
virtual bool setupSelf()
All processes call this function.
+
Blis.h
+
BlisModel::getAveIterations
int getAveIterations() const
Get the average iterations it took to solve a lp.
Definition: BlisModel.h:826
+
BlisModel::heurStrategy_
BlisHeurStrategy heurStrategy_
If use heuristics.
Definition: BlisModel.h:320
+
BlisModel::setVarUb
void setVarUb(double *ub)
Pass variable lower bounds.
Definition: BlisModel.h:379
+
BlisModel::cutoffInc_
double cutoffInc_
Cutoff increment.
Definition: BlisModel.h:152
+
BlisModel::startVarUB
double * startVarUB()
Definition: BlisModel.h:510
+
BlisModel::setColType
void setColType(char *colType)
Pass variable types.
Definition: BlisModel.h:382
+
BlisModel::numHeuristics
int numHeuristics() const
Get the number of heuristics.
Definition: BlisModel.h:687
+
BlisModel::activeNode_
AlpsTreeNode * activeNode_
Active node.
Definition: BlisModel.h:191
+
BlisModel::inputVar_
std::vector< BcpsVariable * > inputVar_
User's input objects.
Definition: BlisModel.h:121
+
BlisModel::objects
BcpsObject ** objects()
Get the array of objects.
Definition: BlisModel.h:627
+
BlisModel::incumbent
double * incumbent()
Return best ip solution found so far.
Definition: BlisModel.h:543
+
BlisModel::tempConUBPos
int * tempConUBPos()
Definition: BlisModel.h:520
+
BlisCutStrategy
BlisCutStrategy
Definition: Blis.h:69
+
BlisModel::setNumOldConstraints
void setNumOldConstraints(int num)
Set number of old constraints.
Definition: BlisModel.h:732
+
BlisModel::numIterations_
int numIterations_
Number of lp(Simplex) iterations.
Definition: BlisModel.h:266
+
BlisModel::setSolEstimate
void setSolEstimate(double est)
Set the solution estimate of the active node.
Definition: BlisModel.h:458
+
BlisModel::currRelGap_
double currRelGap_
Current relative optimal gap.
Definition: BlisModel.h:314
+
BlisModel::BlisPar_
BlisParams * BlisPar_
Blis parameters.
Definition: BlisModel.h:254
+
BlisModel::optimalAbsGap_
double optimalAbsGap_
Input absolute optimal gap.
Definition: BlisModel.h:311
+
BlisModel::setDenseConCutoff
void setDenseConCutoff(int cutoff)
Set the thresheld to be considered as a dense constraint.
Definition: BlisModel.h:771
+
BlisModel::nodeLog
virtual void nodeLog(AlpsTreeNode *node, bool force)
Node log.
+
BlisModel::setCutStrategy
void setCutStrategy(BlisCutStrategy u)
Set constraint generation strategy.
Definition: BlisModel.h:759
+
BlisModel::checkInteger
bool checkInteger(double value) const
Check if a value is integer.
Definition: BlisModel.h:663
+
BlisModel::hotstartStrategy_
BlisHotStartStrategy hotstartStrategy_
Definition: BlisModel.h:176
+
BlisModel::setActiveNode
void setActiveNode(AlpsTreeNode *node)
Set active node.
Definition: BlisModel.h:455
+
BlisModel::constraintPoolReceive_
BcpsConstraintPool * constraintPoolReceive_
Constraints that are received from other processses.
Definition: BlisModel.h:294
+
BlisParams.h
+
BlisHeurStrategy
BlisHeurStrategy
Definition: Blis.h:77
+
BlisModel::conUB_
double * conUB_
Definition: BlisModel.h:97
+
BlisModel::startVarLB
double * startVarLB()
The starting variable bounds arrary of a subproblem (internal use).
Definition: BlisModel.h:509
+
BlisModel::tempConLBPos_
int * tempConLBPos_
Definition: BlisModel.h:282
+
BlisModel::tempVarLBPos_
int * tempVarLBPos_
Tempory storage for var/con indices.
Definition: BlisModel.h:280
+
BlisModel::origLpSolver_
OsiSolverInterface * origLpSolver_
Input by user.
Definition: BlisModel.h:78
+
BlisModel::decodeBlis
AlpsReturnStatus decodeBlis(AlpsEncoded &encoded)
Unpack Blis portion of the model from an encoded object.
+
BlisModel::startConUB_
double * startConUB_
Definition: BlisModel.h:166
+
BlisModel::sharedObjectMark_
char * sharedObjectMark_
The objects that can be shared.
Definition: BlisModel.h:185
+
BlisModel::addNumNodes
void addNumNodes(int newNodes=1)
Increment node count.
Definition: BlisModel.h:829
+
BlisModel::blisMessages_
CoinMessages blisMessages_
Blis messages.
Definition: BlisModel.h:260
+
BlisModel::optimalRelGap_
double optimalRelGap_
Input relative optimal gap.
Definition: BlisModel.h:308
+
BlisModel::setMaxNumCons
void setMaxNumCons(int m)
Set the max number of cuts can be generated.
Definition: BlisModel.h:715
+
BlisModel::isRoot_
bool isRoot_
If root node.
Definition: BlisModel.h:299
+
BlisModel::getIntObjIndices
int * getIntObjIndices() const
Get integers' object indices.
Definition: BlisModel.h:654
+
BlisModel::numElems_
int numElems_
Definition: BlisModel.h:104
+
BlisModel::setObjCoef
void setObjCoef(double *obj)
Pass objective coefficients.
Definition: BlisModel.h:387
+
BlisModel::getNumStrong
int getNumStrong()
Get number of strong branchings.
Definition: BlisModel.h:461
+
BlisModel::readParameters
virtual void readParameters(const int argnum, const char *const *arglist)
Read in Alps, Blis parameters.
+
BlisModel::setColMatrix
void setColMatrix(CoinPackedMatrix *mat)
Pass a matrix in.
Definition: BlisModel.h:358
+
BlisModel::numSolutions_
int numSolutions_
Definition: BlisModel.h:139
+
BlisModel::addFeasCheckTime
void addFeasCheckTime(double t)
Add to the time spent checking solutions for feasibility.
Definition: BlisModel.h:479
+
BlisModel::getOldConstraintsSize
int getOldConstraintsSize() const
Get max number of old constraints.
Definition: BlisModel.h:735
+
BlisModel::conUB
double * conUB()
Definition: BlisModel.h:506
+
BlisPresolve.h
+
BlisModel::startConUB
double * startConUB()
Definition: BlisModel.h:514
+
BlisModel::cutStrategy_
BlisCutStrategy cutStrategy_
If use cut generators.
Definition: BlisModel.h:217
+
BlisModel::feasCheckTime_
double feasCheckTime_
Time spent checking feasibility of solutions.
Definition: BlisModel.h:272
+
BlisModel::unpackSharedPseudocost
void unpackSharedPseudocost(AlpsEncoded &encoded)
Unpack and store shared pseduocost.
+
BlisModel::integerTol_
double integerTol_
Integer tolerance.
Definition: BlisModel.h:305
+
BlisCutStrategyAuto
@ BlisCutStrategyAuto
Definition: Blis.h:73
+
BlisConstraint
Definition: BlisConstraint.h:33
+
BlisModel::newCutPool_
OsiCuts newCutPool_
Store new cuts in each pass.
Definition: BlisModel.h:326
+
BlisModel::presolvedLpSolver_
OsiSolverInterface * presolvedLpSolver_
Presolved.
Definition: BlisModel.h:80
+
BlisModel::setVarLb
void setVarLb(double *lb)
Pass variable upper bounds.
Definition: BlisModel.h:376
+
BlisModel::packSharedConstraints
void packSharedConstraints(AlpsEncoded *encoded)
Retrieve and pack shared constraints.
+
BlisModel::~BlisModel
virtual ~BlisModel()
Destructor.
+
BlisModel::intColIndices_
int * intColIndices_
Definition: BlisModel.h:116
+
BlisModel::conLB
double * conLB()
Get original constraint bounds arrary.
Definition: BlisModel.h:505
+
BlisModel::importModel
virtual void importModel(std::vector< BlisVariable * > vars, std::vector< BlisConstraint * > cons)
For parallel code, only the master calls this function.
+
BlisModel::inputCon_
std::vector< BcpsConstraint * > inputCon_
Definition: BlisModel.h:122
+
BlisModel::colType_
char * colType_
Definition: BlisModel.h:159
+
BlisModel::getColLower
const double * getColLower()
Get column lower bound.
Definition: BlisModel.h:489
+
BlisModel::conRandoms_
double * conRandoms_
Random keys.
Definition: BlisModel.h:244
+
BlisModel::getNumIntObjects
int getNumIntObjects() const
Get number of integers.
Definition: BlisModel.h:657
+
BlisModel::feasibleSolutionHeur
BlisSolution * feasibleSolutionHeur(const double *solution)
Test if a solution found by heuristic is feasible.
+
BlisModel::setBranchingMethod
void setBranchingMethod(BcpsBranchStrategy *method)
Set the branching strategy.
Definition: BlisModel.h:603
+
BlisModel::rampUpBranchStrategy_
BcpsBranchStrategy * rampUpBranchStrategy_
Definition: BlisModel.h:171
+
BlisModel::branchStrategy
BcpsBranchStrategy * branchStrategy() const
Get the current branching strategy.
Definition: BlisModel.h:599
+
BlisModel::BlisPar
BlisParams * BlisPar()
Access parameters.
Definition: BlisModel.h:846
+
BlisModel::gutsOfDestructor
void gutsOfDestructor()
Actual destructor.
+
BlisModel::analyzeObjective
void analyzeObjective()
+
BlisModel::getNumOldConstraints
int getNumOldConstraints() const
Get number of old constraints.
Definition: BlisModel.h:729
+
BlisConGenerator.h
+
BlisModel::startConLB
double * startConLB()
The starting constraint bounds arrary of a subproblem (internal use).
Definition: BlisModel.h:513
+
BlisModel::getIntColIndices
int * getIntColIndices() const
Get integers' column indices.
Definition: BlisModel.h:660
+
BlisModel::setConLb
void setConLb(double *cl)
Pass column upper bounds.
Definition: BlisModel.h:370
+
BlisModel::aveIterations_
int aveIterations_
Average number of lp iterations to solve a subproblem.
Definition: BlisModel.h:269
+
BlisModel::varUB
double * varUB()
Definition: BlisModel.h:502
+
BlisModel::setNumVars
void setNumVars(int num)
Pass column upper bounds.
Definition: BlisModel.h:364
+
BlisModel::addCutGenerator
void addCutGenerator(BlisConGenerator *generator)
Add a Blis cut generator.
+
BlisModel::oldConstraints
BlisConstraint ** oldConstraints()
Access old constraints.
Definition: BlisModel.h:741
+
BlisModel::setNumObjects
void setNumObjects(int num)
Set the number of objects.
Definition: BlisModel.h:624
+
BlisModel::getNumCols
int getNumCols()
Get number of columns.
Definition: BlisModel.h:495
+
BlisModel::heurCallFrequency_
int heurCallFrequency_
Frequency of using heuristics.
Definition: BlisModel.h:323
+
BlisModel::setCutStrategy
void setCutStrategy(int f)
Set constraint generation frequency.
Definition: BlisModel.h:765
+
BlisModel::solver
virtual OsiSolverInterface * solver()
Get lp solver.
Definition: BlisModel.h:449
+
BlisModel::tempVarLBPos
int * tempVarLBPos()
Temparory storage.
Definition: BlisModel.h:517
+
BlisModel::BlisModel
BlisModel()
Default construtor.
Definition: BlisModel.h:342
+
BlisModel::priority_
int * priority_
Priorities of integer object.
Definition: BlisModel.h:188
+
BlisModel::heuristics_
BlisHeuristic ** heuristics_
The list of heuristics.
Definition: BlisModel.h:210
+
BlisModel::modelLog
virtual void modelLog()
Log of specific models.
+
BlisModel::preprocess
virtual void preprocess()
Preprocessing the model.
+
BlisModel::unpackSharedKnowledge
virtual void unpackSharedKnowledge(AlpsEncoded &)
Unpack and store shared knowledge from an encoded object.
+
BlisModel::objCoef_
double * objCoef_
Definition: BlisModel.h:110
+
BlisModel::getCutGenerationFrequency
int getCutGenerationFrequency() const
Query constraint generation frequency.
Definition: BlisModel.h:762
+
BlisModel::numCutGenerators_
int numCutGenerators_
Number of cut generators used.
Definition: BlisModel.h:223
+
BlisModel::getNumNodes
int getNumNodes() const
Get how many Nodes it took to solve the problem.
Definition: BlisModel.h:820
+
BlisModel::blisMessageHandler
CoinMessageHandler * blisMessageHandler() const
Get the message handler.
Definition: BlisModel.h:838
+
BlisModel::getNodeWeight
double getNodeWeight() const
Definition: BlisModel.h:807
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisNodeDesc_8h.html b/Doxygen/0.94/BlisNodeDesc_8h.html new file mode 100644 index 0000000..9c6c617 --- /dev/null +++ b/Doxygen/0.94/BlisNodeDesc_8h.html @@ -0,0 +1,154 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisNodeDesc.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisNodeDesc.h File Reference
+
+
+
#include "CoinWarmStartBasis.hpp"
+#include "AlpsNodeDesc.h"
+#include "BcpsNodeDesc.h"
+#include "BlisHelp.h"
+#include "BlisModel.h"
+
+ + Include dependency graph for BlisNodeDesc.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + +

+Classes

class  BlisNodeDesc
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisNodeDesc_8h__dep__incl.map b/Doxygen/0.94/BlisNodeDesc_8h__dep__incl.map new file mode 100644 index 0000000..6215599 --- /dev/null +++ b/Doxygen/0.94/BlisNodeDesc_8h__dep__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/BlisNodeDesc_8h__dep__incl.md5 b/Doxygen/0.94/BlisNodeDesc_8h__dep__incl.md5 new file mode 100644 index 0000000..2a943ad --- /dev/null +++ b/Doxygen/0.94/BlisNodeDesc_8h__dep__incl.md5 @@ -0,0 +1 @@ +4801d83b10601b78aa6fd82752ce1608 \ No newline at end of file diff --git a/Doxygen/0.94/BlisNodeDesc_8h__dep__incl.png b/Doxygen/0.94/BlisNodeDesc_8h__dep__incl.png new file mode 100644 index 0000000..53fc83a Binary files /dev/null and b/Doxygen/0.94/BlisNodeDesc_8h__dep__incl.png differ diff --git a/Doxygen/0.94/BlisNodeDesc_8h__incl.map b/Doxygen/0.94/BlisNodeDesc_8h__incl.map new file mode 100644 index 0000000..6d2d76a --- /dev/null +++ b/Doxygen/0.94/BlisNodeDesc_8h__incl.map @@ -0,0 +1,40 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisNodeDesc_8h__incl.md5 b/Doxygen/0.94/BlisNodeDesc_8h__incl.md5 new file mode 100644 index 0000000..10d65ca --- /dev/null +++ b/Doxygen/0.94/BlisNodeDesc_8h__incl.md5 @@ -0,0 +1 @@ +364a80ed84edf30c7192acceb1538aec \ No newline at end of file diff --git a/Doxygen/0.94/BlisNodeDesc_8h__incl.png b/Doxygen/0.94/BlisNodeDesc_8h__incl.png new file mode 100644 index 0000000..4ab3b22 Binary files /dev/null and b/Doxygen/0.94/BlisNodeDesc_8h__incl.png differ diff --git a/Doxygen/0.94/BlisNodeDesc_8h_source.html b/Doxygen/0.94/BlisNodeDesc_8h_source.html new file mode 100644 index 0000000..3630ec5 --- /dev/null +++ b/Doxygen/0.94/BlisNodeDesc_8h_source.html @@ -0,0 +1,265 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisNodeDesc.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisNodeDesc.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 #ifndef BlisNodeDesc_h_
+
25 #define BlisNodeDesc_h_
+
26 
+
27 //#############################################################################
+
28 
+
29 #include "CoinWarmStartBasis.hpp"
+
30 
+
31 #include "AlpsNodeDesc.h"
+
32 #include "BcpsNodeDesc.h"
+
33 
+
34 #include "BlisHelp.h"
+
35 #include "BlisModel.h"
+
36 
+
37 //#############################################################################
+
38 
+
39 
+
40 class BlisNodeDesc : public BcpsNodeDesc {
+
41 
+
42  private:
+
43 
+
45  int branchedDir_;
+
46 
+
48  int branchedInd_;
+
49 
+
51  double branchedVal_;
+
52 
+
54  CoinWarmStartBasis *basis_;
+
55 
+
56  public:
+
57 
+
59  BlisNodeDesc() :
+
60  BcpsNodeDesc(),
+
61  branchedDir_(0),
+
62  branchedInd_(-1),
+
63  branchedVal_(0.0),
+
64  basis_(NULL)
+
65  {}
+
66 
+
68  BlisNodeDesc(BlisModel* m)
+
69  :
+
70  BcpsNodeDesc(m),
+
71  branchedDir_(0),
+
72  branchedInd_(-1),
+
73  branchedVal_(0.0),
+
74  basis_(NULL)
+
75  {}
+
76 
+
78  virtual ~BlisNodeDesc() { delete basis_; basis_ = NULL; }
+
79 
+
81  void setBasis(CoinWarmStartBasis *&ws) {
+
82  if (basis_) { delete basis_; }
+
83  basis_= ws;
+
84  ws = NULL;
+
85  }
+
86 
+
88  CoinWarmStartBasis * getBasis() const { return basis_; }
+
89 
+
91  void setBranchedDir(int d) { branchedDir_ = d; }
+
92 
+
94  int getBranchedDir() const { return branchedDir_; }
+
95 
+
97  void setBranchedInd(int d) { branchedInd_ = d; }
+
98 
+
100  int getBranchedInd() const { return branchedInd_; }
+
101 
+
103  void setBranchedVal(double d) { branchedVal_ = d; }
+
104 
+
106  double getBranchedVal() const { return branchedVal_; }
+
107 
+
108  protected:
+
109 
+
111  AlpsReturnStatus encodeBlis(AlpsEncoded *encoded) const {
+
112  AlpsReturnStatus status = AlpsReturnStatusOk;
+
113 
+
114  encoded->writeRep(branchedDir_);
+
115  encoded->writeRep(branchedInd_);
+
116  encoded->writeRep(branchedVal_);
+
117 
+
118  // Basis
+
119  int ava = 0;
+
120  if (basis_) {
+
121  ava = 1;
+
122  encoded->writeRep(ava);
+
123  BlisEncodeWarmStart(encoded, basis_);
+
124  }
+
125  else {
+
126  encoded->writeRep(ava);
+
127  }
+
128 
+
129  return status;
+
130  }
+
131 
+
133  AlpsReturnStatus decodeBlis(AlpsEncoded &encoded) {
+
134  AlpsReturnStatus status = AlpsReturnStatusOk;
+
135 
+
136  encoded.readRep(branchedDir_);
+
137  encoded.readRep(branchedInd_);
+
138  encoded.readRep(branchedVal_);
+
139 
+
140  // Basis
+
141  int ava;
+
142  encoded.readRep(ava);
+
143  if (ava == 1) {
+
144  if (basis_) delete basis_;
+
145  basis_ = BlisDecodeWarmStart(encoded, &status);
+
146  }
+
147  else {
+
148  basis_ = NULL;
+
149  }
+
150 
+
151  return status;
+
152  }
+
153 
+
154  public:
+
155 
+
157  virtual AlpsReturnStatus encode(AlpsEncoded *encoded) const {
+
158  AlpsReturnStatus status = AlpsReturnStatusOk;
+
159 
+
160  status = encodeBcps(encoded);
+
161  status = encodeBlis(encoded);
+
162 
+
163  return status;
+
164  }
+
165 
+
167  virtual AlpsReturnStatus decode(AlpsEncoded &encoded) {
+
168 
+
169  AlpsReturnStatus status = AlpsReturnStatusOk;
+
170 
+
171  status = decodeBcps(encoded);
+
172  status = decodeBlis(encoded);
+
173 
+
174  return status;
+
175  }
+
176 
+
177 };
+
178 #endif
+
+
BlisNodeDesc::encodeBlis
AlpsReturnStatus encodeBlis(AlpsEncoded *encoded) const
Pack blis portion of node description into an encoded.
Definition: BlisNodeDesc.h:111
+
BlisNodeDesc::branchedDir_
int branchedDir_
Branched direction to create it.
Definition: BlisNodeDesc.h:45
+
BlisNodeDesc::setBasis
void setBasis(CoinWarmStartBasis *&ws)
Set basis.
Definition: BlisNodeDesc.h:81
+
BlisNodeDesc::getBasis
CoinWarmStartBasis * getBasis() const
Get warm start basis.
Definition: BlisNodeDesc.h:88
+
BlisModel
Definition: BlisModel.h:69
+
BlisNodeDesc::setBranchedDir
void setBranchedDir(int d)
Set branching direction.
Definition: BlisNodeDesc.h:91
+
BlisNodeDesc::~BlisNodeDesc
virtual ~BlisNodeDesc()
Destructor.
Definition: BlisNodeDesc.h:78
+
BlisNodeDesc
Definition: BlisNodeDesc.h:40
+
BlisNodeDesc::getBranchedVal
double getBranchedVal() const
Get branching direction.
Definition: BlisNodeDesc.h:106
+
BlisModel.h
+
BlisNodeDesc::BlisNodeDesc
BlisNodeDesc()
Default constructor.
Definition: BlisNodeDesc.h:59
+
BlisEncodeWarmStart
int BlisEncodeWarmStart(AlpsEncoded *encoded, const CoinWarmStartBasis *ws)
Pack coin warm start into an encoded object.
+
BlisNodeDesc::getBranchedInd
int getBranchedInd() const
Get branching object index.
Definition: BlisNodeDesc.h:100
+
BlisNodeDesc::encode
virtual AlpsReturnStatus encode(AlpsEncoded *encoded) const
Pack node description into an encoded.
Definition: BlisNodeDesc.h:157
+
BlisNodeDesc::getBranchedDir
int getBranchedDir() const
Get branching direction.
Definition: BlisNodeDesc.h:94
+
BlisHelp.h
+
BlisNodeDesc::basis_
CoinWarmStartBasis * basis_
Warm start.
Definition: BlisNodeDesc.h:54
+
BlisNodeDesc::setBranchedVal
void setBranchedVal(double d)
Set branching value.
Definition: BlisNodeDesc.h:103
+
BlisNodeDesc::decode
virtual AlpsReturnStatus decode(AlpsEncoded &encoded)
Unpack a node description from an encoded.
Definition: BlisNodeDesc.h:167
+
BlisNodeDesc::setBranchedInd
void setBranchedInd(int d)
Set branching object index.
Definition: BlisNodeDesc.h:97
+
BlisNodeDesc::branchedVal_
double branchedVal_
Branched value to create it.
Definition: BlisNodeDesc.h:51
+
BlisNodeDesc::branchedInd_
int branchedInd_
Branched object index to create it.
Definition: BlisNodeDesc.h:48
+
BlisNodeDesc::BlisNodeDesc
BlisNodeDesc(BlisModel *m)
Useful constructor.
Definition: BlisNodeDesc.h:68
+
BlisNodeDesc::decodeBlis
AlpsReturnStatus decodeBlis(AlpsEncoded &encoded)
Unpack blis portion of node description from an encoded.
Definition: BlisNodeDesc.h:133
+
BlisDecodeWarmStart
CoinWarmStartBasis * BlisDecodeWarmStart(AlpsEncoded &encoded, AlpsReturnStatus *rc)
Unpack coin warm start from an encoded object.
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisObjectInt_8h.html b/Doxygen/0.94/BlisObjectInt_8h.html new file mode 100644 index 0000000..6503e37 --- /dev/null +++ b/Doxygen/0.94/BlisObjectInt_8h.html @@ -0,0 +1,107 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisObjectInt.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisObjectInt.h File Reference
+
+
+
#include "BcpsObject.h"
+#include "BlisPseudo.h"
+
+ + Include dependency graph for BlisObjectInt.h:
+
+
+ +
+

Go to the source code of this file.

+ + + + +

+Classes

class  BlisObjectInt
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisObjectInt_8h__incl.map b/Doxygen/0.94/BlisObjectInt_8h__incl.map new file mode 100644 index 0000000..c70d227 --- /dev/null +++ b/Doxygen/0.94/BlisObjectInt_8h__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/Doxygen/0.94/BlisObjectInt_8h__incl.md5 b/Doxygen/0.94/BlisObjectInt_8h__incl.md5 new file mode 100644 index 0000000..31efe40 --- /dev/null +++ b/Doxygen/0.94/BlisObjectInt_8h__incl.md5 @@ -0,0 +1 @@ +394439a7ac465ac388ed25847e72d3da \ No newline at end of file diff --git a/Doxygen/0.94/BlisObjectInt_8h__incl.png b/Doxygen/0.94/BlisObjectInt_8h__incl.png new file mode 100644 index 0000000..55809c2 Binary files /dev/null and b/Doxygen/0.94/BlisObjectInt_8h__incl.png differ diff --git a/Doxygen/0.94/BlisObjectInt_8h_source.html b/Doxygen/0.94/BlisObjectInt_8h_source.html new file mode 100644 index 0000000..2061274 --- /dev/null +++ b/Doxygen/0.94/BlisObjectInt_8h_source.html @@ -0,0 +1,204 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisObjectInt.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisObjectInt.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 //#############################################################################
+
25 // This file is modified from from COIN/Cbc
+
26 //#############################################################################
+
27 
+
28 
+
29 #include "BcpsObject.h"
+
30 #include "BlisPseudo.h"
+
31 
+
32 class BlisModel;
+
33 
+
34 //#############################################################################
+
35 
+
36 class BlisObjectInt : public BcpsObject {
+
37 
+
38 protected:
+
39 
+
41  int columnIndex_;
+
42 
+
44  double originalLower_;
+
45 
+
47  double originalUpper_;
+
48 
+
50  double breakEven_;
+
51 
+
53  BlisPseudocost pseudocost_;
+
54 
+
55  public:
+
56 
+
58  BlisObjectInt();
+
59 
+
61  BlisObjectInt(int objectIndex,
+
62  int iColumn,
+
63  double lb,
+
64  double ub,
+
65  double breakEven = 0.5);
+
66 
+
68  virtual ~BlisObjectInt() {}
+
69 
+
71  BlisObjectInt( const BlisObjectInt &);
+
72 
+
74  virtual BcpsObject * clone() const {
+
75  return new BlisObjectInt(*this);
+
76  }
+
77 
+
79  BlisObjectInt & operator=( const BlisObjectInt& rhs);
+
80 
+
83  virtual double infeasibility(BcpsModel *m, int & preferredWay) const;
+
84 
+
91  virtual void feasibleRegion(BcpsModel *m);
+
92 
+
94  virtual BcpsBranchObject * createBranchObject(BcpsModel *m,
+
95  int direction) const;
+
96 
+
111  virtual BcpsBranchObject * preferredNewFeasible(BcpsModel *m) const;
+
112 
+
120  virtual BcpsBranchObject * notPreferredNewFeasible(BcpsModel *m) const ;
+
121 
+
126  virtual void resetBounds(BcpsModel *m);
+
127 
+
129  virtual int columnIndex() const { return columnIndex_; }
+
130 
+
133  inline double originalLowerBound() const { return originalLower_; }
+
134  inline void setOriginalLowerBound(double value) { originalLower_=value; }
+
135  inline double originalUpperBound() const { return originalUpper_; }
+
136  inline void setOriginalUpperBound(double value) { originalUpper_=value; }
+
138 
+
140  inline double breakEven() const { return breakEven_; }
+
141 
+
143  inline void setBreakEven(double value) { breakEven_ = value; }
+
144 
+
146  BlisPseudocost & pseudocost() { return pseudocost_; }
+
147 };
+
148 
+
+
BlisObjectInt::setOriginalUpperBound
void setOriginalUpperBound(double value)
Definition: BlisObjectInt.h:136
+
BlisObjectInt::columnIndex
virtual int columnIndex() const
Column number if single column object, otherwise.
Definition: BlisObjectInt.h:129
+
BlisObjectInt::infeasibility
virtual double infeasibility(BcpsModel *m, int &preferredWay) const
Infeasibility.
+
BlisObjectInt::clone
virtual BcpsObject * clone() const
Clone an object.
Definition: BlisObjectInt.h:74
+
BlisObjectInt::~BlisObjectInt
virtual ~BlisObjectInt()
Destructor.
Definition: BlisObjectInt.h:68
+
BlisPseudo.h
+
BlisModel
Definition: BlisModel.h:69
+
BlisObjectInt::BlisObjectInt
BlisObjectInt()
Default Constructor.
+
BlisObjectInt::preferredNewFeasible
virtual BcpsBranchObject * preferredNewFeasible(BcpsModel *m) const
Given a valid solution (with reduced costs, etc.), return a branching object which would give a new f...
+
BlisObjectInt::setOriginalLowerBound
void setOriginalLowerBound(double value)
Definition: BlisObjectInt.h:134
+
BlisObjectInt::breakEven
double breakEven() const
Breakeven e.g 0.7 -> >= 0.7 go up first.
Definition: BlisObjectInt.h:140
+
BlisObjectInt::originalUpperBound
double originalUpperBound() const
Definition: BlisObjectInt.h:135
+
BlisObjectInt::resetBounds
virtual void resetBounds(BcpsModel *m)
Reset original upper and lower bound values from the solver.
+
BlisObjectInt::createBranchObject
virtual BcpsBranchObject * createBranchObject(BcpsModel *m, int direction) const
Creates a branching object.
+
BlisObjectInt::originalUpper_
double originalUpper_
Original upper bound.
Definition: BlisObjectInt.h:47
+
BlisObjectInt::notPreferredNewFeasible
virtual BcpsBranchObject * notPreferredNewFeasible(BcpsModel *m) const
Given a valid solution (with reduced costs, etc.), return a branching object which would give a new f...
+
BlisObjectInt::breakEven_
double breakEven_
Breakeven i.e.
Definition: BlisObjectInt.h:50
+
BlisObjectInt::originalLower_
double originalLower_
Original lower bound.
Definition: BlisObjectInt.h:44
+
BlisObjectInt::columnIndex_
int columnIndex_
Column index in the lp model.
Definition: BlisObjectInt.h:41
+
BlisObjectInt::originalLowerBound
double originalLowerBound() const
Definition: BlisObjectInt.h:133
+
BlisObjectInt::feasibleRegion
virtual void feasibleRegion(BcpsModel *m)
Set bounds to contain the current solution.
+
BlisObjectInt::pseudocost_
BlisPseudocost pseudocost_
Pseudo cost.
Definition: BlisObjectInt.h:53
+
BlisObjectInt::pseudocost
BlisPseudocost & pseudocost()
Access pseudocost.
Definition: BlisObjectInt.h:146
+
BlisObjectInt::operator=
BlisObjectInt & operator=(const BlisObjectInt &rhs)
Assignment operator.
+
BlisPseudocost
Definition: BlisPseudo.h:32
+
BlisObjectInt
Definition: BlisObjectInt.h:36
+
BlisObjectInt::setBreakEven
void setBreakEven(double value)
Set breakeven e.g 0.7 -> >= 0.7 go up first.
Definition: BlisObjectInt.h:143
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisParams_8h.html b/Doxygen/0.94/BlisParams_8h.html new file mode 100644 index 0000000..83307ef --- /dev/null +++ b/Doxygen/0.94/BlisParams_8h.html @@ -0,0 +1,135 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisParams.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisParams.h File Reference
+
+
+
#include "AlpsKnowledge.h"
+#include "AlpsParameterBase.h"
+#include "Blis.h"
+
+ + Include dependency graph for BlisParams.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + +

+Classes

class  BlisParams
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisParams_8h__dep__incl.map b/Doxygen/0.94/BlisParams_8h__dep__incl.map new file mode 100644 index 0000000..7026d98 --- /dev/null +++ b/Doxygen/0.94/BlisParams_8h__dep__incl.map @@ -0,0 +1,17 @@ + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisParams_8h__dep__incl.md5 b/Doxygen/0.94/BlisParams_8h__dep__incl.md5 new file mode 100644 index 0000000..707dd1d --- /dev/null +++ b/Doxygen/0.94/BlisParams_8h__dep__incl.md5 @@ -0,0 +1 @@ +9a96a9a252ecf7aa06283ecaa66b5324 \ No newline at end of file diff --git a/Doxygen/0.94/BlisParams_8h__dep__incl.png b/Doxygen/0.94/BlisParams_8h__dep__incl.png new file mode 100644 index 0000000..6c33e9d Binary files /dev/null and b/Doxygen/0.94/BlisParams_8h__dep__incl.png differ diff --git a/Doxygen/0.94/BlisParams_8h__incl.map b/Doxygen/0.94/BlisParams_8h__incl.map new file mode 100644 index 0000000..22e6110 --- /dev/null +++ b/Doxygen/0.94/BlisParams_8h__incl.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/Doxygen/0.94/BlisParams_8h__incl.md5 b/Doxygen/0.94/BlisParams_8h__incl.md5 new file mode 100644 index 0000000..120a256 --- /dev/null +++ b/Doxygen/0.94/BlisParams_8h__incl.md5 @@ -0,0 +1 @@ +2ba5720576d843ac7a2e4c3f9a80777b \ No newline at end of file diff --git a/Doxygen/0.94/BlisParams_8h__incl.png b/Doxygen/0.94/BlisParams_8h__incl.png new file mode 100644 index 0000000..e166d34 Binary files /dev/null and b/Doxygen/0.94/BlisParams_8h__incl.png differ diff --git a/Doxygen/0.94/BlisParams_8h_source.html b/Doxygen/0.94/BlisParams_8h_source.html new file mode 100644 index 0000000..98d793a --- /dev/null +++ b/Doxygen/0.94/BlisParams_8h_source.html @@ -0,0 +1,375 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisParams.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisParams.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 #ifndef BlisParams_h
+
25 #define BlisParams_h
+
26 
+
27 #include "AlpsKnowledge.h"
+
28 #include "AlpsParameterBase.h"
+
29 
+
30 #include "Blis.h"
+
31 
+
32 //#############################################################################
+
33 
+
34 //** Parameters used in Blis. */
+
35 class BlisParams : public AlpsParameterSet {
+
36  public:
+
39  enum chrParams{
+
42  cutRampUp,
+
44  presolve,
+
47  shareConstraints,
+
50  shareVariables,
+
53  sharePseudocostRampUp,
+
56  sharePseudocostSearch,
+
57  //
+
58  endOfChrParams
+
59  };
+
60 
+
62  enum intParams{
+
63 
+
71  branchStrategy,
+
72  branchStrategyRampUp,
+
73 
+
80  cutStrategy,
+
81  cutGenerationFrequency,
+
82 
+
83  cutPass,
+
84  quickCutPass,
+
86  cutCliqueStrategy,
+
87  cutGomoryStrategy,
+
88  cutFlowCoverStrategy,
+
89  cutKnapsackStrategy,
+
90  cutMirStrategy,
+
91  cutOddHoleStrategy,
+
92  cutProbingStrategy,
+
93  cutTwoMirStrategy,
+
94  cutCliqueFreq,
+
95  cutGomoryFreq,
+
96  cutFlowCoverFreq,
+
97  cutKnapsackFreq,
+
98  cutMirFreq,
+
99  cutOddHoleFreq,
+
100  cutProbingFreq,
+
101  cutTwoMirFreq,
+
102 
+
104  difference,
+
105 
+
112  heurStrategy,
+
113  heurCallFrequency,
+
114  heurRoundStrategy,
+
115  heurRoundFreq,
+
116 
+
118  lookAhead,
+
120  pseudoRelibility,
+
121 
+
123  sharePcostDepth,
+
125  sharePcostFrequency,
+
127  strongCandSize,
+
129  endOfIntParams
+
130  };
+
131 
+
133  enum dblParams{
+
136  cutFactor,
+
137 
+
139  cutoff,
+
142  cutoffInc,
+
143 
+
145  denseConFactor,
+
146 
+
148  integerTol,
+
149 
+
151  objSense,
+
152 
+
155  optimalRelGap,
+
156 
+
159  optimalAbsGap,
+
160 
+
162  pseudoWeight,
+
163 
+
165  scaleConFactor,
+
166 
+
168  tailOff,
+
170  endOfDblParams
+
171  };
+
172 
+
174  enum strParams{
+
175  strDummy,
+
176  //
+
177  endOfStrParams
+
178  };
+
179 
+
181  enum strArrayParams{
+
182  strArrayDummy,
+
184  endOfStrArrayParams
+
185  };
+
186 
+
187  public:
+
193  BlisParams() :
+
194  AlpsParameterSet(
+
195  static_cast<int>(endOfChrParams),
+
196  static_cast<int>(endOfIntParams),
+
197  static_cast<int>(endOfDblParams),
+
198  static_cast<int>(endOfStrParams),
+
199  static_cast<int>(endOfStrArrayParams)
+
200  )
+
201  {
+
202  prefix_ = "Blis";
+
203  createKeywordList();
+
204  setDefaultEntries();
+
205  }
+
210  virtual void createKeywordList();
+
212  virtual void setDefaultEntries();
+
216  public:
+
217  //===========================================================================
+
225  //===========================================================================
+
226 
+
227 
+
236  inline bool entry(const chrParams key) const { return bpar_[key]; }
+
239  inline int entry(const intParams key) const { return ipar_[key]; }
+
241  inline double entry(const dblParams key) const { return dpar_[key]; }
+
243  inline const std::string&
+
244  entry(const strParams key) const { return spar_[key]; }
+
246  inline const std::vector<std::string>&
+
247  entry(const strArrayParams key) const { return sapar_[key]; }
+
250  //---------------------------------------------------------------------------
+
252  void setEntry(const chrParams key, const char * val) {
+
253  bpar_[key] = atoi(val) ? true : false; }
+
255  void setEntry(const chrParams key, const char val) {
+
256  bpar_[key] = val ? true : false; }
+
258  void setEntry(const chrParams key, const bool val) {
+
259  bpar_[key] = val; }
+
261  void setEntry(const intParams key, const char * val) {
+
262  ipar_[key] = atoi(val); }
+
264  void setEntry(const intParams key, const int val) {
+
265  ipar_[key] = val; }
+
267  void setEntry(const dblParams key, const char * val) {
+
268  dpar_[key] = atof(val); }
+
270  void setEntry(const dblParams key, const double val) {
+
271  dpar_[key] = val; }
+
273  void setEntry(const strParams key, const char * val) {
+
274  spar_[key] = val; }
+
276  void setEntry(const strArrayParams key, const char *val) {
+
277  sapar_[key].push_back(val); }
+
278 
+
279  //---------------------------------------------------------------------------
+
280 
+
285  void pack(AlpsEncoded& buf) {
+
286  buf.writeRep(bpar_, endOfChrParams)
+
287  .writeRep(ipar_, endOfIntParams)
+
288  .writeRep(dpar_, endOfDblParams);
+
289  for (int i = 0; i < endOfStrParams; ++i)
+
290  buf.writeRep(spar_[i]);
+
291  for (int i = 0; i < endOfStrArrayParams; ++i) {
+
292  buf.writeRep(sapar_[i].size());
+
293  for (size_t j = 0; j < sapar_[i].size(); ++j)
+
294  buf.writeRep(sapar_[i][j]);
+
295  }
+
296  }
+
298  void unpack(AlpsEncoded& buf) {
+
299  int dummy;
+
300  // No need to allocate the arrays, they are of fixed length
+
301  dummy = static_cast<int>(endOfChrParams);
+
302  buf.readRep(bpar_, dummy, false);
+
303  dummy = static_cast<int>(endOfIntParams);
+
304  buf.readRep(ipar_, dummy, false);
+
305  dummy = static_cast<int>(endOfDblParams);
+
306  buf.readRep(dpar_, dummy, false);
+
307  for (int i = 0; i < endOfStrParams; ++i)
+
308  buf.readRep(spar_[i]);
+
309  for (int i = 0; i < endOfStrArrayParams; ++i) {
+
310  size_t str_size;
+
311  buf.readRep(str_size);
+
312  sapar_[i].reserve(str_size);
+
313  for (size_t j = 0; j < str_size; ++j){
+
314  // sapar_[i].unchecked_push_back(std::string());
+
315  sapar_[i].push_back(std::string());
+
316  buf.readRep(sapar_[i].back());
+
317  }
+
318  }
+
319  }
+
322 };
+
323 
+
324 #endif
+
+
BlisParams::heurRoundFreq
@ heurRoundFreq
Definition: BlisParams.h:115
+
BlisParams::entry
double entry(const dblParams key) const
Definition: BlisParams.h:241
+
BlisParams::presolve
@ presolve
Presolve or not.
Definition: BlisParams.h:44
+
BlisParams::scaleConFactor
@ scaleConFactor
Scaling indicator of a constraint.
Definition: BlisParams.h:165
+
BlisParams::cutMirFreq
@ cutMirFreq
Definition: BlisParams.h:98
+
BlisParams::chrParams
chrParams
Character parameters.
Definition: BlisParams.h:39
+
BlisParams::branchStrategy
@ branchStrategy
Branching strategy.
Definition: BlisParams.h:71
+
BlisParams::cutOddHoleStrategy
@ cutOddHoleStrategy
Definition: BlisParams.h:91
+
BlisParams::cutoff
@ cutoff
Cutoff any nodes whose objective value is higher than it.
Definition: BlisParams.h:139
+
BlisParams::cutTwoMirStrategy
@ cutTwoMirStrategy
Definition: BlisParams.h:93
+
BlisParams::optimalRelGap
@ optimalRelGap
If the relative gap between best feasible and best relaxed fall into this gap, search stops.
Definition: BlisParams.h:155
+
BlisParams::cutOddHoleFreq
@ cutOddHoleFreq
Definition: BlisParams.h:99
+
BlisParams::entry
int entry(const intParams key) const
Definition: BlisParams.h:239
+
BlisParams::objSense
@ objSense
Objective sense: min = 1.0, max = -1.0.
Definition: BlisParams.h:151
+
BlisParams::integerTol
@ integerTol
Tolerance to treat as an integer.
Definition: BlisParams.h:148
+
BlisParams::intParams
intParams
Integer paramters.
Definition: BlisParams.h:62
+
BlisParams::cutGomoryStrategy
@ cutGomoryStrategy
Definition: BlisParams.h:87
+
BlisParams::cutProbingStrategy
@ cutProbingStrategy
Definition: BlisParams.h:92
+
BlisParams::pseudoWeight
@ pseudoWeight
Weight used to calculate pseudocost.
Definition: BlisParams.h:162
+
BlisParams::endOfStrParams
@ endOfStrParams
Definition: BlisParams.h:177
+
BlisParams::cutPass
@ cutPass
Definition: BlisParams.h:83
+
BlisParams::setEntry
void setEntry(const strParams key, const char *val)
Definition: BlisParams.h:273
+
BlisParams::cutFactor
@ cutFactor
Limit the max number cuts applied at a node.
Definition: BlisParams.h:136
+
BlisParams::cutKnapsackFreq
@ cutKnapsackFreq
Definition: BlisParams.h:97
+
BlisParams::cutoffInc
@ cutoffInc
The value added to relaxation value when deciding fathom.
Definition: BlisParams.h:142
+
BlisParams::strDummy
@ strDummy
Definition: BlisParams.h:175
+
BlisParams::setEntry
void setEntry(const chrParams key, const char *val)
char* is true(1) or false(0), not used
Definition: BlisParams.h:252
+
BlisParams::entry
const std::vector< std::string > & entry(const strArrayParams key) const
Definition: BlisParams.h:247
+
BlisParams::strArrayDummy
@ strArrayDummy
Definition: BlisParams.h:182
+
BlisParams::cutKnapsackStrategy
@ cutKnapsackStrategy
Definition: BlisParams.h:89
+
BlisParams::heurStrategy
@ heurStrategy
Heuristics control.
Definition: BlisParams.h:112
+
BlisParams::cutGenerationFrequency
@ cutGenerationFrequency
All constraint generators.
Definition: BlisParams.h:81
+
BlisParams
Definition: BlisParams.h:35
+
BlisParams::sharePcostFrequency
@ sharePcostFrequency
Frequency of sharing pseudocost.
Definition: BlisParams.h:125
+
BlisParams::cutTwoMirFreq
@ cutTwoMirFreq
Definition: BlisParams.h:101
+
BlisParams::unpack
void unpack(AlpsEncoded &buf)
Unpack the parameter set from the buffer.
Definition: BlisParams.h:298
+
BlisParams::setEntry
void setEntry(const dblParams key, const double val)
Definition: BlisParams.h:270
+
BlisParams::setEntry
void setEntry(const strArrayParams key, const char *val)
Definition: BlisParams.h:276
+
BlisParams::createKeywordList
virtual void createKeywordList()
Method for creating the list of keyword looked for in the parameter file.
+
BlisParams::pack
void pack(AlpsEncoded &buf)
Pack the parameter set into the buffer (AlpsEncoded is used as buffer Here).
Definition: BlisParams.h:285
+
BlisParams::sharePseudocostSearch
@ sharePseudocostSearch
Share pseudocost during search Default: false.
Definition: BlisParams.h:56
+
BlisParams::cutGomoryFreq
@ cutGomoryFreq
Definition: BlisParams.h:95
+
BlisParams::cutFlowCoverStrategy
@ cutFlowCoverStrategy
Definition: BlisParams.h:88
+
BlisParams::branchStrategyRampUp
@ branchStrategyRampUp
Definition: BlisParams.h:72
+
BlisParams::entry
bool entry(const chrParams key) const
Definition: BlisParams.h:237
+
Blis.h
+
BlisParams::setEntry
void setEntry(const dblParams key, const char *val)
Definition: BlisParams.h:267
+
BlisParams::pseudoRelibility
@ pseudoRelibility
The relibility of pseudocost.
Definition: BlisParams.h:120
+
BlisParams::setDefaultEntries
virtual void setDefaultEntries()
Method for setting the default values for the parameters.
+
BlisParams::cutCliqueStrategy
@ cutCliqueStrategy
The pass to generate cuts for quick branching.
Definition: BlisParams.h:86
+
BlisParams::strParams
strParams
String parameters.
Definition: BlisParams.h:174
+
BlisParams::strArrayParams
strArrayParams
There are no string array parameters.
Definition: BlisParams.h:181
+
BlisParams::denseConFactor
@ denseConFactor
Dense constraint factor.
Definition: BlisParams.h:145
+
BlisParams::endOfChrParams
@ endOfChrParams
Definition: BlisParams.h:58
+
BlisParams::cutFlowCoverFreq
@ cutFlowCoverFreq
Definition: BlisParams.h:96
+
BlisParams::heurRoundStrategy
@ heurRoundStrategy
Definition: BlisParams.h:114
+
BlisParams::sharePseudocostRampUp
@ sharePseudocostRampUp
Share pseudocost during ramp up.
Definition: BlisParams.h:53
+
BlisParams::difference
@ difference
-1 auto, 0, no, any integer frequency
Definition: BlisParams.h:104
+
BlisParams::setEntry
void setEntry(const chrParams key, const char val)
char is true(1) or false(0), not used
Definition: BlisParams.h:255
+
BlisParams::shareVariables
@ shareVariables
Share constraints Default: false.
Definition: BlisParams.h:50
+
BlisParams::setEntry
void setEntry(const intParams key, const int val)
Definition: BlisParams.h:264
+
BlisParams::setEntry
void setEntry(const chrParams key, const bool val)
This method is the one that ever been used.
Definition: BlisParams.h:258
+
BlisParams::cutStrategy
@ cutStrategy
Cut generators control.
Definition: BlisParams.h:80
+
BlisParams::endOfIntParams
@ endOfIntParams
Definition: BlisParams.h:129
+
BlisParams::cutMirStrategy
@ cutMirStrategy
Definition: BlisParams.h:90
+
BlisParams::quickCutPass
@ quickCutPass
The pass to generate cuts.
Definition: BlisParams.h:84
+
BlisParams::cutProbingFreq
@ cutProbingFreq
Definition: BlisParams.h:100
+
BlisParams::tailOff
@ tailOff
Tail off.
Definition: BlisParams.h:168
+
BlisParams::endOfStrArrayParams
@ endOfStrArrayParams
Definition: BlisParams.h:184
+
BlisParams::lookAhead
@ lookAhead
The look ahead of pseudocost.
Definition: BlisParams.h:118
+
BlisParams::cutRampUp
@ cutRampUp
Generate cuts during rampup.
Definition: BlisParams.h:42
+
BlisParams::entry
const std::string & entry(const strParams key) const
Definition: BlisParams.h:244
+
BlisParams::BlisParams
BlisParams()
The default constructor creates a parameter set with from the template argument structure.
Definition: BlisParams.h:193
+
BlisParams::sharePcostDepth
@ sharePcostDepth
Maximum tree depth of sharing pseudocost.
Definition: BlisParams.h:123
+
BlisParams::cutCliqueFreq
@ cutCliqueFreq
Definition: BlisParams.h:94
+
BlisParams::endOfDblParams
@ endOfDblParams
Definition: BlisParams.h:170
+
BlisParams::strongCandSize
@ strongCandSize
The number of candidate used in strong branching.
Definition: BlisParams.h:127
+
BlisParams::optimalAbsGap
@ optimalAbsGap
If the absolute gap between best feasible and best relaxed fall into this gap, search stops.
Definition: BlisParams.h:159
+
BlisParams::dblParams
dblParams
Double parameters.
Definition: BlisParams.h:133
+
BlisParams::shareConstraints
@ shareConstraints
Share constraints Default: false.
Definition: BlisParams.h:47
+
BlisParams::setEntry
void setEntry(const intParams key, const char *val)
Definition: BlisParams.h:261
+
BlisParams::heurCallFrequency
@ heurCallFrequency
All heuristics.
Definition: BlisParams.h:113
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisPresolve_8h.html b/Doxygen/0.94/BlisPresolve_8h.html new file mode 100644 index 0000000..0ed228c --- /dev/null +++ b/Doxygen/0.94/BlisPresolve_8h.html @@ -0,0 +1,128 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisPresolve.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisPresolve.h File Reference
+
+
+
#include "OsiPresolve.hpp"
+
+ + Include dependency graph for BlisPresolve.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + + +

+Classes

class  BlisPresolve
 A interface to Osi/Coin Presolve. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisPresolve_8h__dep__incl.map b/Doxygen/0.94/BlisPresolve_8h__dep__incl.map new file mode 100644 index 0000000..21e8712 --- /dev/null +++ b/Doxygen/0.94/BlisPresolve_8h__dep__incl.map @@ -0,0 +1,17 @@ + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisPresolve_8h__dep__incl.md5 b/Doxygen/0.94/BlisPresolve_8h__dep__incl.md5 new file mode 100644 index 0000000..ccda899 --- /dev/null +++ b/Doxygen/0.94/BlisPresolve_8h__dep__incl.md5 @@ -0,0 +1 @@ +d730ab579bc847b67de8a2079df208a0 \ No newline at end of file diff --git a/Doxygen/0.94/BlisPresolve_8h__dep__incl.png b/Doxygen/0.94/BlisPresolve_8h__dep__incl.png new file mode 100644 index 0000000..a182b17 Binary files /dev/null and b/Doxygen/0.94/BlisPresolve_8h__dep__incl.png differ diff --git a/Doxygen/0.94/BlisPresolve_8h__incl.map b/Doxygen/0.94/BlisPresolve_8h__incl.map new file mode 100644 index 0000000..161cd91 --- /dev/null +++ b/Doxygen/0.94/BlisPresolve_8h__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/BlisPresolve_8h__incl.md5 b/Doxygen/0.94/BlisPresolve_8h__incl.md5 new file mode 100644 index 0000000..a33bc44 --- /dev/null +++ b/Doxygen/0.94/BlisPresolve_8h__incl.md5 @@ -0,0 +1 @@ +0174d1fcf981b3aec81eb385c7e48983 \ No newline at end of file diff --git a/Doxygen/0.94/BlisPresolve_8h__incl.png b/Doxygen/0.94/BlisPresolve_8h__incl.png new file mode 100644 index 0000000..78c49f9 Binary files /dev/null and b/Doxygen/0.94/BlisPresolve_8h__incl.png differ diff --git a/Doxygen/0.94/BlisPresolve_8h_source.html b/Doxygen/0.94/BlisPresolve_8h_source.html new file mode 100644 index 0000000..302fc19 --- /dev/null +++ b/Doxygen/0.94/BlisPresolve_8h_source.html @@ -0,0 +1,153 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisPresolve.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisPresolve.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 #ifndef BlisPresolve_H_
+
25 #define BlisPresolve_H_
+
26 
+
27 #if defined(_MSC_VER)
+
28 // Turn off compiler warning about long names
+
29 # pragma warning(disable:4786)
+
30 #endif
+
31 
+
32 #include "OsiPresolve.hpp"
+
33 
+
34 //#############################################################################
+
35 
+
37 class BlisPresolve : public OsiPresolve
+
38 {
+
39 private:
+
40 
+
41  CoinPresolveMatrix *preMatrix_;
+
42  CoinPostsolveMatrix *postMatrix_;
+
43 
+
44 public:
+
45 
+
47  BlisPresolve() :
+
48  preMatrix_(0),
+
49  postMatrix_(0) {}
+
50 
+
52  virtual ~BlisPresolve() {
+
53  delete preMatrix_;
+
54  delete postMatrix_;
+
55  }
+
56 
+
58  virtual OsiSolverInterface *preprocess(OsiSolverInterface & origModel,
+
59  double feasibilityTolerance=0.0,
+
60  bool keepIntegers=true,
+
61  int numberPasses=5,
+
62  const char * prohibited=NULL);
+
63 
+
65  virtual void postprocess(bool updateStatus=true);
+
66 };
+
67 
+
68 #endif
+
69 
+
70 //#############################################################################
+
+
BlisPresolve
A interface to Osi/Coin Presolve.
Definition: BlisPresolve.h:37
+
BlisPresolve::BlisPresolve
BlisPresolve()
Default constructor (empty object)
Definition: BlisPresolve.h:47
+
BlisPresolve::preMatrix_
CoinPresolveMatrix * preMatrix_
Definition: BlisPresolve.h:41
+
BlisPresolve::postMatrix_
CoinPostsolveMatrix * postMatrix_
Definition: BlisPresolve.h:42
+
BlisPresolve::postprocess
virtual void postprocess(bool updateStatus=true)
Postsolve.
+
BlisPresolve::~BlisPresolve
virtual ~BlisPresolve()
Virtual destructor.
Definition: BlisPresolve.h:52
+
BlisPresolve::preprocess
virtual OsiSolverInterface * preprocess(OsiSolverInterface &origModel, double feasibilityTolerance=0.0, bool keepIntegers=true, int numberPasses=5, const char *prohibited=NULL)
Presolve.
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisPseudo_8h.html b/Doxygen/0.94/BlisPseudo_8h.html new file mode 100644 index 0000000..7f3b742 --- /dev/null +++ b/Doxygen/0.94/BlisPseudo_8h.html @@ -0,0 +1,130 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisPseudo.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisPseudo.h File Reference
+
+
+
#include "CoinError.hpp"
+#include "AlpsKnowledge.h"
+
+ + Include dependency graph for BlisPseudo.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + +

+Classes

class  BlisPseudocost
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisPseudo_8h__dep__incl.map b/Doxygen/0.94/BlisPseudo_8h__dep__incl.map new file mode 100644 index 0000000..206478b --- /dev/null +++ b/Doxygen/0.94/BlisPseudo_8h__dep__incl.map @@ -0,0 +1,18 @@ + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisPseudo_8h__dep__incl.md5 b/Doxygen/0.94/BlisPseudo_8h__dep__incl.md5 new file mode 100644 index 0000000..8e14042 --- /dev/null +++ b/Doxygen/0.94/BlisPseudo_8h__dep__incl.md5 @@ -0,0 +1 @@ +01e4f649c73c3e3f847ffde847f33e82 \ No newline at end of file diff --git a/Doxygen/0.94/BlisPseudo_8h__dep__incl.png b/Doxygen/0.94/BlisPseudo_8h__dep__incl.png new file mode 100644 index 0000000..0f76d75 Binary files /dev/null and b/Doxygen/0.94/BlisPseudo_8h__dep__incl.png differ diff --git a/Doxygen/0.94/BlisPseudo_8h__incl.map b/Doxygen/0.94/BlisPseudo_8h__incl.map new file mode 100644 index 0000000..2c9f8a3 --- /dev/null +++ b/Doxygen/0.94/BlisPseudo_8h__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/BlisPseudo_8h__incl.md5 b/Doxygen/0.94/BlisPseudo_8h__incl.md5 new file mode 100644 index 0000000..d55c0e1 --- /dev/null +++ b/Doxygen/0.94/BlisPseudo_8h__incl.md5 @@ -0,0 +1 @@ +13a179eb4f214eacbd973398e6f5d610 \ No newline at end of file diff --git a/Doxygen/0.94/BlisPseudo_8h__incl.png b/Doxygen/0.94/BlisPseudo_8h__incl.png new file mode 100644 index 0000000..e8395ad Binary files /dev/null and b/Doxygen/0.94/BlisPseudo_8h__incl.png differ diff --git a/Doxygen/0.94/BlisPseudo_8h_source.html b/Doxygen/0.94/BlisPseudo_8h_source.html new file mode 100644 index 0000000..68ca217 --- /dev/null +++ b/Doxygen/0.94/BlisPseudo_8h_source.html @@ -0,0 +1,238 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisPseudo.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisPseudo.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 #ifndef BlisPseudo_h_
+
25 #define BlisPseudo_h_
+
26 
+
27 #include "CoinError.hpp"
+
28 #include "AlpsKnowledge.h"
+
29 
+
30 //#############################################################################
+
31 
+
32 class BlisPseudocost : public AlpsKnowledge
+
33 {
+
34 private:
+
36  double weight_;
+
37 
+
39  double upCost_;
+
40 
+
42  int upCount_;
+
43 
+
45  double downCost_;
+
46 
+
48  int downCount_;
+
49 
+
54  double score_;
+
55 
+
56 public:
+
58  BlisPseudocost() :
+
59  weight_(1.0),
+
60  upCost_(0.0),
+
61  upCount_(0),
+
62  downCost_(0.0),
+
63  downCount_(0),
+
64  score_(0.0)
+
65  {}
+
66 
+
68  BlisPseudocost(double uc,
+
69  int un,
+
70  double dc,
+
71  int dn,
+
72  double s)
+
73  :
+
74  weight_(1.0),
+
75  upCost_(uc),
+
76  upCount_(un),
+
77  downCost_(dc),
+
78  downCount_(dn),
+
79  score_(s)
+
80  {}
+
81 
+
83  BlisPseudocost(const BlisPseudocost& cost) {
+
84  weight_ = cost.weight_;
+
85  upCost_ = cost.upCost_;
+
86  upCount_ = cost.upCount_;
+
87  downCost_ = cost.downCost_;
+
88  downCount_ = cost.downCount_;
+
89  score_ = cost.score_;
+
90  }
+
91 
+
93  BlisPseudocost& operator=(const BlisPseudocost& cost) {
+
94  weight_ = cost.weight_;
+
95  upCost_ = cost.upCost_;
+
96  upCount_ = cost.upCount_;
+
97  downCost_ = cost.downCost_;
+
98  downCount_ = cost.downCount_;
+
99  score_ = cost.score_;
+
100  return *this;
+
101  }
+
102 
+
104  void setWeight(double w) {
+
105  if (w < 0.0 || w > 1.0) {
+
106  throw CoinError("weight is not in range [0,1]", "setWeight",
+
107  "BlisPseudo");
+
108  }
+
109  weight_= w;
+
110  }
+
111 
+
113  void update(const int dir,
+
114  const double parentObjValue,
+
115  const double objValue,
+
116  const double solValue);
+
117 
+
119  void update(const int dir,
+
120  const double objDiff,
+
121  const double solValue);
+
122 
+
124  void update(double upCost,
+
125  int upCount,
+
126  double downCost,
+
127  int downCount);
+
128 
+
130  int getUpCount() { return upCount_; }
+
131 
+
133  double getUpCost() { return upCost_; }
+
134 
+
136  int getDownCount() { return downCount_; }
+
137 
+
139  double getDownCost() { return downCost_; }
+
140 
+
142  double getScore() { return score_; }
+
143 
+
145  void setScore(double s) { score_ = s; }
+
146 
+
148  AlpsReturnStatus encodeTo(AlpsEncoded *encoded) const;
+
149 
+
151  AlpsReturnStatus decodeFrom(AlpsEncoded &encoded);
+
152 
+
153  using AlpsKnowledge::encode ;
+
155  virtual AlpsEncoded* encode() const;
+
156 
+
158  virtual AlpsKnowledge* decode(AlpsEncoded&) const;
+
159 };
+
160 
+
161 #endif
+
+
BlisPseudocost::setScore
void setScore(double s)
Set importance.
Definition: BlisPseudo.h:145
+
BlisPseudocost::encode
virtual AlpsEncoded * encode() const
Encode this node for message passing.
+
BlisPseudocost::getDownCost
double getDownCost()
Get down branching cost.
Definition: BlisPseudo.h:139
+
BlisPseudocost::upCost_
double upCost_
Average object change when branching up.
Definition: BlisPseudo.h:39
+
BlisPseudocost::encodeTo
AlpsReturnStatus encodeTo(AlpsEncoded *encoded) const
Pack pseudocost to the given object.
+
BlisPseudocost::decodeFrom
AlpsReturnStatus decodeFrom(AlpsEncoded &encoded)
Unpack pseudocost from the given encode object.
+
BlisPseudocost::BlisPseudocost
BlisPseudocost(const BlisPseudocost &cost)
Copy constructor.
Definition: BlisPseudo.h:83
+
BlisPseudocost::weight_
double weight_
Use to calculate score.
Definition: BlisPseudo.h:36
+
BlisPseudocost::downCount_
int downCount_
How many times being branched down.
Definition: BlisPseudo.h:48
+
BlisPseudocost::decode
virtual AlpsKnowledge * decode(AlpsEncoded &) const
Decode a node from an encoded object.
+
BlisPseudocost::update
void update(const int dir, const double parentObjValue, const double objValue, const double solValue)
Update pseudocost.
+
BlisPseudocost::downCost_
double downCost_
Average object change when branching down.
Definition: BlisPseudo.h:45
+
BlisPseudocost::setWeight
void setWeight(double w)
Set weigth.
Definition: BlisPseudo.h:104
+
BlisPseudocost::BlisPseudocost
BlisPseudocost(double uc, int un, double dc, int dn, double s)
Useful constructor.
Definition: BlisPseudo.h:68
+
BlisPseudocost::BlisPseudocost
BlisPseudocost()
Default constructor.
Definition: BlisPseudo.h:58
+
BlisPseudocost::getUpCost
double getUpCost()
Get up branching cost.
Definition: BlisPseudo.h:133
+
BlisPseudocost
Definition: BlisPseudo.h:32
+
BlisPseudocost::operator=
BlisPseudocost & operator=(const BlisPseudocost &cost)
Overload operator =.
Definition: BlisPseudo.h:93
+
BlisPseudocost::getDownCount
int getDownCount()
Get down branching count.
Definition: BlisPseudo.h:136
+
BlisPseudocost::getUpCount
int getUpCount()
Get up branching count.
Definition: BlisPseudo.h:130
+
BlisPseudocost::getScore
double getScore()
Get importance.
Definition: BlisPseudo.h:142
+
BlisPseudocost::score_
double score_
The estimated importance.
Definition: BlisPseudo.h:54
+
BlisPseudocost::upCount_
int upCount_
How many times being branched up.
Definition: BlisPseudo.h:42
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisSolution_8h.html b/Doxygen/0.94/BlisSolution_8h.html new file mode 100644 index 0000000..29ebf4d --- /dev/null +++ b/Doxygen/0.94/BlisSolution_8h.html @@ -0,0 +1,117 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisSolution.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisSolution.h File Reference
+
+
+
#include "Alps.h"
+#include "BcpsSolution.h"
+
+ + Include dependency graph for BlisSolution.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + + +

+Classes

class  BlisSolution
 This class contains the solutions generated by the LP solver (either primal or dual. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisSolution_8h__dep__incl.map b/Doxygen/0.94/BlisSolution_8h__dep__incl.map new file mode 100644 index 0000000..84ccf35 --- /dev/null +++ b/Doxygen/0.94/BlisSolution_8h__dep__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/BlisSolution_8h__dep__incl.md5 b/Doxygen/0.94/BlisSolution_8h__dep__incl.md5 new file mode 100644 index 0000000..b9b24d0 --- /dev/null +++ b/Doxygen/0.94/BlisSolution_8h__dep__incl.md5 @@ -0,0 +1 @@ +6de254faedc56eed748313742ff559de \ No newline at end of file diff --git a/Doxygen/0.94/BlisSolution_8h__dep__incl.png b/Doxygen/0.94/BlisSolution_8h__dep__incl.png new file mode 100644 index 0000000..0820d9e Binary files /dev/null and b/Doxygen/0.94/BlisSolution_8h__dep__incl.png differ diff --git a/Doxygen/0.94/BlisSolution_8h__incl.map b/Doxygen/0.94/BlisSolution_8h__incl.map new file mode 100644 index 0000000..b083707 --- /dev/null +++ b/Doxygen/0.94/BlisSolution_8h__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/BlisSolution_8h__incl.md5 b/Doxygen/0.94/BlisSolution_8h__incl.md5 new file mode 100644 index 0000000..704a6b0 --- /dev/null +++ b/Doxygen/0.94/BlisSolution_8h__incl.md5 @@ -0,0 +1 @@ +b51bb1d82db3d486ed1359e2b0d6bae7 \ No newline at end of file diff --git a/Doxygen/0.94/BlisSolution_8h__incl.png b/Doxygen/0.94/BlisSolution_8h__incl.png new file mode 100644 index 0000000..2c48e15 Binary files /dev/null and b/Doxygen/0.94/BlisSolution_8h__incl.png differ diff --git a/Doxygen/0.94/BlisSolution_8h_source.html b/Doxygen/0.94/BlisSolution_8h_source.html new file mode 100644 index 0000000..39e67a0 --- /dev/null +++ b/Doxygen/0.94/BlisSolution_8h_source.html @@ -0,0 +1,175 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisSolution.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisSolution.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * ALPS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 #ifndef BlisSolution_h_
+
25 #define BlisSolution_h_
+
26 
+
27 #include "Alps.h"
+
28 #include "BcpsSolution.h"
+
29 
+
30 //#############################################################################
+
34 //#############################################################################
+
35 
+
36 class BlisSolution : public BcpsSolution {
+
37 
+
38  protected:
+
39 
+
40  public:
+
41 
+
43  BlisSolution()
+
44  :
+
45  BcpsSolution()
+
46  {}
+
47 
+
49  BlisSolution(int s, const double *values, double objValue)
+
50  :
+
51  BcpsSolution(s, values, objValue)
+
52  {}
+
53 
+
55  virtual ~BlisSolution() { }
+
56 
+
59  virtual void print(std::ostream& os) const {
+
60  double nearInt = 0.0;
+
61  for (int j = 0; j < size_; ++j) {
+
62  if (values_[j] > 1.0e-15 || values_[j] < -1.0e-15) {
+
63  nearInt = floor(values_[j] + 0.5);
+
64  if (ALPS_FABS(nearInt - values_[j]) < 1.0e-6) {
+
65  os << "x[" << j << "] = " << nearInt << std::endl;
+
66  }
+
67  else {
+
68  os << "x[" << j << "] = " << values_[j] << std::endl;
+
69  }
+
70  }
+
71  }
+
72  }
+
73 
+
76  // BlisIpSolution* testIntegrality(const double etol = 1e-5) const;
+
77 
+
78  using AlpsKnowledge::encode ;
+
80  virtual AlpsEncoded* encode() const {
+
81  AlpsEncoded* encoded = new AlpsEncoded(AlpsKnowledgeTypeSolution);
+
82  encodeBcps(encoded);
+
83  // Nothing to do for Blis part.
+
84  return encoded;
+
85  }
+
86 
+
88  virtual AlpsKnowledge* decode(AlpsEncoded& encoded) const {
+
89  BlisSolution * sol = new BlisSolution();
+
90  sol->decodeBcps(encoded);
+
91  return sol;
+
92  }
+
93 
+
94 };
+
95 
+
96 //#############################################################################
+
97 //#############################################################################
+
98 
+
99 #endif
+
+
BlisSolution
This class contains the solutions generated by the LP solver (either primal or dual.
Definition: BlisSolution.h:36
+
BlisSolution::~BlisSolution
virtual ~BlisSolution()
Destructor.
Definition: BlisSolution.h:55
+
BlisSolution::BlisSolution
BlisSolution(int s, const double *values, double objValue)
Useful constructor.
Definition: BlisSolution.h:49
+
BlisSolution::encode
virtual AlpsEncoded * encode() const
The method that encodes the solution into a encoded object.
Definition: BlisSolution.h:80
+
BlisSolution::BlisSolution
BlisSolution()
Default constructor.
Definition: BlisSolution.h:43
+
BlisSolution::print
virtual void print(std::ostream &os) const
Print out the solution.
Definition: BlisSolution.h:59
+
BlisSolution::decode
virtual AlpsKnowledge * decode(AlpsEncoded &encoded) const
The method that decodes the solution from a encoded object.
Definition: BlisSolution.h:88
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisSubTree_8h.html b/Doxygen/0.94/BlisSubTree_8h.html new file mode 100644 index 0000000..cbfd00a --- /dev/null +++ b/Doxygen/0.94/BlisSubTree_8h.html @@ -0,0 +1,92 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisSubTree.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisSubTree.h File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + +

+Classes

class  BlisTreeNode
 This is the class in which we are finally able to concretely define the bounding procedure. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisSubTree_8h_source.html b/Doxygen/0.94/BlisSubTree_8h_source.html new file mode 100644 index 0000000..254baff --- /dev/null +++ b/Doxygen/0.94/BlisSubTree_8h_source.html @@ -0,0 +1,128 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisSubTree.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisSubTree.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 #ifndef BlisSubTree_h_
+
25 #define BlisSubTree_h_
+
26 
+
27 //#############################################################################
+
31 //#############################################################################
+
32 
+
33 class BlisTreeNode : public BcpsTreeNode {
+
34 
+
35  virtual void process();
+
36 
+
41  void branch(AlpsTreeNode& explicitNode);
+
42 
+
45  virtual bool fathom();
+
46 
+
47 };
+
48 
+
49 //#############################################################################
+
50 //#############################################################################
+
51 
+
52 #endif
+
+
BlisTreeNode::process
virtual void process()
+
BlisTreeNode::fathom
virtual bool fathom()
Takes the explicit description of the current active node and decides whether or not it should be fat...
+
BlisTreeNode
This is the class in which we are finally able to concretely define the bounding procedure.
Definition: BlisSubTree.h:33
+
BlisTreeNode::branch
virtual std::vector< CoinTriple< AlpsNodeDesc *, AlpsNodeStatus, double > > branch()
Takes the explicit description of the current active node and creates the children's descriptions,...
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisTreeNode_8h.html b/Doxygen/0.94/BlisTreeNode_8h.html new file mode 100644 index 0000000..206a93f --- /dev/null +++ b/Doxygen/0.94/BlisTreeNode_8h.html @@ -0,0 +1,146 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisTreeNode.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisTreeNode.h File Reference
+
+
+
#include "AlpsNodeDesc.h"
+#include "BcpsObjectPool.h"
+#include "BcpsTreeNode.h"
+#include "BcpsNodeDesc.h"
+#include "BlisNodeDesc.h"
+
+ + Include dependency graph for BlisTreeNode.h:
+
+
+ +
+

Go to the source code of this file.

+ + + + + +

+Classes

class  BlisTreeNode
 This is the class in which we are finally able to concretely define the bounding procedure. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisTreeNode_8h__incl.map b/Doxygen/0.94/BlisTreeNode_8h__incl.map new file mode 100644 index 0000000..90f6e69 --- /dev/null +++ b/Doxygen/0.94/BlisTreeNode_8h__incl.map @@ -0,0 +1,42 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/BlisTreeNode_8h__incl.md5 b/Doxygen/0.94/BlisTreeNode_8h__incl.md5 new file mode 100644 index 0000000..8f5dc50 --- /dev/null +++ b/Doxygen/0.94/BlisTreeNode_8h__incl.md5 @@ -0,0 +1 @@ +f243ec5e001023a8d36e73fe4870d2bc \ No newline at end of file diff --git a/Doxygen/0.94/BlisTreeNode_8h__incl.png b/Doxygen/0.94/BlisTreeNode_8h__incl.png new file mode 100644 index 0000000..71e5947 Binary files /dev/null and b/Doxygen/0.94/BlisTreeNode_8h__incl.png differ diff --git a/Doxygen/0.94/BlisTreeNode_8h_source.html b/Doxygen/0.94/BlisTreeNode_8h_source.html new file mode 100644 index 0000000..1f97381 --- /dev/null +++ b/Doxygen/0.94/BlisTreeNode_8h_source.html @@ -0,0 +1,252 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisTreeNode.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisTreeNode.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 #ifndef BlisTreeNode_h_
+
25 #define BlisTreeNode_h_
+
26 
+
27 //#############################################################################
+
28 
+
29 #include "AlpsNodeDesc.h"
+
30 
+
31 #include "BcpsObjectPool.h"
+
32 #include "BcpsTreeNode.h"
+
33 
+
34 #include "BcpsNodeDesc.h"
+
35 #include "BlisNodeDesc.h"
+
36 
+
37 class BcpsModel;
+
38 class BlisModel;
+
39 
+
40 
+
41 //#############################################################################
+
45 //#############################################################################
+
46 
+
47 
+
48 class BlisTreeNode : public BcpsTreeNode {
+
49 private:
+
50 
+
52  BlisTreeNode(const BlisTreeNode&);
+
53 
+
54  BlisTreeNode& operator=(const BlisTreeNode&);
+
55 
+
57  //BcpsConstraintPool *constraintPool_;
+
58 
+
60  //BcpsVariablePool *variablePool_;
+
61 
+
63  //void saveExplicit();
+
64 
+
66  bool parallel(BlisModel *model,
+
67  BcpsConstraintPool &conPool,
+
68  int lastNew,
+
69  BlisConstraint *aCon);
+
70 
+
72  double estimateSolution(BlisModel *model,
+
73  const double *lpSolution,
+
74  double lpObjValue) const;
+
75 
+
76 public:
+
77 
+
79  BlisTreeNode()
+
80  :
+
81  BcpsTreeNode()
+
82  { init(); }
+
83 
+
85  BlisTreeNode(BlisModel* m) {
+
86  init();
+
87  desc_ = new BlisNodeDesc(m);
+
88  }
+
89 
+
91  BlisTreeNode(AlpsNodeDesc *&desc) {
+
92  init();
+
93  desc_ = desc;
+
94  desc = NULL;
+
95  }
+
96 
+
98  virtual ~BlisTreeNode() {
+
99  //std::cout << "------ Delete blis part of node" << std::endl;
+
100  }
+
101 
+
103  void init() {
+
104  //constraintPool_ = new BcpsConstraintPool;
+
105  //variablePool_ = new BcpsVariablePool;
+
106  }
+
107 
+
109  AlpsTreeNode* createNewTreeNode(AlpsNodeDesc *&desc) const;
+
110 
+
112  virtual void convertToExplicit();
+
114  virtual void convertToRelative();
+
116 
+
118  virtual int installSubProblem(BcpsModel *mode);
+
119 
+
121  virtual int process(bool isRoot = false, bool rampUp = false);
+
122 
+
124  virtual int bound(BcpsModel *model);
+
125 
+
130  virtual std::vector< CoinTriple<AlpsNodeDesc*, AlpsNodeStatus, double> >
+
131  branch();
+
132 
+
134  int selectBranchObject(BlisModel *model,
+
135  bool& foundSol,
+
136  int numPassesLeft);
+
137 
+
139  virtual int chooseBranchingObject(BcpsModel*) { return AlpsReturnStatusOk;}
+
140 
+
141  // Why need below?
+
142  //using BcpsTreeNode::generateConstraints ;
+
143 
+
145  int generateConstraints(BlisModel *model, BcpsConstraintPool &conPool);
+
146 
+
151  int callHeuristics(BlisModel *model, bool onlyBeforeRoot=false);
+
152 
+
154  void getViolatedConstraints(BlisModel *model,
+
155  const double *currLpSolution,
+
156  BcpsConstraintPool & conPool);
+
157 
+
159  BlisReturnStatus applyConstraints(BlisModel *model,
+
160  const double *solution,
+
161  BcpsConstraintPool & conPool);
+
162 
+
164  BlisReturnStatus reducedCostFix(BlisModel *model);
+
165 
+
167  //BcpsConstraintPool * constraintPool() { return constraintPool_; }
+
168 
+
170  //BcpsVariablePool * variablePool() { return variablePool_; }
+
171 
+
172  using AlpsKnowledge::encode ;
+
174  virtual AlpsEncoded* encode() const;
+
175 
+
177  virtual AlpsKnowledge* decode(AlpsEncoded&) const;
+
178 };
+
179 
+
180 #endif
+
+
BlisTreeNode::encode
virtual AlpsEncoded * encode() const
Encode this node for message passing.
+
BlisTreeNode::convertToExplicit
virtual void convertToExplicit()
Convert explicit description to difference, and vise-vesa.
+
BlisTreeNode::BlisTreeNode
BlisTreeNode(AlpsNodeDesc *&desc)
Useful constructor.
Definition: BlisTreeNode.h:91
+
BlisTreeNode::BlisTreeNode
BlisTreeNode()
Default constructor.
Definition: BlisTreeNode.h:79
+
BlisModel
Definition: BlisModel.h:69
+
BlisNodeDesc.h
+
BlisTreeNode::selectBranchObject
int selectBranchObject(BlisModel *model, bool &foundSol, int numPassesLeft)
Select a branching object based on give branching strategy.
+
BlisTreeNode::getViolatedConstraints
void getViolatedConstraints(BlisModel *model, const double *currLpSolution, BcpsConstraintPool &conPool)
Get violated constraints.
+
BlisReturnStatus
BlisReturnStatus
Definition: Blis.h:48
+
BlisTreeNode::process
virtual void process()
+
BlisNodeDesc
Definition: BlisNodeDesc.h:40
+
BlisTreeNode::applyConstraints
BlisReturnStatus applyConstraints(BlisModel *model, const double *solution, BcpsConstraintPool &conPool)
Select and apply constraints.
+
BlisTreeNode::operator=
BlisTreeNode & operator=(const BlisTreeNode &)
+
BlisTreeNode::installSubProblem
virtual int installSubProblem(BcpsModel *mode)
intall subproblem
+
BlisTreeNode::estimateSolution
double estimateSolution(BlisModel *model, const double *lpSolution, double lpObjValue) const
Estimate quality of a feasible solution.
+
BlisTreeNode::parallel
bool parallel(BlisModel *model, BcpsConstraintPool &conPool, int lastNew, BlisConstraint *aCon)
Constraint pool.
+
BlisTreeNode
This is the class in which we are finally able to concretely define the bounding procedure.
Definition: BlisSubTree.h:33
+
BlisTreeNode::createNewTreeNode
AlpsTreeNode * createNewTreeNode(AlpsNodeDesc *&desc) const
Create a new node based on given desc.
+
BlisTreeNode::BlisTreeNode
BlisTreeNode(BlisModel *m)
Useful constructor.
Definition: BlisTreeNode.h:85
+
BlisTreeNode::~BlisTreeNode
virtual ~BlisTreeNode()
Destructor.
Definition: BlisTreeNode.h:98
+
BlisTreeNode::init
void init()
Initilize member data when constructing a node.
Definition: BlisTreeNode.h:103
+
BlisTreeNode::chooseBranchingObject
virtual int chooseBranchingObject(BcpsModel *)
To be defined.
Definition: BlisTreeNode.h:139
+
BlisTreeNode::decode
virtual AlpsKnowledge * decode(AlpsEncoded &) const
Decode a node from an encoded object.
+
BlisTreeNode::reducedCostFix
BlisReturnStatus reducedCostFix(BlisModel *model)
Fix and tighten varaibles based optimality conditions.
+
BlisTreeNode::bound
virtual int bound(BcpsModel *model)
Bounding procedure.
+
BlisTreeNode::branch
virtual std::vector< CoinTriple< AlpsNodeDesc *, AlpsNodeStatus, double > > branch()
Takes the explicit description of the current active node and creates the children's descriptions,...
+
BlisConstraint
Definition: BlisConstraint.h:33
+
BlisTreeNode::convertToRelative
virtual void convertToRelative()
+
BlisTreeNode::callHeuristics
int callHeuristics(BlisModel *model, bool onlyBeforeRoot=false)
Call heuristic to search solutions.
+
BlisTreeNode::generateConstraints
int generateConstraints(BlisModel *model, BcpsConstraintPool &conPool)
Generate constraints.
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisVariable_8h.html b/Doxygen/0.94/BlisVariable_8h.html new file mode 100644 index 0000000..b35f803 --- /dev/null +++ b/Doxygen/0.94/BlisVariable_8h.html @@ -0,0 +1,119 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisVariable.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
BlisVariable.h File Reference
+
+
+
#include "BcpsObject.h"
+
+ + Include dependency graph for BlisVariable.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + +

+Classes

class  BlisVariable
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/BlisVariable_8h__dep__incl.map b/Doxygen/0.94/BlisVariable_8h__dep__incl.map new file mode 100644 index 0000000..ae79b6c --- /dev/null +++ b/Doxygen/0.94/BlisVariable_8h__dep__incl.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/Doxygen/0.94/BlisVariable_8h__dep__incl.md5 b/Doxygen/0.94/BlisVariable_8h__dep__incl.md5 new file mode 100644 index 0000000..890bd60 --- /dev/null +++ b/Doxygen/0.94/BlisVariable_8h__dep__incl.md5 @@ -0,0 +1 @@ +f06f11e10441b80bc797c28498f67312 \ No newline at end of file diff --git a/Doxygen/0.94/BlisVariable_8h__dep__incl.png b/Doxygen/0.94/BlisVariable_8h__dep__incl.png new file mode 100644 index 0000000..f66eb68 Binary files /dev/null and b/Doxygen/0.94/BlisVariable_8h__dep__incl.png differ diff --git a/Doxygen/0.94/BlisVariable_8h__incl.map b/Doxygen/0.94/BlisVariable_8h__incl.map new file mode 100644 index 0000000..1aedfe6 --- /dev/null +++ b/Doxygen/0.94/BlisVariable_8h__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/BlisVariable_8h__incl.md5 b/Doxygen/0.94/BlisVariable_8h__incl.md5 new file mode 100644 index 0000000..9149ebf --- /dev/null +++ b/Doxygen/0.94/BlisVariable_8h__incl.md5 @@ -0,0 +1 @@ +bda6e275a13132391457009d0fd95aba \ No newline at end of file diff --git a/Doxygen/0.94/BlisVariable_8h__incl.png b/Doxygen/0.94/BlisVariable_8h__incl.png new file mode 100644 index 0000000..2854ccc Binary files /dev/null and b/Doxygen/0.94/BlisVariable_8h__incl.png differ diff --git a/Doxygen/0.94/BlisVariable_8h_source.html b/Doxygen/0.94/BlisVariable_8h_source.html new file mode 100644 index 0000000..c1fea75 --- /dev/null +++ b/Doxygen/0.94/BlisVariable_8h_source.html @@ -0,0 +1,261 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/BlisVariable.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
BlisVariable.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 #ifndef BlisVariable_h_
+
25 #define BlisVariable_h_
+
26 
+
27 #include "BcpsObject.h"
+
28 
+
29 //#############################################################################
+
30 
+
31 class BlisVariable : public BcpsVariable {
+
32 
+
33  private:
+
34 
+
35  double objCoef_;
+
36  int size_;
+
37  int *indices_;
+
38  double *values_;
+
39 
+
40  public:
+
41 
+
42  BlisVariable() : objCoef_(0.0), size_(0), indices_(NULL), values_(NULL) {}
+
43 
+
44  BlisVariable(double obj, int s, const int *ind, const double *val)
+
45  {
+
46  objCoef_ = obj;
+
47  size_ = s;
+
48  indices_ = new int [s];
+
49  values_ = new double [s];
+
50  memcpy(indices_, ind, s * sizeof(int));
+
51  memcpy(values_, val, s * sizeof(double));
+
52  }
+
53 
+
54  BlisVariable(double lbh, double ubh, double lbs, double ubs)
+
55  :
+
56  BcpsVariable(lbh, ubh, lbs, ubs),
+
57  objCoef_(0.0),
+
58  size_(0), indices_(NULL), values_(NULL)
+
59  {}
+
60 
+
61  BlisVariable(double lbh, double ubh, double lbs, double ubs,
+
62  double obj, int s, const int *ind, const double *val)
+
63  :
+
64  BcpsVariable(lbh, ubh, lbs, ubs)
+
65  {
+
66  objCoef_ = obj;
+
67  size_ = s;
+
68  indices_ = new int [s];
+
69  values_ = new double [s];
+
70  memcpy(indices_, ind, s * sizeof(int));
+
71  memcpy(values_, val, s * sizeof(double));
+
72  }
+
73 
+
74  virtual ~BlisVariable(){
+
75  delete [] indices_; indices_ = NULL;
+
76  delete [] values_; values_ = NULL;
+
77  }
+
78 
+
81  double getObjCoef() { return objCoef_; }
+
82  int getSize() const { return size_; }
+
83  int* getIndices() const { return indices_; }
+
84  double* getValues() { return values_; }
+
89  void setData(int s, const int *ind, const double *val) {
+
90  if (size_ < s) {
+
91  delete [] indices_; indices_ = NULL;
+
92  delete [] values_; values_ = NULL;
+
93  indices_ = new int [s];
+
94  values_ = new double [s];
+
95  }
+
96  size_ = s;
+
97  memcpy(indices_, ind, sizeof(int) * s);
+
98  memcpy(values_, val, sizeof(double) * s);
+
99  }
+
100  void setObjCoef(double coef) { objCoef_ = coef; }
+
103  protected:
+
104 
+
106  AlpsReturnStatus encodeBlis(AlpsEncoded *encoded) {
+
107  AlpsReturnStatus status = AlpsReturnStatusOk;
+
108 
+
109  //std::cout << "****** encodeBlis var: size_ = " << size_ << std::endl;
+
110 
+
111  encoded->writeRep(objCoef_);
+
112  encoded->writeRep(indices_, size_);
+
113  encoded->writeRep(values_, size_);
+
114 
+
115  return status;
+
116  }
+
117 
+
119  AlpsReturnStatus decodeBlis(AlpsEncoded &encoded) {
+
120  AlpsReturnStatus status = AlpsReturnStatusOk;
+
121 
+
122  encoded.readRep(objCoef_);
+
123  encoded.readRep(indices_, size_);
+
124  encoded.readRep(values_, size_);
+
125 
+
126  //std::cout << "****** decodeBlis var: size_ = " << size_ << std::endl;
+
127 
+
128  return status;
+
129  }
+
130 
+
131  public:
+
132 
+
133  using AlpsKnowledge::encode ;
+
135  virtual AlpsReturnStatus encode(AlpsEncoded *encoded){
+
136  AlpsReturnStatus status;
+
137 
+
138  status = encodeBcpsObject(encoded);
+
139  status = encodeBlis(encoded);
+
140 
+
141  return status;
+
142  }
+
143 
+
145  virtual AlpsKnowledge* decode(AlpsEncoded &encoded) const {
+
146  AlpsReturnStatus status = AlpsReturnStatusOk;
+
147  BlisVariable * var = new BlisVariable();
+
148 
+
149  // Unpack Bcps part.
+
150  status = var->decodeBcpsObject(encoded);
+
151  if (status) {
+
152  throw CoinError("Failed to decode Bcps part of var",
+
153  "decode",
+
154  "BlisObject");
+
155  }
+
156 
+
157  // Unpack Blis part.
+
158  status = var->decodeBlis(encoded);
+
159  if (status) {
+
160  throw CoinError("Failed to decode Blis part of var",
+
161  "decode",
+
162  "BlisObject");
+
163  }
+
164  return var;
+
165  }
+
166 
+
167 };
+
168 
+
169 //#############################################################################
+
170 
+
171 #endif /* End of file */
+
172 
+
+
BlisVariable
Definition: BlisVariable.h:31
+
BlisVariable::decodeBlis
AlpsReturnStatus decodeBlis(AlpsEncoded &encoded)
Unpack Blis part from a encode object.
Definition: BlisVariable.h:119
+
BlisVariable::objCoef_
double objCoef_
Definition: BlisVariable.h:35
+
BlisVariable::encode
virtual AlpsReturnStatus encode(AlpsEncoded *encoded)
Pack to a encode object.
Definition: BlisVariable.h:135
+
BlisVariable::encodeBlis
AlpsReturnStatus encodeBlis(AlpsEncoded *encoded)
Pack Blis part into an encoded object.
Definition: BlisVariable.h:106
+
BlisVariable::indices_
int * indices_
Definition: BlisVariable.h:37
+
BlisVariable::~BlisVariable
virtual ~BlisVariable()
Definition: BlisVariable.h:74
+
BlisVariable::getObjCoef
double getObjCoef()
Return data
Definition: BlisVariable.h:81
+
BlisVariable::getIndices
int * getIndices() const
Definition: BlisVariable.h:83
+
BlisVariable::BlisVariable
BlisVariable(double lbh, double ubh, double lbs, double ubs, double obj, int s, const int *ind, const double *val)
Definition: BlisVariable.h:61
+
BlisVariable::BlisVariable
BlisVariable(double obj, int s, const int *ind, const double *val)
Definition: BlisVariable.h:44
+
BlisVariable::size_
int size_
Definition: BlisVariable.h:36
+
BlisVariable::getSize
int getSize() const
Definition: BlisVariable.h:82
+
BlisVariable::setData
void setData(int s, const int *ind, const double *val)
Set data
Definition: BlisVariable.h:89
+
BlisVariable::BlisVariable
BlisVariable()
Definition: BlisVariable.h:42
+
BlisVariable::getValues
double * getValues()
Definition: BlisVariable.h:84
+
BlisVariable::decode
virtual AlpsKnowledge * decode(AlpsEncoded &encoded) const
Decode a variable from an encoded object.
Definition: BlisVariable.h:145
+
BlisVariable::values_
double * values_
Definition: BlisVariable.h:38
+
BlisVariable::setObjCoef
void setObjCoef(double coef)
Definition: BlisVariable.h:100
+
BlisVariable::BlisVariable
BlisVariable(double lbh, double ubh, double lbs, double ubs)
Definition: BlisVariable.h:54
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/Blis_8h.html b/Doxygen/0.94/Blis_8h.html new file mode 100644 index 0000000..6d26bd2 --- /dev/null +++ b/Doxygen/0.94/Blis_8h.html @@ -0,0 +1,461 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/Blis.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Macros | +Enumerations
+
+
Blis.h File Reference
+
+
+
#include "AlpsConfig.h"
+#include "BcpsConfig.h"
+#include "BlisConfig.h"
+
+ + Include dependency graph for Blis.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + + + + + +

+Macros

#define BLIS_CUT_DISABLE   20
 
#define BLIS_HEUR_ROUND_DISABLE   1000000
 
#define BLIS_PSEUDO   21
 
+ + + + + + + + + + + + + + + + + + +

+Enumerations

enum  BlisLpStatus {
+  BlisLpStatusOptimal, +BlisLpStatusAbandoned, +BlisLpStatusPrimalInfeasible, +BlisLpStatusDualInfeasible, +
+  BlisLpStatusPrimalObjLim, +BlisLpStatusDualObjLim, +BlisLpStatusIterLim, +BlisLpStatusUnknown +
+ }
 
enum  BlisReturnStatus {
+  BlisReturnStatusOk = 0, +BlisReturnStatusErrLp, +BlisReturnStatusInfeasible, +BlisReturnStatusUnbounded, +
+  BlisReturnStatusOverObjLim, +BlisReturnStatusFeasible, +BlisReturnStatusBranch, +BlisReturnStatusUnknown +
+ }
 
enum  BlisCutStrategy {
+  BlisCutStrategyNotSet = -1, +BlisCutStrategyNone = 0, +BlisCutStrategyRoot, +BlisCutStrategyAuto, +
+  BlisCutStrategyPeriodic +
+ }
 
enum  BlisHeurStrategy {
+  BlisHeurStrategyNotSet = -1, +BlisHeurStrategyNone = 0, +BlisHeurStrategyRoot, +BlisHeurStrategyAuto, +
+  BlisHeurStrategyPeriodic, +BlisHeurStrategyBeforeRoot +
+ }
 
enum  BlisHotStartStrategy { BlisHotStartBranchIncorrect, +BlisHotStartBranchCorrect + }
 
enum  BlisBranchingStrategy {
+  BlisBranchingStrategyMaxInfeasibility, +BlisBranchingStrategyPseudoCost, +BlisBranchingStrategyReliability, +BlisBranchingStrategyStrong, +
+  BlisBranchingStrategyBilevel +
+ }
 
enum  BlisSolutionType {
+  BlisSolutionTypeBounding, +BlisSolutionTypeBranching, +BlisSolutionTypeDiving, +BlisSolutionTypeHeuristic, +
+  BlisSolutionTypeStrong +
+ }
 
enum  BlisBranchingObjectType { BlisBranchingObjectTypeNone = 0, +BlisBranchingObjectTypeInt, +BlisBranchingObjectTypeSos, +BlisBranchingObjectTypeBilevel + }
 Branching object type. More...
 
+

Macro Definition Documentation

+ +

◆ BLIS_CUT_DISABLE

+ +
+
+ + + + +
#define BLIS_CUT_DISABLE   20
+
+ +

Definition at line 132 of file Blis.h.

+ +
+
+ +

◆ BLIS_HEUR_ROUND_DISABLE

+ +
+
+ + + + +
#define BLIS_HEUR_ROUND_DISABLE   1000000
+
+ +

Definition at line 134 of file Blis.h.

+ +
+
+ +

◆ BLIS_PSEUDO

+ +
+
+ + + + +
#define BLIS_PSEUDO   21
+
+ +

Definition at line 136 of file Blis.h.

+ +
+
+

Enumeration Type Documentation

+ +

◆ BlisLpStatus

+ +
+
+ + + + +
enum BlisLpStatus
+
+ + + + + + + + + +
Enumerator
BlisLpStatusOptimal 
BlisLpStatusAbandoned 
BlisLpStatusPrimalInfeasible 
BlisLpStatusDualInfeasible 
BlisLpStatusPrimalObjLim 
BlisLpStatusDualObjLim 
BlisLpStatusIterLim 
BlisLpStatusUnknown 
+ +

Definition at line 35 of file Blis.h.

+ +
+
+ +

◆ BlisReturnStatus

+ +
+
+ + + + +
enum BlisReturnStatus
+
+ + + + + + + + + +
Enumerator
BlisReturnStatusOk 
BlisReturnStatusErrLp 
BlisReturnStatusInfeasible 
BlisReturnStatusUnbounded 
BlisReturnStatusOverObjLim 
BlisReturnStatusFeasible 
BlisReturnStatusBranch 
BlisReturnStatusUnknown 
+ +

Definition at line 48 of file Blis.h.

+ +
+
+ +

◆ BlisCutStrategy

+ +
+
+ + + + +
enum BlisCutStrategy
+
+ + + + + + +
Enumerator
BlisCutStrategyNotSet 
BlisCutStrategyNone 
BlisCutStrategyRoot 
BlisCutStrategyAuto 
BlisCutStrategyPeriodic 
+ +

Definition at line 69 of file Blis.h.

+ +
+
+ +

◆ BlisHeurStrategy

+ +
+
+ + + + +
enum BlisHeurStrategy
+
+ + + + + + + +
Enumerator
BlisHeurStrategyNotSet 
BlisHeurStrategyNone 
BlisHeurStrategyRoot 
BlisHeurStrategyAuto 
BlisHeurStrategyPeriodic 
BlisHeurStrategyBeforeRoot 
+ +

Definition at line 77 of file Blis.h.

+ +
+
+ +

◆ BlisHotStartStrategy

+ +
+
+ + + + +
enum BlisHotStartStrategy
+
+ + + +
Enumerator
BlisHotStartBranchIncorrect 
BlisHotStartBranchCorrect 
+ +

Definition at line 95 of file Blis.h.

+ +
+
+ +

◆ BlisBranchingStrategy

+ +
+
+ + + + +
enum BlisBranchingStrategy
+
+ + + + + + +
Enumerator
BlisBranchingStrategyMaxInfeasibility 
BlisBranchingStrategyPseudoCost 
BlisBranchingStrategyReliability 
BlisBranchingStrategyStrong 
BlisBranchingStrategyBilevel 
+ +

Definition at line 102 of file Blis.h.

+ +
+
+ +

◆ BlisSolutionType

+ +
+
+ + + + +
enum BlisSolutionType
+
+ + + + + + +
Enumerator
BlisSolutionTypeBounding 
BlisSolutionTypeBranching 
BlisSolutionTypeDiving 
BlisSolutionTypeHeuristic 
BlisSolutionTypeStrong 
+ +

Definition at line 112 of file Blis.h.

+ +
+
+ +

◆ BlisBranchingObjectType

+ +
+
+ + + + +
enum BlisBranchingObjectType
+
+ +

Branching object type.

+ + + + + +
Enumerator
BlisBranchingObjectTypeNone 
BlisBranchingObjectTypeInt 
BlisBranchingObjectTypeSos 
BlisBranchingObjectTypeBilevel 
+ +

Definition at line 123 of file Blis.h.

+ +
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/Blis_8h__dep__incl.map b/Doxygen/0.94/Blis_8h__dep__incl.map new file mode 100644 index 0000000..e25fa06 --- /dev/null +++ b/Doxygen/0.94/Blis_8h__dep__incl.map @@ -0,0 +1,21 @@ + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/Blis_8h__dep__incl.md5 b/Doxygen/0.94/Blis_8h__dep__incl.md5 new file mode 100644 index 0000000..96f665a --- /dev/null +++ b/Doxygen/0.94/Blis_8h__dep__incl.md5 @@ -0,0 +1 @@ +331c5a264e123451ace4aea244180e81 \ No newline at end of file diff --git a/Doxygen/0.94/Blis_8h__dep__incl.png b/Doxygen/0.94/Blis_8h__dep__incl.png new file mode 100644 index 0000000..e8465d2 Binary files /dev/null and b/Doxygen/0.94/Blis_8h__dep__incl.png differ diff --git a/Doxygen/0.94/Blis_8h__incl.map b/Doxygen/0.94/Blis_8h__incl.map new file mode 100644 index 0000000..5f9773f --- /dev/null +++ b/Doxygen/0.94/Blis_8h__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/Doxygen/0.94/Blis_8h__incl.md5 b/Doxygen/0.94/Blis_8h__incl.md5 new file mode 100644 index 0000000..df781f1 --- /dev/null +++ b/Doxygen/0.94/Blis_8h__incl.md5 @@ -0,0 +1 @@ +e4f25958de04e91b7fc0a1aaba8202f2 \ No newline at end of file diff --git a/Doxygen/0.94/Blis_8h__incl.png b/Doxygen/0.94/Blis_8h__incl.png new file mode 100644 index 0000000..8d3e60f Binary files /dev/null and b/Doxygen/0.94/Blis_8h__incl.png differ diff --git a/Doxygen/0.94/Blis_8h_source.html b/Doxygen/0.94/Blis_8h_source.html new file mode 100644 index 0000000..e9c7e53 --- /dev/null +++ b/Doxygen/0.94/Blis_8h_source.html @@ -0,0 +1,272 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/Blis.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Blis.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 //#############################################################################
+
25 
+
26 #ifndef Blis_h_
+
27 #define Blis_h_
+
28 
+
29 #include "AlpsConfig.h"
+
30 #include "BcpsConfig.h"
+
31 #include "BlisConfig.h"
+
32 
+
33 //#############################################################################
+
34 
+
35 enum BlisLpStatus{
+
36  BlisLpStatusOptimal,
+
37  BlisLpStatusAbandoned,
+
38  BlisLpStatusPrimalInfeasible,
+
39  BlisLpStatusDualInfeasible,
+
40  BlisLpStatusPrimalObjLim,
+
41  BlisLpStatusDualObjLim,
+
42  BlisLpStatusIterLim,
+
43  BlisLpStatusUnknown
+
44 };
+
45 
+
46 //#############################################################################
+
47 
+
48 enum BlisReturnStatus {
+
49  BlisReturnStatusOk = 0,
+
50  BlisReturnStatusErrLp,
+
51  BlisReturnStatusInfeasible,
+
52  BlisReturnStatusUnbounded,
+
53  BlisReturnStatusOverObjLim,
+
54  BlisReturnStatusFeasible,
+
55  BlisReturnStatusBranch,
+
56  BlisReturnStatusUnknown
+
57 };
+
58 
+
59 #if 0
+
60 #define BLIS_ERR_LP 100
+
61 #define BLIS_INF 200
+
62 #define BLIS_UNBOUND 201
+
63 #define BLIS_OPTIMAL 0
+
64 #define BLIS_UNKNOWN 202
+
65 #endif
+
66 
+
67 //#############################################################################
+
68 
+
69 enum BlisCutStrategy{
+
70  BlisCutStrategyNotSet = -1,
+
71  BlisCutStrategyNone = 0,
+
72  BlisCutStrategyRoot,
+
73  BlisCutStrategyAuto,
+
74  BlisCutStrategyPeriodic
+
75 };
+
76 
+
77 enum BlisHeurStrategy{
+
78  BlisHeurStrategyNotSet = -1,
+
79  BlisHeurStrategyNone = 0,
+
80  BlisHeurStrategyRoot,
+
81  BlisHeurStrategyAuto,
+
82  BlisHeurStrategyPeriodic,
+
83  BlisHeurStrategyBeforeRoot // Before solving first relaxation
+
84 };
+
85 
+
86 #if 0
+
87 #define BLIS_NOT_SET -555
+
88 #define BLIS_ROOT -2
+
89 #define BLIS_AUTO -1
+
90 #define BLIS_NONE 0
+
91 #endif
+
92 
+
93 //#############################################################################
+
94 
+
95 enum BlisHotStartStrategy{
+
96  BlisHotStartBranchIncorrect,
+
97  BlisHotStartBranchCorrect
+
98 };
+
99 
+
100 //#############################################################################
+
101 
+
102 enum BlisBranchingStrategy{
+
103  BlisBranchingStrategyMaxInfeasibility,
+
104  BlisBranchingStrategyPseudoCost,
+
105  BlisBranchingStrategyReliability,
+
106  BlisBranchingStrategyStrong,
+
107  BlisBranchingStrategyBilevel
+
108 };
+
109 
+
110 //#############################################################################
+
111 
+
112 enum BlisSolutionType {
+
113  BlisSolutionTypeBounding,
+
114  BlisSolutionTypeBranching,
+
115  BlisSolutionTypeDiving,
+
116  BlisSolutionTypeHeuristic,
+
117  BlisSolutionTypeStrong
+
118 };
+
119 
+
120 //#############################################################################
+
121 
+
123 enum BlisBranchingObjectType {
+
124  BlisBranchingObjectTypeNone = 0,
+
125  BlisBranchingObjectTypeInt,
+
126  BlisBranchingObjectTypeSos,
+
127  BlisBranchingObjectTypeBilevel
+
128 };
+
129 
+
130 //#############################################################################
+
131 
+
132 #define BLIS_CUT_DISABLE 20
+
133 
+
134 #define BLIS_HEUR_ROUND_DISABLE 1000000
+
135 
+
136 #define BLIS_PSEUDO 21
+
137 
+
138 //#############################################################################
+
139 
+
140 #endif
+
+
BlisLpStatusDualInfeasible
@ BlisLpStatusDualInfeasible
Definition: Blis.h:39
+
BlisLpStatusIterLim
@ BlisLpStatusIterLim
Definition: Blis.h:42
+
BlisHeurStrategyNone
@ BlisHeurStrategyNone
Definition: Blis.h:79
+
BlisCutStrategyPeriodic
@ BlisCutStrategyPeriodic
Definition: Blis.h:74
+
BlisSolutionTypeBounding
@ BlisSolutionTypeBounding
Definition: Blis.h:113
+
BlisLpStatusPrimalObjLim
@ BlisLpStatusPrimalObjLim
Definition: Blis.h:40
+
BlisBranchingStrategyPseudoCost
@ BlisBranchingStrategyPseudoCost
Definition: Blis.h:104
+
BlisReturnStatusUnknown
@ BlisReturnStatusUnknown
Definition: Blis.h:56
+
BlisBranchingObjectType
BlisBranchingObjectType
Branching object type.
Definition: Blis.h:123
+
BlisHotStartStrategy
BlisHotStartStrategy
Definition: Blis.h:95
+
BlisBranchingStrategy
BlisBranchingStrategy
Definition: Blis.h:102
+
BlisBranchingStrategyMaxInfeasibility
@ BlisBranchingStrategyMaxInfeasibility
Definition: Blis.h:103
+
BlisBranchingStrategyReliability
@ BlisBranchingStrategyReliability
Definition: Blis.h:105
+
BlisHotStartBranchIncorrect
@ BlisHotStartBranchIncorrect
Definition: Blis.h:96
+
BlisReturnStatus
BlisReturnStatus
Definition: Blis.h:48
+
BlisReturnStatusInfeasible
@ BlisReturnStatusInfeasible
Definition: Blis.h:51
+
BlisCutStrategyRoot
@ BlisCutStrategyRoot
Definition: Blis.h:72
+
BlisLpStatusDualObjLim
@ BlisLpStatusDualObjLim
Definition: Blis.h:41
+
BlisSolutionType
BlisSolutionType
Definition: Blis.h:112
+
BlisReturnStatusFeasible
@ BlisReturnStatusFeasible
Definition: Blis.h:54
+
BlisHeurStrategyNotSet
@ BlisHeurStrategyNotSet
Definition: Blis.h:78
+
BlisHeurStrategyAuto
@ BlisHeurStrategyAuto
Definition: Blis.h:81
+
BlisBranchingStrategyBilevel
@ BlisBranchingStrategyBilevel
Definition: Blis.h:107
+
BlisCutStrategyNone
@ BlisCutStrategyNone
Definition: Blis.h:71
+
BlisReturnStatusBranch
@ BlisReturnStatusBranch
Definition: Blis.h:55
+
BlisCutStrategy
BlisCutStrategy
Definition: Blis.h:69
+
BlisReturnStatusOverObjLim
@ BlisReturnStatusOverObjLim
Definition: Blis.h:53
+
BlisHeurStrategyPeriodic
@ BlisHeurStrategyPeriodic
Definition: Blis.h:82
+
BlisLpStatus
BlisLpStatus
Definition: Blis.h:35
+
BlisHeurStrategy
BlisHeurStrategy
Definition: Blis.h:77
+
BlisSolutionTypeHeuristic
@ BlisSolutionTypeHeuristic
Definition: Blis.h:116
+
BlisReturnStatusUnbounded
@ BlisReturnStatusUnbounded
Definition: Blis.h:52
+
BlisBranchingObjectTypeNone
@ BlisBranchingObjectTypeNone
Definition: Blis.h:124
+
BlisSolutionTypeStrong
@ BlisSolutionTypeStrong
Definition: Blis.h:117
+
BlisCutStrategyNotSet
@ BlisCutStrategyNotSet
Definition: Blis.h:70
+
BlisLpStatusUnknown
@ BlisLpStatusUnknown
Definition: Blis.h:43
+
BlisSolutionTypeBranching
@ BlisSolutionTypeBranching
Definition: Blis.h:114
+
BlisBranchingObjectTypeInt
@ BlisBranchingObjectTypeInt
Definition: Blis.h:125
+
BlisCutStrategyAuto
@ BlisCutStrategyAuto
Definition: Blis.h:73
+
BlisLpStatusPrimalInfeasible
@ BlisLpStatusPrimalInfeasible
Definition: Blis.h:38
+
BlisHeurStrategyRoot
@ BlisHeurStrategyRoot
Definition: Blis.h:80
+
BlisHotStartBranchCorrect
@ BlisHotStartBranchCorrect
Definition: Blis.h:97
+
BlisLpStatusOptimal
@ BlisLpStatusOptimal
Definition: Blis.h:36
+
BlisBranchingStrategyStrong
@ BlisBranchingStrategyStrong
Definition: Blis.h:106
+
BlisReturnStatusOk
@ BlisReturnStatusOk
Definition: Blis.h:49
+
BlisBranchingObjectTypeSos
@ BlisBranchingObjectTypeSos
Definition: Blis.h:126
+
BlisHeurStrategyBeforeRoot
@ BlisHeurStrategyBeforeRoot
Definition: Blis.h:83
+
BlisConfig.h
+
BlisReturnStatusErrLp
@ BlisReturnStatusErrLp
Definition: Blis.h:50
+
BlisSolutionTypeDiving
@ BlisSolutionTypeDiving
Definition: Blis.h:115
+
BlisLpStatusAbandoned
@ BlisLpStatusAbandoned
Definition: Blis.h:37
+
BlisBranchingObjectTypeBilevel
@ BlisBranchingObjectTypeBilevel
Definition: Blis.h:127
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpCommonTypes_8h.html b/Doxygen/0.94/VrpCommonTypes_8h.html new file mode 100644 index 0000000..a879157 --- /dev/null +++ b/Doxygen/0.94/VrpCommonTypes_8h.html @@ -0,0 +1,198 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpCommonTypes.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes | +Typedefs
+
+
VrpCommonTypes.h File Reference
+
+
+
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + + + + + + + + + +

+Classes

struct  _NODE
 
struct  ROUTE_DATA
 
struct  BEST_TOURS
 
struct  EDGE_DATA
 
struct  SMALL_GRAPH
 
+ + + + + + + + + + + +

+Typedefs

typedef struct _NODE _node
 
typedef struct ROUTE_DATA route_data
 
typedef struct BEST_TOURS best_tours
 
typedef struct EDGE_DATA edge_data
 
typedef struct SMALL_GRAPH small_graph
 
+

Typedef Documentation

+ +

◆ _node

+ +
+
+ + + + +
typedef struct _NODE _node
+
+ +
+
+ +

◆ route_data

+ +
+
+ + + + +
typedef struct ROUTE_DATA route_data
+
+ +
+
+ +

◆ best_tours

+ +
+
+ + + + +
typedef struct BEST_TOURS best_tours
+
+ +
+
+ +

◆ edge_data

+ +
+
+ + + + +
typedef struct EDGE_DATA edge_data
+
+ +
+
+ +

◆ small_graph

+ +
+
+ + + + +
typedef struct SMALL_GRAPH small_graph
+
+ +
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpCommonTypes_8h__dep__incl.map b/Doxygen/0.94/VrpCommonTypes_8h__dep__incl.map new file mode 100644 index 0000000..750cdcc --- /dev/null +++ b/Doxygen/0.94/VrpCommonTypes_8h__dep__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/Doxygen/0.94/VrpCommonTypes_8h__dep__incl.md5 b/Doxygen/0.94/VrpCommonTypes_8h__dep__incl.md5 new file mode 100644 index 0000000..9a60acd --- /dev/null +++ b/Doxygen/0.94/VrpCommonTypes_8h__dep__incl.md5 @@ -0,0 +1 @@ +883fbeb9a2d816862721c7a8d436c816 \ No newline at end of file diff --git a/Doxygen/0.94/VrpCommonTypes_8h__dep__incl.png b/Doxygen/0.94/VrpCommonTypes_8h__dep__incl.png new file mode 100644 index 0000000..20f9d40 Binary files /dev/null and b/Doxygen/0.94/VrpCommonTypes_8h__dep__incl.png differ diff --git a/Doxygen/0.94/VrpCommonTypes_8h_source.html b/Doxygen/0.94/VrpCommonTypes_8h_source.html new file mode 100644 index 0000000..4a3f5f0 --- /dev/null +++ b/Doxygen/0.94/VrpCommonTypes_8h_source.html @@ -0,0 +1,168 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpCommonTypes.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
VrpCommonTypes.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of a solver for the Vehicle Routing Problem *
+
3  * developed using the BiCePS Linear Integer Solver (BLIS). *
+
4  * *
+
5  * This solver is distributed under the Eclipse Public License as part of *
+
6  * the COIN-OR repository (http://www.coin-or.org). *
+
7  * *
+
8  * Authors: Yan Xu, Lehigh University *
+
9  * Ted Ralphs, Lehigh University *
+
10  * *
+
11  * Copyright (C) 2007 Yan Xu and Ted Ralphs. *
+
12  * All Rights Reserved. *
+
13  *===========================================================================*/
+
14 
+
15 #ifndef VrpCommonTypes_h_
+
16 #define VrpCommonTypes_h_
+
17 
+
18 //#############################################################################
+
19 
+
20 typedef struct _NODE{
+
21  int next;
+
22  int route;
+
23 }_node;
+
24 
+
25 typedef struct ROUTE_DATA{
+
26  int first;
+
27  int last;
+
28  int numcust;
+
29  int weight;
+
30  int cost;
+
31 }route_data;
+
32 
+
33 typedef struct BEST_TOURS{
+
34  int algorithm;
+
35  double solve_time;
+
36  int cost;
+
37  int numroutes;
+
38  route_data *route_info;
+
39  _node *tour;
+
40 }best_tours;
+
41 
+
42 typedef struct EDGE_DATA{
+
43  int v0;
+
44  int v1;
+
45  int cost;
+
46 }edge_data;
+
47 
+
48 typedef struct SMALL_GRAPH{ /* this gets passed eg. to lin-kerninghan */
+
49  int vertnum; /* vertnum in the restricted (small) graph */
+
50  int edgenum; /* edgenum in the restricted (small) graph */
+
51  int allocated_edgenum;
+
52  int del_edgenum;
+
53  edge_data *edges; /* The data for these edges */
+
54 }small_graph;
+
55 
+
56 #endif
+
+
ROUTE_DATA
Definition: VrpCommonTypes.h:25
+
SMALL_GRAPH
Definition: VrpCommonTypes.h:48
+
ROUTE_DATA::numcust
int numcust
Definition: VrpCommonTypes.h:28
+
SMALL_GRAPH::vertnum
int vertnum
Definition: VrpCommonTypes.h:49
+
SMALL_GRAPH::edgenum
int edgenum
Definition: VrpCommonTypes.h:50
+
EDGE_DATA::v1
int v1
Definition: VrpCommonTypes.h:44
+
ROUTE_DATA::weight
int weight
Definition: VrpCommonTypes.h:29
+
ROUTE_DATA::last
int last
Definition: VrpCommonTypes.h:27
+
EDGE_DATA::v0
int v0
Definition: VrpCommonTypes.h:43
+
small_graph
struct SMALL_GRAPH small_graph
+
SMALL_GRAPH::del_edgenum
int del_edgenum
Definition: VrpCommonTypes.h:52
+
ROUTE_DATA::first
int first
Definition: VrpCommonTypes.h:26
+
_NODE
Definition: VrpCommonTypes.h:20
+
EDGE_DATA::cost
int cost
Definition: VrpCommonTypes.h:45
+
_NODE::next
int next
Definition: VrpCommonTypes.h:21
+
ROUTE_DATA::cost
int cost
Definition: VrpCommonTypes.h:30
+
BEST_TOURS::cost
int cost
Definition: VrpCommonTypes.h:36
+
route_data
struct ROUTE_DATA route_data
+
BEST_TOURS::numroutes
int numroutes
Definition: VrpCommonTypes.h:37
+
edge_data
struct EDGE_DATA edge_data
+
BEST_TOURS::solve_time
double solve_time
Definition: VrpCommonTypes.h:35
+
SMALL_GRAPH::allocated_edgenum
int allocated_edgenum
Definition: VrpCommonTypes.h:51
+
BEST_TOURS::algorithm
int algorithm
Definition: VrpCommonTypes.h:34
+
BEST_TOURS::route_info
route_data * route_info
Definition: VrpCommonTypes.h:38
+
SMALL_GRAPH::edges
edge_data * edges
Definition: VrpCommonTypes.h:53
+
best_tours
struct BEST_TOURS best_tours
+
_node
struct _NODE _node
+
_NODE::route
int route
Definition: VrpCommonTypes.h:22
+
BEST_TOURS
Definition: VrpCommonTypes.h:33
+
BEST_TOURS::tour
_node * tour
Definition: VrpCommonTypes.h:39
+
EDGE_DATA
Definition: VrpCommonTypes.h:42
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpConstants_8h.html b/Doxygen/0.94/VrpConstants_8h.html new file mode 100644 index 0000000..a477a87 --- /dev/null +++ b/Doxygen/0.94/VrpConstants_8h.html @@ -0,0 +1,2013 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpConstants.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Macros
+
+
VrpConstants.h File Reference
+
+
+
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Macros

#define LENGTH   255
 
#define KEY_NUM   43
 
#define DEAD   2
 
#define NEAR_INS   -1
 
#define FAR_INS   -2
 
#define DEPOT_PENALTY   20
 
#define RRR   6378.388
 
#define MY_PI   3.141592
 
#define LINE_LEN   80
 
#define _EXPLICIT   0
 
#define _EUC_2D   1
 
#define _EUC_3D   2
 
#define _MAX_2D   3
 
#define _MAX_3D   4
 
#define _MAN_2D   5
 
#define _MAN_3D   6
 
#define _CEIL_2D   7
 
#define _GEO   8
 
#define _ATT   9
 
#define VRP_LB_DATA   1
 
#define VRP_LB_DATA2   2
 
#define VRP_BROADCAST_DATA   3
 
#define EXCHANGE_HEUR_TOUR   4
 
#define ROUTE_FINS_START_RULE   5
 
#define ROUTE_NINS_START_RULE   6
 
#define ROUTE_FNINS_START_RULE   7
 
#define FINI_RATIO   8
 
#define TSP_FINI_RATIO   9
 
#define ROUTE_FINS_VRP_DATA   10
 
#define ROUTE_NINS_VRP_DATA   11
 
#define ROUTE_FNINS_VRP_DATA   12
 
#define SWEEP_TRIALS   13
 
#define TSP_NI_TRIALS   14
 
#define TSP_FI_TRIALS   15
 
#define TSP_FINI_TRIALS   16
 
#define S3_NUMROUTES   17
 
#define NC_NUMROUTES   18
 
#define TSP_START_POINT   19
 
#define SAVINGS_DATA   20
 
#define SAVINGS2_DATA   21
 
#define SAVINGS3_DATA   22
 
#define DISPLAY_DATA   23
 
#define STOP   24
 
#define HEUR_TOUR   25
 
#define HEUR_TOUR_WITH_ROUTES   26
 
#define LOWER_BOUND   27
 
#define EXCHANGE   28
 
#define EXCHANGE2   29
 
#define FARNEAR_INS   30
 
#define FARTHEST_INS   31
 
#define MST   32
 
#define NEAREST_INS   33
 
#define NEAR_CLUSTER   34
 
#define SAVINGS   35
 
#define SAVINGS2   36
 
#define SAVINGS3   37
 
#define SWEEP   38
 
#define TSP_FI   39
 
#define TSP_FINI   40
 
#define TSP_NI   41
 
#define S_EXCHANGE   42
 
#define S_EXCHANGE2   43
 
#define S_FARNEAR_INS   44
 
#define S_FARTHEST_INS   45
 
#define S_MST   46
 
#define S_NEAREST_INS   47
 
#define S_NEAR_CLUSTER   48
 
#define S_SAVINGS   49
 
#define S_SAVINGS2   50
 
#define S_SAVINGS3   51
 
#define S_SWEEP   52
 
#define S_TSP_FI   53
 
#define S_TSP_FINI   54
 
#define S_TSP_NI   55
 
#define IN_TOUR   -1
 
#define IN_TREE   -1
 
#define NOT_NEIGHBOR   0
 
#define SUBTOUR_ELIM_SIDE   0
 
#define SUBTOUR_ELIM_ACROSS   1
 
#define SUBTOUR_ELIM   2
 
#define CLIQUE   3
 
#define FARKAS   4
 
#define NO_COLUMNS   5
 
#define GENERAL_NONZEROS   6
 
#define NO_TSP_CUTS   0
 
#define SUBTOUR   1
 
#define BLOSSOM   2
 
#define COMB   4
 
#define ALL_TSP_CUTS   7
 
#define NUM_RANDS   6
 
#define ACTIVE_NODE_LIST_BLOCK_SIZE   100
 
#define DELETE_POWER   3
 
#define DELETE_AND   0x07
 
#define EVERYTHING_IS_EXTRA   0
 
#define SOME_ARE_BASE   1
 
#define EVERYTHING_IS_BASE   2
 
#define CHEAP_EDGES   0
 
#define REMAINING_EDGES   1
 
#define SAVE_SMALL_GRAPH   1
 
#define LOAD_SMALL_GRAPH   2
 
#define FIRST_SET   1
 
#define SECOND_SET   2
 
#define CONNECTED   0
 
#define BICONNECTED   1
 
#define BOTH   2
 
#define VRP_NOT_SET   -1
 
+

Macro Definition Documentation

+ +

◆ LENGTH

+ +
+
+ + + + +
#define LENGTH   255
+
+ +

Definition at line 18 of file VrpConstants.h.

+ +
+
+ +

◆ KEY_NUM

+ +
+
+ + + + +
#define KEY_NUM   43
+
+ +

Definition at line 19 of file VrpConstants.h.

+ +
+
+ +

◆ DEAD

+ +
+
+ + + + +
#define DEAD   2
+
+ +

Definition at line 20 of file VrpConstants.h.

+ +
+
+ +

◆ NEAR_INS

+ +
+
+ + + + +
#define NEAR_INS   -1
+
+ +

Definition at line 21 of file VrpConstants.h.

+ +
+
+ +

◆ FAR_INS

+ +
+
+ + + + +
#define FAR_INS   -2
+
+ +

Definition at line 22 of file VrpConstants.h.

+ +
+
+ +

◆ DEPOT_PENALTY

+ +
+
+ + + + +
#define DEPOT_PENALTY   20
+
+ +

Definition at line 23 of file VrpConstants.h.

+ +
+
+ +

◆ RRR

+ +
+
+ + + + +
#define RRR   6378.388
+
+ +

Definition at line 24 of file VrpConstants.h.

+ +
+
+ +

◆ MY_PI

+ +
+
+ + + + +
#define MY_PI   3.141592
+
+ +

Definition at line 25 of file VrpConstants.h.

+ +
+
+ +

◆ LINE_LEN

+ +
+
+ + + + +
#define LINE_LEN   80
+
+ +

Definition at line 26 of file VrpConstants.h.

+ +
+
+ +

◆ _EXPLICIT

+ +
+
+ + + + +
#define _EXPLICIT   0
+
+ +

Definition at line 29 of file VrpConstants.h.

+ +
+
+ +

◆ _EUC_2D

+ +
+
+ + + + +
#define _EUC_2D   1
+
+ +

Definition at line 30 of file VrpConstants.h.

+ +
+
+ +

◆ _EUC_3D

+ +
+
+ + + + +
#define _EUC_3D   2
+
+ +

Definition at line 31 of file VrpConstants.h.

+ +
+
+ +

◆ _MAX_2D

+ +
+
+ + + + +
#define _MAX_2D   3
+
+ +

Definition at line 32 of file VrpConstants.h.

+ +
+
+ +

◆ _MAX_3D

+ +
+
+ + + + +
#define _MAX_3D   4
+
+ +

Definition at line 33 of file VrpConstants.h.

+ +
+
+ +

◆ _MAN_2D

+ +
+
+ + + + +
#define _MAN_2D   5
+
+ +

Definition at line 34 of file VrpConstants.h.

+ +
+
+ +

◆ _MAN_3D

+ +
+
+ + + + +
#define _MAN_3D   6
+
+ +

Definition at line 35 of file VrpConstants.h.

+ +
+
+ +

◆ _CEIL_2D

+ +
+
+ + + + +
#define _CEIL_2D   7
+
+ +

Definition at line 36 of file VrpConstants.h.

+ +
+
+ +

◆ _GEO

+ +
+
+ + + + +
#define _GEO   8
+
+ +

Definition at line 37 of file VrpConstants.h.

+ +
+
+ +

◆ _ATT

+ +
+
+ + + + +
#define _ATT   9
+
+ +

Definition at line 38 of file VrpConstants.h.

+ +
+
+ +

◆ VRP_LB_DATA

+ +
+
+ + + + +
#define VRP_LB_DATA   1
+
+ +

Definition at line 41 of file VrpConstants.h.

+ +
+
+ +

◆ VRP_LB_DATA2

+ +
+
+ + + + +
#define VRP_LB_DATA2   2
+
+ +

Definition at line 42 of file VrpConstants.h.

+ +
+
+ +

◆ VRP_BROADCAST_DATA

+ +
+
+ + + + +
#define VRP_BROADCAST_DATA   3
+
+ +

Definition at line 43 of file VrpConstants.h.

+ +
+
+ +

◆ EXCHANGE_HEUR_TOUR

+ +
+
+ + + + +
#define EXCHANGE_HEUR_TOUR   4
+
+ +

Definition at line 44 of file VrpConstants.h.

+ +
+
+ +

◆ ROUTE_FINS_START_RULE

+ +
+
+ + + + +
#define ROUTE_FINS_START_RULE   5
+
+ +

Definition at line 45 of file VrpConstants.h.

+ +
+
+ +

◆ ROUTE_NINS_START_RULE

+ +
+
+ + + + +
#define ROUTE_NINS_START_RULE   6
+
+ +

Definition at line 46 of file VrpConstants.h.

+ +
+
+ +

◆ ROUTE_FNINS_START_RULE

+ +
+
+ + + + +
#define ROUTE_FNINS_START_RULE   7
+
+ +

Definition at line 47 of file VrpConstants.h.

+ +
+
+ +

◆ FINI_RATIO

+ +
+
+ + + + +
#define FINI_RATIO   8
+
+ +

Definition at line 48 of file VrpConstants.h.

+ +
+
+ +

◆ TSP_FINI_RATIO

+ +
+
+ + + + +
#define TSP_FINI_RATIO   9
+
+ +

Definition at line 49 of file VrpConstants.h.

+ +
+
+ +

◆ ROUTE_FINS_VRP_DATA

+ +
+
+ + + + +
#define ROUTE_FINS_VRP_DATA   10
+
+ +

Definition at line 50 of file VrpConstants.h.

+ +
+
+ +

◆ ROUTE_NINS_VRP_DATA

+ +
+
+ + + + +
#define ROUTE_NINS_VRP_DATA   11
+
+ +

Definition at line 51 of file VrpConstants.h.

+ +
+
+ +

◆ ROUTE_FNINS_VRP_DATA

+ +
+
+ + + + +
#define ROUTE_FNINS_VRP_DATA   12
+
+ +

Definition at line 52 of file VrpConstants.h.

+ +
+
+ +

◆ SWEEP_TRIALS

+ +
+
+ + + + +
#define SWEEP_TRIALS   13
+
+ +

Definition at line 53 of file VrpConstants.h.

+ +
+
+ +

◆ TSP_NI_TRIALS

+ +
+
+ + + + +
#define TSP_NI_TRIALS   14
+
+ +

Definition at line 54 of file VrpConstants.h.

+ +
+
+ +

◆ TSP_FI_TRIALS

+ +
+
+ + + + +
#define TSP_FI_TRIALS   15
+
+ +

Definition at line 55 of file VrpConstants.h.

+ +
+
+ +

◆ TSP_FINI_TRIALS

+ +
+
+ + + + +
#define TSP_FINI_TRIALS   16
+
+ +

Definition at line 56 of file VrpConstants.h.

+ +
+
+ +

◆ S3_NUMROUTES

+ +
+
+ + + + +
#define S3_NUMROUTES   17
+
+ +

Definition at line 57 of file VrpConstants.h.

+ +
+
+ +

◆ NC_NUMROUTES

+ +
+
+ + + + +
#define NC_NUMROUTES   18
+
+ +

Definition at line 58 of file VrpConstants.h.

+ +
+
+ +

◆ TSP_START_POINT

+ +
+
+ + + + +
#define TSP_START_POINT   19
+
+ +

Definition at line 59 of file VrpConstants.h.

+ +
+
+ +

◆ SAVINGS_DATA

+ +
+
+ + + + +
#define SAVINGS_DATA   20
+
+ +

Definition at line 60 of file VrpConstants.h.

+ +
+
+ +

◆ SAVINGS2_DATA

+ +
+
+ + + + +
#define SAVINGS2_DATA   21
+
+ +

Definition at line 61 of file VrpConstants.h.

+ +
+
+ +

◆ SAVINGS3_DATA

+ +
+
+ + + + +
#define SAVINGS3_DATA   22
+
+ +

Definition at line 62 of file VrpConstants.h.

+ +
+
+ +

◆ DISPLAY_DATA

+ +
+
+ + + + +
#define DISPLAY_DATA   23
+
+ +

Definition at line 63 of file VrpConstants.h.

+ +
+
+ +

◆ STOP

+ +
+
+ + + + +
#define STOP   24
+
+ +

Definition at line 64 of file VrpConstants.h.

+ +
+
+ +

◆ HEUR_TOUR

+ +
+
+ + + + +
#define HEUR_TOUR   25
+
+ +

Definition at line 68 of file VrpConstants.h.

+ +
+
+ +

◆ HEUR_TOUR_WITH_ROUTES

+ +
+
+ + + + +
#define HEUR_TOUR_WITH_ROUTES   26
+
+ +

Definition at line 69 of file VrpConstants.h.

+ +
+
+ +

◆ LOWER_BOUND

+ +
+
+ + + + +
#define LOWER_BOUND   27
+
+ +

Definition at line 70 of file VrpConstants.h.

+ +
+
+ +

◆ EXCHANGE

+ +
+
+ + + + +
#define EXCHANGE   28
+
+ +

Definition at line 73 of file VrpConstants.h.

+ +
+
+ +

◆ EXCHANGE2

+ +
+
+ + + + +
#define EXCHANGE2   29
+
+ +

Definition at line 74 of file VrpConstants.h.

+ +
+
+ +

◆ FARNEAR_INS

+ +
+
+ + + + +
#define FARNEAR_INS   30
+
+ +

Definition at line 75 of file VrpConstants.h.

+ +
+
+ +

◆ FARTHEST_INS

+ +
+
+ + + + +
#define FARTHEST_INS   31
+
+ +

Definition at line 76 of file VrpConstants.h.

+ +
+
+ +

◆ MST

+ +
+
+ + + + +
#define MST   32
+
+ +

Definition at line 77 of file VrpConstants.h.

+ +
+
+ +

◆ NEAREST_INS

+ +
+
+ + + + +
#define NEAREST_INS   33
+
+ +

Definition at line 78 of file VrpConstants.h.

+ +
+
+ +

◆ NEAR_CLUSTER

+ +
+
+ + + + +
#define NEAR_CLUSTER   34
+
+ +

Definition at line 79 of file VrpConstants.h.

+ +
+
+ +

◆ SAVINGS

+ +
+
+ + + + +
#define SAVINGS   35
+
+ +

Definition at line 80 of file VrpConstants.h.

+ +
+
+ +

◆ SAVINGS2

+ +
+
+ + + + +
#define SAVINGS2   36
+
+ +

Definition at line 81 of file VrpConstants.h.

+ +
+
+ +

◆ SAVINGS3

+ +
+
+ + + + +
#define SAVINGS3   37
+
+ +

Definition at line 82 of file VrpConstants.h.

+ +
+
+ +

◆ SWEEP

+ +
+
+ + + + +
#define SWEEP   38
+
+ +

Definition at line 83 of file VrpConstants.h.

+ +
+
+ +

◆ TSP_FI

+ +
+
+ + + + +
#define TSP_FI   39
+
+ +

Definition at line 84 of file VrpConstants.h.

+ +
+
+ +

◆ TSP_FINI

+ +
+
+ + + + +
#define TSP_FINI   40
+
+ +

Definition at line 85 of file VrpConstants.h.

+ +
+
+ +

◆ TSP_NI

+ +
+
+ + + + +
#define TSP_NI   41
+
+ +

Definition at line 86 of file VrpConstants.h.

+ +
+
+ +

◆ S_EXCHANGE

+ +
+
+ + + + +
#define S_EXCHANGE   42
+
+ +

Definition at line 88 of file VrpConstants.h.

+ +
+
+ +

◆ S_EXCHANGE2

+ +
+
+ + + + +
#define S_EXCHANGE2   43
+
+ +

Definition at line 89 of file VrpConstants.h.

+ +
+
+ +

◆ S_FARNEAR_INS

+ +
+
+ + + + +
#define S_FARNEAR_INS   44
+
+ +

Definition at line 90 of file VrpConstants.h.

+ +
+
+ +

◆ S_FARTHEST_INS

+ +
+
+ + + + +
#define S_FARTHEST_INS   45
+
+ +

Definition at line 91 of file VrpConstants.h.

+ +
+
+ +

◆ S_MST

+ +
+
+ + + + +
#define S_MST   46
+
+ +

Definition at line 92 of file VrpConstants.h.

+ +
+
+ +

◆ S_NEAREST_INS

+ +
+
+ + + + +
#define S_NEAREST_INS   47
+
+ +

Definition at line 93 of file VrpConstants.h.

+ +
+
+ +

◆ S_NEAR_CLUSTER

+ +
+
+ + + + +
#define S_NEAR_CLUSTER   48
+
+ +

Definition at line 94 of file VrpConstants.h.

+ +
+
+ +

◆ S_SAVINGS

+ +
+
+ + + + +
#define S_SAVINGS   49
+
+ +

Definition at line 95 of file VrpConstants.h.

+ +
+
+ +

◆ S_SAVINGS2

+ +
+
+ + + + +
#define S_SAVINGS2   50
+
+ +

Definition at line 96 of file VrpConstants.h.

+ +
+
+ +

◆ S_SAVINGS3

+ +
+
+ + + + +
#define S_SAVINGS3   51
+
+ +

Definition at line 97 of file VrpConstants.h.

+ +
+
+ +

◆ S_SWEEP

+ +
+
+ + + + +
#define S_SWEEP   52
+
+ +

Definition at line 98 of file VrpConstants.h.

+ +
+
+ +

◆ S_TSP_FI

+ +
+
+ + + + +
#define S_TSP_FI   53
+
+ +

Definition at line 99 of file VrpConstants.h.

+ +
+
+ +

◆ S_TSP_FINI

+ +
+
+ + + + +
#define S_TSP_FINI   54
+
+ +

Definition at line 100 of file VrpConstants.h.

+ +
+
+ +

◆ S_TSP_NI

+ +
+
+ + + + +
#define S_TSP_NI   55
+
+ +

Definition at line 101 of file VrpConstants.h.

+ +
+
+ +

◆ IN_TOUR

+ +
+
+ + + + +
#define IN_TOUR   -1
+
+ +

Definition at line 103 of file VrpConstants.h.

+ +
+
+ +

◆ IN_TREE

+ +
+
+ + + + +
#define IN_TREE   -1
+
+ +

Definition at line 104 of file VrpConstants.h.

+ +
+
+ +

◆ NOT_NEIGHBOR

+ +
+
+ + + + +
#define NOT_NEIGHBOR   0
+
+ +

Definition at line 105 of file VrpConstants.h.

+ +
+
+ +

◆ SUBTOUR_ELIM_SIDE

+ +
+
+ + + + +
#define SUBTOUR_ELIM_SIDE   0
+
+ +

Definition at line 109 of file VrpConstants.h.

+ +
+
+ +

◆ SUBTOUR_ELIM_ACROSS

+ +
+
+ + + + +
#define SUBTOUR_ELIM_ACROSS   1
+
+ +

Definition at line 110 of file VrpConstants.h.

+ +
+
+ +

◆ SUBTOUR_ELIM

+ +
+
+ + + + +
#define SUBTOUR_ELIM   2
+
+ +

Definition at line 111 of file VrpConstants.h.

+ +
+
+ +

◆ CLIQUE

+ +
+
+ + + + +
#define CLIQUE   3
+
+ +

Definition at line 112 of file VrpConstants.h.

+ +
+
+ +

◆ FARKAS

+ +
+
+ + + + +
#define FARKAS   4
+
+ +

Definition at line 114 of file VrpConstants.h.

+ +
+
+ +

◆ NO_COLUMNS

+ +
+
+ + + + +
#define NO_COLUMNS   5
+
+ +

Definition at line 115 of file VrpConstants.h.

+ +
+
+ +

◆ GENERAL_NONZEROS

+ +
+
+ + + + +
#define GENERAL_NONZEROS   6
+
+ +

Definition at line 116 of file VrpConstants.h.

+ +
+
+ +

◆ NO_TSP_CUTS

+ +
+
+ + + + +
#define NO_TSP_CUTS   0
+
+ +

Definition at line 121 of file VrpConstants.h.

+ +
+
+ +

◆ SUBTOUR

+ +
+
+ + + + +
#define SUBTOUR   1
+
+ +

Definition at line 122 of file VrpConstants.h.

+ +
+
+ +

◆ BLOSSOM

+ +
+
+ + + + +
#define BLOSSOM   2
+
+ +

Definition at line 123 of file VrpConstants.h.

+ +
+
+ +

◆ COMB

+ +
+
+ + + + +
#define COMB   4
+
+ +

Definition at line 124 of file VrpConstants.h.

+ +
+
+ +

◆ ALL_TSP_CUTS

+ +
+
+ + + + +
#define ALL_TSP_CUTS   7
+
+ +

Definition at line 125 of file VrpConstants.h.

+ +
+
+ +

◆ NUM_RANDS

+ +
+
+ + + + +
#define NUM_RANDS   6
+
+ +

Definition at line 127 of file VrpConstants.h.

+ +
+
+ +

◆ ACTIVE_NODE_LIST_BLOCK_SIZE

+ +
+
+ + + + +
#define ACTIVE_NODE_LIST_BLOCK_SIZE   100
+
+ +

Definition at line 129 of file VrpConstants.h.

+ +
+
+ +

◆ DELETE_POWER

+ +
+
+ + + + +
#define DELETE_POWER   3
+
+ +

Definition at line 130 of file VrpConstants.h.

+ +
+
+ +

◆ DELETE_AND

+ +
+
+ + + + +
#define DELETE_AND   0x07
+
+ +

Definition at line 131 of file VrpConstants.h.

+ +
+
+ +

◆ EVERYTHING_IS_EXTRA

+ +
+
+ + + + +
#define EVERYTHING_IS_EXTRA   0
+
+ +

Definition at line 134 of file VrpConstants.h.

+ +
+
+ +

◆ SOME_ARE_BASE

+ +
+
+ + + + +
#define SOME_ARE_BASE   1
+
+ +

Definition at line 135 of file VrpConstants.h.

+ +
+
+ +

◆ EVERYTHING_IS_BASE

+ +
+
+ + + + +
#define EVERYTHING_IS_BASE   2
+
+ +

Definition at line 136 of file VrpConstants.h.

+ +
+
+ +

◆ CHEAP_EDGES

+ +
+
+ + + + +
#define CHEAP_EDGES   0
+
+ +

Definition at line 139 of file VrpConstants.h.

+ +
+
+ +

◆ REMAINING_EDGES

+ +
+
+ + + + +
#define REMAINING_EDGES   1
+
+ +

Definition at line 140 of file VrpConstants.h.

+ +
+
+ +

◆ SAVE_SMALL_GRAPH

+ +
+
+ + + + +
#define SAVE_SMALL_GRAPH   1
+
+ +

Definition at line 143 of file VrpConstants.h.

+ +
+
+ +

◆ LOAD_SMALL_GRAPH

+ +
+
+ + + + +
#define LOAD_SMALL_GRAPH   2
+
+ +

Definition at line 144 of file VrpConstants.h.

+ +
+
+ +

◆ FIRST_SET

+ +
+
+ + + + +
#define FIRST_SET   1
+
+ +

Definition at line 147 of file VrpConstants.h.

+ +
+
+ +

◆ SECOND_SET

+ +
+
+ + + + +
#define SECOND_SET   2
+
+ +

Definition at line 148 of file VrpConstants.h.

+ +
+
+ +

◆ CONNECTED

+ +
+
+ + + + +
#define CONNECTED   0
+
+ +

Definition at line 151 of file VrpConstants.h.

+ +
+
+ +

◆ BICONNECTED

+ +
+
+ + + + +
#define BICONNECTED   1
+
+ +

Definition at line 152 of file VrpConstants.h.

+ +
+
+ +

◆ BOTH

+ +
+
+ + + + +
#define BOTH   2
+
+ +

Definition at line 153 of file VrpConstants.h.

+ +
+
+ +

◆ VRP_NOT_SET

+ +
+
+ + + + +
#define VRP_NOT_SET   -1
+
+ +

Definition at line 155 of file VrpConstants.h.

+ +
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpConstants_8h__dep__incl.map b/Doxygen/0.94/VrpConstants_8h__dep__incl.map new file mode 100644 index 0000000..bf397e1 --- /dev/null +++ b/Doxygen/0.94/VrpConstants_8h__dep__incl.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/Doxygen/0.94/VrpConstants_8h__dep__incl.md5 b/Doxygen/0.94/VrpConstants_8h__dep__incl.md5 new file mode 100644 index 0000000..7c06377 --- /dev/null +++ b/Doxygen/0.94/VrpConstants_8h__dep__incl.md5 @@ -0,0 +1 @@ +11e307a23740858fc148260f28494f19 \ No newline at end of file diff --git a/Doxygen/0.94/VrpConstants_8h__dep__incl.png b/Doxygen/0.94/VrpConstants_8h__dep__incl.png new file mode 100644 index 0000000..e8e68fe Binary files /dev/null and b/Doxygen/0.94/VrpConstants_8h__dep__incl.png differ diff --git a/Doxygen/0.94/VrpConstants_8h_source.html b/Doxygen/0.94/VrpConstants_8h_source.html new file mode 100644 index 0000000..9e59bf9 --- /dev/null +++ b/Doxygen/0.94/VrpConstants_8h_source.html @@ -0,0 +1,238 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpConstants.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
VrpConstants.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of a solver for the Vehicle Routing Problem *
+
3  * developed using the BiCePS Linear Integer Solver (BLIS). *
+
4  * *
+
5  * This solver is distributed under the Eclipse Public License as part of *
+
6  * the COIN-OR repository (http://www.coin-or.org). *
+
7  * *
+
8  * Authors: Yan Xu, Lehigh University *
+
9  * Ted Ralphs, Lehigh University *
+
10  * *
+
11  * Copyright (C) 2007 Yan Xu and Ted Ralphs. *
+
12  * All Rights Reserved. *
+
13  *===========================================================================*/
+
14 
+
15 #ifndef VrpConstants_h_
+
16 #define VrpConstants_h_
+
17 
+
18 #define LENGTH 255
+
19 #define KEY_NUM 43
+
20 #define DEAD 2
+
21 #define NEAR_INS -1
+
22 #define FAR_INS -2
+
23 #define DEPOT_PENALTY 20
+
24 #define RRR 6378.388
+
25 #define MY_PI 3.141592
+
26 #define LINE_LEN 80
+
27 
+
28 /*---------------- distance types -------------------------------------------*/
+
29 #define _EXPLICIT 0
+
30 #define _EUC_2D 1
+
31 #define _EUC_3D 2
+
32 #define _MAX_2D 3
+
33 #define _MAX_3D 4
+
34 #define _MAN_2D 5
+
35 #define _MAN_3D 6
+
36 #define _CEIL_2D 7
+
37 #define _GEO 8
+
38 #define _ATT 9
+
39 
+
40 /*---------------- message types --------------------------------------------*/
+
41 #define VRP_LB_DATA 1
+
42 #define VRP_LB_DATA2 2
+
43 #define VRP_BROADCAST_DATA 3
+
44 #define EXCHANGE_HEUR_TOUR 4
+
45 #define ROUTE_FINS_START_RULE 5
+
46 #define ROUTE_NINS_START_RULE 6
+
47 #define ROUTE_FNINS_START_RULE 7
+
48 #define FINI_RATIO 8
+
49 #define TSP_FINI_RATIO 9
+
50 #define ROUTE_FINS_VRP_DATA 10
+
51 #define ROUTE_NINS_VRP_DATA 11
+
52 #define ROUTE_FNINS_VRP_DATA 12
+
53 #define SWEEP_TRIALS 13
+
54 #define TSP_NI_TRIALS 14
+
55 #define TSP_FI_TRIALS 15
+
56 #define TSP_FINI_TRIALS 16
+
57 #define S3_NUMROUTES 17
+
58 #define NC_NUMROUTES 18
+
59 #define TSP_START_POINT 19
+
60 #define SAVINGS_DATA 20
+
61 #define SAVINGS2_DATA 21
+
62 #define SAVINGS3_DATA 22
+
63 #define DISPLAY_DATA 23
+
64 #define STOP 24
+
65 
+
66 /*__BEGIN_EXPERIMENTAL_SECTION__*/
+
67 
+
68 #define HEUR_TOUR 25
+
69 #define HEUR_TOUR_WITH_ROUTES 26
+
70 #define LOWER_BOUND 27
+
71 
+
72 /*--------------- algorithms ------------------------------------------------*/
+
73 #define EXCHANGE 28
+
74 #define EXCHANGE2 29
+
75 #define FARNEAR_INS 30
+
76 #define FARTHEST_INS 31
+
77 #define MST 32
+
78 #define NEAREST_INS 33
+
79 #define NEAR_CLUSTER 34
+
80 #define SAVINGS 35
+
81 #define SAVINGS2 36
+
82 #define SAVINGS3 37
+
83 #define SWEEP 38
+
84 #define TSP_FI 39
+
85 #define TSP_FINI 40
+
86 #define TSP_NI 41
+
87 /*--------------- algorithms ------------------------------------------------*/
+
88 #define S_EXCHANGE 42
+
89 #define S_EXCHANGE2 43
+
90 #define S_FARNEAR_INS 44
+
91 #define S_FARTHEST_INS 45
+
92 #define S_MST 46
+
93 #define S_NEAREST_INS 47
+
94 #define S_NEAR_CLUSTER 48
+
95 #define S_SAVINGS 49
+
96 #define S_SAVINGS2 50
+
97 #define S_SAVINGS3 51
+
98 #define S_SWEEP 52
+
99 #define S_TSP_FI 53
+
100 #define S_TSP_FINI 54
+
101 #define S_TSP_NI 55
+
102 
+
103 #define IN_TOUR -1
+
104 #define IN_TREE -1
+
105 #define NOT_NEIGHBOR 0
+
106 /*___END_EXPERIMENTAL_SECTION___*/
+
107 
+
108 /*---------------- cut types ------------------------------------------------*/
+
109 #define SUBTOUR_ELIM_SIDE 0
+
110 #define SUBTOUR_ELIM_ACROSS 1
+
111 #define SUBTOUR_ELIM 2
+
112 #define CLIQUE 3
+
113 /*__BEGIN_EXPERIMENTAL_SECTION__*/
+
114 #define FARKAS 4
+
115 #define NO_COLUMNS 5
+
116 #define GENERAL_NONZEROS 6
+
117 /*___END_EXPERIMENTAL_SECTION___*/
+
118 
+
119 /*---------------- tsp cut routines -----------------------------------------*/
+
120 
+
121 #define NO_TSP_CUTS 0
+
122 #define SUBTOUR 1
+
123 #define BLOSSOM 2
+
124 #define COMB 4
+
125 #define ALL_TSP_CUTS 7
+
126 
+
127 #define NUM_RANDS 6
+
128 
+
129 #define ACTIVE_NODE_LIST_BLOCK_SIZE 100
+
130 #define DELETE_POWER 3
+
131 #define DELETE_AND 0x07
+
132 
+
133 /*-------------- base variable selection rules ------------------------------*/
+
134 #define EVERYTHING_IS_EXTRA 0
+
135 #define SOME_ARE_BASE 1
+
136 #define EVERYTHING_IS_BASE 2
+
137 
+
138 /*--------- constants used in creating the edges lists for the root ---------*/
+
139 #define CHEAP_EDGES 0
+
140 #define REMAINING_EDGES 1
+
141 
+
142 /*--------- constants for saving the small graph ----------------------------*/
+
143 #define SAVE_SMALL_GRAPH 1
+
144 #define LOAD_SMALL_GRAPH 2
+
145 
+
146 /*--------- constants for defining which set of exchange heuristics to do --*/
+
147 #define FIRST_SET 1
+
148 #define SECOND_SET 2
+
149 
+
150 /*--------- which_connected_routine choices --------------------------------*/
+
151 #define CONNECTED 0
+
152 #define BICONNECTED 1
+
153 #define BOTH 2
+
154 
+
155 #define VRP_NOT_SET -1
+
156 
+
157 #endif
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpCutGenerator_8h.html b/Doxygen/0.94/VrpCutGenerator_8h.html new file mode 100644 index 0000000..20454e1 --- /dev/null +++ b/Doxygen/0.94/VrpCutGenerator_8h.html @@ -0,0 +1,159 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpCutGenerator.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
VrpCutGenerator.h File Reference
+
+
+
#include "BlisConGenerator.h"
+#include "VrpModel.h"
+#include "VrpNetwork.h"
+#include "VrpMacros.h"
+
+ + Include dependency graph for VrpCutGenerator.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + +

+Classes

class  VrpCutGenerator
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpCutGenerator_8h__dep__incl.map b/Doxygen/0.94/VrpCutGenerator_8h__dep__incl.map new file mode 100644 index 0000000..c84c82e --- /dev/null +++ b/Doxygen/0.94/VrpCutGenerator_8h__dep__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/Doxygen/0.94/VrpCutGenerator_8h__dep__incl.md5 b/Doxygen/0.94/VrpCutGenerator_8h__dep__incl.md5 new file mode 100644 index 0000000..399415b --- /dev/null +++ b/Doxygen/0.94/VrpCutGenerator_8h__dep__incl.md5 @@ -0,0 +1 @@ +0d714d3fea13dbff2b78dd877f1df5c5 \ No newline at end of file diff --git a/Doxygen/0.94/VrpCutGenerator_8h__dep__incl.png b/Doxygen/0.94/VrpCutGenerator_8h__dep__incl.png new file mode 100644 index 0000000..037ac09 Binary files /dev/null and b/Doxygen/0.94/VrpCutGenerator_8h__dep__incl.png differ diff --git a/Doxygen/0.94/VrpCutGenerator_8h__incl.map b/Doxygen/0.94/VrpCutGenerator_8h__incl.map new file mode 100644 index 0000000..5b19246 --- /dev/null +++ b/Doxygen/0.94/VrpCutGenerator_8h__incl.map @@ -0,0 +1,44 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/VrpCutGenerator_8h__incl.md5 b/Doxygen/0.94/VrpCutGenerator_8h__incl.md5 new file mode 100644 index 0000000..d22e500 --- /dev/null +++ b/Doxygen/0.94/VrpCutGenerator_8h__incl.md5 @@ -0,0 +1 @@ +f3fffafac382a4d049014ef7bf92e578 \ No newline at end of file diff --git a/Doxygen/0.94/VrpCutGenerator_8h__incl.png b/Doxygen/0.94/VrpCutGenerator_8h__incl.png new file mode 100644 index 0000000..3fdb10c Binary files /dev/null and b/Doxygen/0.94/VrpCutGenerator_8h__incl.png differ diff --git a/Doxygen/0.94/VrpCutGenerator_8h_source.html b/Doxygen/0.94/VrpCutGenerator_8h_source.html new file mode 100644 index 0000000..729b27f --- /dev/null +++ b/Doxygen/0.94/VrpCutGenerator_8h_source.html @@ -0,0 +1,194 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpCutGenerator.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
VrpCutGenerator.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of a solver for the Vehicle Routing Problem *
+
3  * developed using the BiCePS Linear Integer Solver (BLIS). *
+
4  * *
+
5  * This solver is distributed under the Eclipse Public License as part of *
+
6  * the COIN-OR repository (http://www.coin-or.org). *
+
7  * *
+
8  * Authors: Yan Xu, Lehigh University *
+
9  * Ted Ralphs, Lehigh University *
+
10  * *
+
11  * Copyright (C) 2007 Yan Xu and Ted Ralphs. *
+
12  * All Rights Reserved. *
+
13  *===========================================================================*/
+
14 
+
15 #ifndef VrpCutGenerator_h_
+
16 #define VrpCutGenerator_h_
+
17 
+
18 //#############################################################################
+
19 
+
20 #include "BlisConGenerator.h"
+
21 #include "VrpModel.h"
+
22 #include "VrpNetwork.h"
+
23 #include "VrpMacros.h"
+
24 #ifdef DO_TSP_CUTS
+
25 extern "C"{
+
26  #include "concorde.h"
+
27 }
+
28 #endif
+
29 
+
30 class VrpModel;
+
31 
+
32 //#############################################################################
+
33 
+
34 class VrpCutGenerator : public BlisConGenerator
+
35 {
+
36 private:
+
37 
+
38  VrpModel *model_;
+
39  char **coef_list;
+
40  int *ref_;
+
41  double *cutVal_;
+
42  char *cutList_;
+
43  char *inSet_;
+
44 
+
45 public:
+
46 
+
48  VrpCutGenerator(VrpModel *vrp=0, int vertnum = 0);
+
49 
+
51  virtual ~VrpCutGenerator() {
+
52  delete [] ref_; ref_ = 0;
+
53  delete [] cutVal_; cutVal_ = 0;
+
54  delete [] cutList_; cutList_ = 0;
+
55  delete [] inSet_; inSet_ = 0;
+
56  }
+
57 
+
62  virtual bool generateConstraints(BcpsConstraintPool &conPool);
+
63 
+
64  int connectivityCuts(BcpsConstraintPool &conPool);
+
65 
+
66  int addVrpCut(BcpsConstraintPool &conPool, char *coef, int rhs,int type);
+
67 
+
68  void setModel(VrpModel *vrp){ model_ = vrp; }
+
69 
+
70  int greedyShrinking1(VrpModel *m, int max_shrink_cuts,
+
71  BcpsConstraintPool &conPool);
+
72 
+
73  int greedyShrinking1One(VrpModel *m, int max_shrink_cuts,
+
74  BcpsConstraintPool &conPool);
+
75 
+
76  int greedyShrinking6(VrpModel *m, int max_shrink_cuts, int trial_num,
+
77  double prob, BcpsConstraintPool &conPool);
+
78 
+
79  int greedyShrinking6One(VrpModel *m, int max_shrink_cuts, int trial_num,
+
80  double prob, BcpsConstraintPool &conPool);
+
81 
+
82  int greedyShrinking2One(VrpModel *m, int max_shrink_cuts,
+
83  BcpsConstraintPool &conPool);
+
84 
+
85 #ifdef DO_TSP_CUTS
+
86  int tspCuts(VrpModel *m, BcpsConstraintPool &conPool);
+
87  int addTspCuts(VrpModel *m, BcpsConstraintPool &conPool,
+
88  CCtsp_lpcut_in **tsp_cuts, CCtsp_lpgraph *g);
+
89 #endif
+
90 
+
91 };
+
92 
+
93 //#############################################################################
+
94 
+
95 #endif
+
+
VrpCutGenerator::greedyShrinking2One
int greedyShrinking2One(VrpModel *m, int max_shrink_cuts, BcpsConstraintPool &conPool)
+
BlisConGenerator
Interface between Blis and Cut Generation Library.
Definition: BlisConGenerator.h:58
+
VrpCutGenerator::connectivityCuts
int connectivityCuts(BcpsConstraintPool &conPool)
+
VrpCutGenerator::generateConstraints
virtual bool generateConstraints(BcpsConstraintPool &conPool)
Generate cons for the client model.
+
VrpNetwork.h
+
VrpCutGenerator::cutVal_
double * cutVal_
Definition: VrpCutGenerator.h:41
+
VrpCutGenerator::ref_
int * ref_
Definition: VrpCutGenerator.h:40
+
VrpCutGenerator::cutList_
char * cutList_
Definition: VrpCutGenerator.h:42
+
VrpCutGenerator
Definition: VrpCutGenerator.h:34
+
VrpCutGenerator::~VrpCutGenerator
virtual ~VrpCutGenerator()
Destructor.
Definition: VrpCutGenerator.h:51
+
VrpCutGenerator::greedyShrinking1
int greedyShrinking1(VrpModel *m, int max_shrink_cuts, BcpsConstraintPool &conPool)
+
VrpMacros.h
+
VrpModel.h
+
VrpCutGenerator::inSet_
char * inSet_
Definition: VrpCutGenerator.h:43
+
VrpCutGenerator::VrpCutGenerator
VrpCutGenerator(VrpModel *vrp=0, int vertnum=0)
Construtors.
+
VrpCutGenerator::coef_list
char ** coef_list
Definition: VrpCutGenerator.h:39
+
VrpCutGenerator::greedyShrinking6
int greedyShrinking6(VrpModel *m, int max_shrink_cuts, int trial_num, double prob, BcpsConstraintPool &conPool)
+
VrpCutGenerator::greedyShrinking1One
int greedyShrinking1One(VrpModel *m, int max_shrink_cuts, BcpsConstraintPool &conPool)
+
VrpCutGenerator::addVrpCut
int addVrpCut(BcpsConstraintPool &conPool, char *coef, int rhs, int type)
+
VrpCutGenerator::setModel
void setModel(VrpModel *vrp)
Definition: VrpCutGenerator.h:68
+
VrpCutGenerator::greedyShrinking6One
int greedyShrinking6One(VrpModel *m, int max_shrink_cuts, int trial_num, double prob, BcpsConstraintPool &conPool)
+
BlisConGenerator.h
+
VrpCutGenerator::model_
VrpModel * model_
Definition: VrpCutGenerator.h:38
+
VrpModel
Model class for VRP.
Definition: VrpModel.h:32
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpHeurTSP_8h.html b/Doxygen/0.94/VrpHeurTSP_8h.html new file mode 100644 index 0000000..45bcb91 --- /dev/null +++ b/Doxygen/0.94/VrpHeurTSP_8h.html @@ -0,0 +1,147 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpHeurTSP.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
VrpHeurTSP.h File Reference
+
+
+
#include <vector>
+#include "CoinPackedVector.hpp"
+#include "BlisHeuristic.h"
+#include "VrpModel.h"
+
+ + Include dependency graph for VrpHeurTSP.h:
+
+
+ +
+

Go to the source code of this file.

+ + + + +

+Classes

class  VrpHeurTSP
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpHeurTSP_8h__incl.map b/Doxygen/0.94/VrpHeurTSP_8h__incl.map new file mode 100644 index 0000000..3877c6f --- /dev/null +++ b/Doxygen/0.94/VrpHeurTSP_8h__incl.map @@ -0,0 +1,45 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/VrpHeurTSP_8h__incl.md5 b/Doxygen/0.94/VrpHeurTSP_8h__incl.md5 new file mode 100644 index 0000000..e0ed0d3 --- /dev/null +++ b/Doxygen/0.94/VrpHeurTSP_8h__incl.md5 @@ -0,0 +1 @@ +0d54d533f761c79070863b168e04d5d6 \ No newline at end of file diff --git a/Doxygen/0.94/VrpHeurTSP_8h__incl.png b/Doxygen/0.94/VrpHeurTSP_8h__incl.png new file mode 100644 index 0000000..49d88ef Binary files /dev/null and b/Doxygen/0.94/VrpHeurTSP_8h__incl.png differ diff --git a/Doxygen/0.94/VrpHeurTSP_8h_source.html b/Doxygen/0.94/VrpHeurTSP_8h_source.html new file mode 100644 index 0000000..12b89d1 --- /dev/null +++ b/Doxygen/0.94/VrpHeurTSP_8h_source.html @@ -0,0 +1,232 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpHeurTSP.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
VrpHeurTSP.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of a solver for the Vehicle Routing Problem *
+
3  * developed using the BiCePS Linear Integer Solver (BLIS). *
+
4  * *
+
5  * This solver is distributed under the Eclipse Public License as part of *
+
6  * the COIN-OR repository (http://www.coin-or.org). *
+
7  * *
+
8  * Authors: Yan Xu, Lehigh University *
+
9  * Ted Ralphs, Lehigh University *
+
10  * *
+
11  * Copyright (C) 2007 Yan Xu and Ted Ralphs. *
+
12  * All Rights Reserved. *
+
13  *===========================================================================*/
+
14 
+
15 #ifndef VrpHeurTSP_h_
+
16 #define VrpHeurTSP_h_
+
17 
+
18 //#############################################################################
+
19 
+
20 #include <vector>
+
21 
+
22 #include "CoinPackedVector.hpp"
+
23 
+
24 #include "BlisHeuristic.h"
+
25 #include "VrpModel.h"
+
26 
+
27 //#############################################################################
+
28 #if 0
+
29 class VrpAdjList
+
30 {
+
31 private:
+
32  std::vector<CoinPackedVector *> list_;
+
33  VrpModel *model_;
+
34 public:
+
35  VrpAdjList() {}
+
36  VrpAdjList(VrpModel *m) {
+
37  model_ = m;
+
38  createAdjList(m);
+
39  }
+
40 
+
41  void createAdjList(VrpModel *model);
+
42 };
+
43 
+
44 typedef struct vrp_neighbors
+
45 {
+
46  int n1;
+
47  int n2;
+
48 } VrpNeighbors;
+
49 
+
50 #endif
+
51 
+
52 //#############################################################################
+
53 
+
54 class VrpHeurTSP : public BlisHeuristic {
+
55 private:
+
57  VrpHeurTSP & operator=(const VrpHeurTSP& rhs);
+
58 
+
59 protected:
+
60  /* Stored the predetermined next vertex to visit for vertex k if
+
61  the value determined_[k] greater than zero. */
+
62  //int *determined_;
+
63 
+
64  /* Adjacent list of all vertices. */
+
65  std::vector<CoinPackedVector *> adjList_;
+
66 
+
68  void createAdjList(VrpModel *model);
+
69 
+
71  std::vector<int> tour_;
+
72 
+
74  bool *visited_;
+
75 
+
77  int preNode_;
+
78 
+
80  //VrpNeighbor *
+
81  int *neighbors_;
+
82 
+
84  int nodeCalls_;
+
85 
+
88  std::vector<int> *edgeColMatch_;
+
89 
+
90  void freeGuts() {
+
91  if (visited_) {
+
92  delete [] visited_;
+
93  visited_ = NULL;
+
94  }
+
95  int numVertices = adjList_.size();
+
96  for (int k = 0; k < numVertices; ++k) {
+
97  delete adjList_[k];
+
98  }
+
99  adjList_.clear();
+
100  if (neighbors_) {
+
101  delete [] neighbors_;
+
102  neighbors_ = NULL;
+
103  }
+
104  if (edgeColMatch_) {
+
105  delete [] edgeColMatch_;
+
106  edgeColMatch_ = NULL;
+
107  }
+
108  }
+
109 
+
110 public:
+
112  VrpHeurTSP()
+
113  :
+
114  visited_(0), preNode_(-1),
+
115  neighbors_(0), nodeCalls_(0), edgeColMatch_(0) {}
+
116 
+
118  VrpHeurTSP(VrpModel * model, const char *name,
+
119  BlisHeurStrategy strategy, int freq)
+
120  :
+
121  BlisHeuristic(model, name, strategy, freq)
+
122  {
+
123  visited_ = NULL;
+
124  preNode_ = -1;
+
125  neighbors_ = NULL;
+
126  nodeCalls_ = 0;
+
127  edgeColMatch_ = NULL;
+
128  createAdjList(model);
+
129  }
+
130 
+
132  ~VrpHeurTSP()
+
133  {
+
134  freeGuts();
+
135  }
+
136 
+
139  virtual bool searchSolution(double & objectiveValue, double * newSolution);
+
140 };
+
141 #endif
+
142 
+
143 //#############################################################################
+
+
BlisHeuristic
Heuristic base class.
Definition: BlisHeuristic.h:48
+
VrpHeurTSP::visited_
bool * visited_
Mark if vertices have been visited.
Definition: VrpHeurTSP.h:74
+
VrpHeurTSP::VrpHeurTSP
VrpHeurTSP()
Default Constructor.
Definition: VrpHeurTSP.h:112
+
BlisHeuristic::name
const char * name() const
return name of generator.
Definition: BlisHeuristic.h:177
+
VrpHeurTSP::adjList_
std::vector< CoinPackedVector * > adjList_
Definition: VrpHeurTSP.h:65
+
BlisHeuristic.h
+
VrpHeurTSP::nodeCalls_
int nodeCalls_
Call how many time at a node.
Definition: VrpHeurTSP.h:84
+
VrpHeurTSP::~VrpHeurTSP
~VrpHeurTSP()
Destructor.
Definition: VrpHeurTSP.h:132
+
VrpModel.h
+
VrpHeurTSP::neighbors_
int * neighbors_
Neighbors determined from LP solution.
Definition: VrpHeurTSP.h:81
+
BlisHeurStrategy
BlisHeurStrategy
Definition: Blis.h:77
+
VrpHeurTSP::searchSolution
virtual bool searchSolution(double &objectiveValue, double *newSolution)
Returns 0 if no solution, 1 if valid solution.
+
VrpHeurTSP::freeGuts
void freeGuts()
Definition: VrpHeurTSP.h:90
+
BlisHeuristic::strategy
virtual BlisHeurStrategy strategy() const
Definition: BlisHeuristic.h:140
+
VrpHeurTSP::tour_
std::vector< int > tour_
TSP Tour.
Definition: VrpHeurTSP.h:71
+
VrpModel
Model class for VRP.
Definition: VrpModel.h:32
+
VrpHeurTSP::operator=
VrpHeurTSP & operator=(const VrpHeurTSP &rhs)
Illegal Assignment operator.
+
VrpHeurTSP::preNode_
int preNode_
The node at which this heuristic was call.
Definition: VrpHeurTSP.h:77
+
VrpHeurTSP::createAdjList
void createAdjList(VrpModel *model)
Create adjacent list for each vertex.
+
VrpHeurTSP::VrpHeurTSP
VrpHeurTSP(VrpModel *model, const char *name, BlisHeurStrategy strategy, int freq)
Constructor with model.
Definition: VrpHeurTSP.h:118
+
VrpHeurTSP::edgeColMatch_
std::vector< int > * edgeColMatch_
Edge and column relationship.
Definition: VrpHeurTSP.h:88
+
VrpHeurTSP
Definition: VrpHeurTSP.h:54
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpMacros_8h.html b/Doxygen/0.94/VrpMacros_8h.html new file mode 100644 index 0000000..2c7362a --- /dev/null +++ b/Doxygen/0.94/VrpMacros_8h.html @@ -0,0 +1,217 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpMacros.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Macros
+
+
VrpMacros.h File Reference
+
+
+
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + + + + + + + +

+Macros

#define SRANDOM(seed)   srandom(seed)
 
#define RANDOM()   random()
 
#define BINS(weight, capacity)   ((int) ceil(((double)weight)/((double)capacity)))
 
#define RHS(cust_num, weight, capacity)   (cust_num-BINS(weight, capacity))
 
+

Macro Definition Documentation

+ +

◆ SRANDOM

+ +
+
+ + + + + + + + +
#define SRANDOM( seed)   srandom(seed)
+
+ +

Definition at line 23 of file VrpMacros.h.

+ +
+
+ +

◆ RANDOM

+ +
+
+ + + + + + + +
#define RANDOM()   random()
+
+ +

Definition at line 24 of file VrpMacros.h.

+ +
+
+ +

◆ BINS

+ +
+
+ + + + + + + + + + + + + + + + + + +
#define BINS( weight,
 capacity 
)   ((int) ceil(((double)weight)/((double)capacity)))
+
+ +

Definition at line 28 of file VrpMacros.h.

+ +
+
+ +

◆ RHS

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
#define RHS( cust_num,
 weight,
 capacity 
)   (cust_num-BINS(weight, capacity))
+
+ +

Definition at line 32 of file VrpMacros.h.

+ +
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpMacros_8h__dep__incl.map b/Doxygen/0.94/VrpMacros_8h__dep__incl.map new file mode 100644 index 0000000..d7eb561 --- /dev/null +++ b/Doxygen/0.94/VrpMacros_8h__dep__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/Doxygen/0.94/VrpMacros_8h__dep__incl.md5 b/Doxygen/0.94/VrpMacros_8h__dep__incl.md5 new file mode 100644 index 0000000..8e6ccdf --- /dev/null +++ b/Doxygen/0.94/VrpMacros_8h__dep__incl.md5 @@ -0,0 +1 @@ +a8096603a3b1545290cfc088dac5afa1 \ No newline at end of file diff --git a/Doxygen/0.94/VrpMacros_8h__dep__incl.png b/Doxygen/0.94/VrpMacros_8h__dep__incl.png new file mode 100644 index 0000000..b85a41b Binary files /dev/null and b/Doxygen/0.94/VrpMacros_8h__dep__incl.png differ diff --git a/Doxygen/0.94/VrpMacros_8h_source.html b/Doxygen/0.94/VrpMacros_8h_source.html new file mode 100644 index 0000000..a63f267 --- /dev/null +++ b/Doxygen/0.94/VrpMacros_8h_source.html @@ -0,0 +1,118 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpMacros.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
VrpMacros.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of a solver for the Vehicle Routing Problem *
+
3  * developed using the BiCePS Linear Integer Solver (BLIS). *
+
4  * *
+
5  * This solver is distributed under the Eclipse Public License as part of *
+
6  * the COIN-OR repository (http://www.coin-or.org). *
+
7  * *
+
8  * Authors: Yan Xu, Lehigh University *
+
9  * Ted Ralphs, Lehigh University *
+
10  * *
+
11  * Copyright (C) 2007 Yan Xu and Ted Ralphs. *
+
12  * All Rights Reserved. *
+
13  *===========================================================================*/
+
14 
+
15 #ifndef VrpMacros_h_
+
16 #define VrpMacros_h_
+
17 
+
18 #if defined(_MSC_VER) || defined(__MNO_CYGWIN) || defined(__MINGW32__)
+
19 /* Different function call in Windows */
+
20 #define SRANDOM(seed) srand(seed)
+
21 #define RANDOM() rand()
+
22 #else
+
23 #define SRANDOM(seed) srandom(seed)
+
24 #define RANDOM() random()
+
25 #endif
+
26 
+
27 /*approximates the number of trucks necessary to service a set of customers*/
+
28 #define BINS(weight, capacity) \
+
29 ((int) ceil(((double)weight)/((double)capacity)))
+
30 
+
31 /*calculates the right hand side of a subtour elimination constraint*/
+
32 #define RHS(cust_num, weight, capacity) \
+
33 (cust_num-BINS(weight, capacity))
+
34 
+
35 /*===========================================================================*/
+
36 
+
37 #endif
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpModel_8h.html b/Doxygen/0.94/VrpModel_8h.html new file mode 100644 index 0000000..52c7f72 --- /dev/null +++ b/Doxygen/0.94/VrpModel_8h.html @@ -0,0 +1,163 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpModel.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
VrpModel.h File Reference
+
+
+
#include <vector>
+#include "BlisModel.h"
+#include "VrpVariable.h"
+#include "VrpCommonTypes.h"
+#include "VrpConstants.h"
+#include "VrpParams.h"
+#include "VrpCutGenerator.h"
+
+ + Include dependency graph for VrpModel.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + + +

+Classes

class  VrpModel
 Model class for VRP. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpModel_8h__dep__incl.map b/Doxygen/0.94/VrpModel_8h__dep__incl.map new file mode 100644 index 0000000..0108ff5 --- /dev/null +++ b/Doxygen/0.94/VrpModel_8h__dep__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/Doxygen/0.94/VrpModel_8h__dep__incl.md5 b/Doxygen/0.94/VrpModel_8h__dep__incl.md5 new file mode 100644 index 0000000..3944d67 --- /dev/null +++ b/Doxygen/0.94/VrpModel_8h__dep__incl.md5 @@ -0,0 +1 @@ +b223515a2b421fc8cb9e56199048d752 \ No newline at end of file diff --git a/Doxygen/0.94/VrpModel_8h__dep__incl.png b/Doxygen/0.94/VrpModel_8h__dep__incl.png new file mode 100644 index 0000000..a775800 Binary files /dev/null and b/Doxygen/0.94/VrpModel_8h__dep__incl.png differ diff --git a/Doxygen/0.94/VrpModel_8h__incl.map b/Doxygen/0.94/VrpModel_8h__incl.map new file mode 100644 index 0000000..79ba91b --- /dev/null +++ b/Doxygen/0.94/VrpModel_8h__incl.map @@ -0,0 +1,44 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/VrpModel_8h__incl.md5 b/Doxygen/0.94/VrpModel_8h__incl.md5 new file mode 100644 index 0000000..5a7ecb1 --- /dev/null +++ b/Doxygen/0.94/VrpModel_8h__incl.md5 @@ -0,0 +1 @@ +f3b5ebad564ec09c43e59fe6797ef483 \ No newline at end of file diff --git a/Doxygen/0.94/VrpModel_8h__incl.png b/Doxygen/0.94/VrpModel_8h__incl.png new file mode 100644 index 0000000..8bc2b53 Binary files /dev/null and b/Doxygen/0.94/VrpModel_8h__incl.png differ diff --git a/Doxygen/0.94/VrpModel_8h_source.html b/Doxygen/0.94/VrpModel_8h_source.html new file mode 100644 index 0000000..8fb090a --- /dev/null +++ b/Doxygen/0.94/VrpModel_8h_source.html @@ -0,0 +1,308 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpModel.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
VrpModel.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of a solver for the Vehicle Routing Problem *
+
3  * developed using the BiCePS Linear Integer Solver (BLIS). *
+
4  * *
+
5  * This solver is distributed under the Eclipse Public License as part of *
+
6  * the COIN-OR repository (http://www.coin-or.org). *
+
7  * *
+
8  * Authors: Yan Xu, Lehigh University *
+
9  * Ted Ralphs, Lehigh University *
+
10  * *
+
11  * Copyright (C) 2007 Yan Xu and Ted Ralphs. *
+
12  * All Rights Reserved. *
+
13  *===========================================================================*/
+
14 
+
15 #ifndef VrpModel_h_
+
16 #define VrpModel_h_
+
17 
+
18 //#############################################################################
+
19 
+
20 #include <vector>
+
21 
+
22 #include "BlisModel.h"
+
23 #include "VrpVariable.h"
+
24 #include "VrpCommonTypes.h"
+
25 #include "VrpConstants.h"
+
26 #include "VrpParams.h"
+
27 #include "VrpCutGenerator.h"
+
28 
+
29 //#############################################################################
+
30 
+
32 class VrpModel : public BlisModel
+
33 {
+
34 
+
35  friend class VrpCutGenerator;
+
36  friend class VrpSolution;
+
37 
+
38  private:
+
39 
+
40  char name_[100];
+
41  int vertnum_;
+
42  int edgenum_;
+
43  int numroutes_;
+
44  int depot_;
+
45  int capacity_;
+
46  int wtype_;
+
47  int *demand_; /*vertnum_*/
+
48  int *posx_; /*vertnum_*/
+
49  int *posy_; /*vertnum_*/
+
50  double *coordx_; /*vertnum_*/
+
51  double *coordy_; /*vertnum_*/
+
52  double *coordz_; /*vertnum_*/
+
53  double etol_;
+
54 
+
55  VrpParams *VrpPar_;
+
56  VrpNetwork *n_; /* Allocate when readInstance (no data filled in). */
+
57 
+
58  // edges_ hold the same elements as variables_ does, do not free memory.
+
59  // For parallel, reinsert elements in variables_ to edges_
+
60  std::vector<VrpVariable *> edges_;
+
61 
+
62 protected:
+
63 
+
68  void setModelData();
+
69 
+
70 public:
+
71 
+
73  VrpModel() : vertnum_(0), edgenum_(0), numroutes_(0), depot_(0),
+
74  capacity_(0), wtype_(0), etol_(1e-5){
+
75  demand_ = 0;
+
76  posx_ = 0;
+
77  posy_ = 0;
+
78  coordx_ = 0;
+
79  coordy_ = 0;
+
80  coordz_ = 0;
+
81  n_ = 0;
+
82  VrpPar_ = new VrpParams;
+
83 
+
84  AlpsPar()->setEntry(AlpsParams::searchStrategy,
+
85  AlpsSearchTypeBestFirst);
+
86  AlpsPar()->setEntry(AlpsParams::staticBalanceScheme, 1); // Spiral
+
87  AlpsPar()->setEntry(AlpsParams::nodeLogInterval, 20);
+
88  BlisPar()->setEntry(BlisParams::branchStrategy,
+
89  BlisBranchingStrategyStrong);
+
90 
+
91  BlisPar()->setEntry(BlisParams::branchStrategyRampUp,
+
92  BlisBranchingStrategyStrong);
+
93 
+
94  BlisPar()->setEntry(BlisParams::cutCliqueStrategy,BlisCutStrategyNone);
+
95  BlisPar()->setEntry(BlisParams::cutFlowCoverStrategy,
+
96  BlisCutStrategyNone);
+
97  BlisPar()->setEntry(BlisParams::cutGomoryStrategy,BlisCutStrategyNone);
+
98  BlisPar()->setEntry(BlisParams::cutKnapsackStrategy,BlisCutStrategyNone);
+
99  BlisPar()->setEntry(BlisParams::cutMirStrategy,BlisCutStrategyNone);
+
100  BlisPar()->setEntry(BlisParams::cutOddHoleStrategy,BlisCutStrategyNone);
+
101  BlisPar()->setEntry(BlisParams::cutProbingStrategy,BlisCutStrategyNone);
+
102  BlisPar()->setEntry(BlisParams::cutTwoMirStrategy,BlisCutStrategyNone);
+
103  BlisPar()->setEntry(BlisParams::heurRoundStrategy, BlisHeurStrategyNone);
+
104 
+
105  // Cuts as formulation
+
106  BlisPar()->setEntry(BlisParams::cutFactor, ALPS_DBL_MAX);
+
107  BlisPar()->setEntry(BlisParams::cutPass, ALPS_INT_MAX);
+
108  BlisPar()->setEntry(BlisParams::tailOff, -1000.0);
+
109  BlisPar()->setEntry(BlisParams::denseConFactor, ALPS_DBL_MAX);
+
110 
+
111  // Seed
+
112  CoinSeedRandom(1234567);
+
113  }
+
114 
+
116  virtual ~VrpModel() {
+
117  delete [] demand_; demand_ = 0;
+
118  delete [] posx_; posx_ = 0;
+
119  delete [] posy_; posy_ = 0;
+
120  delete [] coordx_; coordx_ = 0;
+
121  delete [] coordy_; coordy_ = 0;
+
122  delete [] coordz_; coordz_ = 0;
+
123  delete VrpPar_; VrpPar_ = 0;
+
124  delete n_; n_ = 0;
+
125  }
+
126 
+
136  virtual void readInstance(const char* dateFile);
+
137 
+
139  virtual void readParameters(const int argnum, const char * const *arglist);
+
140 
+
149  virtual BlisSolution * userFeasibleSolution(const double *solution,
+
150  bool &userFeasible);
+
151 
+
152  int index (int v0, int v1) {
+
153  return(v0 < v1 ? v1*(v1 - 1)/2 + v0 : v0*(v0 - 1)/2 + v1);
+
154  }
+
155 
+
156  int computeCost(int v0, int v1);
+
157 
+
158  int getNumVertices() { return vertnum_; }
+
159 
+
160  int getNumEdges() { return edgenum_; }
+
161 
+
162  std::vector<VrpVariable *> getEdgeList() { return edges_; }
+
163 
+
164  // Transform dense solution to a sparse vector.
+
165  CoinPackedVector *getSolution(const double *denseSol);
+
166 
+
167  void createNet(CoinPackedVector *vec);
+
168 
+
170  virtual void registerKnowledge();
+
171 
+
173  AlpsReturnStatus encodeVrp(AlpsEncoded *encoded) const;
+
174 
+
176  AlpsReturnStatus decodeVrp(AlpsEncoded &encoded);
+
177 
+
179  virtual AlpsEncoded* encode() const;
+
180 
+
182  virtual void decodeToSelf(AlpsEncoded&);
+
183 
+
184 };
+
185 
+
186 //#############################################################################
+
187 
+
188 #endif
+
+
BlisSolution
This class contains the solutions generated by the LP solver (either primal or dual.
Definition: BlisSolution.h:36
+
VrpNetwork
Definition: VrpNetwork.h:80
+
VrpModel::index
int index(int v0, int v1)
Definition: VrpModel.h:152
+
VrpModel::demand_
int * demand_
Definition: VrpModel.h:47
+
BlisHeurStrategyNone
@ BlisHeurStrategyNone
Definition: Blis.h:79
+
BlisParams::branchStrategy
@ branchStrategy
Branching strategy.
Definition: BlisParams.h:71
+
BlisParams::cutOddHoleStrategy
@ cutOddHoleStrategy
Definition: BlisParams.h:91
+
VrpParams
Definition: VrpParams.h:24
+
VrpModel::posy_
int * posy_
Definition: VrpModel.h:49
+
BlisParams::cutTwoMirStrategy
@ cutTwoMirStrategy
Definition: BlisParams.h:93
+
VrpModel::readInstance
virtual void readInstance(const char *dateFile)
For parallel code, only the master calls this function.
+
BlisModel
Definition: BlisModel.h:69
+
VrpSolution
This class contains a vrp solution.
Definition: VrpSolution.h:26
+
VrpModel::coordx_
double * coordx_
Definition: VrpModel.h:50
+
BlisParams::cutGomoryStrategy
@ cutGomoryStrategy
Definition: BlisParams.h:87
+
BlisParams::cutProbingStrategy
@ cutProbingStrategy
Definition: BlisParams.h:92
+
VrpModel::~VrpModel
virtual ~VrpModel()
Destructor.
Definition: VrpModel.h:116
+
BlisParams::cutPass
@ cutPass
Definition: BlisParams.h:83
+
BlisParams::cutFactor
@ cutFactor
Limit the max number cuts applied at a node.
Definition: BlisParams.h:136
+
VrpModel::capacity_
int capacity_
Definition: VrpModel.h:45
+
VrpModel::encodeVrp
AlpsReturnStatus encodeVrp(AlpsEncoded *encoded) const
Pack Vrp portion of the model into an encoded object.
+
BlisParams::setEntry
void setEntry(const chrParams key, const char *val)
char* is true(1) or false(0), not used
Definition: BlisParams.h:252
+
BlisModel.h
+
VrpModel::VrpModel
VrpModel()
Default construtor.
Definition: VrpModel.h:73
+
VrpModel::readParameters
virtual void readParameters(const int argnum, const char *const *arglist)
Read in Alps, Blis, Vrp parameters.
+
BlisParams::cutKnapsackStrategy
@ cutKnapsackStrategy
Definition: BlisParams.h:89
+
VrpModel::n_
VrpNetwork * n_
Definition: VrpModel.h:56
+
VrpModel::etol_
double etol_
Definition: VrpModel.h:53
+
VrpCommonTypes.h
+
VrpModel::numroutes_
int numroutes_
Definition: VrpModel.h:43
+
VrpModel::VrpPar_
VrpParams * VrpPar_
Definition: VrpModel.h:55
+
VrpModel::computeCost
int computeCost(int v0, int v1)
+
VrpModel::userFeasibleSolution
virtual BlisSolution * userFeasibleSolution(const double *solution, bool &userFeasible)
User's criteria for a feasible solution.
+
BlisParams::cutFlowCoverStrategy
@ cutFlowCoverStrategy
Definition: BlisParams.h:88
+
BlisParams::branchStrategyRampUp
@ branchStrategyRampUp
Definition: BlisParams.h:72
+
VrpModel::vertnum_
int vertnum_
Definition: VrpModel.h:41
+
VrpModel::coordy_
double * coordy_
Definition: VrpModel.h:51
+
BlisCutStrategyNone
@ BlisCutStrategyNone
Definition: Blis.h:71
+
VrpCutGenerator
Definition: VrpCutGenerator.h:34
+
BlisParams::cutCliqueStrategy
@ cutCliqueStrategy
The pass to generate cuts for quick branching.
Definition: BlisParams.h:86
+
VrpModel::edges_
std::vector< VrpVariable * > edges_
Definition: VrpModel.h:60
+
VrpModel::decodeVrp
AlpsReturnStatus decodeVrp(AlpsEncoded &encoded)
Unpack Vrp portion of the model from an encoded object.
+
VrpModel::getNumVertices
int getNumVertices()
Definition: VrpModel.h:158
+
BlisParams::denseConFactor
@ denseConFactor
Dense constraint factor.
Definition: BlisParams.h:145
+
VrpVariable.h
+
BlisParams::heurRoundStrategy
@ heurRoundStrategy
Definition: BlisParams.h:114
+
VrpModel::depot_
int depot_
Definition: VrpModel.h:44
+
VrpModel::createNet
void createNet(CoinPackedVector *vec)
+
VrpConstants.h
+
VrpModel::getSolution
CoinPackedVector * getSolution(const double *denseSol)
+
VrpModel::name_
char name_[100]
Definition: VrpModel.h:40
+
BlisParams::cutMirStrategy
@ cutMirStrategy
Definition: BlisParams.h:90
+
BlisParams::tailOff
@ tailOff
Tail off.
Definition: BlisParams.h:168
+
VrpModel::posx_
int * posx_
Definition: VrpModel.h:48
+
VrpParams.h
+
VrpModel::registerKnowledge
virtual void registerKnowledge()
Register knowledge.
+
BlisBranchingStrategyStrong
@ BlisBranchingStrategyStrong
Definition: Blis.h:106
+
VrpModel::setModelData
void setModelData()
1) Set colMatrix_, varLB_, varUB_, conLB_, conUB, numCols_, numRows_ 2) Set objCoef_ and objSense_ 3)...
+
BlisModel::BlisPar
BlisParams * BlisPar()
Access parameters.
Definition: BlisModel.h:846
+
VrpParams::setEntry
void setEntry(const boolParams key, const char *val)
char* is true(1) or false(0), not used
Definition: VrpParams.h:130
+
VrpCutGenerator.h
+
VrpModel::getNumEdges
int getNumEdges()
Definition: VrpModel.h:160
+
VrpModel::edgenum_
int edgenum_
Definition: VrpModel.h:42
+
VrpModel::decodeToSelf
virtual void decodeToSelf(AlpsEncoded &)
The method that decodes the model from an encoded object.
+
VrpModel
Model class for VRP.
Definition: VrpModel.h:32
+
VrpModel::encode
virtual AlpsEncoded * encode() const
The method that encodes the model into an encoded object.
+
VrpModel::getEdgeList
std::vector< VrpVariable * > getEdgeList()
Definition: VrpModel.h:162
+
VrpModel::coordz_
double * coordz_
Definition: VrpModel.h:52
+
VrpModel::wtype_
int wtype_
Definition: VrpModel.h:46
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpNetwork_8h.html b/Doxygen/0.94/VrpNetwork_8h.html new file mode 100644 index 0000000..953144d --- /dev/null +++ b/Doxygen/0.94/VrpNetwork_8h.html @@ -0,0 +1,285 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpNetwork.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes | +Macros | +Typedefs
+
+
VrpNetwork.h File Reference
+
+
+
#include <vector>
+#include "CoinPackedVector.hpp"
+#include "VrpConstants.h"
+#include "VrpVariable.h"
+
+ + Include dependency graph for VrpNetwork.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + + + + + + + +

+Classes

struct  EDGE
 
struct  ELIST
 
struct  VERTEX
 
class  VrpNetwork
 
+ + + + + + + +

+Macros

#define OTHER_END(cur_edge, v)   (cur_edge->data->v0 == v) ? cur_edge->data->v1 : cur_edge->data->v0
 
#define MIN(x, y)   (x < y ? x : y)
 
#define MAX(x, y)   (x > y ? x : y)
 
+ + + + + + + +

+Typedefs

typedef struct EDGE edge
 
typedef struct ELIST elist
 
typedef struct VERTEX vertex
 
+

Macro Definition Documentation

+ +

◆ OTHER_END

+ +
+
+ + + + + + + + + + + + + + + + + + +
#define OTHER_END( cur_edge,
 v 
)   (cur_edge->data->v0 == v) ? cur_edge->data->v1 : cur_edge->data->v0
+
+ +

Definition at line 26 of file VrpNetwork.h.

+ +
+
+ +

◆ MIN

+ +
+
+ + + + + + + + + + + + + + + + + + +
#define MIN( x,
 y 
)   (x < y ? x : y)
+
+ +

Definition at line 30 of file VrpNetwork.h.

+ +
+
+ +

◆ MAX

+ +
+
+ + + + + + + + + + + + + + + + + + +
#define MAX( x,
 y 
)   (x > y ? x : y)
+
+ +

Definition at line 34 of file VrpNetwork.h.

+ +
+
+

Typedef Documentation

+ +

◆ edge

+ +
+
+ + + + +
typedef struct EDGE edge
+
+ +
+
+ +

◆ elist

+ +
+
+ + + + +
typedef struct ELIST elist
+
+ +
+
+ +

◆ vertex

+ +
+
+ + + + +
typedef struct VERTEX vertex
+
+ +
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpNetwork_8h__dep__incl.map b/Doxygen/0.94/VrpNetwork_8h__dep__incl.map new file mode 100644 index 0000000..7fbe77b --- /dev/null +++ b/Doxygen/0.94/VrpNetwork_8h__dep__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/Doxygen/0.94/VrpNetwork_8h__dep__incl.md5 b/Doxygen/0.94/VrpNetwork_8h__dep__incl.md5 new file mode 100644 index 0000000..3aa348a --- /dev/null +++ b/Doxygen/0.94/VrpNetwork_8h__dep__incl.md5 @@ -0,0 +1 @@ +34c8978aebeb93bc984bb4ab266ea457 \ No newline at end of file diff --git a/Doxygen/0.94/VrpNetwork_8h__dep__incl.png b/Doxygen/0.94/VrpNetwork_8h__dep__incl.png new file mode 100644 index 0000000..e83d820 Binary files /dev/null and b/Doxygen/0.94/VrpNetwork_8h__dep__incl.png differ diff --git a/Doxygen/0.94/VrpNetwork_8h__incl.map b/Doxygen/0.94/VrpNetwork_8h__incl.map new file mode 100644 index 0000000..3fcb482 --- /dev/null +++ b/Doxygen/0.94/VrpNetwork_8h__incl.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/Doxygen/0.94/VrpNetwork_8h__incl.md5 b/Doxygen/0.94/VrpNetwork_8h__incl.md5 new file mode 100644 index 0000000..31fe01a --- /dev/null +++ b/Doxygen/0.94/VrpNetwork_8h__incl.md5 @@ -0,0 +1 @@ +0921342140adc260398042cf014ad7c5 \ No newline at end of file diff --git a/Doxygen/0.94/VrpNetwork_8h__incl.png b/Doxygen/0.94/VrpNetwork_8h__incl.png new file mode 100644 index 0000000..742d4b7 Binary files /dev/null and b/Doxygen/0.94/VrpNetwork_8h__incl.png differ diff --git a/Doxygen/0.94/VrpNetwork_8h_source.html b/Doxygen/0.94/VrpNetwork_8h_source.html new file mode 100644 index 0000000..cc8fe8d --- /dev/null +++ b/Doxygen/0.94/VrpNetwork_8h_source.html @@ -0,0 +1,285 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpNetwork.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
VrpNetwork.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of a solver for the Vehicle Routing Problem *
+
3  * developed using the BiCePS Linear Integer Solver (BLIS). *
+
4  * *
+
5  * This solver is distributed under the Eclipse Public License as part of *
+
6  * the COIN-OR repository (http://www.coin-or.org). *
+
7  * *
+
8  * Authors: Yan Xu, Lehigh University *
+
9  * Ted Ralphs, Lehigh University *
+
10  * *
+
11  * Copyright (C) 2007 Yan Xu and Ted Ralphs. *
+
12  * All Rights Reserved. *
+
13  *===========================================================================*/
+
14 
+
15 #ifndef VrpNetwork_h_
+
16 #define VrpNetwork_h_
+
17 
+
18 #include <vector>
+
19 
+
20 #include "CoinPackedVector.hpp"
+
21 #include "VrpConstants.h"
+
22 #include "VrpVariable.h"
+
23 
+
24 //#############################################################################
+
25 
+
26 #define OTHER_END(cur_edge, v) \
+
27  (cur_edge->data->v0 == v) ? cur_edge->data->v1 : cur_edge->data->v0
+
28 
+
29 #ifndef MIN
+
30 #define MIN(x, y) (x < y ? x : y)
+
31 #endif
+
32 
+
33 #ifndef MAX
+
34 #define MAX(x, y) (x > y ? x : y)
+
35 #endif
+
36 
+
37 /*-----------------------------------------------------------------------*\
+
38 | These are data tructures used in constructing the solution graph used |
+
39 | by the cut generator to locate cuts. The graph is stored using |
+
40 | adjacency lists |
+
41 \*-----------------------------------------------------------------------*/
+
42 
+
43 typedef struct EDGE{
+
44  int v0;
+
45  int v1;
+
46  int cost;
+
47  double weight;
+
48  bool scanned;
+
49  bool tree_edge;
+
50  bool deleted;
+
51 }edge;
+
52 
+
53 typedef struct ELIST{
+
54  struct ELIST *next_edge; /* next edge in the edgelist */
+
55  struct EDGE *data; /* the data of the edge */
+
56  int other_end; /* the other end of the edge */
+
57  struct VERTEX *other;
+
58 }elist;
+
59 
+
60 typedef struct VERTEX{
+
61  int enodenum; /* the node number in the contracted graph */
+
62  int orignodenum;/* the node number in the original graph */
+
63  struct ELIST *first; /* points to the first edge in the adjacency list */
+
64  struct ELIST *last; /* points to the last edge in the adjacency list */
+
65  int comp; /* contains the component number if the graph is
+
66  disconnected */
+
67  bool scanned;
+
68  int demand; /* contains the demand for this node */
+
69  int degree; /* contains the degree of the node in the graph */
+
70  int orig_node_list_size;
+
71  int *orig_node_list; /* contains a list of the nodes that have been
+
72  contracted into this node to make a
+
73  "super node" */
+
74  int dfnumber;
+
75  int low;
+
76  bool is_art_point;
+
77  bool deleted;
+
78 }vertex;
+
79 
+
80 class VrpNetwork{
+
81 
+
82  friend class VrpModel;
+
83  friend class VrpCutGenerator;
+
84  friend class VrpSolution;
+
85 
+
86  private:
+
87 
+
88  int edgenum_; /* the number of edges in the graph */
+
89  int maxEdgenum_; /* the number of edges allocated */
+
90  int vertnum_; /* the number of vertices in the graph */
+
91  bool isIntegral_; /* indicates whether the graph is integral or
+
92  not */
+
93  int numComps_; /* number of components */
+
94  struct EDGE *edges_; /* the list of edges in the graph */
+
95  struct VERTEX *verts_; /* the list of vertices */
+
96  double mincut_; /* the value of the current mincut */
+
97  struct ELIST *adjList_; /* the array containing the adajacency lists
+
98  for each node */
+
99  int *compNodes_; /* number of nodes in each component */
+
100  int *compDemands_; /* demand in each component */
+
101  double *compCuts_; /* weight of cprresponding cut */
+
102  int *compMembers_; /* which component each vertex belongs to */
+
103  int *newDemand_; /* the amounts of demand for each node to add
+
104  when the network is contracted */
+
105 
+
106  public:
+
107 
+
108  VrpNetwork() : edgenum_(0), vertnum_(0), isIntegral_(false), mincut_(0){
+
109  adjList_ = 0;
+
110  edges_ = 0;
+
111  verts_ = 0;
+
112  compNodes_ = 0;
+
113  compDemands_ = 0;
+
114  compCuts_ = 0;
+
115  compMembers_ = 0;
+
116  newDemand_ = 0;
+
117  }
+
118 
+
119  VrpNetwork(int edgenum, int vertnum);
+
120 
+
121  virtual ~VrpNetwork() {
+
122  gutsOfDestructor();
+
123  }
+
124 
+
125  void createNet(CoinPackedVector *sol, int *demand,
+
126  std::vector<VrpVariable *> edgeList, double etol,
+
127  int vertnum);
+
128 
+
129  void computeCompNums(vertex *v, int parent_comp, int *num_comps,
+
130  bool parent_is_art_point);
+
131 
+
132  void depthFirstSearch(vertex *v, int *count1, int *count2);
+
133 
+
134  int connected();
+
135 
+
136  int biconnected();
+
137 
+
138  void reduce_graph(double etol);
+
139 
+
140  void gutsOfDestructor();
+
141 
+
142 };
+
143 
+
144 #endif
+
+
VrpNetwork::connected
int connected()
+
EDGE
Definition: VrpNetwork.h:43
+
VrpNetwork
Definition: VrpNetwork.h:80
+
VERTEX::first
struct ELIST * first
Definition: VrpNetwork.h:63
+
VERTEX
Definition: VrpNetwork.h:60
+
VrpNetwork::vertnum_
int vertnum_
Definition: VrpNetwork.h:90
+
VrpNetwork::newDemand_
int * newDemand_
Definition: VrpNetwork.h:103
+
VERTEX::dfnumber
int dfnumber
Definition: VrpNetwork.h:74
+
VrpNetwork::mincut_
double mincut_
Definition: VrpNetwork.h:96
+
EDGE::weight
double weight
Definition: VrpNetwork.h:47
+
EDGE::deleted
bool deleted
Definition: VrpNetwork.h:50
+
VERTEX::demand
int demand
Definition: VrpNetwork.h:68
+
VrpSolution
This class contains a vrp solution.
Definition: VrpSolution.h:26
+
VrpNetwork::numComps_
int numComps_
Definition: VrpNetwork.h:93
+
VERTEX::last
struct ELIST * last
Definition: VrpNetwork.h:64
+
VrpNetwork::biconnected
int biconnected()
+
VERTEX::orig_node_list_size
int orig_node_list_size
Definition: VrpNetwork.h:70
+
elist
struct ELIST elist
+
EDGE::v1
int v1
Definition: VrpNetwork.h:45
+
VrpNetwork::edges_
struct EDGE * edges_
Definition: VrpNetwork.h:94
+
vertex
struct VERTEX vertex
+
VERTEX::is_art_point
bool is_art_point
Definition: VrpNetwork.h:76
+
VrpNetwork::depthFirstSearch
void depthFirstSearch(vertex *v, int *count1, int *count2)
+
edge
struct EDGE edge
+
VrpNetwork::compDemands_
int * compDemands_
Definition: VrpNetwork.h:100
+
EDGE::cost
int cost
Definition: VrpNetwork.h:46
+
VERTEX::deleted
bool deleted
Definition: VrpNetwork.h:77
+
VrpCutGenerator
Definition: VrpCutGenerator.h:34
+
VERTEX::low
int low
Definition: VrpNetwork.h:75
+
VrpNetwork::computeCompNums
void computeCompNums(vertex *v, int parent_comp, int *num_comps, bool parent_is_art_point)
+
ELIST::other_end
int other_end
Definition: VrpNetwork.h:56
+
VrpVariable.h
+
VERTEX::comp
int comp
Definition: VrpNetwork.h:65
+
VrpNetwork::maxEdgenum_
int maxEdgenum_
Definition: VrpNetwork.h:89
+
VrpNetwork::compCuts_
double * compCuts_
Definition: VrpNetwork.h:101
+
VERTEX::degree
int degree
Definition: VrpNetwork.h:69
+
ELIST::next_edge
struct ELIST * next_edge
Definition: VrpNetwork.h:54
+
EDGE::scanned
bool scanned
Definition: VrpNetwork.h:48
+
VrpConstants.h
+
ELIST
Definition: VrpNetwork.h:53
+
VERTEX::orig_node_list
int * orig_node_list
Definition: VrpNetwork.h:71
+
VrpNetwork::createNet
void createNet(CoinPackedVector *sol, int *demand, std::vector< VrpVariable * > edgeList, double etol, int vertnum)
+
VrpNetwork::gutsOfDestructor
void gutsOfDestructor()
+
VrpNetwork::isIntegral_
bool isIntegral_
Definition: VrpNetwork.h:91
+
VrpNetwork::verts_
struct VERTEX * verts_
Definition: VrpNetwork.h:95
+
VrpNetwork::VrpNetwork
VrpNetwork()
Definition: VrpNetwork.h:108
+
ELIST::data
struct EDGE * data
Definition: VrpNetwork.h:55
+
VERTEX::enodenum
int enodenum
Definition: VrpNetwork.h:61
+
VrpNetwork::reduce_graph
void reduce_graph(double etol)
+
VERTEX::scanned
bool scanned
Definition: VrpNetwork.h:67
+
VrpNetwork::~VrpNetwork
virtual ~VrpNetwork()
Definition: VrpNetwork.h:121
+
EDGE::v0
int v0
Definition: VrpNetwork.h:44
+
VrpNetwork::compMembers_
int * compMembers_
Definition: VrpNetwork.h:102
+
VrpModel
Model class for VRP.
Definition: VrpModel.h:32
+
VERTEX::orignodenum
int orignodenum
Definition: VrpNetwork.h:62
+
VrpNetwork::compNodes_
int * compNodes_
Definition: VrpNetwork.h:99
+
VrpNetwork::adjList_
struct ELIST * adjList_
Definition: VrpNetwork.h:97
+
ELIST::other
struct VERTEX * other
Definition: VrpNetwork.h:57
+
VrpNetwork::edgenum_
int edgenum_
Definition: VrpNetwork.h:88
+
EDGE::tree_edge
bool tree_edge
Definition: VrpNetwork.h:49
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpParams_8h.html b/Doxygen/0.94/VrpParams_8h.html new file mode 100644 index 0000000..d6c83f5 --- /dev/null +++ b/Doxygen/0.94/VrpParams_8h.html @@ -0,0 +1,119 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpParams.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
VrpParams.h File Reference
+
+
+
#include "AlpsKnowledge.h"
+#include "AlpsParameterBase.h"
+
+ + Include dependency graph for VrpParams.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + +

+Classes

class  VrpParams
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpParams_8h__dep__incl.map b/Doxygen/0.94/VrpParams_8h__dep__incl.map new file mode 100644 index 0000000..f0e8143 --- /dev/null +++ b/Doxygen/0.94/VrpParams_8h__dep__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/Doxygen/0.94/VrpParams_8h__dep__incl.md5 b/Doxygen/0.94/VrpParams_8h__dep__incl.md5 new file mode 100644 index 0000000..985b0ab --- /dev/null +++ b/Doxygen/0.94/VrpParams_8h__dep__incl.md5 @@ -0,0 +1 @@ +994e2bdd1b3fbb8d98ce336b9d812ce2 \ No newline at end of file diff --git a/Doxygen/0.94/VrpParams_8h__dep__incl.png b/Doxygen/0.94/VrpParams_8h__dep__incl.png new file mode 100644 index 0000000..44ab493 Binary files /dev/null and b/Doxygen/0.94/VrpParams_8h__dep__incl.png differ diff --git a/Doxygen/0.94/VrpParams_8h__incl.map b/Doxygen/0.94/VrpParams_8h__incl.map new file mode 100644 index 0000000..efdd2fd --- /dev/null +++ b/Doxygen/0.94/VrpParams_8h__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/VrpParams_8h__incl.md5 b/Doxygen/0.94/VrpParams_8h__incl.md5 new file mode 100644 index 0000000..49e46aa --- /dev/null +++ b/Doxygen/0.94/VrpParams_8h__incl.md5 @@ -0,0 +1 @@ +bccbf180f135a64f6085c2ab0d69baf5 \ No newline at end of file diff --git a/Doxygen/0.94/VrpParams_8h__incl.png b/Doxygen/0.94/VrpParams_8h__incl.png new file mode 100644 index 0000000..aad6572 Binary files /dev/null and b/Doxygen/0.94/VrpParams_8h__incl.png differ diff --git a/Doxygen/0.94/VrpParams_8h_source.html b/Doxygen/0.94/VrpParams_8h_source.html new file mode 100644 index 0000000..998b24f --- /dev/null +++ b/Doxygen/0.94/VrpParams_8h_source.html @@ -0,0 +1,265 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpParams.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
VrpParams.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of a solver for the Vehicle Routing Problem *
+
3  * developed using the BiCePS Linear Integer Solver (BLIS). *
+
4  * *
+
5  * This solver is distributed under the Eclipse Public License as part of *
+
6  * the COIN-OR repository (http://www.coin-or.org). *
+
7  * *
+
8  * Authors: Yan Xu, Lehigh University *
+
9  * Ted Ralphs, Lehigh University *
+
10  * *
+
11  * Copyright (C) 2007 Yan Xu and Ted Ralphs. *
+
12  * All Rights Reserved. *
+
13  *===========================================================================*/
+
14 
+
15 #ifndef VrpParams_h
+
16 #define VrpParams_h
+
17 
+
18 #include "AlpsKnowledge.h"
+
19 #include "AlpsParameterBase.h"
+
20 
+
21 //#############################################################################
+
22 
+
23 //** Parameters used in Vrp. */
+
24 class VrpParams : public AlpsParameterSet {
+
25  public:
+
28  enum boolParams{
+
29  doGreedy,
+
30  doExtraInRoot,
+
31  tspProb,
+
32  endOfBoolParams
+
33  };
+
34 
+
36  enum intParams{
+
37  numRoutes,
+
38  verbosity,
+
39  greedyNumTrials,
+
40  whichConnectedRoutine,
+
41  maxNumCutsInShrink,
+
42  whichTspCuts,
+
43  endOfIntParams
+
44  };
+
45 
+
47  enum dblParams{
+
49  endOfDblParams
+
50  };
+
51 
+
53  enum strParams{
+
54  strDummy,
+
55  //
+
56  endOfStrParams
+
57  };
+
58 
+
60  enum strArrayParams{
+
61  strArrayDummy,
+
63  endOfStrArrayParams
+
64  };
+
65 
+
66  public:
+
72  VrpParams() :
+
73  AlpsParameterSet(
+
74  static_cast<int>(endOfBoolParams),
+
75  static_cast<int>(endOfIntParams),
+
76  static_cast<int>(endOfDblParams),
+
77  static_cast<int>(endOfStrParams),
+
78  static_cast<int>(endOfStrArrayParams)
+
79  )
+
80  {
+
81  createKeywordList();
+
82  setDefaultEntries();
+
83  }
+
88  virtual void createKeywordList();
+
90  virtual void setDefaultEntries();
+
94  public:
+
95  //===========================================================================
+
103  //===========================================================================
+
104 
+
105 
+
114  inline bool entry(const boolParams key) const { return bpar_[key]; }
+
117  inline int entry(const intParams key) const { return ipar_[key]; }
+
119  inline double entry(const dblParams key) const { return dpar_[key]; }
+
121  inline const std::string&
+
122  entry(const strParams key) const { return spar_[key]; }
+
124  inline const std::vector<std::string>&
+
125  entry(const strArrayParams key) const { return sapar_[key]; }
+
128  //---------------------------------------------------------------------------
+
130  void setEntry(const boolParams key, const char * val) {
+
131  bpar_[key] = atoi(val) ? true : false; }
+
133  void setEntry(const boolParams key, const char val) {
+
134  bpar_[key] = val ? true : false; }
+
136  void setEntry(const boolParams key, const bool val) {
+
137  bpar_[key] = val; }
+
139  void setEntry(const intParams key, const char * val) {
+
140  ipar_[key] = atoi(val); }
+
142  void setEntry(const intParams key, const int val) {
+
143  ipar_[key] = val; }
+
145  void setEntry(const dblParams key, const char * val) {
+
146  dpar_[key] = atof(val); }
+
148  void setEntry(const dblParams key, const double val) {
+
149  dpar_[key] = val; }
+
151  void setEntry(const strParams key, const char * val) {
+
152  spar_[key] = val; }
+
154  void setEntry(const strArrayParams key, const char *val) {
+
155  sapar_[key].push_back(val); }
+
156 
+
157  //---------------------------------------------------------------------------
+
158 
+
163  void pack(AlpsEncoded& buf) {
+
164  buf.writeRep(bpar_, endOfBoolParams)
+
165  .writeRep(ipar_, endOfIntParams)
+
166  .writeRep(dpar_, endOfDblParams);
+
167  for (int i = 0; i < endOfStrParams; ++i)
+
168  buf.writeRep(spar_[i]);
+
169  for (int i = 0; i < endOfStrArrayParams; ++i) {
+
170  buf.writeRep(sapar_[i].size());
+
171  for (size_t j = 0; j < sapar_[i].size(); ++j)
+
172  buf.writeRep(sapar_[i][j]);
+
173  }
+
174  }
+
176  void unpack(AlpsEncoded& buf) {
+
177  int dummy;
+
178  // No need to allocate the arrays, they are of fixed length
+
179  dummy = static_cast<int>(endOfBoolParams);
+
180  buf.readRep(bpar_, dummy, false);
+
181  dummy = static_cast<int>(endOfIntParams);
+
182  buf.readRep(ipar_, dummy, false);
+
183  dummy = static_cast<int>(endOfDblParams);
+
184  buf.readRep(dpar_, dummy, false);
+
185  for (int i = 0; i < endOfStrParams; ++i)
+
186  buf.readRep(spar_[i]);
+
187  for (int i = 0; i < endOfStrArrayParams; ++i) {
+
188  size_t str_size;
+
189  buf.readRep(str_size);
+
190  sapar_[i].reserve(str_size);
+
191  for (size_t j = 0; j < str_size; ++j){
+
192  // sapar_[i].unchecked_push_back(std::string());
+
193  sapar_[i].push_back(std::string());
+
194  buf.readRep(sapar_[i].back());
+
195  }
+
196  }
+
197  }
+
200 };
+
201 
+
202 #endif
+
+
VrpParams::intParams
intParams
Integer paramters.
Definition: VrpParams.h:36
+
VrpParams::entry
int entry(const intParams key) const
Definition: VrpParams.h:117
+
VrpParams::createKeywordList
virtual void createKeywordList()
Method for creating the list of keyword looked for in the parameter file.
+
VrpParams::strParams
strParams
String parameters.
Definition: VrpParams.h:53
+
VrpParams::entry
const std::string & entry(const strParams key) const
Definition: VrpParams.h:122
+
VrpParams
Definition: VrpParams.h:24
+
VrpParams::whichConnectedRoutine
@ whichConnectedRoutine
Definition: VrpParams.h:40
+
VrpParams::setEntry
void setEntry(const strArrayParams key, const char *val)
Definition: VrpParams.h:154
+
VrpParams::strArrayParams
strArrayParams
There are no string array parameters.
Definition: VrpParams.h:60
+
VrpParams::setEntry
void setEntry(const intParams key, const char *val)
Definition: VrpParams.h:139
+
VrpParams::pack
void pack(AlpsEncoded &buf)
Pack the parameter set into the buffer (AlpsEncoded is used as buffer Here).
Definition: VrpParams.h:163
+
VrpParams::greedyNumTrials
@ greedyNumTrials
Definition: VrpParams.h:39
+
VrpParams::numRoutes
@ numRoutes
Definition: VrpParams.h:37
+
VrpParams::maxNumCutsInShrink
@ maxNumCutsInShrink
Definition: VrpParams.h:41
+
VrpParams::endOfStrArrayParams
@ endOfStrArrayParams
Definition: VrpParams.h:63
+
VrpParams::setDefaultEntries
virtual void setDefaultEntries()
Method for setting the default values for the parameters.
+
VrpParams::strArrayDummy
@ strArrayDummy
Definition: VrpParams.h:61
+
VrpParams::setEntry
void setEntry(const strParams key, const char *val)
Definition: VrpParams.h:151
+
VrpParams::VrpParams
VrpParams()
The default constructor creates a parameter set with from the template argument structure.
Definition: VrpParams.h:72
+
VrpParams::entry
double entry(const dblParams key) const
Definition: VrpParams.h:119
+
VrpParams::endOfIntParams
@ endOfIntParams
Definition: VrpParams.h:43
+
VrpParams::endOfStrParams
@ endOfStrParams
Definition: VrpParams.h:56
+
VrpParams::entry
const std::vector< std::string > & entry(const strArrayParams key) const
Definition: VrpParams.h:125
+
VrpParams::endOfDblParams
@ endOfDblParams
Definition: VrpParams.h:49
+
VrpParams::setEntry
void setEntry(const dblParams key, const double val)
Definition: VrpParams.h:148
+
VrpParams::unpack
void unpack(AlpsEncoded &buf)
Unpack the parameter set from the buffer.
Definition: VrpParams.h:176
+
VrpParams::verbosity
@ verbosity
Definition: VrpParams.h:38
+
VrpParams::entry
bool entry(const boolParams key) const
Definition: VrpParams.h:115
+
VrpParams::setEntry
void setEntry(const boolParams key, const bool val)
This method is the one that ever been used.
Definition: VrpParams.h:136
+
VrpParams::doExtraInRoot
@ doExtraInRoot
Definition: VrpParams.h:30
+
VrpParams::setEntry
void setEntry(const boolParams key, const char val)
char is true(1) or false(0), not used
Definition: VrpParams.h:133
+
VrpParams::strDummy
@ strDummy
Definition: VrpParams.h:54
+
VrpParams::setEntry
void setEntry(const boolParams key, const char *val)
char* is true(1) or false(0), not used
Definition: VrpParams.h:130
+
VrpParams::setEntry
void setEntry(const intParams key, const int val)
Definition: VrpParams.h:142
+
VrpParams::boolParams
boolParams
Character parameters.
Definition: VrpParams.h:28
+
VrpParams::setEntry
void setEntry(const dblParams key, const char *val)
Definition: VrpParams.h:145
+
VrpParams::tspProb
@ tspProb
Definition: VrpParams.h:31
+
VrpParams::whichTspCuts
@ whichTspCuts
Definition: VrpParams.h:42
+
VrpParams::doGreedy
@ doGreedy
Definition: VrpParams.h:29
+
VrpParams::endOfBoolParams
@ endOfBoolParams
Definition: VrpParams.h:32
+
VrpParams::dblParams
dblParams
Double parameters.
Definition: VrpParams.h:47
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpSolution_8h.html b/Doxygen/0.94/VrpSolution_8h.html new file mode 100644 index 0000000..95a4c8a --- /dev/null +++ b/Doxygen/0.94/VrpSolution_8h.html @@ -0,0 +1,149 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpSolution.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
VrpSolution.h File Reference
+
+
+
#include "BlisSolution.h"
+#include "VrpModel.h"
+
+ + Include dependency graph for VrpSolution.h:
+
+
+ +
+

Go to the source code of this file.

+ + + + + +

+Classes

class  VrpSolution
 This class contains a vrp solution. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpSolution_8h__incl.map b/Doxygen/0.94/VrpSolution_8h__incl.map new file mode 100644 index 0000000..6ae1821 --- /dev/null +++ b/Doxygen/0.94/VrpSolution_8h__incl.map @@ -0,0 +1,48 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/VrpSolution_8h__incl.md5 b/Doxygen/0.94/VrpSolution_8h__incl.md5 new file mode 100644 index 0000000..9b8f78a --- /dev/null +++ b/Doxygen/0.94/VrpSolution_8h__incl.md5 @@ -0,0 +1 @@ +2467b97e6755ebcb3853a3f04f52ae86 \ No newline at end of file diff --git a/Doxygen/0.94/VrpSolution_8h__incl.png b/Doxygen/0.94/VrpSolution_8h__incl.png new file mode 100644 index 0000000..35d738e Binary files /dev/null and b/Doxygen/0.94/VrpSolution_8h__incl.png differ diff --git a/Doxygen/0.94/VrpSolution_8h_source.html b/Doxygen/0.94/VrpSolution_8h_source.html new file mode 100644 index 0000000..d454d0d --- /dev/null +++ b/Doxygen/0.94/VrpSolution_8h_source.html @@ -0,0 +1,185 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpSolution.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
VrpSolution.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of a solver for the Vehicle Routing Problem *
+
3  * developed using the BiCePS Linear Integer Solver (BLIS). *
+
4  * *
+
5  * This solver is distributed under the Eclipse Public License as part of *
+
6  * the COIN-OR repository (http://www.coin-or.org). *
+
7  * *
+
8  * Authors: Yan Xu, Lehigh University *
+
9  * Ted Ralphs, Lehigh University *
+
10  * *
+
11  * Copyright (C) 2007 Yan Xu and Ted Ralphs. *
+
12  * All Rights Reserved. *
+
13  *===========================================================================*/
+
14 
+
15 #ifndef VrpSolution_h_
+
16 #define VrpSolution_h_
+
17 
+
18 #include "BlisSolution.h"
+
19 
+
20 #include "VrpModel.h"
+
21 
+
22 //#############################################################################
+
24 //#############################################################################
+
25 
+
26 class VrpSolution : public BlisSolution {
+
27 
+
28 protected:
+
29 
+
30  _node *opt_;
+
31 
+
32 public:
+
33 
+
35  VrpSolution() : BlisSolution(), opt_(0)
+
36  {}
+
37 
+
39  VrpSolution(int s, const double *values, double objValue, VrpModel *vrp=0);
+
40 
+
42  virtual ~VrpSolution(){
+
43  delete [] opt_;
+
44  }
+
45 
+
47  void setOpt(_node *opt) {
+
48  if (opt_) delete opt_;
+
49  opt_ = opt;
+
50  }
+
51 
+
53  virtual void print(std::ostream& os) const;
+
54 
+
56  virtual AlpsEncoded* encode() const {
+
57  AlpsEncoded* encoded = new AlpsEncoded(AlpsKnowledgeTypeSolution);
+
58  encodeBcps(encoded);
+
59 
+
60  //Vrp part.
+
61  int cur_vert = opt_[0].next, count = 1;
+
62  while (cur_vert != 0){
+
63  cur_vert = opt_[cur_vert].next;
+
64  ++count;
+
65  }
+
66  encoded->writeRep(count);
+
67  for (int j = 0; j < count; ++j) {
+
68  encoded->writeRep(opt_[j].next);
+
69  encoded->writeRep(opt_[j].route);
+
70  }
+
71 
+
72  return encoded;
+
73  }
+
74 
+
76  virtual AlpsKnowledge* decode(AlpsEncoded& encoded) const {
+
77  VrpSolution * sol = new VrpSolution();
+
78  sol->decodeBcps(encoded);
+
79 
+
80  // Vrp part.
+
81  int count;
+
82  encoded.readRep(count);
+
83  _node *opt = new _node [count];
+
84  for (int j = 0; j < count; ++j) {
+
85  encoded.readRep(opt[j].next);
+
86  encoded.readRep(opt[j].route);
+
87  }
+
88  sol->setOpt(opt);
+
89 
+
90  return sol;
+
91  }
+
92 
+
93 };
+
94 
+
95 //#############################################################################
+
96 //#############################################################################
+
97 
+
98 #endif
+
+
BlisSolution
This class contains the solutions generated by the LP solver (either primal or dual.
Definition: BlisSolution.h:36
+
VrpSolution
This class contains a vrp solution.
Definition: VrpSolution.h:26
+
VrpSolution::setOpt
void setOpt(_node *opt)
Set opt.
Definition: VrpSolution.h:47
+
_NODE
Definition: VrpCommonTypes.h:20
+
VrpSolution::encode
virtual AlpsEncoded * encode() const
The method that encodes the solution into a encoded object.
Definition: VrpSolution.h:56
+
_NODE::next
int next
Definition: VrpCommonTypes.h:21
+
VrpModel.h
+
VrpSolution::print
virtual void print(std::ostream &os) const
Print the solution.
+
VrpSolution::decode
virtual AlpsKnowledge * decode(AlpsEncoded &encoded) const
The method that decodes the solution from a encoded object.
Definition: VrpSolution.h:76
+
VrpSolution::VrpSolution
VrpSolution()
Default constructor.
Definition: VrpSolution.h:35
+
VrpSolution::~VrpSolution
virtual ~VrpSolution()
Destructor.
Definition: VrpSolution.h:42
+
VrpSolution::opt_
_node * opt_
Definition: VrpSolution.h:30
+
BlisSolution.h
+
VrpModel
Model class for VRP.
Definition: VrpModel.h:32
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpVariable_8h.html b/Doxygen/0.94/VrpVariable_8h.html new file mode 100644 index 0000000..54578bb --- /dev/null +++ b/Doxygen/0.94/VrpVariable_8h.html @@ -0,0 +1,120 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpVariable.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Classes
+
+
VrpVariable.h File Reference
+
+
+
#include "BlisVariable.h"
+
+ + Include dependency graph for VrpVariable.h:
+
+
+ +
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + + +

+Classes

class  VrpVariable
 Variable class for VRP. More...
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/VrpVariable_8h__dep__incl.map b/Doxygen/0.94/VrpVariable_8h__dep__incl.map new file mode 100644 index 0000000..a59d14a --- /dev/null +++ b/Doxygen/0.94/VrpVariable_8h__dep__incl.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/Doxygen/0.94/VrpVariable_8h__dep__incl.md5 b/Doxygen/0.94/VrpVariable_8h__dep__incl.md5 new file mode 100644 index 0000000..da9d0ab --- /dev/null +++ b/Doxygen/0.94/VrpVariable_8h__dep__incl.md5 @@ -0,0 +1 @@ +b07ed4bfb216c235bb57e102f3f8e7b3 \ No newline at end of file diff --git a/Doxygen/0.94/VrpVariable_8h__dep__incl.png b/Doxygen/0.94/VrpVariable_8h__dep__incl.png new file mode 100644 index 0000000..8f7fa0f Binary files /dev/null and b/Doxygen/0.94/VrpVariable_8h__dep__incl.png differ diff --git a/Doxygen/0.94/VrpVariable_8h__incl.map b/Doxygen/0.94/VrpVariable_8h__incl.map new file mode 100644 index 0000000..dc983a5 --- /dev/null +++ b/Doxygen/0.94/VrpVariable_8h__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/VrpVariable_8h__incl.md5 b/Doxygen/0.94/VrpVariable_8h__incl.md5 new file mode 100644 index 0000000..6f46e30 --- /dev/null +++ b/Doxygen/0.94/VrpVariable_8h__incl.md5 @@ -0,0 +1 @@ +8b07da52cd6e8cebcffe19bc08609d88 \ No newline at end of file diff --git a/Doxygen/0.94/VrpVariable_8h__incl.png b/Doxygen/0.94/VrpVariable_8h__incl.png new file mode 100644 index 0000000..257caa7 Binary files /dev/null and b/Doxygen/0.94/VrpVariable_8h__incl.png differ diff --git a/Doxygen/0.94/VrpVariable_8h_source.html b/Doxygen/0.94/VrpVariable_8h_source.html new file mode 100644 index 0000000..eb7f78c --- /dev/null +++ b/Doxygen/0.94/VrpVariable_8h_source.html @@ -0,0 +1,237 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP/VrpVariable.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
VrpVariable.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of a solver for the Vehicle Routing Problem *
+
3  * developed using the BiCePS Linear Integer Solver (BLIS). *
+
4  * *
+
5  * This solver is distributed under the Eclipse Public License as part of *
+
6  * the COIN-OR repository (http://www.coin-or.org). *
+
7  * *
+
8  * Authors: Yan Xu, Lehigh University *
+
9  * Ted Ralphs, Lehigh University *
+
10  * *
+
11  * Copyright (C) 2007 Yan Xu and Ted Ralphs. *
+
12  * All Rights Reserved. *
+
13  *===========================================================================*/
+
14 
+
15 #ifndef VrpVariable_h_
+
16 #define VrpVariable_h_
+
17 
+
18 //#############################################################################
+
19 
+
20 #include "BlisVariable.h"
+
21 
+
22 //#############################################################################
+
23 
+
25 class VrpVariable : public BlisVariable
+
26 {
+
27 private:
+
28 
+
29  /* The endpoints of the edge */
+
30  int ends_[2];
+
31  int uind_;
+
32 
+
33 protected:
+
34 
+
36  AlpsReturnStatus encodeVrp(AlpsEncoded *encoded) {
+
37  AlpsReturnStatus status = AlpsReturnStatusOk;
+
38 
+
39  //std::cout << "****** encodeVrp var: size_ = " << size_ << std::endl;
+
40 
+
41  encoded->writeRep(ends_[0]);
+
42  encoded->writeRep(ends_[1]);
+
43  encoded->writeRep(uind_);
+
44 
+
45  return status;
+
46  }
+
47 
+
49  AlpsReturnStatus decodeVrp(AlpsEncoded &encoded) {
+
50  AlpsReturnStatus status = AlpsReturnStatusOk;
+
51 
+
52  encoded.readRep(ends_[0]);
+
53  encoded.readRep(ends_[1]);
+
54  encoded.readRep(uind_);
+
55 
+
56  //std::cout << "****** decodeVrp var: size_ = " << size_ << std::endl;
+
57 
+
58  return status;
+
59  }
+
60 
+
61 public:
+
62 
+
64  VrpVariable() {
+
65  ends_[0] = 0;
+
66  ends_[1] = 0;
+
67  }
+
68 
+
70  VrpVariable(int v1, int v2, int cost, int ub) {
+
71  ends_[0] = v1 < v2 ? v1 : v2;
+
72  ends_[1] = v1 < v2 ? v2 : v1;
+
73  uind_ = ends_[1]*(ends_[1] - 1)/2 + ends_[0];
+
74  int indices [2];
+
75  double values [2];
+
76  indices[0] = ends_[0];
+
77  indices[1] = ends_[1];
+
78  values[0] = values[1] = 1.0;
+
79  setData(2, indices, values);
+
80  setIntType('B');
+
81  setLbHard(0.0);
+
82  setUbHard((double) ub);
+
83  setObjCoef((double) cost);
+
84  }
+
85 
+
87  virtual ~VrpVariable() {
+
88  //std::cout << "delete a vrp variable " << std::endl;
+
89  }
+
90 
+
93  inline int getIndex() { return uind_; }
+
94  inline int getv0() { return ends_[0]; }
+
95  inline int getv1() { return ends_[1]; }
+
98  virtual void printDesc() {
+
99  std::cout << "(" << getv0() << ", " << getv1() << ")";
+
100  }
+
101 
+
103  virtual AlpsReturnStatus encode(AlpsEncoded *encoded){
+
104  AlpsReturnStatus status;
+
105 
+
106  status = encodeBcpsObject(encoded);
+
107  status = encodeBlis(encoded);
+
108  status = encodeVrp(encoded);
+
109 
+
110  return status;
+
111  }
+
112 
+
114  virtual AlpsKnowledge* decode(AlpsEncoded &encoded) const {
+
115  AlpsReturnStatus status = AlpsReturnStatusOk;
+
116  VrpVariable * var = new VrpVariable();
+
117 
+
118  // Unpack Bcps part.
+
119  status = var->decodeBcpsObject(encoded);
+
120  if (status) {
+
121  throw CoinError("Failed to decode Bcps part of var",
+
122  "decode",
+
123  "BlisObject");
+
124  }
+
125 
+
126  // Unpack Blis part.
+
127  status = var->decodeBlis(encoded);
+
128  if (status) {
+
129  throw CoinError("Failed to decode Blis part of var",
+
130  "decode",
+
131  "BlisObject");
+
132  }
+
133 
+
134  // Unpack Vrp part.
+
135  status = var->decodeVrp(encoded);
+
136  if (status) {
+
137  throw CoinError("Failed to decode Vrp part of var",
+
138  "decode",
+
139  "BlisObject");
+
140  }
+
141  return var;
+
142  }
+
143 
+
144 };
+
145 
+
146 //#############################################################################
+
147 
+
148 #endif
+
+
VrpVariable::VrpVariable
VrpVariable()
Default constructor.
Definition: VrpVariable.h:64
+
VrpVariable::VrpVariable
VrpVariable(int v1, int v2, int cost, int ub)
Useful constructor.
Definition: VrpVariable.h:70
+
BlisVariable
Definition: BlisVariable.h:31
+
BlisVariable::decodeBlis
AlpsReturnStatus decodeBlis(AlpsEncoded &encoded)
Unpack Blis part from a encode object.
Definition: BlisVariable.h:119
+
VrpVariable::getv0
int getv0()
Definition: VrpVariable.h:94
+
BlisVariable::encodeBlis
AlpsReturnStatus encodeBlis(AlpsEncoded *encoded)
Pack Blis part into an encoded object.
Definition: BlisVariable.h:106
+
VrpVariable::decode
virtual AlpsKnowledge * decode(AlpsEncoded &encoded) const
Decode a variable from an encoded object.
Definition: VrpVariable.h:114
+
VrpVariable::decodeVrp
AlpsReturnStatus decodeVrp(AlpsEncoded &encoded)
Unpack Vrp part from a encode object.
Definition: VrpVariable.h:49
+
VrpVariable
Variable class for VRP.
Definition: VrpVariable.h:25
+
VrpVariable::uind_
int uind_
Definition: VrpVariable.h:31
+
VrpVariable::encode
virtual AlpsReturnStatus encode(AlpsEncoded *encoded)
Pack to a encode object.
Definition: VrpVariable.h:103
+
VrpVariable::encodeVrp
AlpsReturnStatus encodeVrp(AlpsEncoded *encoded)
Pack Vrp part into an encoded object.
Definition: VrpVariable.h:36
+
VrpVariable::printDesc
virtual void printDesc()
Definition: VrpVariable.h:98
+
VrpVariable::~VrpVariable
virtual ~VrpVariable()
Destructor.
Definition: VrpVariable.h:87
+
VrpVariable::getv1
int getv1()
Definition: VrpVariable.h:95
+
VrpVariable::ends_
int ends_[2]
Definition: VrpVariable.h:30
+
BlisVariable::setData
void setData(int s, const int *ind, const double *val)
Set data
Definition: BlisVariable.h:89
+
BlisVariable.h
+
VrpVariable::getIndex
int getIndex()
Get data
Definition: VrpVariable.h:93
+
BlisVariable::setObjCoef
void setObjCoef(double coef)
Definition: BlisVariable.h:100
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/annotated.html b/Doxygen/0.94/annotated.html new file mode 100644 index 0000000..9176876 --- /dev/null +++ b/Doxygen/0.94/annotated.html @@ -0,0 +1,118 @@ + + + + + + + +Blis: Class List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
+
Class List
+
+
+
Here are the classes, structs, unions and interfaces with brief descriptions:
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
 C_NODE
 CBEST_TOURS
 CBlisBranchObjectBilevel
 CBlisBranchObjectInt
 CBlisBranchStrategyBilevelThis class implements maximum infeasibility branching
 CBlisBranchStrategyMaxInfThis class implements maximum infeasibility branching
 CBlisBranchStrategyPseudoBlis branching strategy
 CBlisBranchStrategyRelBlis branching strategy
 CBlisBranchStrategyStrongThis class implements strong branching
 CBlisConGeneratorInterface between Blis and Cut Generation Library
 CBlisConstraint
 CBlisHeuristicHeuristic base class
 CBlisHeurRoundRounding Heuristic
 CBlisMessage
 CBlisModel
 CBlisNodeDesc
 CBlisObjectInt
 CBlisParams
 CBlisPresolveA interface to Osi/Coin Presolve
 CBlisPseudocost
 CBlisSolutionThis class contains the solutions generated by the LP solver (either primal or dual
 CBlisStrong
 CBlisTreeNodeThis is the class in which we are finally able to concretely define the bounding procedure
 CBlisVariable
 CEDGE
 CEDGE_DATA
 CELIST
 CROUTE_DATA
 CSMALL_GRAPH
 CVERTEX
 CVrpCutGenerator
 CVrpHeurTSP
 CVrpModelModel class for VRP
 CVrpNetwork
 CVrpParams
 CVrpSolutionThis class contains a vrp solution
 CVrpVariableVariable class for VRP
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/bc_s.png b/Doxygen/0.94/bc_s.png new file mode 100644 index 0000000..224b29a Binary files /dev/null and b/Doxygen/0.94/bc_s.png differ diff --git a/Doxygen/0.94/bdwn.png b/Doxygen/0.94/bdwn.png new file mode 100644 index 0000000..940a0b9 Binary files /dev/null and b/Doxygen/0.94/bdwn.png differ diff --git a/Doxygen/0.94/classBlisBranchObjectBilevel-members.html b/Doxygen/0.94/classBlisBranchObjectBilevel-members.html new file mode 100644 index 0000000..c8662f3 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchObjectBilevel-members.html @@ -0,0 +1,95 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisBranchObjectBilevel Member List
+
+
+ +

This is the complete list of members for BlisBranchObjectBilevel, including all inherited members.

+ + + + + + + + + + + + + + + + +
addToBranchingSet(int item)BlisBranchObjectBilevelinline
BlisBranchObjectBilevel()BlisBranchObjectBilevelinline
BlisBranchObjectBilevel(BcpsModel *model)BlisBranchObjectBilevelinline
BlisBranchObjectBilevel(const BlisBranchObjectBilevel &rhs)BlisBranchObjectBilevelinline
branch(bool normalBranch=false)BlisBranchObjectBilevelvirtual
branchingSet_BlisBranchObjectBilevelprotected
clone() constBlisBranchObjectBilevelinlinevirtual
decode(AlpsEncoded &encoded)BlisBranchObjectBilevelinlinevirtual
decodeBlis(AlpsEncoded &encoded)BlisBranchObjectBilevelinlineprotected
encode(AlpsEncoded *encoded) constBlisBranchObjectBilevelinlinevirtual
encodeBlis(AlpsEncoded *encoded) constBlisBranchObjectBilevelinlineprotected
getBranchingSet() constBlisBranchObjectBilevelinline
operator=(const BlisBranchObjectBilevel &rhs)BlisBranchObjectBilevel
print(bool normalBranch)BlisBranchObjectBilevelvirtual
~BlisBranchObjectBilevel()BlisBranchObjectBilevelinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisBranchObjectBilevel.html b/Doxygen/0.94/classBlisBranchObjectBilevel.html new file mode 100644 index 0000000..f5b3148 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchObjectBilevel.html @@ -0,0 +1,602 @@ + + + + + + + +Blis: BlisBranchObjectBilevel Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Protected Member Functions | +Protected Attributes | +List of all members
+
+
BlisBranchObjectBilevel Class Reference
+
+
+ +

#include <BlisBranchObjectBilevel.h>

+
+ + Inheritance diagram for BlisBranchObjectBilevel:
+
+
+ +
+ + Collaboration diagram for BlisBranchObjectBilevel:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisBranchObjectBilevel ()
 Default constructor. More...
 
 BlisBranchObjectBilevel (BcpsModel *model)
 Another useful constructor. More...
 
 BlisBranchObjectBilevel (const BlisBranchObjectBilevel &rhs)
 Copy constructor. More...
 
BlisBranchObjectBilevel & operator= (const BlisBranchObjectBilevel &rhs)
 Assignment operator. More...
 
virtual BcpsBranchObject * clone () const
 Clone. More...
 
virtual ~BlisBranchObjectBilevel ()
 Destructor. More...
 
std::deque< int > * getBranchingSet () const
 Get a pointer to the branching set. More...
 
void addToBranchingSet (int item)
 Get a pointer to the branching set. More...
 
virtual double branch (bool normalBranch=false)
 Set the bounds for the variable according to the current arm of the branch and advances the object state to the next arm. More...
 
virtual void print (bool normalBranch)
 Print something about branch - only if log level high. More...
 
virtual AlpsReturnStatus encode (AlpsEncoded *encoded) const
 Pack to an encoded object. More...
 
virtual AlpsReturnStatus decode (AlpsEncoded &encoded)
 Unpack a branching object from an encoded object. More...
 
+ + + + + + + +

+Protected Member Functions

AlpsReturnStatus encodeBlis (AlpsEncoded *encoded) const
 Pack Blis portion to an encoded object. More...
 
AlpsReturnStatus decodeBlis (AlpsEncoded &encoded)
 Unpack Blis portion from an encoded object. More...
 
+ + + + +

+Protected Attributes

std::deque< int > * branchingSet_
 The indices of variables in the branching set. More...
 
+

Detailed Description

+
+

Definition at line 38 of file BlisBranchObjectBilevel.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisBranchObjectBilevel() [1/3]

+ +
+
+ + + + + +
+ + + + + + + +
BlisBranchObjectBilevel::BlisBranchObjectBilevel ()
+ 		+inline
+
+ +

Default constructor.

+ +

Definition at line 48 of file BlisBranchObjectBilevel.h.

+ +
+
+ +

◆ BlisBranchObjectBilevel() [2/3]

+ +
+
+ + + + + +
+ + + + + + + + +
BlisBranchObjectBilevel::BlisBranchObjectBilevel (BcpsModel * model)
+ 		+inline
+
+ +

Another useful constructor.

+ +

Definition at line 55 of file BlisBranchObjectBilevel.h.

+ +
+
+ +

◆ BlisBranchObjectBilevel() [3/3]

+ +
+
+ + + + + +
+ + + + + + + + +
BlisBranchObjectBilevel::BlisBranchObjectBilevel (const BlisBranchObjectBilevel & rhs)
+ 		+inline
+
+ +

Copy constructor.

+ +

Definition at line 62 of file BlisBranchObjectBilevel.h.

+ +
+
+ +

◆ ~BlisBranchObjectBilevel()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisBranchObjectBilevel::~BlisBranchObjectBilevel ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 75 of file BlisBranchObjectBilevel.h.

+ +
+
+

Member Function Documentation

+ +

◆ operator=()

+ +
+
+ + + + + + + + +
BlisBranchObjectBilevel& BlisBranchObjectBilevel::operator= (const BlisBranchObjectBilevel & rhs)
+
+ +

Assignment operator.

+ +
+
+ +

◆ clone()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BcpsBranchObject* BlisBranchObjectBilevel::clone () const
+ 		+inlinevirtual
+
+ +

Clone.

+ +

Definition at line 70 of file BlisBranchObjectBilevel.h.

+ +
+
+ +

◆ getBranchingSet()

+ +
+
+ + + + + +
+ + + + + + + +
std::deque<int>* BlisBranchObjectBilevel::getBranchingSet () const
+ 		+inline
+
+ +

Get a pointer to the branching set.

+ +

Definition at line 78 of file BlisBranchObjectBilevel.h.

+ +
+
+ +

◆ addToBranchingSet()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisBranchObjectBilevel::addToBranchingSet (int item)
+ 		+inline
+
+ +

Get a pointer to the branching set.

+ +

Definition at line 81 of file BlisBranchObjectBilevel.h.

+ +
+
+ +

◆ branch()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual double BlisBranchObjectBilevel::branch (bool normalBranch = false)
+ 		+virtual
+
+ +

Set the bounds for the variable according to the current arm of the branch and advances the object state to the next arm.

+

Returns change in guessed objective on next branch.

+ +
+
+ +

◆ print()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisBranchObjectBilevel::print (bool normalBranch)
+ 		+virtual
+
+ +

Print something about branch - only if log level high.

+ +
+
+ +

◆ encodeBlis()

+ +
+
+ + + + + +
+ + + + + + + + +
AlpsReturnStatus BlisBranchObjectBilevel::encodeBlis (AlpsEncoded * encoded) const
+ 		+inlineprotected
+
+ +

Pack Blis portion to an encoded object.

+ +

Definition at line 94 of file BlisBranchObjectBilevel.h.

+ +
+
+ +

◆ decodeBlis()

+ +
+
+ + + + + +
+ + + + + + + + +
AlpsReturnStatus BlisBranchObjectBilevel::decodeBlis (AlpsEncoded & encoded)
+ 		+inlineprotected
+
+ +

Unpack Blis portion from an encoded object.

+ +

Definition at line 101 of file BlisBranchObjectBilevel.h.

+ +
+
+ +

◆ encode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsReturnStatus BlisBranchObjectBilevel::encode (AlpsEncoded * encoded) const
+ 		+inlinevirtual
+
+ +

Pack to an encoded object.

+ +

Definition at line 109 of file BlisBranchObjectBilevel.h.

+ +
+
+ +

◆ decode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsReturnStatus BlisBranchObjectBilevel::decode (AlpsEncoded & encoded)
+ 		+inlinevirtual
+
+ +

Unpack a branching object from an encoded object.

+ +

Definition at line 119 of file BlisBranchObjectBilevel.h.

+ +
+
+

Member Data Documentation

+ +

◆ branchingSet_

+ +
+
+ + + + + +
+ + + + +
std::deque<int>* BlisBranchObjectBilevel::branchingSet_
+ 		+protected
+
+ +

The indices of variables in the branching set.

+ +

Definition at line 43 of file BlisBranchObjectBilevel.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisBranchObjectBilevel__coll__graph.map b/Doxygen/0.94/classBlisBranchObjectBilevel__coll__graph.map new file mode 100644 index 0000000..a7d6f0b --- /dev/null +++ b/Doxygen/0.94/classBlisBranchObjectBilevel__coll__graph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/Doxygen/0.94/classBlisBranchObjectBilevel__coll__graph.md5 b/Doxygen/0.94/classBlisBranchObjectBilevel__coll__graph.md5 new file mode 100644 index 0000000..a586fdf --- /dev/null +++ b/Doxygen/0.94/classBlisBranchObjectBilevel__coll__graph.md5 @@ -0,0 +1 @@ +f8000926b1b72de8ab017ff13f257a11 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisBranchObjectBilevel__coll__graph.png b/Doxygen/0.94/classBlisBranchObjectBilevel__coll__graph.png new file mode 100644 index 0000000..2d6c196 Binary files /dev/null and b/Doxygen/0.94/classBlisBranchObjectBilevel__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisBranchObjectBilevel__inherit__graph.map b/Doxygen/0.94/classBlisBranchObjectBilevel__inherit__graph.map new file mode 100644 index 0000000..13fa79b --- /dev/null +++ b/Doxygen/0.94/classBlisBranchObjectBilevel__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisBranchObjectBilevel__inherit__graph.md5 b/Doxygen/0.94/classBlisBranchObjectBilevel__inherit__graph.md5 new file mode 100644 index 0000000..f99b8ac --- /dev/null +++ b/Doxygen/0.94/classBlisBranchObjectBilevel__inherit__graph.md5 @@ -0,0 +1 @@ +27c9f3dfc2e6005b869c89e298eaecf6 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisBranchObjectBilevel__inherit__graph.png b/Doxygen/0.94/classBlisBranchObjectBilevel__inherit__graph.png new file mode 100644 index 0000000..a4d7383 Binary files /dev/null and b/Doxygen/0.94/classBlisBranchObjectBilevel__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisBranchObjectInt-members.html b/Doxygen/0.94/classBlisBranchObjectInt-members.html new file mode 100644 index 0000000..dd41fdd --- /dev/null +++ b/Doxygen/0.94/classBlisBranchObjectInt-members.html @@ -0,0 +1,98 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisBranchObjectInt Member List
+
+
+ +

This is the complete list of members for BlisBranchObjectInt, including all inherited members.

+ + + + + + + + + + + + + + + + + + + +
BlisBranchObjectInt()BlisBranchObjectIntinline
BlisBranchObjectInt(BlisModel *model, int varInd, int direction, double value)BlisBranchObjectIntinline
BlisBranchObjectInt(BlisModel *model, int varInd, int intScore, double dblScore, int direction, double value)BlisBranchObjectIntinline
BlisBranchObjectInt(BlisModel *model, int varInd, int direction, double lowerValue, double upperValue)BlisBranchObjectIntinline
BlisBranchObjectInt(const BlisBranchObjectInt &)BlisBranchObjectInt
branch(bool normalBranch=false)BlisBranchObjectIntvirtual
clone() constBlisBranchObjectIntinlinevirtual
decode(AlpsEncoded &encoded)BlisBranchObjectIntinlinevirtual
decodeBlis(AlpsEncoded &encoded)BlisBranchObjectIntinlineprotected
down_BlisBranchObjectIntprotected
encode(AlpsEncoded *encoded) constBlisBranchObjectIntinlinevirtual
encodeBlis(AlpsEncoded *encoded) constBlisBranchObjectIntinlineprotected
getDown() constBlisBranchObjectIntinline
getUp() constBlisBranchObjectIntinline
operator=(const BlisBranchObjectInt &rhs)BlisBranchObjectInt
print(bool normalBranch)BlisBranchObjectIntvirtual
up_BlisBranchObjectIntprotected
~BlisBranchObjectInt()BlisBranchObjectIntinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisBranchObjectInt.html b/Doxygen/0.94/classBlisBranchObjectInt.html new file mode 100644 index 0000000..82c32da --- /dev/null +++ b/Doxygen/0.94/classBlisBranchObjectInt.html @@ -0,0 +1,786 @@ + + + + + + + +Blis: BlisBranchObjectInt Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Protected Member Functions | +Protected Attributes | +List of all members
+
+
BlisBranchObjectInt Class Reference
+
+
+ +

#include <BlisBranchObjectInt.h>

+
+ + Inheritance diagram for BlisBranchObjectInt:
+
+
+ +
+ + Collaboration diagram for BlisBranchObjectInt:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisBranchObjectInt ()
 Default constructor. More...
 
 BlisBranchObjectInt (BlisModel *model, int varInd, int direction, double value)
 Construct a branching object, which branching on variable varInd. More...
 
 BlisBranchObjectInt (BlisModel *model, int varInd, int intScore, double dblScore, int direction, double value)
 Construct a branching object, which branching on variable varInd. More...
 
 BlisBranchObjectInt (BlisModel *model, int varInd, int direction, double lowerValue, double upperValue)
 Create a degenerate branching object. More...
 
 BlisBranchObjectInt (const BlisBranchObjectInt &)
 Copy constructor. More...
 
BlisBranchObjectInt & operator= (const BlisBranchObjectInt &rhs)
 Assignment operator. More...
 
virtual BcpsBranchObject * clone () const
 Clone. More...
 
virtual ~BlisBranchObjectInt ()
 Destructor. More...
 
virtual double branch (bool normalBranch=false)
 Set the bounds for the variable according to the current arm of the branch and advances the object state to the next arm. More...
 
virtual void print (bool normalBranch)
 Print something about branch - only if log level high. More...
 
const double * getDown () const
 Get down arm bounds. More...
 
const double * getUp () const
 Get upper arm bounds. More...
 
virtual AlpsReturnStatus encode (AlpsEncoded *encoded) const
 Pack to an encoded object. More...
 
virtual AlpsReturnStatus decode (AlpsEncoded &encoded)
 Unpack a branching object from an encoded object. More...
 
+ + + + + + + +

+Protected Member Functions

AlpsReturnStatus encodeBlis (AlpsEncoded *encoded) const
 Pack Blis portion to an encoded object. More...
 
AlpsReturnStatus decodeBlis (AlpsEncoded &encoded)
 Unpack Blis portion from an encoded object. More...
 
+ + + + + + + +

+Protected Attributes

double down_ [2]
 Down_[0]: the lower bound of down arm; Down_[1]: the upper bound of down arm;. More...
 
double up_ [2]
 Up_[0]: the lower bound of upper arm; Up_[1]: the upper bound of upper arm;. More...
 
+

Detailed Description

+
+

Definition at line 38 of file BlisBranchObjectInt.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisBranchObjectInt() [1/5]

+ +
+
+ + + + + +
+ + + + + + + +
BlisBranchObjectInt::BlisBranchObjectInt ()
+ 		+inline
+
+ +

Default constructor.

+ +

Definition at line 53 of file BlisBranchObjectInt.h.

+ +
+
+ +

◆ BlisBranchObjectInt() [2/5]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisBranchObjectInt::BlisBranchObjectInt (BlisModel * model,
int varInd,
int direction,
double value 
)
+ 		+inline
+
+ +

Construct a branching object, which branching on variable varInd.

+
Parameters
+ + + + +
varIndthe index of integer variable in object set
directionthe direction of first branching: 1(up), -1(down)
valuethe fractional solution value of variable varInd
+
+
+ +

Definition at line 69 of file BlisBranchObjectInt.h.

+ +
+
+ +

◆ BlisBranchObjectInt() [3/5]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisBranchObjectInt::BlisBranchObjectInt (BlisModel * model,
int varInd,
int intScore,
double dblScore,
int direction,
double value 
)
+ 		+inline
+
+ +

Construct a branching object, which branching on variable varInd.

+
Parameters
+ + + + + + +
varIndthe index of integer variable in object set
intScorethe integer score/goodness
dblScorethe double score/goodness
directionthe direction of first branching: 1(up), -1(down)
valuethe fractional solution value of variable varInd
+
+
+ +

Definition at line 100 of file BlisBranchObjectInt.h.

+ +
+
+ +

◆ BlisBranchObjectInt() [4/5]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisBranchObjectInt::BlisBranchObjectInt (BlisModel * model,
int varInd,
int direction,
double lowerValue,
double upperValue 
)
+ 		+inline
+
+ +

Create a degenerate branching object.

+

Specifies a ‘one-direction branch’. Calling branch() for this object will always result in lowerValue <= x <= upperValue. Used to fix a variable when lowerValue = upperValue.

+ +

Definition at line 122 of file BlisBranchObjectInt.h.

+ +
+
+ +

◆ BlisBranchObjectInt() [5/5]

+ +
+
+ + + + + + + + +
BlisBranchObjectInt::BlisBranchObjectInt (const BlisBranchObjectInt & )
+
+ +

Copy constructor.

+ +
+
+ +

◆ ~BlisBranchObjectInt()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisBranchObjectInt::~BlisBranchObjectInt ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 150 of file BlisBranchObjectInt.h.

+ +
+
+

Member Function Documentation

+ +

◆ operator=()

+ +
+
+ + + + + + + + +
BlisBranchObjectInt& BlisBranchObjectInt::operator= (const BlisBranchObjectInt & rhs)
+
+ +

Assignment operator.

+ +
+
+ +

◆ clone()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BcpsBranchObject* BlisBranchObjectInt::clone () const
+ 		+inlinevirtual
+
+ +

Clone.

+ +

Definition at line 145 of file BlisBranchObjectInt.h.

+ +
+
+ +

◆ branch()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual double BlisBranchObjectInt::branch (bool normalBranch = false)
+ 		+virtual
+
+ +

Set the bounds for the variable according to the current arm of the branch and advances the object state to the next arm.

+

Returns change in guessed objective on next branch.

+ +
+
+ +

◆ print()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisBranchObjectInt::print (bool normalBranch)
+ 		+virtual
+
+ +

Print something about branch - only if log level high.

+ +
+
+ +

◆ getDown()

+ +
+
+ + + + + +
+ + + + + + + +
const double* BlisBranchObjectInt::getDown () const
+ 		+inline
+
+ +

Get down arm bounds.

+ +

Definition at line 161 of file BlisBranchObjectInt.h.

+ +
+
+ +

◆ getUp()

+ +
+
+ + + + + +
+ + + + + + + +
const double* BlisBranchObjectInt::getUp () const
+ 		+inline
+
+ +

Get upper arm bounds.

+ +

Definition at line 164 of file BlisBranchObjectInt.h.

+ +
+
+ +

◆ encodeBlis()

+ +
+
+ + + + + +
+ + + + + + + + +
AlpsReturnStatus BlisBranchObjectInt::encodeBlis (AlpsEncoded * encoded) const
+ 		+inlineprotected
+
+ +

Pack Blis portion to an encoded object.

+ +

Definition at line 169 of file BlisBranchObjectInt.h.

+ +
+
+ +

◆ decodeBlis()

+ +
+
+ + + + + +
+ + + + + + + + +
AlpsReturnStatus BlisBranchObjectInt::decodeBlis (AlpsEncoded & encoded)
+ 		+inlineprotected
+
+ +

Unpack Blis portion from an encoded object.

+ +

Definition at line 185 of file BlisBranchObjectInt.h.

+ +
+
+ +

◆ encode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsReturnStatus BlisBranchObjectInt::encode (AlpsEncoded * encoded) const
+ 		+inlinevirtual
+
+ +

Pack to an encoded object.

+ +

Definition at line 202 of file BlisBranchObjectInt.h.

+ +
+
+ +

◆ decode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsReturnStatus BlisBranchObjectInt::decode (AlpsEncoded & encoded)
+ 		+inlinevirtual
+
+ +

Unpack a branching object from an encoded object.

+ +

Definition at line 212 of file BlisBranchObjectInt.h.

+ +
+
+

Member Data Documentation

+ +

◆ down_

+ +
+
+ + + + + +
+ + + + +
double BlisBranchObjectInt::down_[2]
+ 		+protected
+
+ +

Down_[0]: the lower bound of down arm; Down_[1]: the upper bound of down arm;.

+ +

Definition at line 44 of file BlisBranchObjectInt.h.

+ +
+
+ +

◆ up_

+ +
+
+ + + + + +
+ + + + +
double BlisBranchObjectInt::up_[2]
+ 		+protected
+
+ +

Up_[0]: the lower bound of upper arm; Up_[1]: the upper bound of upper arm;.

+ +

Definition at line 48 of file BlisBranchObjectInt.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisBranchObjectInt__coll__graph.map b/Doxygen/0.94/classBlisBranchObjectInt__coll__graph.map new file mode 100644 index 0000000..9efef7b --- /dev/null +++ b/Doxygen/0.94/classBlisBranchObjectInt__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisBranchObjectInt__coll__graph.md5 b/Doxygen/0.94/classBlisBranchObjectInt__coll__graph.md5 new file mode 100644 index 0000000..a4e153b --- /dev/null +++ b/Doxygen/0.94/classBlisBranchObjectInt__coll__graph.md5 @@ -0,0 +1 @@ +a036e0d09e620515e0ab8391fa0255de \ No newline at end of file diff --git a/Doxygen/0.94/classBlisBranchObjectInt__coll__graph.png b/Doxygen/0.94/classBlisBranchObjectInt__coll__graph.png new file mode 100644 index 0000000..4577f79 Binary files /dev/null and b/Doxygen/0.94/classBlisBranchObjectInt__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisBranchObjectInt__inherit__graph.map b/Doxygen/0.94/classBlisBranchObjectInt__inherit__graph.map new file mode 100644 index 0000000..9efef7b --- /dev/null +++ b/Doxygen/0.94/classBlisBranchObjectInt__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisBranchObjectInt__inherit__graph.md5 b/Doxygen/0.94/classBlisBranchObjectInt__inherit__graph.md5 new file mode 100644 index 0000000..a4e153b --- /dev/null +++ b/Doxygen/0.94/classBlisBranchObjectInt__inherit__graph.md5 @@ -0,0 +1 @@ +a036e0d09e620515e0ab8391fa0255de \ No newline at end of file diff --git a/Doxygen/0.94/classBlisBranchObjectInt__inherit__graph.png b/Doxygen/0.94/classBlisBranchObjectInt__inherit__graph.png new file mode 100644 index 0000000..4577f79 Binary files /dev/null and b/Doxygen/0.94/classBlisBranchObjectInt__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisBranchStrategyBilevel-members.html b/Doxygen/0.94/classBlisBranchStrategyBilevel-members.html new file mode 100644 index 0000000..fe6c1dd --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyBilevel-members.html @@ -0,0 +1,88 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisBranchStrategyBilevel Member List
+
+
+ +

This is the complete list of members for BlisBranchStrategyBilevel, including all inherited members.

+ + + + + + + + + +
betterBranchObject(BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)BlisBranchStrategyBilevelvirtual
BlisBranchStrategyBilevel()BlisBranchStrategyBilevelinline
BlisBranchStrategyBilevel(BlisModel *model)BlisBranchStrategyBilevelinline
BlisBranchStrategyBilevel(const BlisBranchStrategyBilevel &)BlisBranchStrategyBilevel
clone() constBlisBranchStrategyBilevelinlinevirtual
createCandBranchObjects(int numPassesLeft, double ub)BlisBranchStrategyBilevelvirtual
operator=(const BlisBranchStrategyBilevel &rhs)BlisBranchStrategyBilevelprivate
~BlisBranchStrategyBilevel()BlisBranchStrategyBilevelinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisBranchStrategyBilevel.html b/Doxygen/0.94/classBlisBranchStrategyBilevel.html new file mode 100644 index 0000000..18dab90 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyBilevel.html @@ -0,0 +1,390 @@ + + + + + + + +Blis: BlisBranchStrategyBilevel Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Private Member Functions | +List of all members
+
+
BlisBranchStrategyBilevel Class Reference
+
+
+ +

This class implements maximum infeasibility branching. + More...

+ +

#include <BlisBranchStrategyBilevel.h>

+
+ + Inheritance diagram for BlisBranchStrategyBilevel:
+
+
+ +
+ + Collaboration diagram for BlisBranchStrategyBilevel:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisBranchStrategyBilevel ()
 Bilevel Constructor. More...
 
 BlisBranchStrategyBilevel (BlisModel *model)
 Bilevel Constructor. More...
 
virtual ~BlisBranchStrategyBilevel ()
 Destructor. More...
 
 BlisBranchStrategyBilevel (const BlisBranchStrategyBilevel &)
 Copy constructor. More...
 
virtual BcpsBranchStrategy * clone () const
 Clone a brancing strategy. More...
 
virtual int createCandBranchObjects (int numPassesLeft, double ub)
 Create a set of candidate branching objects. More...
 
virtual int betterBranchObject (BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)
 Compare branching object thisOne to bestSoFar. More...
 
+ + + + +

+Private Member Functions

BlisBranchStrategyBilevel & operator= (const BlisBranchStrategyBilevel &rhs)
 Illegal Assignment operator. More...
 
+

Detailed Description

+

This class implements maximum infeasibility branching.

+ +

Definition at line 32 of file BlisBranchStrategyBilevel.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisBranchStrategyBilevel() [1/3]

+ +
+
+ + + + + +
+ + + + + + + +
BlisBranchStrategyBilevel::BlisBranchStrategyBilevel ()
+ 		+inline
+
+ +

Bilevel Constructor.

+ +

Definition at line 42 of file BlisBranchStrategyBilevel.h.

+ +
+
+ +

◆ BlisBranchStrategyBilevel() [2/3]

+ +
+
+ + + + + +
+ + + + + + + + +
BlisBranchStrategyBilevel::BlisBranchStrategyBilevel (BlisModel * model)
+ 		+inline
+
+ +

Bilevel Constructor.

+ +

Definition at line 47 of file BlisBranchStrategyBilevel.h.

+ +
+
+ +

◆ ~BlisBranchStrategyBilevel()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisBranchStrategyBilevel::~BlisBranchStrategyBilevel ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 52 of file BlisBranchStrategyBilevel.h.

+ +
+
+ +

◆ BlisBranchStrategyBilevel() [3/3]

+ +
+
+ + + + + + + + +
BlisBranchStrategyBilevel::BlisBranchStrategyBilevel (const BlisBranchStrategyBilevel & )
+
+ +

Copy constructor.

+ +
+
+

Member Function Documentation

+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + + +
BlisBranchStrategyBilevel& BlisBranchStrategyBilevel::operator= (const BlisBranchStrategyBilevel & rhs)
+ 		+private
+
+ +

Illegal Assignment operator.

+ +
+
+ +

◆ clone()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BcpsBranchStrategy* BlisBranchStrategyBilevel::clone () const
+ 		+inlinevirtual
+
+ +

Clone a brancing strategy.

+ +

Definition at line 58 of file BlisBranchStrategyBilevel.h.

+ +
+
+ +

◆ createCandBranchObjects()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual int BlisBranchStrategyBilevel::createCandBranchObjects (int numPassesLeft,
double ub 
)
+ 		+virtual
+
+ +

Create a set of candidate branching objects.

+ +
+
+ +

◆ betterBranchObject()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual int BlisBranchStrategyBilevel::betterBranchObject (BcpsBranchObject * thisOne,
BcpsBranchObject * bestSoFar 
)
+ 		+virtual
+
+ +

Compare branching object thisOne to bestSoFar.

+

If thisOne is better than bestObject, return branching direction(1 or -1), otherwise return 0. If bestSorFar is NULL, then always return branching direction(1 or -1).

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisBranchStrategyBilevel__coll__graph.map b/Doxygen/0.94/classBlisBranchStrategyBilevel__coll__graph.map new file mode 100644 index 0000000..7f78b9a --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyBilevel__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisBranchStrategyBilevel__coll__graph.md5 b/Doxygen/0.94/classBlisBranchStrategyBilevel__coll__graph.md5 new file mode 100644 index 0000000..ecbcf75 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyBilevel__coll__graph.md5 @@ -0,0 +1 @@ +27a144f78a3aed61fbbeaef509a4f7ab \ No newline at end of file diff --git a/Doxygen/0.94/classBlisBranchStrategyBilevel__coll__graph.png b/Doxygen/0.94/classBlisBranchStrategyBilevel__coll__graph.png new file mode 100644 index 0000000..2efc2ac Binary files /dev/null and b/Doxygen/0.94/classBlisBranchStrategyBilevel__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisBranchStrategyBilevel__inherit__graph.map b/Doxygen/0.94/classBlisBranchStrategyBilevel__inherit__graph.map new file mode 100644 index 0000000..7f78b9a --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyBilevel__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisBranchStrategyBilevel__inherit__graph.md5 b/Doxygen/0.94/classBlisBranchStrategyBilevel__inherit__graph.md5 new file mode 100644 index 0000000..ecbcf75 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyBilevel__inherit__graph.md5 @@ -0,0 +1 @@ +27a144f78a3aed61fbbeaef509a4f7ab \ No newline at end of file diff --git a/Doxygen/0.94/classBlisBranchStrategyBilevel__inherit__graph.png b/Doxygen/0.94/classBlisBranchStrategyBilevel__inherit__graph.png new file mode 100644 index 0000000..2efc2ac Binary files /dev/null and b/Doxygen/0.94/classBlisBranchStrategyBilevel__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisBranchStrategyMaxInf-members.html b/Doxygen/0.94/classBlisBranchStrategyMaxInf-members.html new file mode 100644 index 0000000..ec13004 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyMaxInf-members.html @@ -0,0 +1,88 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisBranchStrategyMaxInf Member List
+
+
+ +

This is the complete list of members for BlisBranchStrategyMaxInf, including all inherited members.

+ + + + + + + + + +
betterBranchObject(BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)BlisBranchStrategyMaxInfvirtual
BlisBranchStrategyMaxInf()BlisBranchStrategyMaxInfinline
BlisBranchStrategyMaxInf(BlisModel *model)BlisBranchStrategyMaxInfinline
BlisBranchStrategyMaxInf(const BlisBranchStrategyMaxInf &)BlisBranchStrategyMaxInf
clone() constBlisBranchStrategyMaxInfinlinevirtual
createCandBranchObjects(int numPassesLeft, double ub)BlisBranchStrategyMaxInfvirtual
operator=(const BlisBranchStrategyMaxInf &rhs)BlisBranchStrategyMaxInfprivate
~BlisBranchStrategyMaxInf()BlisBranchStrategyMaxInfinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisBranchStrategyMaxInf.html b/Doxygen/0.94/classBlisBranchStrategyMaxInf.html new file mode 100644 index 0000000..9a2eb38 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyMaxInf.html @@ -0,0 +1,390 @@ + + + + + + + +Blis: BlisBranchStrategyMaxInf Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Private Member Functions | +List of all members
+
+
BlisBranchStrategyMaxInf Class Reference
+
+
+ +

This class implements maximum infeasibility branching. + More...

+ +

#include <BlisBranchStrategyMaxInf.h>

+
+ + Inheritance diagram for BlisBranchStrategyMaxInf:
+
+
+ +
+ + Collaboration diagram for BlisBranchStrategyMaxInf:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisBranchStrategyMaxInf ()
 MaxInf Constructor. More...
 
 BlisBranchStrategyMaxInf (BlisModel *model)
 MaxInf Constructor. More...
 
virtual ~BlisBranchStrategyMaxInf ()
 Destructor. More...
 
 BlisBranchStrategyMaxInf (const BlisBranchStrategyMaxInf &)
 Copy constructor. More...
 
virtual BcpsBranchStrategy * clone () const
 Clone a brancing strategy. More...
 
virtual int createCandBranchObjects (int numPassesLeft, double ub)
 Create a set of candidate branching objects. More...
 
virtual int betterBranchObject (BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)
 Compare branching object thisOne to bestSoFar. More...
 
+ + + + +

+Private Member Functions

BlisBranchStrategyMaxInf & operator= (const BlisBranchStrategyMaxInf &rhs)
 Illegal Assignment operator. More...
 
+

Detailed Description

+

This class implements maximum infeasibility branching.

+ +

Definition at line 32 of file BlisBranchStrategyMaxInf.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisBranchStrategyMaxInf() [1/3]

+ +
+
+ + + + + +
+ + + + + + + +
BlisBranchStrategyMaxInf::BlisBranchStrategyMaxInf ()
+ 		+inline
+
+ +

MaxInf Constructor.

+ +

Definition at line 42 of file BlisBranchStrategyMaxInf.h.

+ +
+
+ +

◆ BlisBranchStrategyMaxInf() [2/3]

+ +
+
+ + + + + +
+ + + + + + + + +
BlisBranchStrategyMaxInf::BlisBranchStrategyMaxInf (BlisModel * model)
+ 		+inline
+
+ +

MaxInf Constructor.

+ +

Definition at line 47 of file BlisBranchStrategyMaxInf.h.

+ +
+
+ +

◆ ~BlisBranchStrategyMaxInf()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisBranchStrategyMaxInf::~BlisBranchStrategyMaxInf ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 52 of file BlisBranchStrategyMaxInf.h.

+ +
+
+ +

◆ BlisBranchStrategyMaxInf() [3/3]

+ +
+
+ + + + + + + + +
BlisBranchStrategyMaxInf::BlisBranchStrategyMaxInf (const BlisBranchStrategyMaxInf & )
+
+ +

Copy constructor.

+ +
+
+

Member Function Documentation

+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + + +
BlisBranchStrategyMaxInf& BlisBranchStrategyMaxInf::operator= (const BlisBranchStrategyMaxInf & rhs)
+ 		+private
+
+ +

Illegal Assignment operator.

+ +
+
+ +

◆ clone()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BcpsBranchStrategy* BlisBranchStrategyMaxInf::clone () const
+ 		+inlinevirtual
+
+ +

Clone a brancing strategy.

+ +

Definition at line 58 of file BlisBranchStrategyMaxInf.h.

+ +
+
+ +

◆ createCandBranchObjects()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual int BlisBranchStrategyMaxInf::createCandBranchObjects (int numPassesLeft,
double ub 
)
+ 		+virtual
+
+ +

Create a set of candidate branching objects.

+ +
+
+ +

◆ betterBranchObject()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual int BlisBranchStrategyMaxInf::betterBranchObject (BcpsBranchObject * thisOne,
BcpsBranchObject * bestSoFar 
)
+ 		+virtual
+
+ +

Compare branching object thisOne to bestSoFar.

+

If thisOne is better than bestObject, return branching direction(1 or -1), otherwise return 0. If bestSorFar is NULL, then always return branching direction(1 or -1).

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisBranchStrategyMaxInf__coll__graph.map b/Doxygen/0.94/classBlisBranchStrategyMaxInf__coll__graph.map new file mode 100644 index 0000000..7f24d23 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyMaxInf__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisBranchStrategyMaxInf__coll__graph.md5 b/Doxygen/0.94/classBlisBranchStrategyMaxInf__coll__graph.md5 new file mode 100644 index 0000000..0bfadde --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyMaxInf__coll__graph.md5 @@ -0,0 +1 @@ +1668d099e576cd107fdbeab8cd1b2463 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisBranchStrategyMaxInf__coll__graph.png b/Doxygen/0.94/classBlisBranchStrategyMaxInf__coll__graph.png new file mode 100644 index 0000000..9af9e95 Binary files /dev/null and b/Doxygen/0.94/classBlisBranchStrategyMaxInf__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisBranchStrategyMaxInf__inherit__graph.map b/Doxygen/0.94/classBlisBranchStrategyMaxInf__inherit__graph.map new file mode 100644 index 0000000..7f24d23 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyMaxInf__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisBranchStrategyMaxInf__inherit__graph.md5 b/Doxygen/0.94/classBlisBranchStrategyMaxInf__inherit__graph.md5 new file mode 100644 index 0000000..0bfadde --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyMaxInf__inherit__graph.md5 @@ -0,0 +1 @@ +1668d099e576cd107fdbeab8cd1b2463 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisBranchStrategyMaxInf__inherit__graph.png b/Doxygen/0.94/classBlisBranchStrategyMaxInf__inherit__graph.png new file mode 100644 index 0000000..9af9e95 Binary files /dev/null and b/Doxygen/0.94/classBlisBranchStrategyMaxInf__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisBranchStrategyPseudo-members.html b/Doxygen/0.94/classBlisBranchStrategyPseudo-members.html new file mode 100644 index 0000000..0411df4 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyPseudo-members.html @@ -0,0 +1,90 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisBranchStrategyPseudo Member List
+
+
+ +

This is the complete list of members for BlisBranchStrategyPseudo, including all inherited members.

+ + + + + + + + + + + +
betterBranchObject(BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)BlisBranchStrategyPseudovirtual
BlisBranchStrategyPseudo()BlisBranchStrategyPseudoinline
BlisBranchStrategyPseudo(BlisModel *model, int rel)BlisBranchStrategyPseudoinline
BlisBranchStrategyPseudo(const BlisBranchStrategyPseudo &)BlisBranchStrategyPseudo
clone() constBlisBranchStrategyPseudoinlinevirtual
createCandBranchObjects(int numPassesLeft, double ub)BlisBranchStrategyPseudovirtual
operator=(const BlisBranchStrategyPseudo &rhs)BlisBranchStrategyPseudoprivate
relibility_BlisBranchStrategyPseudoprivate
setRelibility(int rel)BlisBranchStrategyPseudoinline
~BlisBranchStrategyPseudo()BlisBranchStrategyPseudoinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisBranchStrategyPseudo.html b/Doxygen/0.94/classBlisBranchStrategyPseudo.html new file mode 100644 index 0000000..592d1dd --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyPseudo.html @@ -0,0 +1,465 @@ + + + + + + + +Blis: BlisBranchStrategyPseudo Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Private Member Functions | +Private Attributes | +List of all members
+
+
BlisBranchStrategyPseudo Class Reference
+
+
+ +

Blis branching strategy. + More...

+ +

#include <BlisBranchStrategyPseudo.h>

+
+ + Inheritance diagram for BlisBranchStrategyPseudo:
+
+
+ +
+ + Collaboration diagram for BlisBranchStrategyPseudo:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisBranchStrategyPseudo ()
 Default Constructor. More...
 
 BlisBranchStrategyPseudo (BlisModel *model, int rel)
 Useful Constructor. More...
 
virtual ~BlisBranchStrategyPseudo ()
 Destructor. More...
 
 BlisBranchStrategyPseudo (const BlisBranchStrategyPseudo &)
 Copy constructor. More...
 
void setRelibility (int rel)
 Set relibility. More...
 
virtual BcpsBranchStrategy * clone () const
 Clone a brancing strategy. More...
 
virtual int betterBranchObject (BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)
 Compare branching object thisOne to bestSoFar. More...
 
virtual int createCandBranchObjects (int numPassesLeft, double ub)
 Create a set of candidate branching objects. More...
 
+ + + + +

+Private Member Functions

BlisBranchStrategyPseudo & operator= (const BlisBranchStrategyPseudo &rhs)
 Illegal Assignment operator. More...
 
+ + + +

+Private Attributes

int relibility_
 
+

Detailed Description

+

Blis branching strategy.

+

This class implements pseudocost branching.

+ +

Definition at line 40 of file BlisBranchStrategyPseudo.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisBranchStrategyPseudo() [1/3]

+ +
+
+ + + + + +
+ + + + + + + +
BlisBranchStrategyPseudo::BlisBranchStrategyPseudo ()
+ 		+inline
+
+ +

Default Constructor.

+ +

Definition at line 51 of file BlisBranchStrategyPseudo.h.

+ +
+
+ +

◆ BlisBranchStrategyPseudo() [2/3]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
BlisBranchStrategyPseudo::BlisBranchStrategyPseudo (BlisModel * model,
int rel 
)
+ 		+inline
+
+ +

Useful Constructor.

+ +

Definition at line 57 of file BlisBranchStrategyPseudo.h.

+ +
+
+ +

◆ ~BlisBranchStrategyPseudo()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisBranchStrategyPseudo::~BlisBranchStrategyPseudo ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 64 of file BlisBranchStrategyPseudo.h.

+ +
+
+ +

◆ BlisBranchStrategyPseudo() [3/3]

+ +
+
+ + + + + + + + +
BlisBranchStrategyPseudo::BlisBranchStrategyPseudo (const BlisBranchStrategyPseudo & )
+
+ +

Copy constructor.

+ +
+
+

Member Function Documentation

+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + + +
BlisBranchStrategyPseudo& BlisBranchStrategyPseudo::operator= (const BlisBranchStrategyPseudo & rhs)
+ 		+private
+
+ +

Illegal Assignment operator.

+ +
+
+ +

◆ setRelibility()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisBranchStrategyPseudo::setRelibility (int rel)
+ 		+inline
+
+ +

Set relibility.

+ +

Definition at line 70 of file BlisBranchStrategyPseudo.h.

+ +
+
+ +

◆ clone()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BcpsBranchStrategy* BlisBranchStrategyPseudo::clone () const
+ 		+inlinevirtual
+
+ +

Clone a brancing strategy.

+ +

Definition at line 73 of file BlisBranchStrategyPseudo.h.

+ +
+
+ +

◆ betterBranchObject()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual int BlisBranchStrategyPseudo::betterBranchObject (BcpsBranchObject * thisOne,
BcpsBranchObject * bestSoFar 
)
+ 		+virtual
+
+ +

Compare branching object thisOne to bestSoFar.

+

If thisOne is better than bestObject, return branching direction(1 or -1), otherwise return 0. If bestSorFar is NULL, then always return branching direction(1 or -1).

+ +
+
+ +

◆ createCandBranchObjects()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual int BlisBranchStrategyPseudo::createCandBranchObjects (int numPassesLeft,
double ub 
)
+ 		+virtual
+
+ +

Create a set of candidate branching objects.

+ +
+
+

Member Data Documentation

+ +

◆ relibility_

+ +
+
+ + + + + +
+ + + + +
int BlisBranchStrategyPseudo::relibility_
+ 		+private
+
+ +

Definition at line 46 of file BlisBranchStrategyPseudo.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisBranchStrategyPseudo__coll__graph.map b/Doxygen/0.94/classBlisBranchStrategyPseudo__coll__graph.map new file mode 100644 index 0000000..e32b592 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyPseudo__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisBranchStrategyPseudo__coll__graph.md5 b/Doxygen/0.94/classBlisBranchStrategyPseudo__coll__graph.md5 new file mode 100644 index 0000000..aa81f0d --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyPseudo__coll__graph.md5 @@ -0,0 +1 @@ +8a8ed203665dc1806c02e5dffd017f1e \ No newline at end of file diff --git a/Doxygen/0.94/classBlisBranchStrategyPseudo__coll__graph.png b/Doxygen/0.94/classBlisBranchStrategyPseudo__coll__graph.png new file mode 100644 index 0000000..f21c22b Binary files /dev/null and b/Doxygen/0.94/classBlisBranchStrategyPseudo__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisBranchStrategyPseudo__inherit__graph.map b/Doxygen/0.94/classBlisBranchStrategyPseudo__inherit__graph.map new file mode 100644 index 0000000..e32b592 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyPseudo__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisBranchStrategyPseudo__inherit__graph.md5 b/Doxygen/0.94/classBlisBranchStrategyPseudo__inherit__graph.md5 new file mode 100644 index 0000000..aa81f0d --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyPseudo__inherit__graph.md5 @@ -0,0 +1 @@ +8a8ed203665dc1806c02e5dffd017f1e \ No newline at end of file diff --git a/Doxygen/0.94/classBlisBranchStrategyPseudo__inherit__graph.png b/Doxygen/0.94/classBlisBranchStrategyPseudo__inherit__graph.png new file mode 100644 index 0000000..f21c22b Binary files /dev/null and b/Doxygen/0.94/classBlisBranchStrategyPseudo__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisBranchStrategyRel-members.html b/Doxygen/0.94/classBlisBranchStrategyRel-members.html new file mode 100644 index 0000000..f3539aa --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyRel-members.html @@ -0,0 +1,90 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisBranchStrategyRel Member List
+
+
+ +

This is the complete list of members for BlisBranchStrategyRel, including all inherited members.

+ + + + + + + + + + + +
betterBranchObject(BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)BlisBranchStrategyRelvirtual
BlisBranchStrategyRel()BlisBranchStrategyRelinline
BlisBranchStrategyRel(BlisModel *model, int rel)BlisBranchStrategyRelinline
BlisBranchStrategyRel(const BlisBranchStrategyRel &)BlisBranchStrategyRel
clone() constBlisBranchStrategyRelinlinevirtual
createCandBranchObjects(int numPassesLeft, double ub)BlisBranchStrategyRelvirtual
operator=(const BlisBranchStrategyRel &rhs)BlisBranchStrategyRelprivate
relibility_BlisBranchStrategyRelprotected
setRelibility(int rel)BlisBranchStrategyRelinline
~BlisBranchStrategyRel()BlisBranchStrategyRelinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisBranchStrategyRel.html b/Doxygen/0.94/classBlisBranchStrategyRel.html new file mode 100644 index 0000000..6f0409c --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyRel.html @@ -0,0 +1,465 @@ + + + + + + + +Blis: BlisBranchStrategyRel Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Protected Attributes | +Private Member Functions | +List of all members
+
+
BlisBranchStrategyRel Class Reference
+
+
+ +

Blis branching strategy. + More...

+ +

#include <BlisBranchStrategyRel.h>

+
+ + Inheritance diagram for BlisBranchStrategyRel:
+
+
+ +
+ + Collaboration diagram for BlisBranchStrategyRel:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisBranchStrategyRel ()
 Default Constructor. More...
 
 BlisBranchStrategyRel (BlisModel *model, int rel)
 Useful Constructor. More...
 
virtual ~BlisBranchStrategyRel ()
 Destructor. More...
 
 BlisBranchStrategyRel (const BlisBranchStrategyRel &)
 Copy constructor. More...
 
void setRelibility (int rel)
 Set relibility. More...
 
virtual BcpsBranchStrategy * clone () const
 Clone a brancing strategy. More...
 
virtual int betterBranchObject (BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)
 Compare branching object thisOne to bestSoFar. More...
 
virtual int createCandBranchObjects (int numPassesLeft, double ub)
 Create a set of candidate branching objects. More...
 
+ + + +

+Protected Attributes

int relibility_
 
+ + + + +

+Private Member Functions

BlisBranchStrategyRel & operator= (const BlisBranchStrategyRel &rhs)
 Illegal Assignment operator. More...
 
+

Detailed Description

+

Blis branching strategy.

+

This class implements reliability branching.

+ +

Definition at line 40 of file BlisBranchStrategyRel.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisBranchStrategyRel() [1/3]

+ +
+
+ + + + + +
+ + + + + + + +
BlisBranchStrategyRel::BlisBranchStrategyRel ()
+ 		+inline
+
+ +

Default Constructor.

+ +

Definition at line 53 of file BlisBranchStrategyRel.h.

+ +
+
+ +

◆ BlisBranchStrategyRel() [2/3]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
BlisBranchStrategyRel::BlisBranchStrategyRel (BlisModel * model,
int rel 
)
+ 		+inline
+
+ +

Useful Constructor.

+ +

Definition at line 59 of file BlisBranchStrategyRel.h.

+ +
+
+ +

◆ ~BlisBranchStrategyRel()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisBranchStrategyRel::~BlisBranchStrategyRel ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 66 of file BlisBranchStrategyRel.h.

+ +
+
+ +

◆ BlisBranchStrategyRel() [3/3]

+ +
+
+ + + + + + + + +
BlisBranchStrategyRel::BlisBranchStrategyRel (const BlisBranchStrategyRel & )
+
+ +

Copy constructor.

+ +
+
+

Member Function Documentation

+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + + +
BlisBranchStrategyRel& BlisBranchStrategyRel::operator= (const BlisBranchStrategyRel & rhs)
+ 		+private
+
+ +

Illegal Assignment operator.

+ +
+
+ +

◆ setRelibility()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisBranchStrategyRel::setRelibility (int rel)
+ 		+inline
+
+ +

Set relibility.

+ +

Definition at line 72 of file BlisBranchStrategyRel.h.

+ +
+
+ +

◆ clone()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BcpsBranchStrategy* BlisBranchStrategyRel::clone () const
+ 		+inlinevirtual
+
+ +

Clone a brancing strategy.

+ +

Definition at line 75 of file BlisBranchStrategyRel.h.

+ +
+
+ +

◆ betterBranchObject()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual int BlisBranchStrategyRel::betterBranchObject (BcpsBranchObject * thisOne,
BcpsBranchObject * bestSoFar 
)
+ 		+virtual
+
+ +

Compare branching object thisOne to bestSoFar.

+

If thisOne is better than bestObject, return branching direction(1 or -1), otherwise return 0. If bestSorFar is NULL, then always return branching direction(1 or -1).

+ +
+
+ +

◆ createCandBranchObjects()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual int BlisBranchStrategyRel::createCandBranchObjects (int numPassesLeft,
double ub 
)
+ 		+virtual
+
+ +

Create a set of candidate branching objects.

+ +
+
+

Member Data Documentation

+ +

◆ relibility_

+ +
+
+ + + + + +
+ + + + +
int BlisBranchStrategyRel::relibility_
+ 		+protected
+
+ +

Definition at line 48 of file BlisBranchStrategyRel.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisBranchStrategyRel__coll__graph.map b/Doxygen/0.94/classBlisBranchStrategyRel__coll__graph.map new file mode 100644 index 0000000..6e8d790 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyRel__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisBranchStrategyRel__coll__graph.md5 b/Doxygen/0.94/classBlisBranchStrategyRel__coll__graph.md5 new file mode 100644 index 0000000..38a9fc1 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyRel__coll__graph.md5 @@ -0,0 +1 @@ +6e419ab78c5430b89bd62b4f417ddbb2 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisBranchStrategyRel__coll__graph.png b/Doxygen/0.94/classBlisBranchStrategyRel__coll__graph.png new file mode 100644 index 0000000..20a26b4 Binary files /dev/null and b/Doxygen/0.94/classBlisBranchStrategyRel__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisBranchStrategyRel__inherit__graph.map b/Doxygen/0.94/classBlisBranchStrategyRel__inherit__graph.map new file mode 100644 index 0000000..6e8d790 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyRel__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisBranchStrategyRel__inherit__graph.md5 b/Doxygen/0.94/classBlisBranchStrategyRel__inherit__graph.md5 new file mode 100644 index 0000000..38a9fc1 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyRel__inherit__graph.md5 @@ -0,0 +1 @@ +6e419ab78c5430b89bd62b4f417ddbb2 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisBranchStrategyRel__inherit__graph.png b/Doxygen/0.94/classBlisBranchStrategyRel__inherit__graph.png new file mode 100644 index 0000000..20a26b4 Binary files /dev/null and b/Doxygen/0.94/classBlisBranchStrategyRel__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisBranchStrategyStrong-members.html b/Doxygen/0.94/classBlisBranchStrategyStrong-members.html new file mode 100644 index 0000000..4980f42 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyStrong-members.html @@ -0,0 +1,88 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisBranchStrategyStrong Member List
+
+
+ +

This is the complete list of members for BlisBranchStrategyStrong, including all inherited members.

+ + + + + + + + + +
betterBranchObject(BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)BlisBranchStrategyStrongvirtual
BlisBranchStrategyStrong()BlisBranchStrategyStronginline
BlisBranchStrategyStrong(BlisModel *model)BlisBranchStrategyStronginline
BlisBranchStrategyStrong(const BlisBranchStrategyStrong &)BlisBranchStrategyStrong
clone() constBlisBranchStrategyStronginlinevirtual
createCandBranchObjects(int numPassesLeft, double ub)BlisBranchStrategyStrongvirtual
operator=(const BlisBranchStrategyStrong &rhs)BlisBranchStrategyStrongprivate
~BlisBranchStrategyStrong()BlisBranchStrategyStronginlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisBranchStrategyStrong.html b/Doxygen/0.94/classBlisBranchStrategyStrong.html new file mode 100644 index 0000000..d92c4ae --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyStrong.html @@ -0,0 +1,390 @@ + + + + + + + +Blis: BlisBranchStrategyStrong Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Private Member Functions | +List of all members
+
+
BlisBranchStrategyStrong Class Reference
+
+
+ +

This class implements strong branching. + More...

+ +

#include <BlisBranchStrategyStrong.h>

+
+ + Inheritance diagram for BlisBranchStrategyStrong:
+
+
+ +
+ + Collaboration diagram for BlisBranchStrategyStrong:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisBranchStrategyStrong ()
 Strong Constructor. More...
 
 BlisBranchStrategyStrong (BlisModel *model)
 Strong Constructor. More...
 
virtual ~BlisBranchStrategyStrong ()
 Destructor. More...
 
 BlisBranchStrategyStrong (const BlisBranchStrategyStrong &)
 Copy constructor. More...
 
virtual BcpsBranchStrategy * clone () const
 Clone a brancing strategy. More...
 
virtual int createCandBranchObjects (int numPassesLeft, double ub)
 Create a set of candidate branching objects. More...
 
virtual int betterBranchObject (BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)
 Compare branching object thisOne to bestSoFar. More...
 
+ + + + +

+Private Member Functions

BlisBranchStrategyStrong & operator= (const BlisBranchStrategyStrong &rhs)
 Illegal Assignment operator. More...
 
+

Detailed Description

+

This class implements strong branching.

+ +

Definition at line 57 of file BlisBranchStrategyStrong.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisBranchStrategyStrong() [1/3]

+ +
+
+ + + + + +
+ + + + + + + +
BlisBranchStrategyStrong::BlisBranchStrategyStrong ()
+ 		+inline
+
+ +

Strong Constructor.

+ +

Definition at line 67 of file BlisBranchStrategyStrong.h.

+ +
+
+ +

◆ BlisBranchStrategyStrong() [2/3]

+ +
+
+ + + + + +
+ + + + + + + + +
BlisBranchStrategyStrong::BlisBranchStrategyStrong (BlisModel * model)
+ 		+inline
+
+ +

Strong Constructor.

+ +

Definition at line 72 of file BlisBranchStrategyStrong.h.

+ +
+
+ +

◆ ~BlisBranchStrategyStrong()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisBranchStrategyStrong::~BlisBranchStrategyStrong ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 78 of file BlisBranchStrategyStrong.h.

+ +
+
+ +

◆ BlisBranchStrategyStrong() [3/3]

+ +
+
+ + + + + + + + +
BlisBranchStrategyStrong::BlisBranchStrategyStrong (const BlisBranchStrategyStrong & )
+
+ +

Copy constructor.

+ +
+
+

Member Function Documentation

+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + + +
BlisBranchStrategyStrong& BlisBranchStrategyStrong::operator= (const BlisBranchStrategyStrong & rhs)
+ 		+private
+
+ +

Illegal Assignment operator.

+ +
+
+ +

◆ clone()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BcpsBranchStrategy* BlisBranchStrategyStrong::clone () const
+ 		+inlinevirtual
+
+ +

Clone a brancing strategy.

+ +

Definition at line 84 of file BlisBranchStrategyStrong.h.

+ +
+
+ +

◆ createCandBranchObjects()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual int BlisBranchStrategyStrong::createCandBranchObjects (int numPassesLeft,
double ub 
)
+ 		+virtual
+
+ +

Create a set of candidate branching objects.

+ +
+
+ +

◆ betterBranchObject()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual int BlisBranchStrategyStrong::betterBranchObject (BcpsBranchObject * thisOne,
BcpsBranchObject * bestSoFar 
)
+ 		+virtual
+
+ +

Compare branching object thisOne to bestSoFar.

+

If thisOne is better than bestObject, return branching direction(1 or -1), otherwise return 0. If bestSorFar is NULL, then always return branching direction(1 or -1).

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisBranchStrategyStrong__coll__graph.map b/Doxygen/0.94/classBlisBranchStrategyStrong__coll__graph.map new file mode 100644 index 0000000..5104e56 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyStrong__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisBranchStrategyStrong__coll__graph.md5 b/Doxygen/0.94/classBlisBranchStrategyStrong__coll__graph.md5 new file mode 100644 index 0000000..42e1c7e --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyStrong__coll__graph.md5 @@ -0,0 +1 @@ +c148b84b1906fb2e097a6201837a7281 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisBranchStrategyStrong__coll__graph.png b/Doxygen/0.94/classBlisBranchStrategyStrong__coll__graph.png new file mode 100644 index 0000000..bd00876 Binary files /dev/null and b/Doxygen/0.94/classBlisBranchStrategyStrong__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisBranchStrategyStrong__inherit__graph.map b/Doxygen/0.94/classBlisBranchStrategyStrong__inherit__graph.map new file mode 100644 index 0000000..5104e56 --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyStrong__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisBranchStrategyStrong__inherit__graph.md5 b/Doxygen/0.94/classBlisBranchStrategyStrong__inherit__graph.md5 new file mode 100644 index 0000000..42e1c7e --- /dev/null +++ b/Doxygen/0.94/classBlisBranchStrategyStrong__inherit__graph.md5 @@ -0,0 +1 @@ +c148b84b1906fb2e097a6201837a7281 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisBranchStrategyStrong__inherit__graph.png b/Doxygen/0.94/classBlisBranchStrategyStrong__inherit__graph.png new file mode 100644 index 0000000..bd00876 Binary files /dev/null and b/Doxygen/0.94/classBlisBranchStrategyStrong__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisConGenerator-members.html b/Doxygen/0.94/classBlisConGenerator-members.html new file mode 100644 index 0000000..0e376be --- /dev/null +++ b/Doxygen/0.94/classBlisConGenerator-members.html @@ -0,0 +1,125 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisConGenerator Member List
+
+
+ +

This is the complete list of members for BlisConGenerator, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
addCalls(int n=1)BlisConGeneratorinline
addNoConsCalls(int n=1)BlisConGeneratorinline
addNumConsGenerated(int n)BlisConGeneratorinline
addNumConsUsed(int n)BlisConGeneratorinline
addTime(double t)BlisConGeneratorinline
atSolution() constBlisConGeneratorinline
atSolution_BlisConGeneratorprotected
BlisConGenerator()BlisConGeneratorinline
BlisConGenerator(BlisModel *model, CglCutGenerator *generator, const char *name=NULL, BlisCutStrategy strategy=BlisCutStrategyAuto, int cutGenerationFrequency_=1, bool normal=true, bool atSolution=false, bool infeasible=false)BlisConGenerator
BlisConGenerator(const BlisConGenerator &)BlisConGenerator
calls() constBlisConGeneratorinline
calls_BlisConGeneratorprotected
cutGenerationFreq() constBlisConGeneratorinline
cutGenerationFrequency_BlisConGeneratorprotected
generateConstraints(BcpsConstraintPool &conPool)BlisConGeneratorvirtual
generator() constBlisConGeneratorinline
generator_BlisConGeneratorprotected
getModel()BlisConGeneratorinline
model_BlisConGeneratorprotected
name() constBlisConGeneratorinline
name_BlisConGeneratorprotected
noConsCalls() constBlisConGeneratorinline
noConsCalls_BlisConGeneratorprotected
normal() constBlisConGeneratorinline
normal_BlisConGeneratorprotected
numConsGenerated()BlisConGeneratorinline
numConsGenerated_BlisConGeneratorprotected
numConsUsed()BlisConGeneratorinline
numConsUsed_BlisConGeneratorprotected
operator=(const BlisConGenerator &rhs)BlisConGenerator
refreshModel(BlisModel *model)BlisConGenerator
setAtSolution(bool value)BlisConGeneratorinline
setCutGenerationFreq(int freq)BlisConGeneratorinline
setModel(BlisModel *m)BlisConGeneratorinline
setName(const char *str)BlisConGeneratorinline
setNormal(bool value)BlisConGeneratorinline
setStrategy(BlisCutStrategy value)BlisConGeneratorinline
setWhenInfeasible(bool value)BlisConGeneratorinline
strategy() constBlisConGeneratorinline
strategy_BlisConGeneratorprotected
time() constBlisConGeneratorinline
time_BlisConGeneratorprotected
whenInfeasible() constBlisConGeneratorinline
whenInfeasible_BlisConGeneratorprotected
~BlisConGenerator()BlisConGeneratorinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisConGenerator.html b/Doxygen/0.94/classBlisConGenerator.html new file mode 100644 index 0000000..489c925 --- /dev/null +++ b/Doxygen/0.94/classBlisConGenerator.html @@ -0,0 +1,1572 @@ + + + + + + + +Blis: BlisConGenerator Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Protected Attributes | +List of all members
+
+
BlisConGenerator Class Reference
+
+
+ +

Interface between Blis and Cut Generation Library. + More...

+ +

#include <BlisConGenerator.h>

+
+ + Inheritance diagram for BlisConGenerator:
+
+
+ +
+ + Collaboration diagram for BlisConGenerator:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

Constructors and destructors
 BlisConGenerator ()
 Default constructor. More...
 
 BlisConGenerator (BlisModel *model, CglCutGenerator *generator, const char *name=NULL, BlisCutStrategy strategy=BlisCutStrategyAuto, int cutGenerationFrequency_=1, bool normal=true, bool atSolution=false, bool infeasible=false)
 Useful constructor. More...
 
 BlisConGenerator (const BlisConGenerator &)
 Copy constructor. More...
 
BlisConGenerator & operator= (const BlisConGenerator &rhs)
 Assignment operator. More...
 
virtual ~BlisConGenerator ()
 Destructor. More...
 
Generate Constraints
virtual bool generateConstraints (BcpsConstraintPool &conPool)
 Generate cons for the client model. More...
 
Gets and sets
BlisModel * getModel ()
 Set the client model. More...
 
void setModel (BlisModel *m)
 Set the model. More...
 
void refreshModel (BlisModel *model)
 Refresh the model. More...
 
void setName (const char *str)
 return name of generator. More...
 
std::string name () const
 return name of generator. More...
 
void setStrategy (BlisCutStrategy value)
 Set the con generation strategy. More...
 
BlisCutStrategy strategy () const
 Get the con generation interval. More...
 
void setCutGenerationFreq (int freq)
 Set the con generation strategy. More...
 
int cutGenerationFreq () const
 Get the con generation interval. More...
 
bool normal () const
 Get whether the con generator should be called in the normal place. More...
 
void setNormal (bool value)
 Set whether the con generator should be called in the normal place. More...
 
bool atSolution () const
 Get whether the con generator should be called when a solution is found. More...
 
void setAtSolution (bool value)
 Set whether the con generator should be called when a solution is found. More...
 
bool whenInfeasible () const
 Get whether the con generator should be called when the subproblem is found to be infeasible. More...
 
void setWhenInfeasible (bool value)
 Set whether the con generator should be called when the subproblem is found to be infeasible. More...
 
CglCutGenerator * generator () const
 Get the CglCutGenerator bound to this BlisConGenerator. More...
 
int numConsGenerated ()
 Get number of generated cons. More...
 
void addNumConsGenerated (int n)
 Increase the number of generated cons. More...
 
int numConsUsed ()
 Get number of used cons. More...
 
void addNumConsUsed (int n)
 Increase the number of generated cons. More...
 
double time () const
 Cpu time used. More...
 
void addTime (double t)
 Increase Cpu time used. More...
 
int calls () const
 Number called. More...
 
void addCalls (int n=1)
 Increase the number of called. More...
 
int noConsCalls () const
 Number called and no cons found. More...
 
void addNoConsCalls (int n=1)
 Increase the number of no cons called. More...
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Protected Attributes

BlisModel * model_
 The client model. More...
 
CglCutGenerator * generator_
 The CglCutGenerator object. More...
 
BlisCutStrategy strategy_
 When to call CglCutGenerator::generateCuts routine. More...
 
int cutGenerationFrequency_
 The frequency of calls to the cut generator. More...
 
std::string name_
 Name of generator. More...
 
bool normal_
 Whether to call the generator in the normal place. More...
 
bool atSolution_
 Whether to call the generator when a new solution is found. More...
 
bool whenInfeasible_
 Whether to call generator when a subproblem is found to be infeasible. More...
 
int numConsGenerated_
 Number of cons generated. More...
 
int numConsUsed_
 Number of cons used. More...
 
double time_
 Used CPU/User time. More...
 
int calls_
 The times of calling this generator. More...
 
int noConsCalls_
 The times of calling this generator and no cons found. More...
 
+

Detailed Description

+

Interface between Blis and Cut Generation Library.

+

BlisConGenerator is intended to provide an intelligent interface between Blis and the cutting plane algorithms in the CGL. A BlisConGenerator is bound to a CglCutGenerator and to an BlisModel. It contains parameters which control when and how the generateCuts method of the CglCutGenerator will be called.

+

The builtin decision criteria available to use when deciding whether to generate cons are: at root, autmatic, every X nodes, when a solution is found, and when a subproblem is found to be infeasible.

+ +

Definition at line 58 of file BlisConGenerator.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisConGenerator() [1/3]

+ +
+
+ + + + + +
+ + + + + + + +
BlisConGenerator::BlisConGenerator ()
+ 		+inline
+
+ +

Default constructor.

+ +

Definition at line 119 of file BlisConGenerator.h.

+ +
+
+ +

◆ BlisConGenerator() [2/3]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisConGenerator::BlisConGenerator (BlisModel * model,
CglCutGenerator * generator,
const char * name = NULL,
BlisCutStrategy strategy = BlisCutStrategyAuto,
int cutGenerationFrequency_ = 1,
bool normal = true,
bool atSolution = false,
bool infeasible = false 
)
+
+ +

Useful constructor.

+ +
+
+ +

◆ BlisConGenerator() [3/3]

+ +
+
+ + + + + + + + +
BlisConGenerator::BlisConGenerator (const BlisConGenerator & )
+
+ +

Copy constructor.

+ +
+
+ +

◆ ~BlisConGenerator()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisConGenerator::~BlisConGenerator ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 152 of file BlisConGenerator.h.

+ +
+
+

Member Function Documentation

+ +

◆ operator=()

+ +
+
+ + + + + + + + +
BlisConGenerator& BlisConGenerator::operator= (const BlisConGenerator & rhs)
+
+ +

Assignment operator.

+ +
+
+ +

◆ generateConstraints()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual bool BlisConGenerator::generateConstraints (BcpsConstraintPool & conPool)
+ 		+virtual
+
+ +

Generate cons for the client model.

+

Evaluate the state of the client model and decide whether to generate cons. The generated cons are inserted into and returned in the collection of cons cs.

+

The routine returns true if reoptimisation is needed (because the state of the solver interface has been modified).

+ +

Reimplemented in VrpCutGenerator.

+ +
+
+ +

◆ getModel()

+ +
+
+ + + + + +
+ + + + + + + +
BlisModel* BlisConGenerator::getModel ()
+ 		+inline
+
+ +

Set the client model.

+

In addition to setting the client model, refreshModel also calls the refreshSolver method of the CglCutGenerator object. Get a pointer to the model

+ +

Definition at line 182 of file BlisConGenerator.h.

+ +
+
+ +

◆ setModel()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisConGenerator::setModel (BlisModel * m)
+ 		+inline
+
+ +

Set the model.

+ +

Definition at line 185 of file BlisConGenerator.h.

+ +
+
+ +

◆ refreshModel()

+ +
+
+ + + + + + + + +
void BlisConGenerator::refreshModel (BlisModel * model)
+
+ +

Refresh the model.

+ +
+
+ +

◆ setName()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisConGenerator::setName (const char * str)
+ 		+inline
+
+ +

return name of generator.

+ +

Definition at line 191 of file BlisConGenerator.h.

+ +
+
+ +

◆ name()

+ +
+
+ + + + + +
+ + + + + + + +
std::string BlisConGenerator::name () const
+ 		+inline
+
+ +

return name of generator.

+ +

Definition at line 194 of file BlisConGenerator.h.

+ +
+
+ +

◆ setStrategy()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisConGenerator::setStrategy (BlisCutStrategy value)
+ 		+inline
+
+ +

Set the con generation strategy.

+ +

Definition at line 197 of file BlisConGenerator.h.

+ +
+
+ +

◆ strategy()

+ +
+
+ + + + + +
+ + + + + + + +
BlisCutStrategy BlisConGenerator::strategy () const
+ 		+inline
+
+ +

Get the con generation interval.

+ +

Definition at line 200 of file BlisConGenerator.h.

+ +
+
+ +

◆ setCutGenerationFreq()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisConGenerator::setCutGenerationFreq (int freq)
+ 		+inline
+
+ +

Set the con generation strategy.

+ +

Definition at line 203 of file BlisConGenerator.h.

+ +
+
+ +

◆ cutGenerationFreq()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisConGenerator::cutGenerationFreq () const
+ 		+inline
+
+ +

Get the con generation interval.

+ +

Definition at line 206 of file BlisConGenerator.h.

+ +
+
+ +

◆ normal()

+ +
+
+ + + + + +
+ + + + + + + +
bool BlisConGenerator::normal () const
+ 		+inline
+
+ +

Get whether the con generator should be called in the normal place.

+ +

Definition at line 209 of file BlisConGenerator.h.

+ +
+
+ +

◆ setNormal()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisConGenerator::setNormal (bool value)
+ 		+inline
+
+ +

Set whether the con generator should be called in the normal place.

+ +

Definition at line 212 of file BlisConGenerator.h.

+ +
+
+ +

◆ atSolution()

+ +
+
+ + + + + +
+ + + + + + + +
bool BlisConGenerator::atSolution () const
+ 		+inline
+
+ +

Get whether the con generator should be called when a solution is found.

+ +

Definition at line 216 of file BlisConGenerator.h.

+ +
+
+ +

◆ setAtSolution()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisConGenerator::setAtSolution (bool value)
+ 		+inline
+
+ +

Set whether the con generator should be called when a solution is found.

+ +

Definition at line 220 of file BlisConGenerator.h.

+ +
+
+ +

◆ whenInfeasible()

+ +
+
+ + + + + +
+ + + + + + + +
bool BlisConGenerator::whenInfeasible () const
+ 		+inline
+
+ +

Get whether the con generator should be called when the subproblem is found to be infeasible.

+ +

Definition at line 224 of file BlisConGenerator.h.

+ +
+
+ +

◆ setWhenInfeasible()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisConGenerator::setWhenInfeasible (bool value)
+ 		+inline
+
+ +

Set whether the con generator should be called when the subproblem is found to be infeasible.

+ +

Definition at line 228 of file BlisConGenerator.h.

+ +
+
+ +

◆ generator()

+ +
+
+ + + + + +
+ + + + + + + +
CglCutGenerator* BlisConGenerator::generator () const
+ 		+inline
+
+ +

Get the CglCutGenerator bound to this BlisConGenerator.

+ +

Definition at line 231 of file BlisConGenerator.h.

+ +
+
+ +

◆ numConsGenerated()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisConGenerator::numConsGenerated ()
+ 		+inline
+
+ +

Get number of generated cons.

+ +

Definition at line 234 of file BlisConGenerator.h.

+ +
+
+ +

◆ addNumConsGenerated()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisConGenerator::addNumConsGenerated (int n)
+ 		+inline
+
+ +

Increase the number of generated cons.

+ +

Definition at line 237 of file BlisConGenerator.h.

+ +
+
+ +

◆ numConsUsed()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisConGenerator::numConsUsed ()
+ 		+inline
+
+ +

Get number of used cons.

+ +

Definition at line 240 of file BlisConGenerator.h.

+ +
+
+ +

◆ addNumConsUsed()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisConGenerator::addNumConsUsed (int n)
+ 		+inline
+
+ +

Increase the number of generated cons.

+ +

Definition at line 243 of file BlisConGenerator.h.

+ +
+
+ +

◆ time()

+ +
+
+ + + + + +
+ + + + + + + +
double BlisConGenerator::time () const
+ 		+inline
+
+ +

Cpu time used.

+ +

Definition at line 246 of file BlisConGenerator.h.

+ +
+
+ +

◆ addTime()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisConGenerator::addTime (double t)
+ 		+inline
+
+ +

Increase Cpu time used.

+ +

Definition at line 249 of file BlisConGenerator.h.

+ +
+
+ +

◆ calls()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisConGenerator::calls () const
+ 		+inline
+
+ +

Number called.

+ +

Definition at line 252 of file BlisConGenerator.h.

+ +
+
+ +

◆ addCalls()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisConGenerator::addCalls (int n = 1)
+ 		+inline
+
+ +

Increase the number of called.

+ +

Definition at line 255 of file BlisConGenerator.h.

+ +
+
+ +

◆ noConsCalls()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisConGenerator::noConsCalls () const
+ 		+inline
+
+ +

Number called and no cons found.

+ +

Definition at line 258 of file BlisConGenerator.h.

+ +
+
+ +

◆ addNoConsCalls()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisConGenerator::addNoConsCalls (int n = 1)
+ 		+inline
+
+ +

Increase the number of no cons called.

+ +

Definition at line 261 of file BlisConGenerator.h.

+ +
+
+

Member Data Documentation

+ +

◆ model_

+ +
+
+ + + + + +
+ + + + +
BlisModel* BlisConGenerator::model_
+ 		+protected
+
+ +

The client model.

+ +

Definition at line 62 of file BlisConGenerator.h.

+ +
+
+ +

◆ generator_

+ +
+
+ + + + + +
+ + + + +
CglCutGenerator* BlisConGenerator::generator_
+ 		+protected
+
+ +

The CglCutGenerator object.

+ +

Definition at line 65 of file BlisConGenerator.h.

+ +
+
+ +

◆ strategy_

+ +
+
+ + + + + +
+ + + + +
BlisCutStrategy BlisConGenerator::strategy_
+ 		+protected
+
+ +

When to call CglCutGenerator::generateCuts routine.

+

BlisCutStrategyNone: disable BlisCutStrategyRoot: just root BlisCutStrategyAuto: automatically decided by BLIS BlisCutStrategyPeriodic: Generate every 't' nodes

+ +

Definition at line 77 of file BlisConGenerator.h.

+ +
+
+ +

◆ cutGenerationFrequency_

+ +
+
+ + + + + +
+ + + + +
int BlisConGenerator::cutGenerationFrequency_
+ 		+protected
+
+ +

The frequency of calls to the cut generator.

+ +

Definition at line 80 of file BlisConGenerator.h.

+ +
+
+ +

◆ name_

+ +
+
+ + + + + +
+ + + + +
std::string BlisConGenerator::name_
+ 		+protected
+
+ +

Name of generator.

+ +

Definition at line 83 of file BlisConGenerator.h.

+ +
+
+ +

◆ normal_

+ +
+
+ + + + + +
+ + + + +
bool BlisConGenerator::normal_
+ 		+protected
+
+ +

Whether to call the generator in the normal place.

+ +

Definition at line 86 of file BlisConGenerator.h.

+ +
+
+ +

◆ atSolution_

+ +
+
+ + + + + +
+ + + + +
bool BlisConGenerator::atSolution_
+ 		+protected
+
+ +

Whether to call the generator when a new solution is found.

+ +

Definition at line 89 of file BlisConGenerator.h.

+ +
+
+ +

◆ whenInfeasible_

+ +
+
+ + + + + +
+ + + + +
bool BlisConGenerator::whenInfeasible_
+ 		+protected
+
+ +

Whether to call generator when a subproblem is found to be infeasible.

+ +

Definition at line 93 of file BlisConGenerator.h.

+ +
+
+ +

◆ numConsGenerated_

+ +
+
+ + + + + +
+ + + + +
int BlisConGenerator::numConsGenerated_
+ 		+protected
+
+ +

Number of cons generated.

+ +

Definition at line 100 of file BlisConGenerator.h.

+ +
+
+ +

◆ numConsUsed_

+ +
+
+ + + + + +
+ + + + +
int BlisConGenerator::numConsUsed_
+ 		+protected
+
+ +

Number of cons used.

+ +

Definition at line 103 of file BlisConGenerator.h.

+ +
+
+ +

◆ time_

+ +
+
+ + + + + +
+ + + + +
double BlisConGenerator::time_
+ 		+protected
+
+ +

Used CPU/User time.

+ +

Definition at line 106 of file BlisConGenerator.h.

+ +
+
+ +

◆ calls_

+ +
+
+ + + + + +
+ + + + +
int BlisConGenerator::calls_
+ 		+protected
+
+ +

The times of calling this generator.

+ +

Definition at line 109 of file BlisConGenerator.h.

+ +
+
+ +

◆ noConsCalls_

+ +
+
+ + + + + +
+ + + + +
int BlisConGenerator::noConsCalls_
+ 		+protected
+
+ +

The times of calling this generator and no cons found.

+ +

Definition at line 112 of file BlisConGenerator.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisConGenerator__coll__graph.map b/Doxygen/0.94/classBlisConGenerator__coll__graph.map new file mode 100644 index 0000000..cbf4d61 --- /dev/null +++ b/Doxygen/0.94/classBlisConGenerator__coll__graph.map @@ -0,0 +1,19 @@ + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/classBlisConGenerator__coll__graph.md5 b/Doxygen/0.94/classBlisConGenerator__coll__graph.md5 new file mode 100644 index 0000000..da32b69 --- /dev/null +++ b/Doxygen/0.94/classBlisConGenerator__coll__graph.md5 @@ -0,0 +1 @@ +633d5f1892356f7c8f6b1aeb3831df64 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisConGenerator__coll__graph.png b/Doxygen/0.94/classBlisConGenerator__coll__graph.png new file mode 100644 index 0000000..1b289a7 Binary files /dev/null and b/Doxygen/0.94/classBlisConGenerator__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisConGenerator__inherit__graph.map b/Doxygen/0.94/classBlisConGenerator__inherit__graph.map new file mode 100644 index 0000000..0145f42 --- /dev/null +++ b/Doxygen/0.94/classBlisConGenerator__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisConGenerator__inherit__graph.md5 b/Doxygen/0.94/classBlisConGenerator__inherit__graph.md5 new file mode 100644 index 0000000..7364e88 --- /dev/null +++ b/Doxygen/0.94/classBlisConGenerator__inherit__graph.md5 @@ -0,0 +1 @@ +30f3a10a4e89833358d9b3cd2792f077 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisConGenerator__inherit__graph.png b/Doxygen/0.94/classBlisConGenerator__inherit__graph.png new file mode 100644 index 0000000..d199a85 Binary files /dev/null and b/Doxygen/0.94/classBlisConGenerator__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisConstraint-members.html b/Doxygen/0.94/classBlisConstraint-members.html new file mode 100644 index 0000000..0d80fad --- /dev/null +++ b/Doxygen/0.94/classBlisConstraint-members.html @@ -0,0 +1,100 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisConstraint Member List
+
+
+ +

This is the complete list of members for BlisConstraint, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + +
BlisConstraint()BlisConstraint
BlisConstraint(int s, const int *ind, const double *val)BlisConstraint
BlisConstraint(double lbh, double ubh, double lbs, double ubs)BlisConstraint
BlisConstraint(double lbh, double ubh, double lbs, double ubs, int size, const int *ind, const double *val)BlisConstraint
BlisConstraint(const BlisConstraint &rhs)BlisConstraint
createOsiRowCut()BlisConstraint
decode(AlpsEncoded &encoded) constBlisConstraintvirtual
decodeBlis(AlpsEncoded &encoded)BlisConstraintprotected
encode(AlpsEncoded *encoded)BlisConstraintvirtual
encodeBlis(AlpsEncoded *encoded)BlisConstraintprotected
getIndices() constBlisConstraintinline
getSize() constBlisConstraintinline
getValues() constBlisConstraintinline
hashing(BcpsModel *model=NULL)BlisConstraintvirtual
indices_BlisConstraintprotected
setData(int s, const int *ind, const double *val)BlisConstraintinline
size_BlisConstraintprotected
values_BlisConstraintprotected
violation(const double *lpSolution)BlisConstraint
~BlisConstraint()BlisConstraintvirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisConstraint.html b/Doxygen/0.94/classBlisConstraint.html new file mode 100644 index 0000000..dc717ab --- /dev/null +++ b/Doxygen/0.94/classBlisConstraint.html @@ -0,0 +1,779 @@ + + + + + + + +Blis: BlisConstraint Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Protected Member Functions | +Protected Attributes | +List of all members
+
+
BlisConstraint Class Reference
+
+
+ +

#include <BlisConstraint.h>

+
+ + Inheritance diagram for BlisConstraint:
+
+
+ +
+ + Collaboration diagram for BlisConstraint:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisConstraint ()
 Default constructor. More...
 
 BlisConstraint (int s, const int *ind, const double *val)
 Useful constructor. More...
 
 BlisConstraint (double lbh, double ubh, double lbs, double ubs)
 Useful constructor. More...
 
 BlisConstraint (double lbh, double ubh, double lbs, double ubs, int size, const int *ind, const double *val)
 Useful constructor. More...
 
virtual ~BlisConstraint ()
 Destructor. More...
 
 BlisConstraint (const BlisConstraint &rhs)
 Copy constructor. More...
 
OsiRowCut * createOsiRowCut ()
 Create a OsiRowCut based on this constraint. More...
 
virtual void hashing (BcpsModel *model=NULL)
 Compute a hash key. More...
 
double violation (const double *lpSolution)
 Check if violates a given lp solution. More...
 
virtual AlpsReturnStatus encode (AlpsEncoded *encoded)
 Pack into a encode object. More...
 
virtual AlpsKnowledge * decode (AlpsEncoded &encoded) const
 Decode a constraint from an encoded object. More...
 
int getSize () const
 Return data
+ More...
 
int * getIndices () const
 
double * getValues () const
 
void setData (int s, const int *ind, const double *val)
 Set data
+ More...
 
+ + + + + + + +

+Protected Member Functions

AlpsReturnStatus encodeBlis (AlpsEncoded *encoded)
 Pack Blis part into an encoded object. More...
 
AlpsReturnStatus decodeBlis (AlpsEncoded &encoded)
 Unpack Blis part from a encode object. More...
 
+ + + + + + + + + + +

+Protected Attributes

int size_
 Number of nonzero coefficients. More...
 
int * indices_
 Variable indices. More...
 
double * values_
 Value of nonzero coefficients. More...
 
+

Detailed Description

+
+

Definition at line 33 of file BlisConstraint.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisConstraint() [1/5]

+ +
+
+ + + + + + + +
BlisConstraint::BlisConstraint ()
+
+ +

Default constructor.

+ +
+
+ +

◆ BlisConstraint() [2/5]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
BlisConstraint::BlisConstraint (int s,
const int * ind,
const double * val 
)
+
+ +

Useful constructor.

+ +
+
+ +

◆ BlisConstraint() [3/5]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisConstraint::BlisConstraint (double lbh,
double ubh,
double lbs,
double ubs 
)
+
+ +

Useful constructor.

+ +
+
+ +

◆ BlisConstraint() [4/5]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisConstraint::BlisConstraint (double lbh,
double ubh,
double lbs,
double ubs,
int size,
const int * ind,
const double * val 
)
+
+ +

Useful constructor.

+ +
+
+ +

◆ ~BlisConstraint()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisConstraint::~BlisConstraint ()
+ 		+virtual
+
+ +

Destructor.

+ +
+
+ +

◆ BlisConstraint() [5/5]

+ +
+
+ + + + + + + + +
BlisConstraint::BlisConstraint (const BlisConstraint & rhs)
+
+ +

Copy constructor.

+ +
+
+

Member Function Documentation

+ +

◆ getSize()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisConstraint::getSize () const
+ 		+inline
+
+ +

Return data
+

+ +

Definition at line 65 of file BlisConstraint.h.

+ +
+
+ +

◆ getIndices()

+ +
+
+ + + + + +
+ + + + + + + +
int* BlisConstraint::getIndices () const
+ 		+inline
+
+ +

Definition at line 66 of file BlisConstraint.h.

+ +
+
+ +

◆ getValues()

+ +
+
+ + + + + +
+ + + + + + + +
double* BlisConstraint::getValues () const
+ 		+inline
+
+ +

Definition at line 67 of file BlisConstraint.h.

+ +
+
+ +

◆ setData()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void BlisConstraint::setData (int s,
const int * ind,
const double * val 
)
+ 		+inline
+
+ +

Set data
+

+ +

Definition at line 72 of file BlisConstraint.h.

+ +
+
+ +

◆ encodeBlis()

+ +
+
+ + + + + +
+ + + + + + + + +
AlpsReturnStatus BlisConstraint::encodeBlis (AlpsEncoded * encoded)
+ 		+protected
+
+ +

Pack Blis part into an encoded object.

+ +
+
+ +

◆ decodeBlis()

+ +
+
+ + + + + +
+ + + + + + + + +
AlpsReturnStatus BlisConstraint::decodeBlis (AlpsEncoded & encoded)
+ 		+protected
+
+ +

Unpack Blis part from a encode object.

+ +
+
+ +

◆ createOsiRowCut()

+ +
+
+ + + + + + + +
OsiRowCut* BlisConstraint::createOsiRowCut ()
+
+ +

Create a OsiRowCut based on this constraint.

+ +
+
+ +

◆ hashing()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisConstraint::hashing (BcpsModel * model = NULL)
+ 		+virtual
+
+ +

Compute a hash key.

+ +
+
+ +

◆ violation()

+ +
+
+ + + + + + + + +
double BlisConstraint::violation (const double * lpSolution)
+
+ +

Check if violates a given lp solution.

+ +
+
+ +

◆ encode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsReturnStatus BlisConstraint::encode (AlpsEncoded * encoded)
+ 		+virtual
+
+ +

Pack into a encode object.

+ +
+
+ +

◆ decode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsKnowledge* BlisConstraint::decode (AlpsEncoded & encoded) const
+ 		+virtual
+
+ +

Decode a constraint from an encoded object.

+ +
+
+

Member Data Documentation

+ +

◆ size_

+ +
+
+ + + + + +
+ + + + +
int BlisConstraint::size_
+ 		+protected
+
+ +

Number of nonzero coefficients.

+ +

Definition at line 37 of file BlisConstraint.h.

+ +
+
+ +

◆ indices_

+ +
+
+ + + + + +
+ + + + +
int* BlisConstraint::indices_
+ 		+protected
+
+ +

Variable indices.

+ +

Definition at line 39 of file BlisConstraint.h.

+ +
+
+ +

◆ values_

+ +
+
+ + + + + +
+ + + + +
double* BlisConstraint::values_
+ 		+protected
+
+ +

Value of nonzero coefficients.

+ +

Definition at line 41 of file BlisConstraint.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisConstraint__coll__graph.map b/Doxygen/0.94/classBlisConstraint__coll__graph.map new file mode 100644 index 0000000..24efb9a --- /dev/null +++ b/Doxygen/0.94/classBlisConstraint__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisConstraint__coll__graph.md5 b/Doxygen/0.94/classBlisConstraint__coll__graph.md5 new file mode 100644 index 0000000..c0264c2 --- /dev/null +++ b/Doxygen/0.94/classBlisConstraint__coll__graph.md5 @@ -0,0 +1 @@ +f3ead5377eaf86bf95962a42ae0be5f4 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisConstraint__coll__graph.png b/Doxygen/0.94/classBlisConstraint__coll__graph.png new file mode 100644 index 0000000..9ac951e Binary files /dev/null and b/Doxygen/0.94/classBlisConstraint__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisConstraint__inherit__graph.map b/Doxygen/0.94/classBlisConstraint__inherit__graph.map new file mode 100644 index 0000000..24efb9a --- /dev/null +++ b/Doxygen/0.94/classBlisConstraint__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisConstraint__inherit__graph.md5 b/Doxygen/0.94/classBlisConstraint__inherit__graph.md5 new file mode 100644 index 0000000..c0264c2 --- /dev/null +++ b/Doxygen/0.94/classBlisConstraint__inherit__graph.md5 @@ -0,0 +1 @@ +f3ead5377eaf86bf95962a42ae0be5f4 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisConstraint__inherit__graph.png b/Doxygen/0.94/classBlisConstraint__inherit__graph.png new file mode 100644 index 0000000..9ac951e Binary files /dev/null and b/Doxygen/0.94/classBlisConstraint__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisHeurRound-members.html b/Doxygen/0.94/classBlisHeurRound-members.html new file mode 100644 index 0000000..74dd2cf --- /dev/null +++ b/Doxygen/0.94/classBlisHeurRound-members.html @@ -0,0 +1,118 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisHeurRound Member List
+
+
+ +

This is the complete list of members for BlisHeurRound, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
addCalls(int c=1)BlisHeuristicinline
addNoSolCalls(int n=1)BlisHeuristicinline
addNumSolutions(int num=1)BlisHeuristicinline
addTime(double t=0.0)BlisHeuristicinline
BlisHeuristic()BlisHeuristicinline
BlisHeuristic(BlisModel *model, const char *name, BlisHeurStrategy strategy, int heurCallFrequency)BlisHeuristicinline
BlisHeuristic(const BlisHeuristic &rhs)BlisHeuristicinline
BlisHeurRound()BlisHeurRoundinline
BlisHeurRound(BlisModel *model, const char *name, BlisHeurStrategy strategy, int freq)BlisHeurRoundinline
BlisHeurRound(const BlisHeurRound &)BlisHeurRound
calls() constBlisHeuristicinline
calls_BlisHeuristicprotected
clone() constBlisHeurRoundvirtual
heurCallFrequency() constBlisHeuristicinlinevirtual
heurCallFrequency_BlisHeuristicprotected
matrix_BlisHeurRoundprotected
matrixByRow_BlisHeurRoundprotected
model_BlisHeuristicprotected
name() constBlisHeuristicinline
name_BlisHeuristicprotected
noSolCalls() constBlisHeuristicinline
noSolsCalls_BlisHeuristicprotected
numSolutions() constBlisHeuristicinline
numSolutions_BlisHeuristicprotected
operator=(const BlisHeurRound &rhs)BlisHeurRoundprivate
searchSolution(double &objectiveValue, double *newSolution)BlisHeurRoundvirtual
BlisHeuristic::searchSolution(double &objectiveValue, double *newSolution, OsiCuts &cs)BlisHeuristicinlinevirtual
seed_BlisHeurRoundprotected
setHeurCallFrequency(int freq)BlisHeuristicinlinevirtual
setModel(BlisModel *model)BlisHeurRoundvirtual
setSeed(int value)BlisHeurRoundinline
setStrategy(BlisHeurStrategy strategy)BlisHeuristicinlinevirtual
strategy() constBlisHeuristicinlinevirtual
strategy_BlisHeuristicprotected
time() constBlisHeuristicinline
time_BlisHeuristicprotected
~BlisHeuristic()BlisHeuristicinlinevirtual
~BlisHeurRound()BlisHeurRoundinline
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisHeurRound.html b/Doxygen/0.94/classBlisHeurRound.html new file mode 100644 index 0000000..6811400 --- /dev/null +++ b/Doxygen/0.94/classBlisHeurRound.html @@ -0,0 +1,626 @@ + + + + + + + +Blis: BlisHeurRound Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Protected Attributes | +Private Member Functions | +List of all members
+
+
BlisHeurRound Class Reference
+
+
+ +

Rounding Heuristic. + More...

+ +

#include <BlisHeurRound.h>

+
+ + Inheritance diagram for BlisHeurRound:
+
+
+ +
+ + Collaboration diagram for BlisHeurRound:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisHeurRound ()
 Default Constructor. More...
 
 BlisHeurRound (BlisModel *model, const char *name, BlisHeurStrategy strategy, int freq)
 Constructor with model - assumed before cuts. More...
 
 ~BlisHeurRound ()
 Destructor. More...
 
 BlisHeurRound (const BlisHeurRound &)
 Copy constructor. More...
 
virtual BlisHeuristic * clone () const
 Clone a rounding heuristic. More...
 
virtual void setModel (BlisModel *model)
 update model (This is needed if cliques update matrix etc). More...
 
virtual bool searchSolution (double &objectiveValue, double *newSolution)
 returns 0 if no solution, 1 if valid solution with better objective value than one passed in Sets solution values if good, sets objective value (only if good) This is called after cuts have been added - so can not add cuts More...
 
void setSeed (int value)
 Set seed. More...
 
- Public Member Functions inherited from BlisHeuristic
 BlisHeuristic ()
 Default Constructor. More...
 
 BlisHeuristic (BlisModel *model, const char *name, BlisHeurStrategy strategy, int heurCallFrequency)
 Useful constructor. More...
 
virtual ~BlisHeuristic ()
 Distructor. More...
 
 BlisHeuristic (const BlisHeuristic &rhs)
 Copy constructor. More...
 
virtual void setStrategy (BlisHeurStrategy strategy)
 Get/set strategy. More...
 
virtual BlisHeurStrategy strategy () const
 
virtual void setHeurCallFrequency (int freq)
 Get/set call frequency. More...
 
virtual int heurCallFrequency () const
 
virtual bool searchSolution (double &objectiveValue, double *newSolution, OsiCuts &cs)
 returns 0 if no solution, 1 if valid solution, -1 if just returning an estimate of best possible solution with better objective value than one passed in Sets solution values if good, sets objective value (only if nonzero code) This is called at same time as cut generators - so can add cuts Default is do nothing More...
 
const char * name () const
 return name of generator. More...
 
void addNumSolutions (int num=1)
 Record number of solutions found. More...
 
int numSolutions () const
 Number of solutions found. More...
 
void addTime (double t=0.0)
 Record Cpu time used. More...
 
double time () const
 Cpu time used. More...
 
void addCalls (int c=1)
 Record number of times called. More...
 
int calls () const
 Number of times called. More...
 
int noSolCalls () const
 Number called and no cons found. More...
 
void addNoSolCalls (int n=1)
 Increase the number of no cons called. More...
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Protected Attributes

CoinPackedMatrix matrix_
 Column majored matrix. More...
 
CoinPackedMatrix matrixByRow_
 Row majored matrix. More...
 
int seed_
 Seed for random stuff. More...
 
- Protected Attributes inherited from BlisHeuristic
BlisModel * model_
 Pointer to the model. More...
 
char * name_
 Heuristics name. More...
 
BlisHeurStrategy strategy_
 When to call findSolution() routine. More...
 
int heurCallFrequency_
 The frequency with which to call the heuristic. More...
 
int numSolutions_
 Number of solutions found. More...
 
double time_
 Used CPU/User time. More...
 
int calls_
 The times of calling this heuristic. More...
 
int noSolsCalls_
 The times of calling this heuristic and no solutions found. More...
 
+ + + + +

+Private Member Functions

BlisHeurRound & operator= (const BlisHeurRound &rhs)
 Illegal Assignment operator. More...
 
+

Detailed Description

+

Rounding Heuristic.

+


+

+ +

Definition at line 44 of file BlisHeurRound.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisHeurRound() [1/3]

+ +
+
+ + + + + +
+ + + + + + + +
BlisHeurRound::BlisHeurRound ()
+ 		+inline
+
+ +

Default Constructor.

+ +

Definition at line 61 of file BlisHeurRound.h.

+ +
+
+ +

◆ BlisHeurRound() [2/3]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisHeurRound::BlisHeurRound (BlisModel * model,
const char * name,
BlisHeurStrategy strategy,
int freq 
)
+ 		+inline
+
+ +

Constructor with model - assumed before cuts.

+ +

Definition at line 64 of file BlisHeurRound.h.

+ +
+
+ +

◆ ~BlisHeurRound()

+ +
+
+ + + + + +
+ + + + + + + +
BlisHeurRound::~BlisHeurRound ()
+ 		+inline
+
+ +

Destructor.

+ +

Definition at line 73 of file BlisHeurRound.h.

+ +
+
+ +

◆ BlisHeurRound() [3/3]

+ +
+
+ + + + + + + + +
BlisHeurRound::BlisHeurRound (const BlisHeurRound & )
+
+ +

Copy constructor.

+ +
+
+

Member Function Documentation

+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + + +
BlisHeurRound& BlisHeurRound::operator= (const BlisHeurRound & rhs)
+ 		+private
+
+ +

Illegal Assignment operator.

+ +
+
+ +

◆ clone()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisHeuristic* BlisHeurRound::clone () const
+ 		+virtual
+
+ +

Clone a rounding heuristic.

+ +

Reimplemented from BlisHeuristic.

+ +
+
+ +

◆ setModel()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisHeurRound::setModel (BlisModel * model)
+ 		+virtual
+
+ +

update model (This is needed if cliques update matrix etc).

+ +

Reimplemented from BlisHeuristic.

+ +
+
+ +

◆ searchSolution()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual bool BlisHeurRound::searchSolution (double & objectiveValue,
double * newSolution 
)
+ 		+virtual
+
+ +

returns 0 if no solution, 1 if valid solution with better objective value than one passed in Sets solution values if good, sets objective value (only if good) This is called after cuts have been added - so can not add cuts

+ +

Implements BlisHeuristic.

+ +
+
+ +

◆ setSeed()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisHeurRound::setSeed (int value)
+ 		+inline
+
+ +

Set seed.

+ +

Definition at line 94 of file BlisHeurRound.h.

+ +
+
+

Member Data Documentation

+ +

◆ matrix_

+ +
+
+ + + + + +
+ + + + +
CoinPackedMatrix BlisHeurRound::matrix_
+ 		+protected
+
+ +

Column majored matrix.

+ +

Definition at line 51 of file BlisHeurRound.h.

+ +
+
+ +

◆ matrixByRow_

+ +
+
+ + + + + +
+ + + + +
CoinPackedMatrix BlisHeurRound::matrixByRow_
+ 		+protected
+
+ +

Row majored matrix.

+ +

Definition at line 54 of file BlisHeurRound.h.

+ +
+
+ +

◆ seed_

+ +
+
+ + + + + +
+ + + + +
int BlisHeurRound::seed_
+ 		+protected
+
+ +

Seed for random stuff.

+ +

Definition at line 57 of file BlisHeurRound.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisHeurRound__coll__graph.map b/Doxygen/0.94/classBlisHeurRound__coll__graph.map new file mode 100644 index 0000000..e9bd309 --- /dev/null +++ b/Doxygen/0.94/classBlisHeurRound__coll__graph.map @@ -0,0 +1,20 @@ + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/classBlisHeurRound__coll__graph.md5 b/Doxygen/0.94/classBlisHeurRound__coll__graph.md5 new file mode 100644 index 0000000..702974a --- /dev/null +++ b/Doxygen/0.94/classBlisHeurRound__coll__graph.md5 @@ -0,0 +1 @@ +b7544aff7908947303d9696f0b031ce9 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisHeurRound__coll__graph.png b/Doxygen/0.94/classBlisHeurRound__coll__graph.png new file mode 100644 index 0000000..21a375a Binary files /dev/null and b/Doxygen/0.94/classBlisHeurRound__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisHeurRound__inherit__graph.map b/Doxygen/0.94/classBlisHeurRound__inherit__graph.map new file mode 100644 index 0000000..fa6624e --- /dev/null +++ b/Doxygen/0.94/classBlisHeurRound__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisHeurRound__inherit__graph.md5 b/Doxygen/0.94/classBlisHeurRound__inherit__graph.md5 new file mode 100644 index 0000000..5efee57 --- /dev/null +++ b/Doxygen/0.94/classBlisHeurRound__inherit__graph.md5 @@ -0,0 +1 @@ +4e8348c296e7da4a6cc413dd5a431793 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisHeurRound__inherit__graph.png b/Doxygen/0.94/classBlisHeurRound__inherit__graph.png new file mode 100644 index 0000000..746a9fd Binary files /dev/null and b/Doxygen/0.94/classBlisHeurRound__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisHeuristic-members.html b/Doxygen/0.94/classBlisHeuristic-members.html new file mode 100644 index 0000000..45ced61 --- /dev/null +++ b/Doxygen/0.94/classBlisHeuristic-members.html @@ -0,0 +1,110 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisHeuristic Member List
+
+
+ +

This is the complete list of members for BlisHeuristic, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
addCalls(int c=1)BlisHeuristicinline
addNoSolCalls(int n=1)BlisHeuristicinline
addNumSolutions(int num=1)BlisHeuristicinline
addTime(double t=0.0)BlisHeuristicinline
BlisHeuristic()BlisHeuristicinline
BlisHeuristic(BlisModel *model, const char *name, BlisHeurStrategy strategy, int heurCallFrequency)BlisHeuristicinline
BlisHeuristic(const BlisHeuristic &rhs)BlisHeuristicinline
calls() constBlisHeuristicinline
calls_BlisHeuristicprotected
clone() constBlisHeuristicinlinevirtual
heurCallFrequency() constBlisHeuristicinlinevirtual
heurCallFrequency_BlisHeuristicprotected
model_BlisHeuristicprotected
name() constBlisHeuristicinline
name_BlisHeuristicprotected
noSolCalls() constBlisHeuristicinline
noSolsCalls_BlisHeuristicprotected
numSolutions() constBlisHeuristicinline
numSolutions_BlisHeuristicprotected
operator=(const BlisHeuristic &rhs)BlisHeuristicprivate
searchSolution(double &objectiveValue, double *newSolution)=0BlisHeuristicpure virtual
searchSolution(double &objectiveValue, double *newSolution, OsiCuts &cs)BlisHeuristicinlinevirtual
setHeurCallFrequency(int freq)BlisHeuristicinlinevirtual
setModel(BlisModel *model)BlisHeuristicinlinevirtual
setStrategy(BlisHeurStrategy strategy)BlisHeuristicinlinevirtual
strategy() constBlisHeuristicinlinevirtual
strategy_BlisHeuristicprotected
time() constBlisHeuristicinline
time_BlisHeuristicprotected
~BlisHeuristic()BlisHeuristicinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisHeuristic.html b/Doxygen/0.94/classBlisHeuristic.html new file mode 100644 index 0000000..953a493 --- /dev/null +++ b/Doxygen/0.94/classBlisHeuristic.html @@ -0,0 +1,1138 @@ + + + + + + + +Blis: BlisHeuristic Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Protected Attributes | +Private Member Functions | +List of all members
+
+
BlisHeuristic Class Referenceabstract
+
+
+ +

Heuristic base class. + More...

+ +

#include <BlisHeuristic.h>

+
+ + Inheritance diagram for BlisHeuristic:
+
+
+ +
+ + Collaboration diagram for BlisHeuristic:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisHeuristic ()
 Default Constructor. More...
 
 BlisHeuristic (BlisModel *model, const char *name, BlisHeurStrategy strategy, int heurCallFrequency)
 Useful constructor. More...
 
virtual ~BlisHeuristic ()
 Distructor. More...
 
 BlisHeuristic (const BlisHeuristic &rhs)
 Copy constructor. More...
 
virtual void setModel (BlisModel *model)
 update model (This is needed if cliques update matrix etc). More...
 
virtual void setStrategy (BlisHeurStrategy strategy)
 Get/set strategy. More...
 
virtual BlisHeurStrategy strategy () const
 
virtual void setHeurCallFrequency (int freq)
 Get/set call frequency. More...
 
virtual int heurCallFrequency () const
 
virtual BlisHeuristic * clone () const
 Clone a heuristic. More...
 
virtual bool searchSolution (double &objectiveValue, double *newSolution)=0
 returns 0 if no solution, 1 if valid solution with better objective value than one passed in Sets solution values if good, sets objective value This is called after cuts have been added - so can not add cuts More...
 
virtual bool searchSolution (double &objectiveValue, double *newSolution, OsiCuts &cs)
 returns 0 if no solution, 1 if valid solution, -1 if just returning an estimate of best possible solution with better objective value than one passed in Sets solution values if good, sets objective value (only if nonzero code) This is called at same time as cut generators - so can add cuts Default is do nothing More...
 
const char * name () const
 return name of generator. More...
 
void addNumSolutions (int num=1)
 Record number of solutions found. More...
 
int numSolutions () const
 Number of solutions found. More...
 
void addTime (double t=0.0)
 Record Cpu time used. More...
 
double time () const
 Cpu time used. More...
 
void addCalls (int c=1)
 Record number of times called. More...
 
int calls () const
 Number of times called. More...
 
int noSolCalls () const
 Number called and no cons found. More...
 
void addNoSolCalls (int n=1)
 Increase the number of no cons called. More...
 
+ + + + + + + + + + + + + + + + + + + + + + + + + +

+Protected Attributes

BlisModel * model_
 Pointer to the model. More...
 
char * name_
 Heuristics name. More...
 
BlisHeurStrategy strategy_
 When to call findSolution() routine. More...
 
int heurCallFrequency_
 The frequency with which to call the heuristic. More...
 
int numSolutions_
 Number of solutions found. More...
 
double time_
 Used CPU/User time. More...
 
int calls_
 The times of calling this heuristic. More...
 
int noSolsCalls_
 The times of calling this heuristic and no solutions found. More...
 
+ + + + +

+Private Member Functions

BlisHeuristic & operator= (const BlisHeuristic &rhs)
 Illegal Assignment operator. More...
 
+

Detailed Description

+

Heuristic base class.

+ +

Definition at line 48 of file BlisHeuristic.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisHeuristic() [1/3]

+ +
+
+ + + + + +
+ + + + + + + +
BlisHeuristic::BlisHeuristic ()
+ 		+inline
+
+ +

Default Constructor.

+ +

Definition at line 90 of file BlisHeuristic.h.

+ +
+
+ +

◆ BlisHeuristic() [2/3]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisHeuristic::BlisHeuristic (BlisModel * model,
const char * name,
BlisHeurStrategy strategy,
int heurCallFrequency 
)
+ 		+inline
+
+ +

Useful constructor.

+ +

Definition at line 102 of file BlisHeuristic.h.

+ +
+
+ +

◆ ~BlisHeuristic()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisHeuristic::~BlisHeuristic ()
+ 		+inlinevirtual
+
+ +

Distructor.

+ +

Definition at line 120 of file BlisHeuristic.h.

+ +
+
+ +

◆ BlisHeuristic() [3/3]

+ +
+
+ + + + + +
+ + + + + + + + +
BlisHeuristic::BlisHeuristic (const BlisHeuristic & rhs)
+ 		+inline
+
+ +

Copy constructor.

+ +

Definition at line 123 of file BlisHeuristic.h.

+ +
+
+

Member Function Documentation

+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + + +
BlisHeuristic& BlisHeuristic::operator= (const BlisHeuristic & rhs)
+ 		+private
+
+ +

Illegal Assignment operator.

+ +
+
+ +

◆ setModel()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisHeuristic::setModel (BlisModel * model)
+ 		+inlinevirtual
+
+ +

update model (This is needed if cliques update matrix etc).

+ +

Reimplemented in BlisHeurRound.

+ +

Definition at line 135 of file BlisHeuristic.h.

+ +
+
+ +

◆ setStrategy()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisHeuristic::setStrategy (BlisHeurStrategy strategy)
+ 		+inlinevirtual
+
+ +

Get/set strategy.

+ +

Definition at line 139 of file BlisHeuristic.h.

+ +
+
+ +

◆ strategy()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisHeurStrategy BlisHeuristic::strategy () const
+ 		+inlinevirtual
+
+ +

Definition at line 140 of file BlisHeuristic.h.

+ +
+
+ +

◆ setHeurCallFrequency()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisHeuristic::setHeurCallFrequency (int freq)
+ 		+inlinevirtual
+
+ +

Get/set call frequency.

+ +

Definition at line 145 of file BlisHeuristic.h.

+ +
+
+ +

◆ heurCallFrequency()

+ +
+
+ + + + + +
+ + + + + + + +
virtual int BlisHeuristic::heurCallFrequency () const
+ 		+inlinevirtual
+
+ +

Definition at line 146 of file BlisHeuristic.h.

+ +
+
+ +

◆ clone()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisHeuristic* BlisHeuristic::clone () const
+ 		+inlinevirtual
+
+ +

Clone a heuristic.

+ +

Reimplemented in BlisHeurRound.

+ +

Definition at line 150 of file BlisHeuristic.h.

+ +
+
+ +

◆ searchSolution() [1/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual bool BlisHeuristic::searchSolution (double & objectiveValue,
double * newSolution 
)
+ 		+pure virtual
+
+ +

returns 0 if no solution, 1 if valid solution with better objective value than one passed in Sets solution values if good, sets objective value This is called after cuts have been added - so can not add cuts

+ +

Implemented in VrpHeurTSP, and BlisHeurRound.

+ +
+
+ +

◆ searchSolution() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
virtual bool BlisHeuristic::searchSolution (double & objectiveValue,
double * newSolution,
OsiCuts & cs 
)
+ 		+inlinevirtual
+
+ +

returns 0 if no solution, 1 if valid solution, -1 if just returning an estimate of best possible solution with better objective value than one passed in Sets solution values if good, sets objective value (only if nonzero code) This is called at same time as cut generators - so can add cuts Default is do nothing

+ +

Definition at line 172 of file BlisHeuristic.h.

+ +
+
+ +

◆ name()

+ +
+
+ + + + + +
+ + + + + + + +
const char* BlisHeuristic::name () const
+ 		+inline
+
+ +

return name of generator.

+ +

Definition at line 177 of file BlisHeuristic.h.

+ +
+
+ +

◆ addNumSolutions()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisHeuristic::addNumSolutions (int num = 1)
+ 		+inline
+
+ +

Record number of solutions found.

+ +

Definition at line 180 of file BlisHeuristic.h.

+ +
+
+ +

◆ numSolutions()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisHeuristic::numSolutions () const
+ 		+inline
+
+ +

Number of solutions found.

+ +

Definition at line 183 of file BlisHeuristic.h.

+ +
+
+ +

◆ addTime()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisHeuristic::addTime (double t = 0.0)
+ 		+inline
+
+ +

Record Cpu time used.

+ +

Definition at line 186 of file BlisHeuristic.h.

+ +
+
+ +

◆ time()

+ +
+
+ + + + + +
+ + + + + + + +
double BlisHeuristic::time () const
+ 		+inline
+
+ +

Cpu time used.

+ +

Definition at line 189 of file BlisHeuristic.h.

+ +
+
+ +

◆ addCalls()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisHeuristic::addCalls (int c = 1)
+ 		+inline
+
+ +

Record number of times called.

+ +

Definition at line 192 of file BlisHeuristic.h.

+ +
+
+ +

◆ calls()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisHeuristic::calls () const
+ 		+inline
+
+ +

Number of times called.

+ +

Definition at line 195 of file BlisHeuristic.h.

+ +
+
+ +

◆ noSolCalls()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisHeuristic::noSolCalls () const
+ 		+inline
+
+ +

Number called and no cons found.

+ +

Definition at line 198 of file BlisHeuristic.h.

+ +
+
+ +

◆ addNoSolCalls()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisHeuristic::addNoSolCalls (int n = 1)
+ 		+inline
+
+ +

Increase the number of no cons called.

+ +

Definition at line 201 of file BlisHeuristic.h.

+ +
+
+

Member Data Documentation

+ +

◆ model_

+ +
+
+ + + + + +
+ + + + +
BlisModel* BlisHeuristic::model_
+ 		+protected
+
+ +

Pointer to the model.

+ +

Definition at line 58 of file BlisHeuristic.h.

+ +
+
+ +

◆ name_

+ +
+
+ + + + + +
+ + + + +
char* BlisHeuristic::name_
+ 		+protected
+
+ +

Heuristics name.

+ +

Definition at line 61 of file BlisHeuristic.h.

+ +
+
+ +

◆ strategy_

+ +
+
+ + + + + +
+ + + + +
BlisHeurStrategy BlisHeuristic::strategy_
+ 		+protected
+
+ +

When to call findSolution() routine.

+

BlisHeurStrategyNone: disable BlisHeurStrategyRoot: just root BlisHeurStrategyAuto: automatically decided by BLIS BlisHeurStrategyPeriodic: every 't' nodes BlisHeurStrategyBeforeRoot: before solving first LP

+ +

Definition at line 70 of file BlisHeuristic.h.

+ +
+
+ +

◆ heurCallFrequency_

+ +
+
+ + + + + +
+ + + + +
int BlisHeuristic::heurCallFrequency_
+ 		+protected
+
+ +

The frequency with which to call the heuristic.

+ +

Definition at line 73 of file BlisHeuristic.h.

+ +
+
+ +

◆ numSolutions_

+ +
+
+ + + + + +
+ + + + +
int BlisHeuristic::numSolutions_
+ 		+protected
+
+ +

Number of solutions found.

+ +

Definition at line 76 of file BlisHeuristic.h.

+ +
+
+ +

◆ time_

+ +
+
+ + + + + +
+ + + + +
double BlisHeuristic::time_
+ 		+protected
+
+ +

Used CPU/User time.

+ +

Definition at line 79 of file BlisHeuristic.h.

+ +
+
+ +

◆ calls_

+ +
+
+ + + + + +
+ + + + +
int BlisHeuristic::calls_
+ 		+protected
+
+ +

The times of calling this heuristic.

+ +

Definition at line 82 of file BlisHeuristic.h.

+ +
+
+ +

◆ noSolsCalls_

+ +
+
+ + + + + +
+ + + + +
int BlisHeuristic::noSolsCalls_
+ 		+protected
+
+ +

The times of calling this heuristic and no solutions found.

+ +

Definition at line 85 of file BlisHeuristic.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisHeuristic__coll__graph.map b/Doxygen/0.94/classBlisHeuristic__coll__graph.map new file mode 100644 index 0000000..df4a55b --- /dev/null +++ b/Doxygen/0.94/classBlisHeuristic__coll__graph.map @@ -0,0 +1,19 @@ + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/classBlisHeuristic__coll__graph.md5 b/Doxygen/0.94/classBlisHeuristic__coll__graph.md5 new file mode 100644 index 0000000..1fbab59 --- /dev/null +++ b/Doxygen/0.94/classBlisHeuristic__coll__graph.md5 @@ -0,0 +1 @@ +e5670e85d4325a2cd56fb78040e41bd7 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisHeuristic__coll__graph.png b/Doxygen/0.94/classBlisHeuristic__coll__graph.png new file mode 100644 index 0000000..c477a3b Binary files /dev/null and b/Doxygen/0.94/classBlisHeuristic__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisHeuristic__inherit__graph.map b/Doxygen/0.94/classBlisHeuristic__inherit__graph.map new file mode 100644 index 0000000..ffc70e3 --- /dev/null +++ b/Doxygen/0.94/classBlisHeuristic__inherit__graph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/classBlisHeuristic__inherit__graph.md5 b/Doxygen/0.94/classBlisHeuristic__inherit__graph.md5 new file mode 100644 index 0000000..9f3b515 --- /dev/null +++ b/Doxygen/0.94/classBlisHeuristic__inherit__graph.md5 @@ -0,0 +1 @@ +8aa08639c6dcdc11f48e52e4b2ad2831 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisHeuristic__inherit__graph.png b/Doxygen/0.94/classBlisHeuristic__inherit__graph.png new file mode 100644 index 0000000..d87ba4b Binary files /dev/null and b/Doxygen/0.94/classBlisHeuristic__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisMessage-members.html b/Doxygen/0.94/classBlisMessage-members.html new file mode 100644 index 0000000..62791e1 --- /dev/null +++ b/Doxygen/0.94/classBlisMessage-members.html @@ -0,0 +1,81 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisMessage Member List
+
+
+ +

This is the complete list of members for BlisMessage, including all inherited members.

+ + +
BlisMessage(Language language=us_en)BlisMessage
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisMessage.html b/Doxygen/0.94/classBlisMessage.html new file mode 100644 index 0000000..570d80c --- /dev/null +++ b/Doxygen/0.94/classBlisMessage.html @@ -0,0 +1,138 @@ + + + + + + + +Blis: BlisMessage Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+List of all members
+
+
BlisMessage Class Reference
+
+
+ +

#include <BlisMessage.h>

+
+ + Inheritance diagram for BlisMessage:
+
+
+ +
+ + Collaboration diagram for BlisMessage:
+
+
+ + + + + + + +

+Public Member Functions

Constructors etc
 BlisMessage (Language language=us_en)
 Constructor. More...
 
+

Detailed Description

+
+

Definition at line 59 of file BlisMessage.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisMessage()

+ +
+
+ + + + + + + + +
BlisMessage::BlisMessage (Language language = us_en)
+
+ +

Constructor.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisMessage__coll__graph.map b/Doxygen/0.94/classBlisMessage__coll__graph.map new file mode 100644 index 0000000..c3d466f --- /dev/null +++ b/Doxygen/0.94/classBlisMessage__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisMessage__coll__graph.md5 b/Doxygen/0.94/classBlisMessage__coll__graph.md5 new file mode 100644 index 0000000..969a580 --- /dev/null +++ b/Doxygen/0.94/classBlisMessage__coll__graph.md5 @@ -0,0 +1 @@ +8a445da38c9c95e505357fba71f12f95 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisMessage__coll__graph.png b/Doxygen/0.94/classBlisMessage__coll__graph.png new file mode 100644 index 0000000..782a8f2 Binary files /dev/null and b/Doxygen/0.94/classBlisMessage__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisMessage__inherit__graph.map b/Doxygen/0.94/classBlisMessage__inherit__graph.map new file mode 100644 index 0000000..c3d466f --- /dev/null +++ b/Doxygen/0.94/classBlisMessage__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisMessage__inherit__graph.md5 b/Doxygen/0.94/classBlisMessage__inherit__graph.md5 new file mode 100644 index 0000000..969a580 --- /dev/null +++ b/Doxygen/0.94/classBlisMessage__inherit__graph.md5 @@ -0,0 +1 @@ +8a445da38c9c95e505357fba71f12f95 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisMessage__inherit__graph.png b/Doxygen/0.94/classBlisMessage__inherit__graph.png new file mode 100644 index 0000000..782a8f2 Binary files /dev/null and b/Doxygen/0.94/classBlisMessage__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisModel-members.html b/Doxygen/0.94/classBlisModel-members.html new file mode 100644 index 0000000..9d0070a --- /dev/null +++ b/Doxygen/0.94/classBlisModel-members.html @@ -0,0 +1,298 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisModel Member List
+
+
+ +

This is the complete list of members for BlisModel, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
activeNode_BlisModelprotected
addCutGenerator(BlisConGenerator *generator)BlisModel
addCutGenerator(CglCutGenerator *generator, const char *name=NULL, BlisCutStrategy strategy=BlisCutStrategyAuto, int cutGenerationFrequency=1, bool normal=true, bool atSolution=false, bool whenInfeasible=false)BlisModel
addFeasCheckTime(double t)BlisModelinline
addHeuristic(BlisHeuristic *heur)BlisModel
addNumIterations(int newIter)BlisModelinline
addNumNodes(int newNodes=1)BlisModelinline
addNumStrong(int num=1)BlisModelinline
addObjects(int numObjects, BcpsObject **objects)BlisModel
analyzeObjective()BlisModel
aveIterations_BlisModelprotected
blisMessageHandler() constBlisModelinline
blisMessageHandler_BlisModelprotected
blisMessages()BlisModelinline
blisMessages_BlisModelprotected
BlisModel()BlisModelinline
BlisPar()BlisModelinline
BlisPar_BlisModelprotected
boundingPass_BlisModel
branchStrategy() constBlisModelinline
branchStrategy_BlisModelprotected
checkInteger(double value) constBlisModelinline
clearSharedObjectMark()BlisModelinline
colMatrix_BlisModelprotected
colType_BlisModelprotected
conLB()BlisModelinline
conLB_BlisModelprotected
conRandoms_BlisModelprotected
constraintPool()BlisModelinline
constraintPool_BlisModelprotected
constraintPoolReceive()BlisModelinline
constraintPoolReceive_BlisModelprotected
constraintPoolSend()BlisModelinline
constraintPoolSend_BlisModelprotected
conUB()BlisModelinline
conUB_BlisModelprotected
createIntgerObjects(bool startAgain)BlisModel
createObjects()BlisModelprotected
createRoot()BlisModelvirtual
currAbsGap_BlisModel
currRelGap_BlisModel
cutGenerationFrequency_BlisModelprotected
cutGenerators(int i) constBlisModelinline
cutoff_BlisModelprotected
cutoffInc_BlisModelprotected
cutStrategy_BlisModelprotected
decodeBlis(AlpsEncoded &encoded)BlisModelprotected
decodeToSelf(AlpsEncoded &)BlisModelvirtual
deleteObjects()BlisModel
delOldConstraints()BlisModelinline
denseConCutoff_BlisModelprotected
encode() constBlisModelvirtual
encodeBlis(AlpsEncoded *encoded) constBlisModelprotected
fathomAllNodes()BlisModelvirtual
feasCheckTime_BlisModelprotected
feasibleSolution(int &numIntegerInfs, int &numObjectInfs)BlisModelvirtual
feasibleSolutionHeur(const double *solution)BlisModel
generators_BlisModelprotected
getAveIterations() constBlisModelinline
getColLower()BlisModelinline
getColUpper()BlisModelinline
getConRandoms() constBlisModelinline
getCutGenerationFrequency() constBlisModelinline
getCutoff() constBlisModelinline
getCutStrategy() constBlisModelinline
getDenseConCutoff() constBlisModelinline
getFeasCheckTime()BlisModelinline
getIntColIndices() constBlisModelinline
getIntObjIndices() constBlisModelinline
getLpObjValue() constBlisModelinline
getLpSolution() constBlisModelinline
getMaxNumCons() constBlisModelinline
getNodeWeight() constBlisModelinline
getNumBranchResolve()BlisModelinline
getNumCols()BlisModelinline
getNumHeurSolutions() constBlisModelinline
getNumIntObjects() constBlisModelinline
getNumIterations() constBlisModelinline
getNumNodes() constBlisModelinline
getNumOldConstraints() constBlisModelinline
getNumRows()BlisModelinline
getNumSolutions() constBlisModelinline
getNumStrong()BlisModelinline
getObjCoef() constBlisModelinline
getOldConstraintsSize() constBlisModelinline
getSolver()BlisModelinlinevirtual
gutsOfDestructor()BlisModel
heurCallFrequency_BlisModel
heuristics(int i) constBlisModelinline
heuristics_BlisModelprotected
heurStrategy_BlisModel
hotstartStrategy_BlisModelprotected
importModel(std::vector< BlisVariable * > vars, std::vector< BlisConstraint * > cons)BlisModelvirtual
incObjValue_BlisModelprotected
incumbent()BlisModelinline
incumbent_BlisModelprotected
init()BlisModelprotected
inputCon_BlisModelprotected
inputVar_BlisModelprotected
intColIndices_BlisModelprotected
integerTol_BlisModel
intObjIndices_BlisModelprotected
isRoot_BlisModel
leafToRootPathBlisModel
lpSolver_BlisModelprotected
maxNumCons_BlisModelprotected
modelLog()BlisModelvirtual
newCutPool_BlisModel
nodeLog(AlpsTreeNode *node, bool force)BlisModelvirtual
nodeWeight_BlisModelprotected
numBranchResolve_BlisModelprotected
numCols_BlisModelprotected
numCutGenerators() constBlisModelinline
numCutGenerators_BlisModelprotected
numElems_BlisModelprotected
numHeuristics() constBlisModelinline
numHeuristics_BlisModelprotected
numHeurSolutions_BlisModelprotected
numIntObjects_BlisModelprotected
numIterations_BlisModelprotected
numNodes_BlisModelprotected
numObjects() constBlisModelinline
numObjects_BlisModelprotected
numOldConstraints_BlisModelprotected
numRows_BlisModelprotected
numSolutions_BlisModelprotected
numStrong_BlisModelprotected
objCoef_BlisModelprotected
objects()BlisModelinline
objects(int which)BlisModelinline
objects_BlisModelprotected
objSense_BlisModelprotected
oldConstraints()BlisModelinline
oldConstraints_BlisModelprotected
oldConstraintsSize_BlisModelprotected
optimalAbsGap_BlisModel
optimalRelGap_BlisModel
origLpSolver_BlisModelprotected
packSharedConstraints(AlpsEncoded *encoded)BlisModelprotected
packSharedKnowlege()BlisModelvirtual
packSharedPseudocost(AlpsEncoded *encoded, int numToShare)BlisModelprotected
packSharedVariables(AlpsEncoded *encoded)BlisModelprotected
passInPriorities(const int *priorities, bool ifNotSimpleIntegers, int defaultValue=1000)BlisModel
postprocess()BlisModelvirtual
preprocess()BlisModelvirtual
presolve_BlisModelprotected
presolvedBlisModelprotected
presolvedLpSolver_BlisModelprotected
presolveForTheWholeTree()BlisModelvirtual
priority() constBlisModelinline
priority(int sequence) constBlisModelinline
priority_BlisModelprotected
problemSetupBlisModelprotected
rampUpBranchStrategy() constBlisModelinline
rampUpBranchStrategy_BlisModelprotected
readInstance(const char *dataFile)BlisModelvirtual
readParameters(const int argnum, const char *const *arglist)BlisModelvirtual
registerKnowledge()BlisModelvirtual
resolve()BlisModel
setActiveNode(AlpsTreeNode *node)BlisModelinline
setBranchingMethod(BcpsBranchStrategy *method)BlisModelinline
setBranchingMethod(BcpsBranchStrategy &method)BlisModelinline
setColMatrix(CoinPackedMatrix *mat)BlisModelinline
setColType(char *colType)BlisModelinline
setConLb(double *cl)BlisModelinline
setConUb(double *cu)BlisModelinline
setCutoff(double co)BlisModelinline
setCutStrategy(BlisCutStrategy u)BlisModelinline
setCutStrategy(int f)BlisModelinline
setDenseConCutoff(int cutoff)BlisModelinline
setFeasCheckTime(double t)BlisModelinline
setMaxNumCons(int m)BlisModelinline
setNodeWeight(double nw)BlisModelinline
setNumBranchResolve(int num)BlisModelinline
setNumCons(int num)BlisModelinline
setNumElems(int num)BlisModelinline
setNumObjects(int num)BlisModelinline
setNumOldConstraints(int num)BlisModelinline
setNumVars(int num)BlisModelinline
setObjCoef(double *obj)BlisModelinline
setOldConstraints(BlisConstraint **old)BlisModelinline
setOldConstraintsSize(int num)BlisModelinline
setSharedObjectMark(int i)BlisModelinline
setSolEstimate(double est)BlisModelinline
setSolver(OsiSolverInterface *si)BlisModelinlinevirtual
setupSelf()BlisModelvirtual
setVarLb(double *lb)BlisModelinline
setVarUb(double *ub)BlisModelinline
sharedObjectMark_BlisModelprotected
solver()BlisModelinlinevirtual
startConLB()BlisModelinline
startConLB_BlisModelprotected
startConUB()BlisModelinline
startConUB_BlisModelprotected
startVarLB()BlisModelinline
startVarLB_BlisModelprotected
startVarUB()BlisModelinline
startVarUB_BlisModelprotected
storeSolution(BlisSolutionType how, BlisSolution *sol)BlisModel
tempConLBPos()BlisModelinline
tempConLBPos_BlisModelprotected
tempConUBPos()BlisModelinline
tempConUBPos_BlisModelprotected
tempVarLBPos()BlisModelinline
tempVarLBPos_BlisModelprotected
tempVarUBPos()BlisModelinline
tempVarUBPos_BlisModelprotected
unpackSharedConstraints(AlpsEncoded &encoded)BlisModelprotected
unpackSharedKnowledge(AlpsEncoded &)BlisModelvirtual
unpackSharedPseudocost(AlpsEncoded &encoded)BlisModelprotected
unpackSharedVariables(AlpsEncoded &encoded)BlisModelprotected
userFeasibleSolution(const double *solution, bool &feasible)BlisModelinlinevirtual
varLB()BlisModelinline
varLB_BlisModelprotected
varUB()BlisModelinline
varUB_BlisModelprotected
writeParameters(std::ostream &outstream) constBlisModelvirtual
~BlisModel()BlisModelvirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisModel.html b/Doxygen/0.94/classBlisModel.html new file mode 100644 index 0000000..cfb1dd8 --- /dev/null +++ b/Doxygen/0.94/classBlisModel.html @@ -0,0 +1,6737 @@ + + + + + + + +Blis: BlisModel Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Public Attributes | +Protected Member Functions | +Protected Attributes | +List of all members
+
+
BlisModel Class Reference
+
+
+ +

#include <BlisModel.h>

+
+ + Inheritance diagram for BlisModel:
+
+
+ +
+ + Collaboration diagram for BlisModel:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisModel ()
 Default construtor. More...
 
virtual ~BlisModel ()
 Destructor. More...
 
void gutsOfDestructor ()
 Actual destructor. More...
 
void setColMatrix (CoinPackedMatrix *mat)
 Pass a matrix in. More...
 
void setNumCons (int num)
 Pass column upper bounds. More...
 
void setNumVars (int num)
 Pass column upper bounds. More...
 
void setNumElems (int num)
 Pass column upper bounds. More...
 
void setConLb (double *cl)
 Pass column upper bounds. More...
 
void setConUb (double *cu)
 Pass column lower bounds. More...
 
void setVarLb (double *lb)
 Pass variable upper bounds. More...
 
void setVarUb (double *ub)
 Pass variable lower bounds. More...
 
void setColType (char *colType)
 Pass variable types. More...
 
void setObjCoef (double *obj)
 Pass objective coefficients. More...
 
virtual void readInstance (const char *dataFile)
 For parallel code, only the master calls this function. More...
 
virtual void importModel (std::vector< BlisVariable * > vars, std::vector< BlisConstraint * > cons)
 For parallel code, only the master calls this function. More...
 
virtual void readParameters (const int argnum, const char *const *arglist)
 Read in Alps, Blis parameters. More...
 
virtual void writeParameters (std::ostream &outstream) const
 Write out parameters. More...
 
virtual AlpsTreeNode * createRoot ()
 For parallel code, only the master calls this function. More...
 
virtual bool setupSelf ()
 All processes call this function. More...
 
virtual void preprocess ()
 Preprocessing the model. More...
 
virtual void postprocess ()
 Postprocessing the searching results. More...
 
virtual void setSolver (OsiSolverInterface *si)
 Set lp solver. More...
 
virtual OsiSolverInterface * getSolver ()
 Get lp solver. More...
 
virtual OsiSolverInterface * solver ()
 Get lp solver. More...
 
bool resolve ()
 Resolving a lp. More...
 
void setActiveNode (AlpsTreeNode *node)
 Set active node. More...
 
void setSolEstimate (double est)
 Set the solution estimate of the active node. More...
 
int getNumStrong ()
 Get number of strong branchings. More...
 
void addNumStrong (int num=1)
 Add num to number of strong branchings. More...
 
int getNumBranchResolve ()
 Get the maximum number of resolve during branching. More...
 
void setNumBranchResolve (int num)
 Set the maximum number of resolve during branching. More...
 
double getFeasCheckTime ()
 Get the total time spent checking solutions for feasibility. More...
 
void setFeasCheckTime (double t)
 Set the total time spent checking solutions for feasibility. More...
 
void addFeasCheckTime (double t)
 Add to the time spent checking solutions for feasibility. More...
 
double * getObjCoef () const
 Get objective coefficients. More...
 
const double * getColLower ()
 Get column lower bound. More...
 
const double * getColUpper ()
 Get column upper bound. More...
 
int getNumCols ()
 Get number of columns. More...
 
int getNumRows ()
 Get number of rows. More...
 
double * varLB ()
 Get variable bounds arrary. More...
 
double * varUB ()
 
double * conLB ()
 Get original constraint bounds arrary. More...
 
double * conUB ()
 
double * startVarLB ()
 The starting variable bounds arrary of a subproblem (internal use). More...
 
double * startVarUB ()
 
double * startConLB ()
 The starting constraint bounds arrary of a subproblem (internal use). More...
 
double * startConUB ()
 
int * tempVarLBPos ()
 Temparory storage. More...
 
int * tempVarUBPos ()
 
int * tempConLBPos ()
 
int * tempConUBPos ()
 
double getLpObjValue () const
 Get current objective function value. More...
 
const double * getLpSolution () const
 Get active lp solution. More...
 
int getNumSolutions () const
 Get number of solutions. More...
 
int getNumHeurSolutions () const
 Get number of heuristic solutions. More...
 
double * incumbent ()
 Return best ip solution found so far. More...
 
int storeSolution (BlisSolutionType how, BlisSolution *sol)
 Record a new incumbent solution and update objectiveValue. More...
 
double getCutoff () const
 Get cut off value. More...
 
void setCutoff (double co)
 Set cut off value. More...
 
BlisSolution * feasibleSolutionHeur (const double *solution)
 Test if a solution found by heuristic is feasible. More...
 
virtual BlisSolution * feasibleSolution (int &numIntegerInfs, int &numObjectInfs)
 Test the current LP solution for feasiblility. More...
 
virtual BlisSolution * userFeasibleSolution (const double *solution, bool &feasible)
 User's criteria for a feasible solution. More...
 
Branching Strategys

See the BcpsBranchStrategy class for additional information.

+
BcpsBranchStrategy * branchStrategy () const
 Get the current branching strategy. More...
 
void setBranchingMethod (BcpsBranchStrategy *method)
 Set the branching strategy. More...
 
void setBranchingMethod (BcpsBranchStrategy &method)
 Set the branching stratedy. More...
 
BcpsBranchStrategy * rampUpBranchStrategy () const
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Attributes

bool isRoot_
 If root node. More...
 
int boundingPass_
 The number of passes during bounding procedure. More...
 
double integerTol_
 Integer tolerance. More...
 
double optimalRelGap_
 Input relative optimal gap. More...
 
double optimalAbsGap_
 Input absolute optimal gap. More...
 
double currRelGap_
 Current relative optimal gap. More...
 
double currAbsGap_
 Current absolute optimal gap. More...
 
BlisHeurStrategy heurStrategy_
 If use heuristics. More...
 
int heurCallFrequency_
 Frequency of using heuristics. More...
 
OsiCuts newCutPool_
 Store new cuts in each pass. More...
 
std::vector< AlpsTreeNode * > leafToRootPath
 Record the path from leaf to root. More...
 
+ + + + + + + +

+Protected Member Functions

void init ()
 Intialize member data. More...
 
void createObjects ()
 Create variables and constraints. More...
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Protected Attributes

OsiSolverInterface * origLpSolver_
 Input by user. More...
 
OsiSolverInterface * presolvedLpSolver_
 Presolved. More...
 
OsiSolverInterface * lpSolver_
 Actually used. More...
 
CoinPackedMatrix * colMatrix_
 Column majored matrix. More...
 
double * varLB_
 Variable and constraint bounds. More...
 
double * varUB_
 
double * conLB_
 
double * conUB_
 
int numCols_
 Number of columns/rows/elements. More...
 
int numRows_
 
int numElems_
 
double objSense_
 Objective function. More...
 
double * objCoef_
 
int numIntObjects_
 Column types. More...
 
int * intColIndices_
 
std::vector< BcpsVariable * > inputVar_
 User's input objects. More...
 
std::vector< BcpsConstraint * > inputCon_
 
BlisPresolve * presolve_
 
bool presolved
 
bool problemSetup
 
int numSolutions_
 
int numHeurSolutions_
 
double incObjValue_
 Incumbent objective value. More...
 
double * incumbent_
 Incumbent. More...
 
double cutoff_
 Cutoff in lp solver. More...
 
double cutoffInc_
 Cutoff increment. More...
 
int * intObjIndices_
 
char * colType_
 
double * startVarLB_
 Starting var/con bounds for processing each node. More...
 
double * startVarUB_
 
double * startConLB_
 
double * startConUB_
 
BcpsBranchStrategy * branchStrategy_
 Variable selection function. More...
 
BcpsBranchStrategy * rampUpBranchStrategy_
 
BlisHotStartStrategy hotstartStrategy_
 
int numObjects_
 Number of objects. More...
 
BcpsObject ** objects_
 The set of objects. More...
 
char * sharedObjectMark_
 The objects that can be shared. More...
 
int * priority_
 Priorities of integer object. More...
 
AlpsTreeNode * activeNode_
 Active node. More...
 
int numStrong_
 Number of strong branching. More...
 
double nodeWeight_
 
int numBranchResolve_
 Maximum number of resolve during branching. More...
 
int numHeuristics_
 Number of heuristics. More...
 
BlisHeuristic ** heuristics_
 The list of heuristics. More...
 
BlisCutStrategy cutStrategy_
 If use cut generators. More...
 
int cutGenerationFrequency_
 Frequency of cut generation. More...
 
int numCutGenerators_
 Number of cut generators used. More...
 
int maxNumCons_
 Number of cuts can be generators. More...
 
BlisConGenerator ** generators_
 The list of cut generators used. More...
 
BcpsConstraintPool * constraintPool_
 Store all the cuts. More...
 
BlisConstraint ** oldConstraints_
 Temporary store old cuts at a node when installing a node. More...
 
int oldConstraintsSize_
 The memory size allocated for oldConstraints_. More...
 
int numOldConstraints_
 Number of old constraints. More...
 
double * conRandoms_
 Random keys. More...
 
int denseConCutoff_
 Dense constraint cutoff. More...
 
BlisParams * BlisPar_
 Blis parameters. More...
 
CoinMessageHandler * blisMessageHandler_
 Message handler. More...
 
CoinMessages blisMessages_
 Blis messages. More...
 
int numNodes_
 Number of processed nodes. More...
 
int numIterations_
 Number of lp(Simplex) iterations. More...
 
int aveIterations_
 Average number of lp iterations to solve a subproblem. More...
 
double feasCheckTime_
 Time spent checking feasibility of solutions. More...
 
int * tempVarLBPos_
 Tempory storage for var/con indices. More...
 
int * tempVarUBPos_
 
int * tempConLBPos_
 
int * tempConUBPos_
 
BcpsConstraintPool * constraintPoolSend_
 Constraints that can be sent/broadcasted to other processes. More...
 
BcpsConstraintPool * constraintPoolReceive_
 Constraints that are received from other processses. More...
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Object manipulation routines

AlpsReturnStatus encodeBlis (AlpsEncoded *encoded) const
 Pack Blis portion of the model into an encoded object. More...
 
AlpsReturnStatus decodeBlis (AlpsEncoded &encoded)
 Unpack Blis portion of the model from an encoded object. More...
 
void packSharedPseudocost (AlpsEncoded *encoded, int numToShare)
 Retrieve and pack shared pseudocost. More...
 
void unpackSharedPseudocost (AlpsEncoded &encoded)
 Unpack and store shared pseduocost. More...
 
void packSharedConstraints (AlpsEncoded *encoded)
 Retrieve and pack shared constraints. More...
 
void unpackSharedConstraints (AlpsEncoded &encoded)
 Unpack and store shared constraints. More...
 
void packSharedVariables (AlpsEncoded *encoded)
 Retrieve and pack shared variables. More...
 
void unpackSharedVariables (AlpsEncoded &encoded)
 Unpack and store shared variables. More...
 
int numObjects () const
 Get the number of objects. More...
 
void setNumObjects (int num)
 Set the number of objects. More...
 
BcpsObject ** objects ()
 Get the array of objects. More...
 
BcpsObject * objects (int which)
 Get the specified object. More...
 
void setSharedObjectMark (int i)
 Mark object to be shared. More...
 
void clearSharedObjectMark ()
 Clear all the share mark. More...
 
void deleteObjects ()
 Delete all object information. More...
 
void addObjects (int numObjects, BcpsObject **objects)
 Add in object information. More...
 
void createIntgerObjects (bool startAgain)
 Identify integer variable. More...
 
int * getIntObjIndices () const
 Get integers' object indices. More...
 
int getNumIntObjects () const
 Get number of integers. More...
 
int * getIntColIndices () const
 Get integers' column indices. More...
 
bool checkInteger (double value) const
 Check if a value is integer. More...
 
void analyzeObjective ()
 
void addHeuristic (BlisHeuristic *heur)
 Add a heuristic. More...
 
BlisHeuristic * heuristics (int i) const
 Get a specific heuristic. More...
 
int numHeuristics () const
 Get the number of heuristics. More...
 
void addCutGenerator (BlisConGenerator *generator)
 Add a Blis cut generator. More...
 
void addCutGenerator (CglCutGenerator *generator, const char *name=NULL, BlisCutStrategy strategy=BlisCutStrategyAuto, int cutGenerationFrequency=1, bool normal=true, bool atSolution=false, bool whenInfeasible=false)
 Add a Cgl cut generator. More...
 
BlisConGenerator * cutGenerators (int i) const
 Get a specific cut generator. More...
 
int numCutGenerators () const
 Get the number of cut generators. More...
 
int getMaxNumCons () const
 Get the max number of cuts can be generated. More...
 
void setMaxNumCons (int m)
 Set the max number of cuts can be generated. More...
 
BcpsConstraintPool * constraintPool ()
 Access constraint pool. More...
 
BcpsConstraintPool * constraintPoolReceive ()
 Access receive constraint pool. More...
 
BcpsConstraintPool * constraintPoolSend ()
 Access send constraint pool. More...
 
int getNumOldConstraints () const
 Get number of old constraints. More...
 
void setNumOldConstraints (int num)
 Set number of old constraints. More...
 
int getOldConstraintsSize () const
 Get max number of old constraints. More...
 
void setOldConstraintsSize (int num)
 Set max number of old constraints. More...
 
BlisConstraint ** oldConstraints ()
 Access old constraints. More...
 
void setOldConstraints (BlisConstraint **old)
 set old constraints. More...
 
void delOldConstraints ()
 Set max number of old constraints. More...
 
BlisCutStrategy getCutStrategy () const
 Query constraint generation strategy. More...
 
void setCutStrategy (BlisCutStrategy u)
 Set constraint generation strategy. More...
 
int getCutGenerationFrequency () const
 Query constraint generation frequency. More...
 
void setCutStrategy (int f)
 Set constraint generation frequency. More...
 
int getDenseConCutoff () const
 Get the thresheld to be considered as a dense constraint. More...
 
void setDenseConCutoff (int cutoff)
 Set the thresheld to be considered as a dense constraint. More...
 
double * getConRandoms () const
 Get randoms for check parallel constraints. More...
 
void passInPriorities (const int *priorities, bool ifNotSimpleIntegers, int defaultValue=1000)
 Pass in branching priorities. More...
 
const int * priority () const
 Priorities. More...
 
int priority (int sequence) const
 Returns priority level for an object (or 1000 if no priorities exist) More...
 
double getNodeWeight () const
 
void setNodeWeight (double nw)
 
virtual void modelLog ()
 Log of specific models. More...
 
int getNumNodes () const
 Get how many Nodes it took to solve the problem. More...
 
int getNumIterations () const
 Get how many iterations it took to solve the problem. More...
 
int getAveIterations () const
 Get the average iterations it took to solve a lp. More...
 
void addNumNodes (int newNodes=1)
 Increment node count. More...
 
void addNumIterations (int newIter)
 Increment Iteration count. More...
 
CoinMessageHandler * blisMessageHandler () const
 Get the message handler. More...
 
CoinMessages blisMessages ()
 Return messages. More...
 
BlisParams * BlisPar ()
 Access parameters. More...
 
virtual void nodeLog (AlpsTreeNode *node, bool force)
 Node log. More...
 
virtual bool fathomAllNodes ()
 Return true, if all nodes can be fathomed. More...
 
virtual void registerKnowledge ()
 Register knowledge. More...
 
virtual AlpsEncoded * encode () const
 The method that encodes the model into an encoded object. More...
 
virtual void decodeToSelf (AlpsEncoded &)
 The method that decodes the model from an encoded object. More...
 
virtual AlpsEncoded * packSharedKnowlege ()
 Pack knowledge to be shared with others into an encoded object. More...
 
virtual void unpackSharedKnowledge (AlpsEncoded &)
 Unpack and store shared knowledge from an encoded object. More...
 
virtual void presolveForTheWholeTree ()
 
+

Detailed Description

+
+

Definition at line 69 of file BlisModel.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisModel()

+ +
+
+ + + + + +
+ + + + + + + +
BlisModel::BlisModel ()
+ 		+inline
+
+ +

Default construtor.

+ +

Definition at line 342 of file BlisModel.h.

+ +
+
+ +

◆ ~BlisModel()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisModel::~BlisModel ()
+ 		+virtual
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ init()

+ +
+
+ + + + + +
+ + + + + + + +
void BlisModel::init ()
+ 		+protected
+
+ +

Intialize member data.

+ +
+
+ +

◆ createObjects()

+ +
+
+ + + + + +
+ + + + + + + +
void BlisModel::createObjects ()
+ 		+protected
+
+ +

Create variables and constraints.

+ +
+
+ +

◆ gutsOfDestructor()

+ +
+
+ + + + + + + +
void BlisModel::gutsOfDestructor ()
+
+ +

Actual destructor.

+ +
+
+ +

◆ setColMatrix()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setColMatrix (CoinPackedMatrix * mat)
+ 		+inline
+
+ +

Pass a matrix in.

+ +

Definition at line 358 of file BlisModel.h.

+ +
+
+ +

◆ setNumCons()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setNumCons (int num)
+ 		+inline
+
+ +

Pass column upper bounds.

+ +

Definition at line 361 of file BlisModel.h.

+ +
+
+ +

◆ setNumVars()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setNumVars (int num)
+ 		+inline
+
+ +

Pass column upper bounds.

+ +

Definition at line 364 of file BlisModel.h.

+ +
+
+ +

◆ setNumElems()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setNumElems (int num)
+ 		+inline
+
+ +

Pass column upper bounds.

+ +

Definition at line 367 of file BlisModel.h.

+ +
+
+ +

◆ setConLb()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setConLb (double * cl)
+ 		+inline
+
+ +

Pass column upper bounds.

+ +

Definition at line 370 of file BlisModel.h.

+ +
+
+ +

◆ setConUb()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setConUb (double * cu)
+ 		+inline
+
+ +

Pass column lower bounds.

+ +

Definition at line 373 of file BlisModel.h.

+ +
+
+ +

◆ setVarLb()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setVarLb (double * lb)
+ 		+inline
+
+ +

Pass variable upper bounds.

+ +

Definition at line 376 of file BlisModel.h.

+ +
+
+ +

◆ setVarUb()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setVarUb (double * ub)
+ 		+inline
+
+ +

Pass variable lower bounds.

+ +

Definition at line 379 of file BlisModel.h.

+ +
+
+ +

◆ setColType()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setColType (char * colType)
+ 		+inline
+
+ +

Pass variable types.

+ +

Definition at line 382 of file BlisModel.h.

+ +
+
+ +

◆ setObjCoef()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setObjCoef (double * obj)
+ 		+inline
+
+ +

Pass objective coefficients.

+ +

Definition at line 387 of file BlisModel.h.

+ +
+
+ +

◆ readInstance()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisModel::readInstance (const char * dataFile)
+ 		+virtual
+
+ +

For parallel code, only the master calls this function.

+

1) Read in the instance data 2) Set colMatrix_, varLB_, varUB_, conLB_, conUB numCols_, numRows_ 3) Set objCoef_ and objSense_ 4) Set colType_ ('C', 'I', or 'B') 5) Create variables and constraints 6) Set numCoreVariables_ and numCoreConstraints_

+ +

Reimplemented in VrpModel.

+ +
+
+ +

◆ importModel()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual void BlisModel::importModel (std::vector< BlisVariable * > vars,
std::vector< BlisConstraint * > cons 
)
+ 		+virtual
+
+ +

For parallel code, only the master calls this function.

+

Import model from vars and cons. 1) Set colMatrix_, varLB_, varUB_, conLB_, conUB numCols_, numRows_ 2) Set objCoef_ (Assume minimization) 3) Set colType_ ('C', 'I', or 'B') 4) Set variables_ and constraints_ 5) Set numCoreVariables_ and numCoreConstraints_ NOTE: Blis takes over the memory ownship of vars and cons, which means users must NOT free vars or cons.

+ +
+
+ +

◆ readParameters()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual void BlisModel::readParameters (const int argnum,
const char *const * arglist 
)
+ 		+virtual
+
+ +

Read in Alps, Blis parameters.

+ +

Reimplemented in VrpModel.

+ +
+
+ +

◆ writeParameters()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisModel::writeParameters (std::ostream & outstream) const
+ 		+virtual
+
+ +

Write out parameters.

+ +
+
+ +

◆ createRoot()

+ +
+
+ + + + + +
+ + + + + + + +
virtual AlpsTreeNode* BlisModel::createRoot ()
+ 		+virtual
+
+ +

For parallel code, only the master calls this function.

+

Create the root node based on model.

+ +
+
+ +

◆ setupSelf()

+ +
+
+ + + + + +
+ + + + + + + +
virtual bool BlisModel::setupSelf ()
+ 		+virtual
+
+ +

All processes call this function.

+

Do necessary work to make model usable. Return success or not. 1) Set numIntObjects_, intColIndices_, intObjectIndices_ 2) Load problem to LP solver. 3) Create integer objects (must after load to lp since using lp info) 4) Set branch strategy 5) Add heuristics 6) Add Cgl cut generators

+ +
+
+ +

◆ preprocess()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void BlisModel::preprocess ()
+ 		+virtual
+
+ +

Preprocessing the model.

+ +
+
+ +

◆ postprocess()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void BlisModel::postprocess ()
+ 		+virtual
+
+ +

Postprocessing the searching results.

+ +
+
+ +

◆ setSolver()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisModel::setSolver (OsiSolverInterface * si)
+ 		+inlinevirtual
+
+ +

Set lp solver.

+ +

Definition at line 443 of file BlisModel.h.

+ +
+
+ +

◆ getSolver()

+ +
+
+ + + + + +
+ + + + + + + +
virtual OsiSolverInterface* BlisModel::getSolver ()
+ 		+inlinevirtual
+
+ +

Get lp solver.

+ +

Definition at line 446 of file BlisModel.h.

+ +
+
+ +

◆ solver()

+ +
+
+ + + + + +
+ + + + + + + +
virtual OsiSolverInterface* BlisModel::solver ()
+ 		+inlinevirtual
+
+ +

Get lp solver.

+ +

Definition at line 449 of file BlisModel.h.

+ +
+
+ +

◆ resolve()

+ +
+
+ + + + + + + +
bool BlisModel::resolve ()
+
+ +

Resolving a lp.

+ +
+
+ +

◆ setActiveNode()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setActiveNode (AlpsTreeNode * node)
+ 		+inline
+
+ +

Set active node.

+ +

Definition at line 455 of file BlisModel.h.

+ +
+
+ +

◆ setSolEstimate()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setSolEstimate (double est)
+ 		+inline
+
+ +

Set the solution estimate of the active node.

+ +

Definition at line 458 of file BlisModel.h.

+ +
+
+ +

◆ getNumStrong()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getNumStrong ()
+ 		+inline
+
+ +

Get number of strong branchings.

+ +

Definition at line 461 of file BlisModel.h.

+ +
+
+ +

◆ addNumStrong()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::addNumStrong (int num = 1)
+ 		+inline
+
+ +

Add num to number of strong branchings.

+ +

Definition at line 464 of file BlisModel.h.

+ +
+
+ +

◆ getNumBranchResolve()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getNumBranchResolve ()
+ 		+inline
+
+ +

Get the maximum number of resolve during branching.

+ +

Definition at line 467 of file BlisModel.h.

+ +
+
+ +

◆ setNumBranchResolve()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setNumBranchResolve (int num)
+ 		+inline
+
+ +

Set the maximum number of resolve during branching.

+ +

Definition at line 470 of file BlisModel.h.

+ +
+
+ +

◆ getFeasCheckTime()

+ +
+
+ + + + + +
+ + + + + + + +
double BlisModel::getFeasCheckTime ()
+ 		+inline
+
+ +

Get the total time spent checking solutions for feasibility.

+ +

Definition at line 473 of file BlisModel.h.

+ +
+
+ +

◆ setFeasCheckTime()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setFeasCheckTime (double t)
+ 		+inline
+
+ +

Set the total time spent checking solutions for feasibility.

+ +

Definition at line 476 of file BlisModel.h.

+ +
+
+ +

◆ addFeasCheckTime()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::addFeasCheckTime (double t)
+ 		+inline
+
+ +

Add to the time spent checking solutions for feasibility.

+ +

Definition at line 479 of file BlisModel.h.

+ +
+
+ +

◆ getObjCoef()

+ +
+
+ + + + + +
+ + + + + + + +
double* BlisModel::getObjCoef () const
+ 		+inline
+
+ +

Get objective coefficients.

+ +

Definition at line 486 of file BlisModel.h.

+ +
+
+ +

◆ getColLower()

+ +
+
+ + + + + +
+ + + + + + + +
const double* BlisModel::getColLower ()
+ 		+inline
+
+ +

Get column lower bound.

+ +

Definition at line 489 of file BlisModel.h.

+ +
+
+ +

◆ getColUpper()

+ +
+
+ + + + + +
+ + + + + + + +
const double* BlisModel::getColUpper ()
+ 		+inline
+
+ +

Get column upper bound.

+ +

Definition at line 492 of file BlisModel.h.

+ +
+
+ +

◆ getNumCols()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getNumCols ()
+ 		+inline
+
+ +

Get number of columns.

+ +

Definition at line 495 of file BlisModel.h.

+ +
+
+ +

◆ getNumRows()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getNumRows ()
+ 		+inline
+
+ +

Get number of rows.

+ +

Definition at line 498 of file BlisModel.h.

+ +
+
+ +

◆ varLB()

+ +
+
+ + + + + +
+ + + + + + + +
double* BlisModel::varLB ()
+ 		+inline
+
+ +

Get variable bounds arrary.

+ +

Definition at line 501 of file BlisModel.h.

+ +
+
+ +

◆ varUB()

+ +
+
+ + + + + +
+ + + + + + + +
double* BlisModel::varUB ()
+ 		+inline
+
+ +

Definition at line 502 of file BlisModel.h.

+ +
+
+ +

◆ conLB()

+ +
+
+ + + + + +
+ + + + + + + +
double* BlisModel::conLB ()
+ 		+inline
+
+ +

Get original constraint bounds arrary.

+ +

Definition at line 505 of file BlisModel.h.

+ +
+
+ +

◆ conUB()

+ +
+
+ + + + + +
+ + + + + + + +
double* BlisModel::conUB ()
+ 		+inline
+
+ +

Definition at line 506 of file BlisModel.h.

+ +
+
+ +

◆ startVarLB()

+ +
+
+ + + + + +
+ + + + + + + +
double* BlisModel::startVarLB ()
+ 		+inline
+
+ +

The starting variable bounds arrary of a subproblem (internal use).

+ +

Definition at line 509 of file BlisModel.h.

+ +
+
+ +

◆ startVarUB()

+ +
+
+ + + + + +
+ + + + + + + +
double* BlisModel::startVarUB ()
+ 		+inline
+
+ +

Definition at line 510 of file BlisModel.h.

+ +
+
+ +

◆ startConLB()

+ +
+
+ + + + + +
+ + + + + + + +
double* BlisModel::startConLB ()
+ 		+inline
+
+ +

The starting constraint bounds arrary of a subproblem (internal use).

+ +

Definition at line 513 of file BlisModel.h.

+ +
+
+ +

◆ startConUB()

+ +
+
+ + + + + +
+ + + + + + + +
double* BlisModel::startConUB ()
+ 		+inline
+
+ +

Definition at line 514 of file BlisModel.h.

+ +
+
+ +

◆ tempVarLBPos()

+ +
+
+ + + + + +
+ + + + + + + +
int* BlisModel::tempVarLBPos ()
+ 		+inline
+
+ +

Temparory storage.

+ +

Definition at line 517 of file BlisModel.h.

+ +
+
+ +

◆ tempVarUBPos()

+ +
+
+ + + + + +
+ + + + + + + +
int* BlisModel::tempVarUBPos ()
+ 		+inline
+
+ +

Definition at line 518 of file BlisModel.h.

+ +
+
+ +

◆ tempConLBPos()

+ +
+
+ + + + + +
+ + + + + + + +
int* BlisModel::tempConLBPos ()
+ 		+inline
+
+ +

Definition at line 519 of file BlisModel.h.

+ +
+
+ +

◆ tempConUBPos()

+ +
+
+ + + + + +
+ + + + + + + +
int* BlisModel::tempConUBPos ()
+ 		+inline
+
+ +

Definition at line 520 of file BlisModel.h.

+ +
+
+ +

◆ getLpObjValue()

+ +
+
+ + + + + +
+ + + + + + + +
double BlisModel::getLpObjValue () const
+ 		+inline
+
+ +

Get current objective function value.

+ +

Definition at line 527 of file BlisModel.h.

+ +
+
+ +

◆ getLpSolution()

+ +
+
+ + + + + +
+ + + + + + + +
const double* BlisModel::getLpSolution () const
+ 		+inline
+
+ +

Get active lp solution.

+ +

Definition at line 530 of file BlisModel.h.

+ +
+
+ +

◆ getNumSolutions()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getNumSolutions () const
+ 		+inline
+
+ +

Get number of solutions.

+ +

Definition at line 537 of file BlisModel.h.

+ +
+
+ +

◆ getNumHeurSolutions()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getNumHeurSolutions () const
+ 		+inline
+
+ +

Get number of heuristic solutions.

+ +

Definition at line 540 of file BlisModel.h.

+ +
+
+ +

◆ incumbent()

+ +
+
+ + + + + +
+ + + + + + + +
double* BlisModel::incumbent ()
+ 		+inline
+
+ +

Return best ip solution found so far.

+ +

Definition at line 543 of file BlisModel.h.

+ +
+
+ +

◆ storeSolution()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int BlisModel::storeSolution (BlisSolutionType how,
BlisSolution * sol 
)
+
+ +

Record a new incumbent solution and update objectiveValue.

+ +
+
+ +

◆ getCutoff()

+ +
+
+ + + + + +
+ + + + + + + +
double BlisModel::getCutoff () const
+ 		+inline
+
+ +

Get cut off value.

+ +

Definition at line 549 of file BlisModel.h.

+ +
+
+ +

◆ setCutoff()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setCutoff (double co)
+ 		+inline
+
+ +

Set cut off value.

+ +

Definition at line 552 of file BlisModel.h.

+ +
+
+ +

◆ feasibleSolutionHeur()

+ +
+
+ + + + + + + + +
BlisSolution* BlisModel::feasibleSolutionHeur (const double * solution)
+
+ +

Test if a solution found by heuristic is feasible.

+ +
+
+ +

◆ feasibleSolution()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual BlisSolution* BlisModel::feasibleSolution (int & numIntegerInfs,
int & numObjectInfs 
)
+ 		+virtual
+
+ +

Test the current LP solution for feasiblility.

+

Scan all objects for indications of infeasibility. This is broken down into simple integer infeasibility (numIntegerInfs) and all other reports of infeasibility(numObjectInfs).

+ +
+
+ +

◆ userFeasibleSolution()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual BlisSolution* BlisModel::userFeasibleSolution (const double * solution,
bool & feasible 
)
+ 		+inlinevirtual
+
+ +

User's criteria for a feasible solution.

+

If user think the given solution is feasible then need 1) set userFeasible to true, and 2) return a non-null solution. If user think the solution is infeasible then need 1) set userFeasible to false, and 2) return a null.

+ +

Reimplemented in VrpModel.

+ +

Definition at line 583 of file BlisModel.h.

+ +
+
+ +

◆ branchStrategy()

+ +
+
+ + + + + +
+ + + + + + + +
BcpsBranchStrategy* BlisModel::branchStrategy () const
+ 		+inline
+
+ +

Get the current branching strategy.

+ +

Definition at line 599 of file BlisModel.h.

+ +
+
+ +

◆ setBranchingMethod() [1/2]

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setBranchingMethod (BcpsBranchStrategy * method)
+ 		+inline
+
+ +

Set the branching strategy.

+ +

Definition at line 603 of file BlisModel.h.

+ +
+
+ +

◆ setBranchingMethod() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setBranchingMethod (BcpsBranchStrategy & method)
+ 		+inline
+
+ +

Set the branching stratedy.

+

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

+ +

Definition at line 609 of file BlisModel.h.

+ +
+
+ +

◆ rampUpBranchStrategy()

+ +
+
+ + + + + +
+ + + + + + + +
BcpsBranchStrategy* BlisModel::rampUpBranchStrategy () const
+ 		+inline
+
+ +

Definition at line 613 of file BlisModel.h.

+ +
+
+ +

◆ numObjects()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::numObjects () const
+ 		+inline
+
+ +

Get the number of objects.

+ +

Definition at line 621 of file BlisModel.h.

+ +
+
+ +

◆ setNumObjects()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setNumObjects (int num)
+ 		+inline
+
+ +

Set the number of objects.

+ +

Definition at line 624 of file BlisModel.h.

+ +
+
+ +

◆ objects() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
BcpsObject** BlisModel::objects ()
+ 		+inline
+
+ +

Get the array of objects.

+ +

Definition at line 627 of file BlisModel.h.

+ +
+
+ +

◆ objects() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + +
BcpsObject* BlisModel::objects (int which)
+ 		+inline
+
+ +

Get the specified object.

+ +

Definition at line 630 of file BlisModel.h.

+ +
+
+ +

◆ setSharedObjectMark()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setSharedObjectMark (int i)
+ 		+inline
+
+ +

Mark object to be shared.

+ +

Definition at line 633 of file BlisModel.h.

+ +
+
+ +

◆ clearSharedObjectMark()

+ +
+
+ + + + + +
+ + + + + + + +
void BlisModel::clearSharedObjectMark ()
+ 		+inline
+
+ +

Clear all the share mark.

+ +

Definition at line 636 of file BlisModel.h.

+ +
+
+ +

◆ deleteObjects()

+ +
+
+ + + + + + + +
void BlisModel::deleteObjects ()
+
+ +

Delete all object information.

+ +
+
+ +

◆ addObjects()

+ +
+
+ + + + + + + + + + + + + + + + + + +
void BlisModel::addObjects (int numObjects,
BcpsObject ** objects 
)
+
+ +

Add in object information.

+

Objects are cloned; the owner can delete the originals.

+ +
+
+ +

◆ createIntgerObjects()

+ +
+
+ + + + + + + + +
void BlisModel::createIntgerObjects (bool startAgain)
+
+ +

Identify integer variable.

+ +
+
+ +

◆ getIntObjIndices()

+ +
+
+ + + + + +
+ + + + + + + +
int* BlisModel::getIntObjIndices () const
+ 		+inline
+
+ +

Get integers' object indices.

+ +

Definition at line 654 of file BlisModel.h.

+ +
+
+ +

◆ getNumIntObjects()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getNumIntObjects () const
+ 		+inline
+
+ +

Get number of integers.

+ +

Definition at line 657 of file BlisModel.h.

+ +
+
+ +

◆ getIntColIndices()

+ +
+
+ + + + + +
+ + + + + + + +
int* BlisModel::getIntColIndices () const
+ 		+inline
+
+ +

Get integers' column indices.

+ +

Definition at line 660 of file BlisModel.h.

+ +
+
+ +

◆ checkInteger()

+ +
+
+ + + + + +
+ + + + + + + + +
bool BlisModel::checkInteger (double value) const
+ 		+inline
+
+ +

Check if a value is integer.

+ +

Definition at line 663 of file BlisModel.h.

+ +
+
+ +

◆ analyzeObjective()

+ +
+
+ + + + + + + +
void BlisModel::analyzeObjective ()
+
+ +
+
+ +

◆ addHeuristic()

+ +
+
+ + + + + + + + +
void BlisModel::addHeuristic (BlisHeuristic * heur)
+
+ +

Add a heuristic.

+ +
+
+ +

◆ heuristics()

+ +
+
+ + + + + +
+ + + + + + + + +
BlisHeuristic* BlisModel::heuristics (int i) const
+ 		+inline
+
+ +

Get a specific heuristic.

+ +

Definition at line 684 of file BlisModel.h.

+ +
+
+ +

◆ numHeuristics()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::numHeuristics () const
+ 		+inline
+
+ +

Get the number of heuristics.

+ +

Definition at line 687 of file BlisModel.h.

+ +
+
+ +

◆ addCutGenerator() [1/2]

+ +
+
+ + + + + + + + +
void BlisModel::addCutGenerator (BlisConGenerator * generator)
+
+ +

Add a Blis cut generator.

+ +
+
+ +

◆ addCutGenerator() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void BlisModel::addCutGenerator (CglCutGenerator * generator,
const char * name = NULL,
BlisCutStrategy strategy = BlisCutStrategyAuto,
int cutGenerationFrequency = 1,
bool normal = true,
bool atSolution = false,
bool whenInfeasible = false 
)
+
+ +

Add a Cgl cut generator.

+ +
+
+ +

◆ cutGenerators()

+ +
+
+ + + + + +
+ + + + + + + + +
BlisConGenerator* BlisModel::cutGenerators (int i) const
+ 		+inline
+
+ +

Get a specific cut generator.

+ +

Definition at line 706 of file BlisModel.h.

+ +
+
+ +

◆ numCutGenerators()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::numCutGenerators () const
+ 		+inline
+
+ +

Get the number of cut generators.

+ +

Definition at line 709 of file BlisModel.h.

+ +
+
+ +

◆ getMaxNumCons()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getMaxNumCons () const
+ 		+inline
+
+ +

Get the max number of cuts can be generated.

+ +

Definition at line 712 of file BlisModel.h.

+ +
+
+ +

◆ setMaxNumCons()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setMaxNumCons (int m)
+ 		+inline
+
+ +

Set the max number of cuts can be generated.

+ +

Definition at line 715 of file BlisModel.h.

+ +
+
+ +

◆ constraintPool()

+ +
+
+ + + + + +
+ + + + + + + +
BcpsConstraintPool* BlisModel::constraintPool ()
+ 		+inline
+
+ +

Access constraint pool.

+ +

Definition at line 718 of file BlisModel.h.

+ +
+
+ +

◆ constraintPoolReceive()

+ +
+
+ + + + + +
+ + + + + + + +
BcpsConstraintPool* BlisModel::constraintPoolReceive ()
+ 		+inline
+
+ +

Access receive constraint pool.

+ +

Definition at line 721 of file BlisModel.h.

+ +
+
+ +

◆ constraintPoolSend()

+ +
+
+ + + + + +
+ + + + + + + +
BcpsConstraintPool* BlisModel::constraintPoolSend ()
+ 		+inline
+
+ +

Access send constraint pool.

+ +

Definition at line 725 of file BlisModel.h.

+ +
+
+ +

◆ getNumOldConstraints()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getNumOldConstraints () const
+ 		+inline
+
+ +

Get number of old constraints.

+ +

Definition at line 729 of file BlisModel.h.

+ +
+
+ +

◆ setNumOldConstraints()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setNumOldConstraints (int num)
+ 		+inline
+
+ +

Set number of old constraints.

+ +

Definition at line 732 of file BlisModel.h.

+ +
+
+ +

◆ getOldConstraintsSize()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getOldConstraintsSize () const
+ 		+inline
+
+ +

Get max number of old constraints.

+ +

Definition at line 735 of file BlisModel.h.

+ +
+
+ +

◆ setOldConstraintsSize()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setOldConstraintsSize (int num)
+ 		+inline
+
+ +

Set max number of old constraints.

+ +

Definition at line 738 of file BlisModel.h.

+ +
+
+ +

◆ oldConstraints()

+ +
+
+ + + + + +
+ + + + + + + +
BlisConstraint** BlisModel::oldConstraints ()
+ 		+inline
+
+ +

Access old constraints.

+ +

Definition at line 741 of file BlisModel.h.

+ +
+
+ +

◆ setOldConstraints()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setOldConstraints (BlisConstraint ** old)
+ 		+inline
+
+ +

set old constraints.

+ +

Definition at line 744 of file BlisModel.h.

+ +
+
+ +

◆ delOldConstraints()

+ +
+
+ + + + + +
+ + + + + + + +
void BlisModel::delOldConstraints ()
+ 		+inline
+
+ +

Set max number of old constraints.

+ +

Definition at line 747 of file BlisModel.h.

+ +
+
+ +

◆ getCutStrategy()

+ +
+
+ + + + + +
+ + + + + + + +
BlisCutStrategy BlisModel::getCutStrategy () const
+ 		+inline
+
+ +

Query constraint generation strategy.

+ +

Definition at line 754 of file BlisModel.h.

+ +
+
+ +

◆ setCutStrategy() [1/2]

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setCutStrategy (BlisCutStrategy u)
+ 		+inline
+
+ +

Set constraint generation strategy.

+ +

Definition at line 759 of file BlisModel.h.

+ +
+
+ +

◆ getCutGenerationFrequency()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getCutGenerationFrequency () const
+ 		+inline
+
+ +

Query constraint generation frequency.

+ +

Definition at line 762 of file BlisModel.h.

+ +
+
+ +

◆ setCutStrategy() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setCutStrategy (int f)
+ 		+inline
+
+ +

Set constraint generation frequency.

+ +

Definition at line 765 of file BlisModel.h.

+ +
+
+ +

◆ getDenseConCutoff()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getDenseConCutoff () const
+ 		+inline
+
+ +

Get the thresheld to be considered as a dense constraint.

+ +

Definition at line 768 of file BlisModel.h.

+ +
+
+ +

◆ setDenseConCutoff()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setDenseConCutoff (int cutoff)
+ 		+inline
+
+ +

Set the thresheld to be considered as a dense constraint.

+ +

Definition at line 771 of file BlisModel.h.

+ +
+
+ +

◆ getConRandoms()

+ +
+
+ + + + + +
+ + + + + + + +
double* BlisModel::getConRandoms () const
+ 		+inline
+
+ +

Get randoms for check parallel constraints.

+ +

Definition at line 774 of file BlisModel.h.

+ +
+
+ +

◆ passInPriorities()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void BlisModel::passInPriorities (const int * priorities,
bool ifNotSimpleIntegers,
int defaultValue = 1000 
)
+
+ +

Pass in branching priorities.

+

If ifClique then priorities are on cliques otherwise priorities are on integer variables.
+ Other type (if exists set to default) 1 is highest priority. (well actually -INT_MAX is but that's ugly) If hotstart > 0 then branches are created to force the variable to the value given by best solution. This enables a sort of hot start. The node choice should be greatest depth and hotstart should normally be switched off after a solution.

+

If ifNotSimpleIntegers true then appended to normal integers

+ +
+
+ +

◆ priority() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
const int* BlisModel::priority () const
+ 		+inline
+
+ +

Priorities.

+ +

Definition at line 799 of file BlisModel.h.

+ +
+
+ +

◆ priority() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + +
int BlisModel::priority (int sequence) const
+ 		+inline
+
+ +

Returns priority level for an object (or 1000 if no priorities exist)

+ +

Definition at line 802 of file BlisModel.h.

+ +
+
+ +

◆ getNodeWeight()

+ +
+
+ + + + + +
+ + + + + + + +
double BlisModel::getNodeWeight () const
+ 		+inline
+
+ +

Definition at line 807 of file BlisModel.h.

+ +
+
+ +

◆ setNodeWeight()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::setNodeWeight (double nw)
+ 		+inline
+
+ +

Definition at line 809 of file BlisModel.h.

+ +
+
+ +

◆ modelLog()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void BlisModel::modelLog ()
+ 		+virtual
+
+ +

Log of specific models.

+ +
+
+ +

◆ getNumNodes()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getNumNodes () const
+ 		+inline
+
+ +

Get how many Nodes it took to solve the problem.

+ +

Definition at line 820 of file BlisModel.h.

+ +
+
+ +

◆ getNumIterations()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getNumIterations () const
+ 		+inline
+
+ +

Get how many iterations it took to solve the problem.

+ +

Definition at line 823 of file BlisModel.h.

+ +
+
+ +

◆ getAveIterations()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisModel::getAveIterations () const
+ 		+inline
+
+ +

Get the average iterations it took to solve a lp.

+ +

Definition at line 826 of file BlisModel.h.

+ +
+
+ +

◆ addNumNodes()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::addNumNodes (int newNodes = 1)
+ 		+inline
+
+ +

Increment node count.

+ +

Definition at line 829 of file BlisModel.h.

+ +
+
+ +

◆ addNumIterations()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::addNumIterations (int newIter)
+ 		+inline
+
+ +

Increment Iteration count.

+ +

Definition at line 832 of file BlisModel.h.

+ +
+
+ +

◆ blisMessageHandler()

+ +
+
+ + + + + +
+ + + + + + + +
CoinMessageHandler* BlisModel::blisMessageHandler () const
+ 		+inline
+
+ +

Get the message handler.

+ +

Definition at line 838 of file BlisModel.h.

+ +
+
+ +

◆ blisMessages()

+ +
+
+ + + + + +
+ + + + + + + +
CoinMessages BlisModel::blisMessages ()
+ 		+inline
+
+ +

Return messages.

+ +

Definition at line 842 of file BlisModel.h.

+ +
+
+ +

◆ BlisPar()

+ +
+
+ + + + + +
+ + + + + + + +
BlisParams* BlisModel::BlisPar ()
+ 		+inline
+
+ +

Access parameters.

+ +

Definition at line 846 of file BlisModel.h.

+ +
+
+ +

◆ nodeLog()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual void BlisModel::nodeLog (AlpsTreeNode * node,
bool force 
)
+ 		+virtual
+
+ +

Node log.

+ +
+
+ +

◆ fathomAllNodes()

+ +
+
+ + + + + +
+ + + + + + + +
virtual bool BlisModel::fathomAllNodes ()
+ 		+virtual
+
+ +

Return true, if all nodes can be fathomed.

+ +
+
+ +

◆ encodeBlis()

+ +
+
+ + + + + +
+ + + + + + + + +
AlpsReturnStatus BlisModel::encodeBlis (AlpsEncoded * encoded) const
+ 		+protected
+
+ +

Pack Blis portion of the model into an encoded object.

+ +
+
+ +

◆ decodeBlis()

+ +
+
+ + + + + +
+ + + + + + + + +
AlpsReturnStatus BlisModel::decodeBlis (AlpsEncoded & encoded)
+ 		+protected
+
+ +

Unpack Blis portion of the model from an encoded object.

+ +
+
+ +

◆ packSharedPseudocost()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void BlisModel::packSharedPseudocost (AlpsEncoded * encoded,
int numToShare 
)
+ 		+protected
+
+ +

Retrieve and pack shared pseudocost.

+ +
+
+ +

◆ unpackSharedPseudocost()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::unpackSharedPseudocost (AlpsEncoded & encoded)
+ 		+protected
+
+ +

Unpack and store shared pseduocost.

+ +
+
+ +

◆ packSharedConstraints()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::packSharedConstraints (AlpsEncoded * encoded)
+ 		+protected
+
+ +

Retrieve and pack shared constraints.

+ +
+
+ +

◆ unpackSharedConstraints()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::unpackSharedConstraints (AlpsEncoded & encoded)
+ 		+protected
+
+ +

Unpack and store shared constraints.

+ +
+
+ +

◆ packSharedVariables()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::packSharedVariables (AlpsEncoded * encoded)
+ 		+protected
+
+ +

Retrieve and pack shared variables.

+ +
+
+ +

◆ unpackSharedVariables()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisModel::unpackSharedVariables (AlpsEncoded & encoded)
+ 		+protected
+
+ +

Unpack and store shared variables.

+ +
+
+ +

◆ registerKnowledge()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void BlisModel::registerKnowledge ()
+ 		+virtual
+
+ +

Register knowledge.

+ +

Reimplemented in VrpModel.

+ +
+
+ +

◆ encode()

+ +
+
+ + + + + +
+ + + + + + + +
virtual AlpsEncoded* BlisModel::encode () const
+ 		+virtual
+
+ +

The method that encodes the model into an encoded object.

+ +

Reimplemented in VrpModel.

+ +
+
+ +

◆ decodeToSelf()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisModel::decodeToSelf (AlpsEncoded & )
+ 		+virtual
+
+ +

The method that decodes the model from an encoded object.

+ +

Reimplemented in VrpModel.

+ +
+
+ +

◆ packSharedKnowlege()

+ +
+
+ + + + + +
+ + + + + + + +
virtual AlpsEncoded* BlisModel::packSharedKnowlege ()
+ 		+virtual
+
+ +

Pack knowledge to be shared with others into an encoded object.

+

Return NULL means that no knowledge can be shared.

+ +
+
+ +

◆ unpackSharedKnowledge()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisModel::unpackSharedKnowledge (AlpsEncoded & )
+ 		+virtual
+
+ +

Unpack and store shared knowledge from an encoded object.

+ +
+
+ +

◆ presolveForTheWholeTree()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void BlisModel::presolveForTheWholeTree ()
+ 		+virtual
+
+ +
+
+

Member Data Documentation

+ +

◆ origLpSolver_

+ +
+
+ + + + + +
+ + + + +
OsiSolverInterface* BlisModel::origLpSolver_
+ 		+protected
+
+ +

Input by user.

+ +

Definition at line 78 of file BlisModel.h.

+ +
+
+ +

◆ presolvedLpSolver_

+ +
+
+ + + + + +
+ + + + +
OsiSolverInterface* BlisModel::presolvedLpSolver_
+ 		+protected
+
+ +

Presolved.

+ +

Definition at line 80 of file BlisModel.h.

+ +
+
+ +

◆ lpSolver_

+ +
+
+ + + + + +
+ + + + +
OsiSolverInterface* BlisModel::lpSolver_
+ 		+protected
+
+ +

Actually used.

+

If using presolve, then it is presolved; otherwise it is the original.

+ +

Definition at line 83 of file BlisModel.h.

+ +
+
+ +

◆ colMatrix_

+ +
+
+ + + + + +
+ + + + +
CoinPackedMatrix* BlisModel::colMatrix_
+ 		+protected
+
+ +

Column majored matrix.

+

(For MPS file, etc.)

+ +

Definition at line 90 of file BlisModel.h.

+ +
+
+ +

◆ varLB_

+ +
+
+ + + + + +
+ + + + +
double* BlisModel::varLB_
+ 		+protected
+
+ +

Variable and constraint bounds.

+ +

Definition at line 94 of file BlisModel.h.

+ +
+
+ +

◆ varUB_

+ +
+
+ + + + + +
+ + + + +
double* BlisModel::varUB_
+ 		+protected
+
+ +

Definition at line 95 of file BlisModel.h.

+ +
+
+ +

◆ conLB_

+ +
+
+ + + + + +
+ + + + +
double* BlisModel::conLB_
+ 		+protected
+
+ +

Definition at line 96 of file BlisModel.h.

+ +
+
+ +

◆ conUB_

+ +
+
+ + + + + +
+ + + + +
double* BlisModel::conUB_
+ 		+protected
+
+ +

Definition at line 97 of file BlisModel.h.

+ +
+
+ +

◆ numCols_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::numCols_
+ 		+protected
+
+ +

Number of columns/rows/elements.

+ +

Definition at line 102 of file BlisModel.h.

+ +
+
+ +

◆ numRows_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::numRows_
+ 		+protected
+
+ +

Definition at line 103 of file BlisModel.h.

+ +
+
+ +

◆ numElems_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::numElems_
+ 		+protected
+
+ +

Definition at line 104 of file BlisModel.h.

+ +
+
+ +

◆ objSense_

+ +
+
+ + + + + +
+ + + + +
double BlisModel::objSense_
+ 		+protected
+
+ +

Objective function.

+ +

Definition at line 109 of file BlisModel.h.

+ +
+
+ +

◆ objCoef_

+ +
+
+ + + + + +
+ + + + +
double* BlisModel::objCoef_
+ 		+protected
+
+ +

Definition at line 110 of file BlisModel.h.

+ +
+
+ +

◆ numIntObjects_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::numIntObjects_
+ 		+protected
+
+ +

Column types.

+ +

Definition at line 115 of file BlisModel.h.

+ +
+
+ +

◆ intColIndices_

+ +
+
+ + + + + +
+ + + + +
int* BlisModel::intColIndices_
+ 		+protected
+
+ +

Definition at line 116 of file BlisModel.h.

+ +
+
+ +

◆ inputVar_

+ +
+
+ + + + + +
+ + + + +
std::vector<BcpsVariable *> BlisModel::inputVar_
+ 		+protected
+
+ +

User's input objects.

+ +

Definition at line 121 of file BlisModel.h.

+ +
+
+ +

◆ inputCon_

+ +
+
+ + + + + +
+ + + + +
std::vector<BcpsConstraint *> BlisModel::inputCon_
+ 		+protected
+
+ +

Definition at line 122 of file BlisModel.h.

+ +
+
+ +

◆ presolve_

+ +
+
+ + + + + +
+ + + + +
BlisPresolve* BlisModel::presolve_
+ 		+protected
+
+ +

Definition at line 129 of file BlisModel.h.

+ +
+
+ +

◆ presolved

+ +
+
+ + + + + +
+ + + + +
bool BlisModel::presolved
+ 		+protected
+
+ +

Definition at line 131 of file BlisModel.h.

+ +
+
+ +

◆ problemSetup

+ +
+
+ + + + + +
+ + + + +
bool BlisModel::problemSetup
+ 		+protected
+
+ +

Definition at line 132 of file BlisModel.h.

+ +
+
+ +

◆ numSolutions_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::numSolutions_
+ 		+protected
+
+ +

Definition at line 139 of file BlisModel.h.

+ +
+
+ +

◆ numHeurSolutions_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::numHeurSolutions_
+ 		+protected
+
+ +

Definition at line 140 of file BlisModel.h.

+ +
+
+ +

◆ incObjValue_

+ +
+
+ + + + + +
+ + + + +
double BlisModel::incObjValue_
+ 		+protected
+
+ +

Incumbent objective value.

+ +

Definition at line 143 of file BlisModel.h.

+ +
+
+ +

◆ incumbent_

+ +
+
+ + + + + +
+ + + + +
double* BlisModel::incumbent_
+ 		+protected
+
+ +

Incumbent.

+ +

Definition at line 146 of file BlisModel.h.

+ +
+
+ +

◆ cutoff_

+ +
+
+ + + + + +
+ + + + +
double BlisModel::cutoff_
+ 		+protected
+
+ +

Cutoff in lp solver.

+ +

Definition at line 149 of file BlisModel.h.

+ +
+
+ +

◆ cutoffInc_

+ +
+
+ + + + + +
+ + + + +
double BlisModel::cutoffInc_
+ 		+protected
+
+ +

Cutoff increment.

+ +

Definition at line 152 of file BlisModel.h.

+ +
+
+ +

◆ intObjIndices_

+ +
+
+ + + + + +
+ + + + +
int* BlisModel::intObjIndices_
+ 		+protected
+
+ +

Definition at line 158 of file BlisModel.h.

+ +
+
+ +

◆ colType_

+ +
+
+ + + + + +
+ + + + +
char* BlisModel::colType_
+ 		+protected
+
+ +

Definition at line 159 of file BlisModel.h.

+ +
+
+ +

◆ startVarLB_

+ +
+
+ + + + + +
+ + + + +
double* BlisModel::startVarLB_
+ 		+protected
+
+ +

Starting var/con bounds for processing each node.

+ +

Definition at line 163 of file BlisModel.h.

+ +
+
+ +

◆ startVarUB_

+ +
+
+ + + + + +
+ + + + +
double* BlisModel::startVarUB_
+ 		+protected
+
+ +

Definition at line 164 of file BlisModel.h.

+ +
+
+ +

◆ startConLB_

+ +
+
+ + + + + +
+ + + + +
double* BlisModel::startConLB_
+ 		+protected
+
+ +

Definition at line 165 of file BlisModel.h.

+ +
+
+ +

◆ startConUB_

+ +
+
+ + + + + +
+ + + + +
double* BlisModel::startConUB_
+ 		+protected
+
+ +

Definition at line 166 of file BlisModel.h.

+ +
+
+ +

◆ branchStrategy_

+ +
+
+ + + + + +
+ + + + +
BcpsBranchStrategy* BlisModel::branchStrategy_
+ 		+protected
+
+ +

Variable selection function.

+ +

Definition at line 170 of file BlisModel.h.

+ +
+
+ +

◆ rampUpBranchStrategy_

+ +
+
+ + + + + +
+ + + + +
BcpsBranchStrategy* BlisModel::rampUpBranchStrategy_
+ 		+protected
+
+ +

Definition at line 171 of file BlisModel.h.

+ +
+
+ +

◆ hotstartStrategy_

+ +
+
+ + + + + +
+ + + + +
BlisHotStartStrategy BlisModel::hotstartStrategy_
+ 		+protected
+
+ +

Definition at line 176 of file BlisModel.h.

+ +
+
+ +

◆ numObjects_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::numObjects_
+ 		+protected
+
+ +

Number of objects.

+ +

Definition at line 179 of file BlisModel.h.

+ +
+
+ +

◆ objects_

+ +
+
+ + + + + +
+ + + + +
BcpsObject** BlisModel::objects_
+ 		+protected
+
+ +

The set of objects.

+ +

Definition at line 182 of file BlisModel.h.

+ +
+
+ +

◆ sharedObjectMark_

+ +
+
+ + + + + +
+ + + + +
char* BlisModel::sharedObjectMark_
+ 		+protected
+
+ +

The objects that can be shared.

+ +

Definition at line 185 of file BlisModel.h.

+ +
+
+ +

◆ priority_

+ +
+
+ + + + + +
+ + + + +
int* BlisModel::priority_
+ 		+protected
+
+ +

Priorities of integer object.

+ +

Definition at line 188 of file BlisModel.h.

+ +
+
+ +

◆ activeNode_

+ +
+
+ + + + + +
+ + + + +
AlpsTreeNode* BlisModel::activeNode_
+ 		+protected
+
+ +

Active node.

+ +

Definition at line 191 of file BlisModel.h.

+ +
+
+ +

◆ numStrong_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::numStrong_
+ 		+protected
+
+ +

Number of strong branching.

+ +

Definition at line 194 of file BlisModel.h.

+ +
+
+ +

◆ nodeWeight_

+ +
+
+ + + + + +
+ + + + +
double BlisModel::nodeWeight_
+ 		+protected
+
+ +

Definition at line 197 of file BlisModel.h.

+ +
+
+ +

◆ numBranchResolve_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::numBranchResolve_
+ 		+protected
+
+ +

Maximum number of resolve during branching.

+ +

Definition at line 200 of file BlisModel.h.

+ +
+
+ +

◆ numHeuristics_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::numHeuristics_
+ 		+protected
+
+ +

Number of heuristics.

+ +

Definition at line 207 of file BlisModel.h.

+ +
+
+ +

◆ heuristics_

+ +
+
+ + + + + +
+ + + + +
BlisHeuristic** BlisModel::heuristics_
+ 		+protected
+
+ +

The list of heuristics.

+ +

Definition at line 210 of file BlisModel.h.

+ +
+
+ +

◆ cutStrategy_

+ +
+
+ + + + + +
+ + + + +
BlisCutStrategy BlisModel::cutStrategy_
+ 		+protected
+
+ +

If use cut generators.

+ +

Definition at line 217 of file BlisModel.h.

+ +
+
+ +

◆ cutGenerationFrequency_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::cutGenerationFrequency_
+ 		+protected
+
+ +

Frequency of cut generation.

+ +

Definition at line 220 of file BlisModel.h.

+ +
+
+ +

◆ numCutGenerators_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::numCutGenerators_
+ 		+protected
+
+ +

Number of cut generators used.

+ +

Definition at line 223 of file BlisModel.h.

+ +
+
+ +

◆ maxNumCons_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::maxNumCons_
+ 		+protected
+
+ +

Number of cuts can be generators.

+ +

Definition at line 226 of file BlisModel.h.

+ +
+
+ +

◆ generators_

+ +
+
+ + + + + +
+ + + + +
BlisConGenerator** BlisModel::generators_
+ 		+protected
+
+ +

The list of cut generators used.

+ +

Definition at line 229 of file BlisModel.h.

+ +
+
+ +

◆ constraintPool_

+ +
+
+ + + + + +
+ + + + +
BcpsConstraintPool* BlisModel::constraintPool_
+ 		+protected
+
+ +

Store all the cuts.

+ +

Definition at line 232 of file BlisModel.h.

+ +
+
+ +

◆ oldConstraints_

+ +
+
+ + + + + +
+ + + + +
BlisConstraint** BlisModel::oldConstraints_
+ 		+protected
+
+ +

Temporary store old cuts at a node when installing a node.

+ +

Definition at line 235 of file BlisModel.h.

+ +
+
+ +

◆ oldConstraintsSize_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::oldConstraintsSize_
+ 		+protected
+
+ +

The memory size allocated for oldConstraints_.

+ +

Definition at line 238 of file BlisModel.h.

+ +
+
+ +

◆ numOldConstraints_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::numOldConstraints_
+ 		+protected
+
+ +

Number of old constraints.

+ +

Definition at line 241 of file BlisModel.h.

+ +
+
+ +

◆ conRandoms_

+ +
+
+ + + + + +
+ + + + +
double* BlisModel::conRandoms_
+ 		+protected
+
+ +

Random keys.

+ +

Definition at line 244 of file BlisModel.h.

+ +
+
+ +

◆ denseConCutoff_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::denseConCutoff_
+ 		+protected
+
+ +

Dense constraint cutoff.

+ +

Definition at line 247 of file BlisModel.h.

+ +
+
+ +

◆ BlisPar_

+ +
+
+ + + + + +
+ + + + +
BlisParams* BlisModel::BlisPar_
+ 		+protected
+
+ +

Blis parameters.

+ +

Definition at line 254 of file BlisModel.h.

+ +
+
+ +

◆ blisMessageHandler_

+ +
+
+ + + + + +
+ + + + +
CoinMessageHandler* BlisModel::blisMessageHandler_
+ 		+protected
+
+ +

Message handler.

+ +

Definition at line 257 of file BlisModel.h.

+ +
+
+ +

◆ blisMessages_

+ +
+
+ + + + + +
+ + + + +
CoinMessages BlisModel::blisMessages_
+ 		+protected
+
+ +

Blis messages.

+ +

Definition at line 260 of file BlisModel.h.

+ +
+
+ +

◆ numNodes_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::numNodes_
+ 		+protected
+
+ +

Number of processed nodes.

+ +

Definition at line 263 of file BlisModel.h.

+ +
+
+ +

◆ numIterations_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::numIterations_
+ 		+protected
+
+ +

Number of lp(Simplex) iterations.

+ +

Definition at line 266 of file BlisModel.h.

+ +
+
+ +

◆ aveIterations_

+ +
+
+ + + + + +
+ + + + +
int BlisModel::aveIterations_
+ 		+protected
+
+ +

Average number of lp iterations to solve a subproblem.

+ +

Definition at line 269 of file BlisModel.h.

+ +
+
+ +

◆ feasCheckTime_

+ +
+
+ + + + + +
+ + + + +
double BlisModel::feasCheckTime_
+ 		+protected
+
+ +

Time spent checking feasibility of solutions.

+ +

Definition at line 272 of file BlisModel.h.

+ +
+
+ +

◆ tempVarLBPos_

+ +
+
+ + + + + +
+ + + + +
int* BlisModel::tempVarLBPos_
+ 		+protected
+
+ +

Tempory storage for var/con indices.

+ +

Definition at line 280 of file BlisModel.h.

+ +
+
+ +

◆ tempVarUBPos_

+ +
+
+ + + + + +
+ + + + +
int* BlisModel::tempVarUBPos_
+ 		+protected
+
+ +

Definition at line 281 of file BlisModel.h.

+ +
+
+ +

◆ tempConLBPos_

+ +
+
+ + + + + +
+ + + + +
int* BlisModel::tempConLBPos_
+ 		+protected
+
+ +

Definition at line 282 of file BlisModel.h.

+ +
+
+ +

◆ tempConUBPos_

+ +
+
+ + + + + +
+ + + + +
int* BlisModel::tempConUBPos_
+ 		+protected
+
+ +

Definition at line 283 of file BlisModel.h.

+ +
+
+ +

◆ constraintPoolSend_

+ +
+
+ + + + + +
+ + + + +
BcpsConstraintPool* BlisModel::constraintPoolSend_
+ 		+protected
+
+ +

Constraints that can be sent/broadcasted to other processes.

+ +

Definition at line 291 of file BlisModel.h.

+ +
+
+ +

◆ constraintPoolReceive_

+ +
+
+ + + + + +
+ + + + +
BcpsConstraintPool* BlisModel::constraintPoolReceive_
+ 		+protected
+
+ +

Constraints that are received from other processses.

+ +

Definition at line 294 of file BlisModel.h.

+ +
+
+ +

◆ isRoot_

+ +
+
+ + + + +
bool BlisModel::isRoot_
+
+ +

If root node.

+ +

Definition at line 299 of file BlisModel.h.

+ +
+
+ +

◆ boundingPass_

+ +
+
+ + + + +
int BlisModel::boundingPass_
+
+ +

The number of passes during bounding procedure.

+ +

Definition at line 302 of file BlisModel.h.

+ +
+
+ +

◆ integerTol_

+ +
+
+ + + + +
double BlisModel::integerTol_
+
+ +

Integer tolerance.

+ +

Definition at line 305 of file BlisModel.h.

+ +
+
+ +

◆ optimalRelGap_

+ +
+
+ + + + +
double BlisModel::optimalRelGap_
+
+ +

Input relative optimal gap.

+ +

Definition at line 308 of file BlisModel.h.

+ +
+
+ +

◆ optimalAbsGap_

+ +
+
+ + + + +
double BlisModel::optimalAbsGap_
+
+ +

Input absolute optimal gap.

+ +

Definition at line 311 of file BlisModel.h.

+ +
+
+ +

◆ currRelGap_

+ +
+
+ + + + +
double BlisModel::currRelGap_
+
+ +

Current relative optimal gap.

+ +

Definition at line 314 of file BlisModel.h.

+ +
+
+ +

◆ currAbsGap_

+ +
+
+ + + + +
double BlisModel::currAbsGap_
+
+ +

Current absolute optimal gap.

+ +

Definition at line 317 of file BlisModel.h.

+ +
+
+ +

◆ heurStrategy_

+ +
+
+ + + + +
BlisHeurStrategy BlisModel::heurStrategy_
+
+ +

If use heuristics.

+ +

Definition at line 320 of file BlisModel.h.

+ +
+
+ +

◆ heurCallFrequency_

+ +
+
+ + + + +
int BlisModel::heurCallFrequency_
+
+ +

Frequency of using heuristics.

+ +

Definition at line 323 of file BlisModel.h.

+ +
+
+ +

◆ newCutPool_

+ +
+
+ + + + +
OsiCuts BlisModel::newCutPool_
+
+ +

Store new cuts in each pass.

+ +

Definition at line 326 of file BlisModel.h.

+ +
+
+ +

◆ leafToRootPath

+ +
+
+ + + + +
std::vector<AlpsTreeNode *> BlisModel::leafToRootPath
+
+ +

Record the path from leaf to root.

+ +

Definition at line 329 of file BlisModel.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisModel__coll__graph.map b/Doxygen/0.94/classBlisModel__coll__graph.map new file mode 100644 index 0000000..6d6c657 --- /dev/null +++ b/Doxygen/0.94/classBlisModel__coll__graph.map @@ -0,0 +1,19 @@ + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/classBlisModel__coll__graph.md5 b/Doxygen/0.94/classBlisModel__coll__graph.md5 new file mode 100644 index 0000000..d2f3baa --- /dev/null +++ b/Doxygen/0.94/classBlisModel__coll__graph.md5 @@ -0,0 +1 @@ +dc67de41d36c7af49c3f273a15ae1a68 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisModel__coll__graph.png b/Doxygen/0.94/classBlisModel__coll__graph.png new file mode 100644 index 0000000..ce85344 Binary files /dev/null and b/Doxygen/0.94/classBlisModel__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisModel__inherit__graph.map b/Doxygen/0.94/classBlisModel__inherit__graph.map new file mode 100644 index 0000000..e8b05ef --- /dev/null +++ b/Doxygen/0.94/classBlisModel__inherit__graph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/classBlisModel__inherit__graph.md5 b/Doxygen/0.94/classBlisModel__inherit__graph.md5 new file mode 100644 index 0000000..adceff8 --- /dev/null +++ b/Doxygen/0.94/classBlisModel__inherit__graph.md5 @@ -0,0 +1 @@ +6472cbfdb0be34566ff6cea9eaf45d4c \ No newline at end of file diff --git a/Doxygen/0.94/classBlisModel__inherit__graph.png b/Doxygen/0.94/classBlisModel__inherit__graph.png new file mode 100644 index 0000000..1634ed4 Binary files /dev/null and b/Doxygen/0.94/classBlisModel__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisNodeDesc-members.html b/Doxygen/0.94/classBlisNodeDesc-members.html new file mode 100644 index 0000000..a941ee0 --- /dev/null +++ b/Doxygen/0.94/classBlisNodeDesc-members.html @@ -0,0 +1,99 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisNodeDesc Member List
+
+
+ +

This is the complete list of members for BlisNodeDesc, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
basis_BlisNodeDescprivate
BlisNodeDesc()BlisNodeDescinline
BlisNodeDesc(BlisModel *m)BlisNodeDescinline
branchedDir_BlisNodeDescprivate
branchedInd_BlisNodeDescprivate
branchedVal_BlisNodeDescprivate
decode(AlpsEncoded &encoded)BlisNodeDescinlinevirtual
decodeBlis(AlpsEncoded &encoded)BlisNodeDescinlineprotected
encode(AlpsEncoded *encoded) constBlisNodeDescinlinevirtual
encodeBlis(AlpsEncoded *encoded) constBlisNodeDescinlineprotected
getBasis() constBlisNodeDescinline
getBranchedDir() constBlisNodeDescinline
getBranchedInd() constBlisNodeDescinline
getBranchedVal() constBlisNodeDescinline
setBasis(CoinWarmStartBasis *&ws)BlisNodeDescinline
setBranchedDir(int d)BlisNodeDescinline
setBranchedInd(int d)BlisNodeDescinline
setBranchedVal(double d)BlisNodeDescinline
~BlisNodeDesc()BlisNodeDescinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisNodeDesc.html b/Doxygen/0.94/classBlisNodeDesc.html new file mode 100644 index 0000000..bce1aca --- /dev/null +++ b/Doxygen/0.94/classBlisNodeDesc.html @@ -0,0 +1,734 @@ + + + + + + + +Blis: BlisNodeDesc Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Protected Member Functions | +Private Attributes | +List of all members
+
+
BlisNodeDesc Class Reference
+
+
+ +

#include <BlisNodeDesc.h>

+
+ + Inheritance diagram for BlisNodeDesc:
+
+
+ +
+ + Collaboration diagram for BlisNodeDesc:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisNodeDesc ()
 Default constructor. More...
 
 BlisNodeDesc (BlisModel *m)
 Useful constructor. More...
 
virtual ~BlisNodeDesc ()
 Destructor. More...
 
void setBasis (CoinWarmStartBasis *&ws)
 Set basis. More...
 
CoinWarmStartBasis * getBasis () const
 Get warm start basis. More...
 
void setBranchedDir (int d)
 Set branching direction. More...
 
int getBranchedDir () const
 Get branching direction. More...
 
void setBranchedInd (int d)
 Set branching object index. More...
 
int getBranchedInd () const
 Get branching object index. More...
 
void setBranchedVal (double d)
 Set branching value. More...
 
double getBranchedVal () const
 Get branching direction. More...
 
virtual AlpsReturnStatus encode (AlpsEncoded *encoded) const
 Pack node description into an encoded. More...
 
virtual AlpsReturnStatus decode (AlpsEncoded &encoded)
 Unpack a node description from an encoded. More...
 
+ + + + + + + +

+Protected Member Functions

AlpsReturnStatus encodeBlis (AlpsEncoded *encoded) const
 Pack blis portion of node description into an encoded. More...
 
AlpsReturnStatus decodeBlis (AlpsEncoded &encoded)
 Unpack blis portion of node description from an encoded. More...
 
+ + + + + + + + + + + + + +

+Private Attributes

int branchedDir_
 Branched direction to create it. More...
 
int branchedInd_
 Branched object index to create it. More...
 
double branchedVal_
 Branched value to create it. More...
 
CoinWarmStartBasis * basis_
 Warm start. More...
 
+

Detailed Description

+
+

Definition at line 40 of file BlisNodeDesc.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisNodeDesc() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
BlisNodeDesc::BlisNodeDesc ()
+ 		+inline
+
+ +

Default constructor.

+ +

Definition at line 59 of file BlisNodeDesc.h.

+ +
+
+ +

◆ BlisNodeDesc() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + +
BlisNodeDesc::BlisNodeDesc (BlisModel * m)
+ 		+inline
+
+ +

Useful constructor.

+ +

Definition at line 68 of file BlisNodeDesc.h.

+ +
+
+ +

◆ ~BlisNodeDesc()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisNodeDesc::~BlisNodeDesc ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 78 of file BlisNodeDesc.h.

+ +
+
+

Member Function Documentation

+ +

◆ setBasis()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisNodeDesc::setBasis (CoinWarmStartBasis *& ws)
+ 		+inline
+
+ +

Set basis.

+ +

Definition at line 81 of file BlisNodeDesc.h.

+ +
+
+ +

◆ getBasis()

+ +
+
+ + + + + +
+ + + + + + + +
CoinWarmStartBasis* BlisNodeDesc::getBasis () const
+ 		+inline
+
+ +

Get warm start basis.

+ +

Definition at line 88 of file BlisNodeDesc.h.

+ +
+
+ +

◆ setBranchedDir()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisNodeDesc::setBranchedDir (int d)
+ 		+inline
+
+ +

Set branching direction.

+ +

Definition at line 91 of file BlisNodeDesc.h.

+ +
+
+ +

◆ getBranchedDir()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisNodeDesc::getBranchedDir () const
+ 		+inline
+
+ +

Get branching direction.

+ +

Definition at line 94 of file BlisNodeDesc.h.

+ +
+
+ +

◆ setBranchedInd()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisNodeDesc::setBranchedInd (int d)
+ 		+inline
+
+ +

Set branching object index.

+ +

Definition at line 97 of file BlisNodeDesc.h.

+ +
+
+ +

◆ getBranchedInd()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisNodeDesc::getBranchedInd () const
+ 		+inline
+
+ +

Get branching object index.

+ +

Definition at line 100 of file BlisNodeDesc.h.

+ +
+
+ +

◆ setBranchedVal()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisNodeDesc::setBranchedVal (double d)
+ 		+inline
+
+ +

Set branching value.

+ +

Definition at line 103 of file BlisNodeDesc.h.

+ +
+
+ +

◆ getBranchedVal()

+ +
+
+ + + + + +
+ + + + + + + +
double BlisNodeDesc::getBranchedVal () const
+ 		+inline
+
+ +

Get branching direction.

+ +

Definition at line 106 of file BlisNodeDesc.h.

+ +
+
+ +

◆ encodeBlis()

+ +
+
+ + + + + +
+ + + + + + + + +
AlpsReturnStatus BlisNodeDesc::encodeBlis (AlpsEncoded * encoded) const
+ 		+inlineprotected
+
+ +

Pack blis portion of node description into an encoded.

+ +

Definition at line 111 of file BlisNodeDesc.h.

+ +
+
+ +

◆ decodeBlis()

+ +
+
+ + + + + +
+ + + + + + + + +
AlpsReturnStatus BlisNodeDesc::decodeBlis (AlpsEncoded & encoded)
+ 		+inlineprotected
+
+ +

Unpack blis portion of node description from an encoded.

+ +

Definition at line 133 of file BlisNodeDesc.h.

+ +
+
+ +

◆ encode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsReturnStatus BlisNodeDesc::encode (AlpsEncoded * encoded) const
+ 		+inlinevirtual
+
+ +

Pack node description into an encoded.

+ +

Definition at line 157 of file BlisNodeDesc.h.

+ +
+
+ +

◆ decode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsReturnStatus BlisNodeDesc::decode (AlpsEncoded & encoded)
+ 		+inlinevirtual
+
+ +

Unpack a node description from an encoded.

+

Fill member data.

+ +

Definition at line 167 of file BlisNodeDesc.h.

+ +
+
+

Member Data Documentation

+ +

◆ branchedDir_

+ +
+
+ + + + + +
+ + + + +
int BlisNodeDesc::branchedDir_
+ 		+private
+
+ +

Branched direction to create it.

+

For updating pseudocost.

+ +

Definition at line 45 of file BlisNodeDesc.h.

+ +
+
+ +

◆ branchedInd_

+ +
+
+ + + + + +
+ + + + +
int BlisNodeDesc::branchedInd_
+ 		+private
+
+ +

Branched object index to create it.

+

For updating pseudocost.

+ +

Definition at line 48 of file BlisNodeDesc.h.

+ +
+
+ +

◆ branchedVal_

+ +
+
+ + + + + +
+ + + + +
double BlisNodeDesc::branchedVal_
+ 		+private
+
+ +

Branched value to create it.

+

For updating pseudocost.

+ +

Definition at line 51 of file BlisNodeDesc.h.

+ +
+
+ +

◆ basis_

+ +
+
+ + + + + +
+ + + + +
CoinWarmStartBasis* BlisNodeDesc::basis_
+ 		+private
+
+ +

Warm start.

+ +

Definition at line 54 of file BlisNodeDesc.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisNodeDesc__coll__graph.map b/Doxygen/0.94/classBlisNodeDesc__coll__graph.map new file mode 100644 index 0000000..116a7b0 --- /dev/null +++ b/Doxygen/0.94/classBlisNodeDesc__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisNodeDesc__coll__graph.md5 b/Doxygen/0.94/classBlisNodeDesc__coll__graph.md5 new file mode 100644 index 0000000..7ccfc4b --- /dev/null +++ b/Doxygen/0.94/classBlisNodeDesc__coll__graph.md5 @@ -0,0 +1 @@ +2e3dfb8329899c3c20baeaa800d93389 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisNodeDesc__coll__graph.png b/Doxygen/0.94/classBlisNodeDesc__coll__graph.png new file mode 100644 index 0000000..e2435a6 Binary files /dev/null and b/Doxygen/0.94/classBlisNodeDesc__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisNodeDesc__inherit__graph.map b/Doxygen/0.94/classBlisNodeDesc__inherit__graph.map new file mode 100644 index 0000000..116a7b0 --- /dev/null +++ b/Doxygen/0.94/classBlisNodeDesc__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisNodeDesc__inherit__graph.md5 b/Doxygen/0.94/classBlisNodeDesc__inherit__graph.md5 new file mode 100644 index 0000000..7ccfc4b --- /dev/null +++ b/Doxygen/0.94/classBlisNodeDesc__inherit__graph.md5 @@ -0,0 +1 @@ +2e3dfb8329899c3c20baeaa800d93389 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisNodeDesc__inherit__graph.png b/Doxygen/0.94/classBlisNodeDesc__inherit__graph.png new file mode 100644 index 0000000..e2435a6 Binary files /dev/null and b/Doxygen/0.94/classBlisNodeDesc__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisObjectInt-members.html b/Doxygen/0.94/classBlisObjectInt-members.html new file mode 100644 index 0000000..b93ae22 --- /dev/null +++ b/Doxygen/0.94/classBlisObjectInt-members.html @@ -0,0 +1,105 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisObjectInt Member List
+
+
+ +

This is the complete list of members for BlisObjectInt, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisObjectInt()BlisObjectInt
BlisObjectInt(int objectIndex, int iColumn, double lb, double ub, double breakEven=0.5)BlisObjectInt
BlisObjectInt(const BlisObjectInt &)BlisObjectInt
breakEven() constBlisObjectIntinline
breakEven_BlisObjectIntprotected
clone() constBlisObjectIntinlinevirtual
columnIndex() constBlisObjectIntinlinevirtual
columnIndex_BlisObjectIntprotected
createBranchObject(BcpsModel *m, int direction) constBlisObjectIntvirtual
feasibleRegion(BcpsModel *m)BlisObjectIntvirtual
infeasibility(BcpsModel *m, int &preferredWay) constBlisObjectIntvirtual
notPreferredNewFeasible(BcpsModel *m) constBlisObjectIntvirtual
operator=(const BlisObjectInt &rhs)BlisObjectInt
originalLower_BlisObjectIntprotected
originalLowerBound() constBlisObjectIntinline
originalUpper_BlisObjectIntprotected
originalUpperBound() constBlisObjectIntinline
preferredNewFeasible(BcpsModel *m) constBlisObjectIntvirtual
pseudocost()BlisObjectIntinline
pseudocost_BlisObjectIntprotected
resetBounds(BcpsModel *m)BlisObjectIntvirtual
setBreakEven(double value)BlisObjectIntinline
setOriginalLowerBound(double value)BlisObjectIntinline
setOriginalUpperBound(double value)BlisObjectIntinline
~BlisObjectInt()BlisObjectIntinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisObjectInt.html b/Doxygen/0.94/classBlisObjectInt.html new file mode 100644 index 0000000..5e94436 --- /dev/null +++ b/Doxygen/0.94/classBlisObjectInt.html @@ -0,0 +1,917 @@ + + + + + + + +Blis: BlisObjectInt Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Protected Attributes | +List of all members
+
+
BlisObjectInt Class Reference
+
+
+ +

#include <BlisObjectInt.h>

+
+ + Inheritance diagram for BlisObjectInt:
+
+
+ +
+ + Collaboration diagram for BlisObjectInt:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisObjectInt ()
 Default Constructor. More...
 
 BlisObjectInt (int objectIndex, int iColumn, double lb, double ub, double breakEven=0.5)
 Useful constructor - passed integer index and model index. More...
 
virtual ~BlisObjectInt ()
 Destructor. More...
 
 BlisObjectInt (const BlisObjectInt &)
 Copy constructor. More...
 
virtual BcpsObject * clone () const
 Clone an object. More...
 
BlisObjectInt & operator= (const BlisObjectInt &rhs)
 Assignment operator. More...
 
virtual double infeasibility (BcpsModel *m, int &preferredWay) const
 Infeasibility. More...
 
virtual void feasibleRegion (BcpsModel *m)
 Set bounds to contain the current solution. More...
 
virtual BcpsBranchObject * createBranchObject (BcpsModel *m, int direction) const
 Creates a branching object. More...
 
virtual BcpsBranchObject * preferredNewFeasible (BcpsModel *m) const
 Given a valid solution (with reduced costs, etc.), return a branching object which would give a new feasible point in the good direction. More...
 
virtual BcpsBranchObject * notPreferredNewFeasible (BcpsModel *m) const
 Given a valid solution (with reduced costs, etc.), return a branching object which would give a new feasible point in a bad direction. More...
 
virtual void resetBounds (BcpsModel *m)
 Reset original upper and lower bound values from the solver. More...
 
virtual int columnIndex () const
 Column number if single column object, otherwise. More...
 
Get or set Original bounds.
double originalLowerBound () const
 
void setOriginalLowerBound (double value)
 
double originalUpperBound () const
 
void setOriginalUpperBound (double value)
 
double breakEven () const
 Breakeven e.g 0.7 -> >= 0.7 go up first. More...
 
void setBreakEven (double value)
 Set breakeven e.g 0.7 -> >= 0.7 go up first. More...
 
BlisPseudocost & pseudocost ()
 Access pseudocost. More...
 
+ + + + + + + + + + + + + + + + +

+Protected Attributes

int columnIndex_
 Column index in the lp model. More...
 
double originalLower_
 Original lower bound. More...
 
double originalUpper_
 Original upper bound. More...
 
double breakEven_
 Breakeven i.e. More...
 
BlisPseudocost pseudocost_
 Pseudo cost. More...
 
+

Detailed Description

+
+

Definition at line 36 of file BlisObjectInt.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisObjectInt() [1/3]

+ +
+
+ + + + + + + +
BlisObjectInt::BlisObjectInt ()
+
+ +

Default Constructor.

+ +
+
+ +

◆ BlisObjectInt() [2/3]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisObjectInt::BlisObjectInt (int objectIndex,
int iColumn,
double lb,
double ub,
double breakEven = 0.5 
)
+
+ +

Useful constructor - passed integer index and model index.

+ +
+
+ +

◆ ~BlisObjectInt()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisObjectInt::~BlisObjectInt ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 68 of file BlisObjectInt.h.

+ +
+
+ +

◆ BlisObjectInt() [3/3]

+ +
+
+ + + + + + + + +
BlisObjectInt::BlisObjectInt (const BlisObjectInt & )
+
+ +

Copy constructor.

+ +
+
+

Member Function Documentation

+ +

◆ clone()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BcpsObject* BlisObjectInt::clone () const
+ 		+inlinevirtual
+
+ +

Clone an object.

+ +

Definition at line 74 of file BlisObjectInt.h.

+ +
+
+ +

◆ operator=()

+ +
+
+ + + + + + + + +
BlisObjectInt& BlisObjectInt::operator= (const BlisObjectInt & rhs)
+
+ +

Assignment operator.

+ +
+
+ +

◆ infeasibility()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual double BlisObjectInt::infeasibility (BcpsModel * m,
int & preferredWay 
) const
+ 		+virtual
+
+ +

Infeasibility.

+

Range is [0.0, 0.5].

Parameters
+ + +
PreferredWaythe direction close to an integer.
+
+
+ +
+
+ +

◆ feasibleRegion()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisObjectInt::feasibleRegion (BcpsModel * m)
+ 		+virtual
+
+ +

Set bounds to contain the current solution.

+

More precisely, for the variable associated with this object, take the value given in the current solution, force it within the current bounds if required, then set the bounds to fix the variable at the integer nearest the solution value.

+ +
+
+ +

◆ createBranchObject()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual BcpsBranchObject* BlisObjectInt::createBranchObject (BcpsModel * m,
int direction 
) const
+ 		+virtual
+
+ +

Creates a branching object.

+ +
+
+ +

◆ preferredNewFeasible()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual BcpsBranchObject* BlisObjectInt::preferredNewFeasible (BcpsModel * m) const
+ 		+virtual
+
+ +

Given a valid solution (with reduced costs, etc.), return a branching object which would give a new feasible point in the good direction.

+

The preferred branching object will force the variable to be +/-1 from its current value, depending on the reduced cost and objective sense. If movement in the direction which improves the objective is impossible due to bounds on the variable, the branching object will move in the other direction. If no movement is possible, the method returns NULL.

+

Only the bounds on this variable are considered when determining if the new point is feasible.

+ +
+
+ +

◆ notPreferredNewFeasible()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual BcpsBranchObject* BlisObjectInt::notPreferredNewFeasible (BcpsModel * m) const
+ 		+virtual
+
+ +

Given a valid solution (with reduced costs, etc.), return a branching object which would give a new feasible point in a bad direction.

+

As for preferredNewFeasible(), but the preferred branching object will force movement in a direction that degrades the objective.

+ +
+
+ +

◆ resetBounds()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisObjectInt::resetBounds (BcpsModel * m)
+ 		+virtual
+
+ +

Reset original upper and lower bound values from the solver.

+

Handy for updating bounds held in this object after bounds held in the solver have been tightened.

+ +
+
+ +

◆ columnIndex()

+ +
+
+ + + + + +
+ + + + + + + +
virtual int BlisObjectInt::columnIndex () const
+ 		+inlinevirtual
+
+ +

Column number if single column object, otherwise.

+ +

Definition at line 129 of file BlisObjectInt.h.

+ +
+
+ +

◆ originalLowerBound()

+ +
+
+ + + + + +
+ + + + + + + +
double BlisObjectInt::originalLowerBound () const
+ 		+inline
+
+ +

Definition at line 133 of file BlisObjectInt.h.

+ +
+
+ +

◆ setOriginalLowerBound()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisObjectInt::setOriginalLowerBound (double value)
+ 		+inline
+
+ +

Definition at line 134 of file BlisObjectInt.h.

+ +
+
+ +

◆ originalUpperBound()

+ +
+
+ + + + + +
+ + + + + + + +
double BlisObjectInt::originalUpperBound () const
+ 		+inline
+
+ +

Definition at line 135 of file BlisObjectInt.h.

+ +
+
+ +

◆ setOriginalUpperBound()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisObjectInt::setOriginalUpperBound (double value)
+ 		+inline
+
+ +

Definition at line 136 of file BlisObjectInt.h.

+ +
+
+ +

◆ breakEven()

+ +
+
+ + + + + +
+ + + + + + + +
double BlisObjectInt::breakEven () const
+ 		+inline
+
+ +

Breakeven e.g 0.7 -> >= 0.7 go up first.

+ +

Definition at line 140 of file BlisObjectInt.h.

+ +
+
+ +

◆ setBreakEven()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisObjectInt::setBreakEven (double value)
+ 		+inline
+
+ +

Set breakeven e.g 0.7 -> >= 0.7 go up first.

+ +

Definition at line 143 of file BlisObjectInt.h.

+ +
+
+ +

◆ pseudocost()

+ +
+
+ + + + + +
+ + + + + + + +
BlisPseudocost& BlisObjectInt::pseudocost ()
+ 		+inline
+
+ +

Access pseudocost.

+ +

Definition at line 146 of file BlisObjectInt.h.

+ +
+
+

Member Data Documentation

+ +

◆ columnIndex_

+ +
+
+ + + + + +
+ + + + +
int BlisObjectInt::columnIndex_
+ 		+protected
+
+ +

Column index in the lp model.

+ +

Definition at line 41 of file BlisObjectInt.h.

+ +
+
+ +

◆ originalLower_

+ +
+
+ + + + + +
+ + + + +
double BlisObjectInt::originalLower_
+ 		+protected
+
+ +

Original lower bound.

+ +

Definition at line 44 of file BlisObjectInt.h.

+ +
+
+ +

◆ originalUpper_

+ +
+
+ + + + + +
+ + + + +
double BlisObjectInt::originalUpper_
+ 		+protected
+
+ +

Original upper bound.

+ +

Definition at line 47 of file BlisObjectInt.h.

+ +
+
+ +

◆ breakEven_

+ +
+
+ + + + + +
+ + + + +
double BlisObjectInt::breakEven_
+ 		+protected
+
+ +

Breakeven i.e.

+

>= this preferred is up.

+ +

Definition at line 50 of file BlisObjectInt.h.

+ +
+
+ +

◆ pseudocost_

+ +
+
+ + + + + +
+ + + + +
BlisPseudocost BlisObjectInt::pseudocost_
+ 		+protected
+
+ +

Pseudo cost.

+ +

Definition at line 53 of file BlisObjectInt.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisObjectInt__coll__graph.map b/Doxygen/0.94/classBlisObjectInt__coll__graph.map new file mode 100644 index 0000000..93498b8 --- /dev/null +++ b/Doxygen/0.94/classBlisObjectInt__coll__graph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/Doxygen/0.94/classBlisObjectInt__coll__graph.md5 b/Doxygen/0.94/classBlisObjectInt__coll__graph.md5 new file mode 100644 index 0000000..b4ecbd9 --- /dev/null +++ b/Doxygen/0.94/classBlisObjectInt__coll__graph.md5 @@ -0,0 +1 @@ +a86e84e885d2a23d107e8eb407f7f1a0 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisObjectInt__coll__graph.png b/Doxygen/0.94/classBlisObjectInt__coll__graph.png new file mode 100644 index 0000000..2b7e688 Binary files /dev/null and b/Doxygen/0.94/classBlisObjectInt__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisObjectInt__inherit__graph.map b/Doxygen/0.94/classBlisObjectInt__inherit__graph.map new file mode 100644 index 0000000..a2d69e9 --- /dev/null +++ b/Doxygen/0.94/classBlisObjectInt__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisObjectInt__inherit__graph.md5 b/Doxygen/0.94/classBlisObjectInt__inherit__graph.md5 new file mode 100644 index 0000000..3bb7e13 --- /dev/null +++ b/Doxygen/0.94/classBlisObjectInt__inherit__graph.md5 @@ -0,0 +1 @@ +6516372baebaa40587ad5f1d1c2f8bc1 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisObjectInt__inherit__graph.png b/Doxygen/0.94/classBlisObjectInt__inherit__graph.png new file mode 100644 index 0000000..6bbad56 Binary files /dev/null and b/Doxygen/0.94/classBlisObjectInt__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisParams-members.html b/Doxygen/0.94/classBlisParams-members.html new file mode 100644 index 0000000..b6bf5f1 --- /dev/null +++ b/Doxygen/0.94/classBlisParams-members.html @@ -0,0 +1,160 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisParams Member List
+
+
+ +

This is the complete list of members for BlisParams, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisParams()BlisParamsinline
branchStrategy enum valueBlisParams
branchStrategyRampUp enum valueBlisParams
chrParams enum nameBlisParams
createKeywordList()BlisParamsvirtual
cutCliqueFreq enum valueBlisParams
cutCliqueStrategy enum valueBlisParams
cutFactor enum valueBlisParams
cutFlowCoverFreq enum valueBlisParams
cutFlowCoverStrategy enum valueBlisParams
cutGenerationFrequency enum valueBlisParams
cutGomoryFreq enum valueBlisParams
cutGomoryStrategy enum valueBlisParams
cutKnapsackFreq enum valueBlisParams
cutKnapsackStrategy enum valueBlisParams
cutMirFreq enum valueBlisParams
cutMirStrategy enum valueBlisParams
cutOddHoleFreq enum valueBlisParams
cutOddHoleStrategy enum valueBlisParams
cutoff enum valueBlisParams
cutoffInc enum valueBlisParams
cutPass enum valueBlisParams
cutProbingFreq enum valueBlisParams
cutProbingStrategy enum valueBlisParams
cutRampUp enum valueBlisParams
cutStrategy enum valueBlisParams
cutTwoMirFreq enum valueBlisParams
cutTwoMirStrategy enum valueBlisParams
dblParams enum nameBlisParams
denseConFactor enum valueBlisParams
difference enum valueBlisParams
endOfChrParams enum valueBlisParams
endOfDblParams enum valueBlisParams
endOfIntParams enum valueBlisParams
endOfStrArrayParams enum valueBlisParams
endOfStrParams enum valueBlisParams
entry(const chrParams key) constBlisParamsinline
entry(const intParams key) constBlisParamsinline
entry(const dblParams key) constBlisParamsinline
entry(const strParams key) constBlisParamsinline
entry(const strArrayParams key) constBlisParamsinline
heurCallFrequency enum valueBlisParams
heurRoundFreq enum valueBlisParams
heurRoundStrategy enum valueBlisParams
heurStrategy enum valueBlisParams
integerTol enum valueBlisParams
intParams enum nameBlisParams
lookAhead enum valueBlisParams
objSense enum valueBlisParams
optimalAbsGap enum valueBlisParams
optimalRelGap enum valueBlisParams
pack(AlpsEncoded &buf)BlisParamsinline
presolve enum valueBlisParams
pseudoRelibility enum valueBlisParams
pseudoWeight enum valueBlisParams
quickCutPass enum valueBlisParams
scaleConFactor enum valueBlisParams
setDefaultEntries()BlisParamsvirtual
setEntry(const chrParams key, const char *val)BlisParamsinline
setEntry(const chrParams key, const char val)BlisParamsinline
setEntry(const chrParams key, const bool val)BlisParamsinline
setEntry(const intParams key, const char *val)BlisParamsinline
setEntry(const intParams key, const int val)BlisParamsinline
setEntry(const dblParams key, const char *val)BlisParamsinline
setEntry(const dblParams key, const double val)BlisParamsinline
setEntry(const strParams key, const char *val)BlisParamsinline
setEntry(const strArrayParams key, const char *val)BlisParamsinline
shareConstraints enum valueBlisParams
sharePcostDepth enum valueBlisParams
sharePcostFrequency enum valueBlisParams
sharePseudocostRampUp enum valueBlisParams
sharePseudocostSearch enum valueBlisParams
shareVariables enum valueBlisParams
strArrayDummy enum valueBlisParams
strArrayParams enum nameBlisParams
strDummy enum valueBlisParams
strongCandSize enum valueBlisParams
strParams enum nameBlisParams
tailOff enum valueBlisParams
unpack(AlpsEncoded &buf)BlisParamsinline
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisParams.html b/Doxygen/0.94/classBlisParams.html new file mode 100644 index 0000000..9ec81e4 --- /dev/null +++ b/Doxygen/0.94/classBlisParams.html @@ -0,0 +1,1091 @@ + + + + + + + +Blis: BlisParams Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Types | +List of all members
+
+
BlisParams Class Reference
+
+
+ +

#include <BlisParams.h>

+
+ + Inheritance diagram for BlisParams:
+
+
+ +
+ + Collaboration diagram for BlisParams:
+
+
+ + + + + + + + + + + + + + + + + + +

+Public Types

enum  chrParams {
+  cutRampUp, +presolve, +shareConstraints, +shareVariables, +
+  sharePseudocostRampUp, +sharePseudocostSearch, +endOfChrParams +
+ }
 Character parameters. More...
 
enum  intParams {
+  branchStrategy, +branchStrategyRampUp, +cutStrategy, +cutGenerationFrequency, +
+  cutPass, +quickCutPass, +cutCliqueStrategy, +cutGomoryStrategy, +
+  cutFlowCoverStrategy, +cutKnapsackStrategy, +cutMirStrategy, +cutOddHoleStrategy, +
+  cutProbingStrategy, +cutTwoMirStrategy, +cutCliqueFreq, +cutGomoryFreq, +
+  cutFlowCoverFreq, +cutKnapsackFreq, +cutMirFreq, +cutOddHoleFreq, +
+  cutProbingFreq, +cutTwoMirFreq, +difference, +heurStrategy, +
+  heurCallFrequency, +heurRoundStrategy, +heurRoundFreq, +lookAhead, +
+  pseudoRelibility, +sharePcostDepth, +sharePcostFrequency, +strongCandSize, +
+  endOfIntParams +
+ }
 Integer paramters. More...
 
enum  dblParams {
+  cutFactor, +cutoff, +cutoffInc, +denseConFactor, +
+  integerTol, +objSense, +optimalRelGap, +optimalAbsGap, +
+  pseudoWeight, +scaleConFactor, +tailOff, +endOfDblParams +
+ }
 Double parameters. More...
 
enum  strParams { strDummy, +endOfStrParams + }
 String parameters. More...
 
enum  strArrayParams { strArrayDummy, +endOfStrArrayParams + }
 There are no string array parameters. More...
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

Constructors.
 BlisParams ()
 The default constructor creates a parameter set with from the template argument structure. More...
 
virtual void createKeywordList ()
 Method for creating the list of keyword looked for in the parameter file. More...
 
virtual void setDefaultEntries ()
 Method for setting the default values for the parameters. More...
 
Query methods

For user application: Following code are do NOT need to change.

+

The reason can not put following functions in base class AlpsParameterSet is that chrParams and endOfChrParams etc., are NOT the same as those declared in base class.

+

The members of the parameter set can be queried for using the overloaded entry() method. Using the example in the class documentation the user can get a parameter with the "<code>param.entry(USER_par::parameter_name)</code>" expression.

+
bool entry (const chrParams key) const
 
int entry (const intParams key) const
 
double entry (const dblParams key) const
 
const std::string & entry (const strParams key) const
 
const std::vector< std::string > & entry (const strArrayParams key) const
 
void setEntry (const chrParams key, const char *val)
 char* is true(1) or false(0), not used More...
 
void setEntry (const chrParams key, const char val)
 char is true(1) or false(0), not used More...
 
void setEntry (const chrParams key, const bool val)
 This method is the one that ever been used. More...
 
void setEntry (const intParams key, const char *val)
 
void setEntry (const intParams key, const int val)
 
void setEntry (const dblParams key, const char *val)
 
void setEntry (const dblParams key, const double val)
 
void setEntry (const strParams key, const char *val)
 
void setEntry (const strArrayParams key, const char *val)
 
Packing/unpacking methods
void pack (AlpsEncoded &buf)
 Pack the parameter set into the buffer (AlpsEncoded is used as buffer Here). More...
 
void unpack (AlpsEncoded &buf)
 Unpack the parameter set from the buffer. More...
 
+

Detailed Description

+
+

Definition at line 35 of file BlisParams.h.

+

Member Enumeration Documentation

+ +

◆ chrParams

+ +
+
+ + + + +
enum BlisParams::chrParams
+
+ +

Character parameters.

+

All of these variable are used as booleans (ture = 1, false = 0).

+ + + + + + + + +
Enumerator
cutRampUp 

Generate cuts during rampup.

+

Default: true

+
presolve 

Presolve or not.

+
shareConstraints 

Share constraints Default: false.

+
shareVariables 

Share constraints Default: false.

+
sharePseudocostRampUp 

Share pseudocost during ramp up.

+

Default: true

+
sharePseudocostSearch 

Share pseudocost during search Default: false.

+
endOfChrParams 
+ +

Definition at line 39 of file BlisParams.h.

+ +
+
+ +

◆ intParams

+ +
+
+ + + + +
enum BlisParams::intParams
+
+ +

Integer paramters.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Enumerator
branchStrategy 

Branching strategy.

+

0: max infeasibilty, 1: pseudocost, 2: relibility, 3: strong branching. 4: bilevel branching

+
branchStrategyRampUp 
cutStrategy 

Cut generators control.

+

-2: root, -1: auto, 0: disable, any positive frequency

+
cutGenerationFrequency 

All constraint generators.

+
cutPass 
quickCutPass 

The pass to generate cuts.

+
cutCliqueStrategy 

The pass to generate cuts for quick branching.

+
cutGomoryStrategy 
cutFlowCoverStrategy 
cutKnapsackStrategy 
cutMirStrategy 
cutOddHoleStrategy 
cutProbingStrategy 
cutTwoMirStrategy 
cutCliqueFreq 
cutGomoryFreq 
cutFlowCoverFreq 
cutKnapsackFreq 
cutMirFreq 
cutOddHoleFreq 
cutProbingFreq 
cutTwoMirFreq 
difference 

-1 auto, 0, no, any integer frequency

+
heurStrategy 

Heuristics control.

+

BlisHeurStrategyRoot: root, BlisHeurStrategyAuto: auto, BlisHeurStrategyNone: disable, BlisHeurStrategyPeriodic: every 't' nodes

+
heurCallFrequency 

All heuristics.

+
heurRoundStrategy 
heurRoundFreq 
lookAhead 

The look ahead of pseudocost.

+
pseudoRelibility 

The relibility of pseudocost.

+
sharePcostDepth 

Maximum tree depth of sharing pseudocost.

+
sharePcostFrequency 

Frequency of sharing pseudocost.

+
strongCandSize 

The number of candidate used in strong branching.

+

Default: 10.

+
endOfIntParams 
+ +

Definition at line 62 of file BlisParams.h.

+ +
+
+ +

◆ dblParams

+ +
+
+ + + + +
enum BlisParams::dblParams
+
+ +

Double parameters.

+ + + + + + + + + + + + + +
Enumerator
cutFactor 

Limit the max number cuts applied at a node.

+

maxNumCons = (CutFactor - 1) * numCoreConstraints.

+
cutoff 

Cutoff any nodes whose objective value is higher than it.

+
cutoffInc 

The value added to relaxation value when deciding fathom.

+

Default:1.0e-6

+
denseConFactor 

Dense constraint factor.

+
integerTol 

Tolerance to treat as an integer.

+

Default: 1.0e-5

+
objSense 

Objective sense: min = 1.0, max = -1.0.

+
optimalRelGap 

If the relative gap between best feasible and best relaxed fall into this gap, search stops.

+

Default: 1.0e-6

+
optimalAbsGap 

If the absolute gap between best feasible and best relaxed fall into this gap, search stops.

+

Default: 1.0e-4

+
pseudoWeight 

Weight used to calculate pseudocost.

+
scaleConFactor 

Scaling indicator of a constraint.

+
tailOff 

Tail off.

+
endOfDblParams 
+ +

Definition at line 133 of file BlisParams.h.

+ +
+
+ +

◆ strParams

+ +
+
+ + + + +
enum BlisParams::strParams
+
+ +

String parameters.

+ + + +
Enumerator
strDummy 
endOfStrParams 
+ +

Definition at line 174 of file BlisParams.h.

+ +
+
+ +

◆ strArrayParams

+ +
+
+ + + + +
enum BlisParams::strArrayParams
+
+ +

There are no string array parameters.

+ + + +
Enumerator
strArrayDummy 
endOfStrArrayParams 
+ +

Definition at line 181 of file BlisParams.h.

+ +
+
+

Constructor & Destructor Documentation

+ +

◆ BlisParams()

+ +
+
+ + + + + +
+ + + + + + + +
BlisParams::BlisParams ()
+ 		+inline
+
+ +

The default constructor creates a parameter set with from the template argument structure.

+

The keyword list is created and the defaults are set.

+ +

Definition at line 193 of file BlisParams.h.

+ +
+
+

Member Function Documentation

+ +

◆ createKeywordList()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void BlisParams::createKeywordList ()
+ 		+virtual
+
+ +

Method for creating the list of keyword looked for in the parameter file.

+ +
+
+ +

◆ setDefaultEntries()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void BlisParams::setDefaultEntries ()
+ 		+virtual
+
+ +

Method for setting the default values for the parameters.

+ +
+
+ +

◆ entry() [1/5]

+ +
+
+ + + + + +
+ + + + + + + + +
bool BlisParams::entry (const chrParams key) const
+ 		+inline
+
+ +

Definition at line 237 of file BlisParams.h.

+ +
+
+ +

◆ entry() [2/5]

+ +
+
+ + + + + +
+ + + + + + + + +
int BlisParams::entry (const intParams key) const
+ 		+inline
+
+ +

Definition at line 239 of file BlisParams.h.

+ +
+
+ +

◆ entry() [3/5]

+ +
+
+ + + + + +
+ + + + + + + + +
double BlisParams::entry (const dblParams key) const
+ 		+inline
+
+ +

Definition at line 241 of file BlisParams.h.

+ +
+
+ +

◆ entry() [4/5]

+ +
+
+ + + + + +
+ + + + + + + + +
const std::string& BlisParams::entry (const strParams key) const
+ 		+inline
+
+ +

Definition at line 244 of file BlisParams.h.

+ +
+
+ +

◆ entry() [5/5]

+ +
+
+ + + + + +
+ + + + + + + + +
const std::vector<std::string>& BlisParams::entry (const strArrayParams key) const
+ 		+inline
+
+ +

Definition at line 247 of file BlisParams.h.

+ +
+
+ +

◆ setEntry() [1/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void BlisParams::setEntry (const chrParams key,
const char * val 
)
+ 		+inline
+
+ +

char* is true(1) or false(0), not used

+ +

Definition at line 252 of file BlisParams.h.

+ +
+
+ +

◆ setEntry() [2/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void BlisParams::setEntry (const chrParams key,
const char val 
)
+ 		+inline
+
+ +

char is true(1) or false(0), not used

+ +

Definition at line 255 of file BlisParams.h.

+ +
+
+ +

◆ setEntry() [3/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void BlisParams::setEntry (const chrParams key,
const bool val 
)
+ 		+inline
+
+ +

This method is the one that ever been used.

+ +

Definition at line 258 of file BlisParams.h.

+ +
+
+ +

◆ setEntry() [4/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void BlisParams::setEntry (const intParams key,
const char * val 
)
+ 		+inline
+
+ +

Definition at line 261 of file BlisParams.h.

+ +
+
+ +

◆ setEntry() [5/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void BlisParams::setEntry (const intParams key,
const int val 
)
+ 		+inline
+
+ +

Definition at line 264 of file BlisParams.h.

+ +
+
+ +

◆ setEntry() [6/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void BlisParams::setEntry (const dblParams key,
const char * val 
)
+ 		+inline
+
+ +

Definition at line 267 of file BlisParams.h.

+ +
+
+ +

◆ setEntry() [7/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void BlisParams::setEntry (const dblParams key,
const double val 
)
+ 		+inline
+
+ +

Definition at line 270 of file BlisParams.h.

+ +
+
+ +

◆ setEntry() [8/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void BlisParams::setEntry (const strParams key,
const char * val 
)
+ 		+inline
+
+ +

Definition at line 273 of file BlisParams.h.

+ +
+
+ +

◆ setEntry() [9/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void BlisParams::setEntry (const strArrayParams key,
const char * val 
)
+ 		+inline
+
+ +

Definition at line 276 of file BlisParams.h.

+ +
+
+ +

◆ pack()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisParams::pack (AlpsEncoded & buf)
+ 		+inline
+
+ +

Pack the parameter set into the buffer (AlpsEncoded is used as buffer Here).

+ +

Definition at line 285 of file BlisParams.h.

+ +
+
+ +

◆ unpack()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisParams::unpack (AlpsEncoded & buf)
+ 		+inline
+
+ +

Unpack the parameter set from the buffer.

+ +

Definition at line 298 of file BlisParams.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisParams__coll__graph.map b/Doxygen/0.94/classBlisParams__coll__graph.map new file mode 100644 index 0000000..0f93f6e --- /dev/null +++ b/Doxygen/0.94/classBlisParams__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisParams__coll__graph.md5 b/Doxygen/0.94/classBlisParams__coll__graph.md5 new file mode 100644 index 0000000..ce1d760 --- /dev/null +++ b/Doxygen/0.94/classBlisParams__coll__graph.md5 @@ -0,0 +1 @@ +cd90ba3fbcb738591b9fdfce50dc18f8 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisParams__coll__graph.png b/Doxygen/0.94/classBlisParams__coll__graph.png new file mode 100644 index 0000000..bd22925 Binary files /dev/null and b/Doxygen/0.94/classBlisParams__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisParams__inherit__graph.map b/Doxygen/0.94/classBlisParams__inherit__graph.map new file mode 100644 index 0000000..0f93f6e --- /dev/null +++ b/Doxygen/0.94/classBlisParams__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisParams__inherit__graph.md5 b/Doxygen/0.94/classBlisParams__inherit__graph.md5 new file mode 100644 index 0000000..ce1d760 --- /dev/null +++ b/Doxygen/0.94/classBlisParams__inherit__graph.md5 @@ -0,0 +1 @@ +cd90ba3fbcb738591b9fdfce50dc18f8 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisParams__inherit__graph.png b/Doxygen/0.94/classBlisParams__inherit__graph.png new file mode 100644 index 0000000..bd22925 Binary files /dev/null and b/Doxygen/0.94/classBlisParams__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisPresolve-members.html b/Doxygen/0.94/classBlisPresolve-members.html new file mode 100644 index 0000000..723c77b --- /dev/null +++ b/Doxygen/0.94/classBlisPresolve-members.html @@ -0,0 +1,86 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisPresolve Member List
+
+
+ +

This is the complete list of members for BlisPresolve, including all inherited members.

+ + + + + + + +
BlisPresolve()BlisPresolveinline
postMatrix_BlisPresolveprivate
postprocess(bool updateStatus=true)BlisPresolvevirtual
preMatrix_BlisPresolveprivate
preprocess(OsiSolverInterface &origModel, double feasibilityTolerance=0.0, bool keepIntegers=true, int numberPasses=5, const char *prohibited=NULL)BlisPresolvevirtual
~BlisPresolve()BlisPresolveinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisPresolve.html b/Doxygen/0.94/classBlisPresolve.html new file mode 100644 index 0000000..6da6f0d --- /dev/null +++ b/Doxygen/0.94/classBlisPresolve.html @@ -0,0 +1,331 @@ + + + + + + + +Blis: BlisPresolve Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Private Attributes | +List of all members
+
+
BlisPresolve Class Reference
+
+
+ +

A interface to Osi/Coin Presolve. + More...

+ +

#include <BlisPresolve.h>

+
+ + Inheritance diagram for BlisPresolve:
+
+
+ +
+ + Collaboration diagram for BlisPresolve:
+
+
+ + + + + + + + + + + + + + + +

+Public Member Functions

 BlisPresolve ()
 Default constructor (empty object) More...
 
virtual ~BlisPresolve ()
 Virtual destructor. More...
 
virtual OsiSolverInterface * preprocess (OsiSolverInterface &origModel, double feasibilityTolerance=0.0, bool keepIntegers=true, int numberPasses=5, const char *prohibited=NULL)
 Presolve. More...
 
virtual void postprocess (bool updateStatus=true)
 Postsolve. More...
 
+ + + + + +

+Private Attributes

CoinPresolveMatrix * preMatrix_
 
CoinPostsolveMatrix * postMatrix_
 
+

Detailed Description

+

A interface to Osi/Coin Presolve.

+ +

Definition at line 37 of file BlisPresolve.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisPresolve()

+ +
+
+ + + + + +
+ + + + + + + +
BlisPresolve::BlisPresolve ()
+ 		+inline
+
+ +

Default constructor (empty object)

+ +

Definition at line 47 of file BlisPresolve.h.

+ +
+
+ +

◆ ~BlisPresolve()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisPresolve::~BlisPresolve ()
+ 		+inlinevirtual
+
+ +

Virtual destructor.

+ +

Definition at line 52 of file BlisPresolve.h.

+ +
+
+

Member Function Documentation

+ +

◆ preprocess()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
virtual OsiSolverInterface* BlisPresolve::preprocess (OsiSolverInterface & origModel,
double feasibilityTolerance = 0.0,
bool keepIntegers = true,
int numberPasses = 5,
const char * prohibited = NULL 
)
+ 		+virtual
+
+ +

Presolve.

+ +
+
+ +

◆ postprocess()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisPresolve::postprocess (bool updateStatus = true)
+ 		+virtual
+
+ +

Postsolve.

+ +
+
+

Member Data Documentation

+ +

◆ preMatrix_

+ +
+
+ + + + + +
+ + + + +
CoinPresolveMatrix* BlisPresolve::preMatrix_
+ 		+private
+
+ +

Definition at line 41 of file BlisPresolve.h.

+ +
+
+ +

◆ postMatrix_

+ +
+
+ + + + + +
+ + + + +
CoinPostsolveMatrix* BlisPresolve::postMatrix_
+ 		+private
+
+ +

Definition at line 42 of file BlisPresolve.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisPresolve__coll__graph.map b/Doxygen/0.94/classBlisPresolve__coll__graph.map new file mode 100644 index 0000000..8fc58ec --- /dev/null +++ b/Doxygen/0.94/classBlisPresolve__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisPresolve__coll__graph.md5 b/Doxygen/0.94/classBlisPresolve__coll__graph.md5 new file mode 100644 index 0000000..854340d --- /dev/null +++ b/Doxygen/0.94/classBlisPresolve__coll__graph.md5 @@ -0,0 +1 @@ +d8d38f3d0b042f7bb5a08b356d937c76 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisPresolve__coll__graph.png b/Doxygen/0.94/classBlisPresolve__coll__graph.png new file mode 100644 index 0000000..ca39d3b Binary files /dev/null and b/Doxygen/0.94/classBlisPresolve__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisPresolve__inherit__graph.map b/Doxygen/0.94/classBlisPresolve__inherit__graph.map new file mode 100644 index 0000000..8fc58ec --- /dev/null +++ b/Doxygen/0.94/classBlisPresolve__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisPresolve__inherit__graph.md5 b/Doxygen/0.94/classBlisPresolve__inherit__graph.md5 new file mode 100644 index 0000000..854340d --- /dev/null +++ b/Doxygen/0.94/classBlisPresolve__inherit__graph.md5 @@ -0,0 +1 @@ +d8d38f3d0b042f7bb5a08b356d937c76 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisPresolve__inherit__graph.png b/Doxygen/0.94/classBlisPresolve__inherit__graph.png new file mode 100644 index 0000000..ca39d3b Binary files /dev/null and b/Doxygen/0.94/classBlisPresolve__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisPseudocost-members.html b/Doxygen/0.94/classBlisPseudocost-members.html new file mode 100644 index 0000000..be80484 --- /dev/null +++ b/Doxygen/0.94/classBlisPseudocost-members.html @@ -0,0 +1,104 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisPseudocost Member List
+
+
+ +

This is the complete list of members for BlisPseudocost, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + +
BlisPseudocost()BlisPseudocostinline
BlisPseudocost(double uc, int un, double dc, int dn, double s)BlisPseudocostinline
BlisPseudocost(const BlisPseudocost &cost)BlisPseudocostinline
decode(AlpsEncoded &) constBlisPseudocostvirtual
decodeFrom(AlpsEncoded &encoded)BlisPseudocost
downCost_BlisPseudocostprivate
downCount_BlisPseudocostprivate
encode() constBlisPseudocostvirtual
encodeTo(AlpsEncoded *encoded) constBlisPseudocost
getDownCost()BlisPseudocostinline
getDownCount()BlisPseudocostinline
getScore()BlisPseudocostinline
getUpCost()BlisPseudocostinline
getUpCount()BlisPseudocostinline
operator=(const BlisPseudocost &cost)BlisPseudocostinline
score_BlisPseudocostprivate
setScore(double s)BlisPseudocostinline
setWeight(double w)BlisPseudocostinline
upCost_BlisPseudocostprivate
upCount_BlisPseudocostprivate
update(const int dir, const double parentObjValue, const double objValue, const double solValue)BlisPseudocost
update(const int dir, const double objDiff, const double solValue)BlisPseudocost
update(double upCost, int upCount, double downCost, int downCount)BlisPseudocost
weight_BlisPseudocostprivate
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisPseudocost.html b/Doxygen/0.94/classBlisPseudocost.html new file mode 100644 index 0000000..cd5b45f --- /dev/null +++ b/Doxygen/0.94/classBlisPseudocost.html @@ -0,0 +1,917 @@ + + + + + + + +Blis: BlisPseudocost Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Private Attributes | +List of all members
+
+
BlisPseudocost Class Reference
+
+
+ +

#include <BlisPseudo.h>

+
+ + Inheritance diagram for BlisPseudocost:
+
+
+ +
+ + Collaboration diagram for BlisPseudocost:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisPseudocost ()
 Default constructor. More...
 
 BlisPseudocost (double uc, int un, double dc, int dn, double s)
 Useful constructor. More...
 
 BlisPseudocost (const BlisPseudocost &cost)
 Copy constructor. More...
 
BlisPseudocost & operator= (const BlisPseudocost &cost)
 Overload operator =. More...
 
void setWeight (double w)
 Set weigth. More...
 
void update (const int dir, const double parentObjValue, const double objValue, const double solValue)
 Update pseudocost. More...
 
void update (const int dir, const double objDiff, const double solValue)
 Update pseudocost. More...
 
void update (double upCost, int upCount, double downCost, int downCount)
 Update pseudocost. More...
 
int getUpCount ()
 Get up branching count. More...
 
double getUpCost ()
 Get up branching cost. More...
 
int getDownCount ()
 Get down branching count. More...
 
double getDownCost ()
 Get down branching cost. More...
 
double getScore ()
 Get importance. More...
 
void setScore (double s)
 Set importance. More...
 
AlpsReturnStatus encodeTo (AlpsEncoded *encoded) const
 Pack pseudocost to the given object. More...
 
AlpsReturnStatus decodeFrom (AlpsEncoded &encoded)
 Unpack pseudocost from the given encode object. More...
 
virtual AlpsEncoded * encode () const
 Encode this node for message passing. More...
 
virtual AlpsKnowledge * decode (AlpsEncoded &) const
 Decode a node from an encoded object. More...
 
+ + + + + + + + + + + + + + + + + + + +

+Private Attributes

double weight_
 Use to calculate score. More...
 
double upCost_
 Average object change when branching up. More...
 
int upCount_
 How many times being branched up. More...
 
double downCost_
 Average object change when branching down. More...
 
int downCount_
 How many times being branched down. More...
 
double score_
 The estimated importance. More...
 
+

Detailed Description

+
+

Definition at line 32 of file BlisPseudo.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisPseudocost() [1/3]

+ +
+
+ + + + + +
+ + + + + + + +
BlisPseudocost::BlisPseudocost ()
+ 		+inline
+
+ +

Default constructor.

+ +

Definition at line 58 of file BlisPseudo.h.

+ +
+
+ +

◆ BlisPseudocost() [2/3]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisPseudocost::BlisPseudocost (double uc,
int un,
double dc,
int dn,
double s 
)
+ 		+inline
+
+ +

Useful constructor.

+ +

Definition at line 68 of file BlisPseudo.h.

+ +
+
+ +

◆ BlisPseudocost() [3/3]

+ +
+
+ + + + + +
+ + + + + + + + +
BlisPseudocost::BlisPseudocost (const BlisPseudocost & cost)
+ 		+inline
+
+ +

Copy constructor.

+ +

Definition at line 83 of file BlisPseudo.h.

+ +
+
+

Member Function Documentation

+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + + +
BlisPseudocost& BlisPseudocost::operator= (const BlisPseudocost & cost)
+ 		+inline
+
+ +

Overload operator =.

+ +

Definition at line 93 of file BlisPseudo.h.

+ +
+
+ +

◆ setWeight()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisPseudocost::setWeight (double w)
+ 		+inline
+
+ +

Set weigth.

+ +

Definition at line 104 of file BlisPseudo.h.

+ +
+
+ +

◆ update() [1/3]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void BlisPseudocost::update (const int dir,
const double parentObjValue,
const double objValue,
const double solValue 
)
+
+ +

Update pseudocost.

+ +
+
+ +

◆ update() [2/3]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void BlisPseudocost::update (const int dir,
const double objDiff,
const double solValue 
)
+
+ +

Update pseudocost.

+ +
+
+ +

◆ update() [3/3]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void BlisPseudocost::update (double upCost,
int upCount,
double downCost,
int downCount 
)
+
+ +

Update pseudocost.

+ +
+
+ +

◆ getUpCount()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisPseudocost::getUpCount ()
+ 		+inline
+
+ +

Get up branching count.

+ +

Definition at line 130 of file BlisPseudo.h.

+ +
+
+ +

◆ getUpCost()

+ +
+
+ + + + + +
+ + + + + + + +
double BlisPseudocost::getUpCost ()
+ 		+inline
+
+ +

Get up branching cost.

+ +

Definition at line 133 of file BlisPseudo.h.

+ +
+
+ +

◆ getDownCount()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisPseudocost::getDownCount ()
+ 		+inline
+
+ +

Get down branching count.

+ +

Definition at line 136 of file BlisPseudo.h.

+ +
+
+ +

◆ getDownCost()

+ +
+
+ + + + + +
+ + + + + + + +
double BlisPseudocost::getDownCost ()
+ 		+inline
+
+ +

Get down branching cost.

+ +

Definition at line 139 of file BlisPseudo.h.

+ +
+
+ +

◆ getScore()

+ +
+
+ + + + + +
+ + + + + + + +
double BlisPseudocost::getScore ()
+ 		+inline
+
+ +

Get importance.

+ +

Definition at line 142 of file BlisPseudo.h.

+ +
+
+ +

◆ setScore()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisPseudocost::setScore (double s)
+ 		+inline
+
+ +

Set importance.

+ +

Definition at line 145 of file BlisPseudo.h.

+ +
+
+ +

◆ encodeTo()

+ +
+
+ + + + + + + + +
AlpsReturnStatus BlisPseudocost::encodeTo (AlpsEncoded * encoded) const
+
+ +

Pack pseudocost to the given object.

+ +
+
+ +

◆ decodeFrom()

+ +
+
+ + + + + + + + +
AlpsReturnStatus BlisPseudocost::decodeFrom (AlpsEncoded & encoded)
+
+ +

Unpack pseudocost from the given encode object.

+ +
+
+ +

◆ encode()

+ +
+
+ + + + + +
+ + + + + + + +
virtual AlpsEncoded* BlisPseudocost::encode () const
+ 		+virtual
+
+ +

Encode this node for message passing.

+ +
+
+ +

◆ decode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsKnowledge* BlisPseudocost::decode (AlpsEncoded & ) const
+ 		+virtual
+
+ +

Decode a node from an encoded object.

+ +
+
+

Member Data Documentation

+ +

◆ weight_

+ +
+
+ + + + + +
+ + + + +
double BlisPseudocost::weight_
+ 		+private
+
+ +

Use to calculate score.

+ +

Definition at line 36 of file BlisPseudo.h.

+ +
+
+ +

◆ upCost_

+ +
+
+ + + + + +
+ + + + +
double BlisPseudocost::upCost_
+ 		+private
+
+ +

Average object change when branching up.

+ +

Definition at line 39 of file BlisPseudo.h.

+ +
+
+ +

◆ upCount_

+ +
+
+ + + + + +
+ + + + +
int BlisPseudocost::upCount_
+ 		+private
+
+ +

How many times being branched up.

+ +

Definition at line 42 of file BlisPseudo.h.

+ +
+
+ +

◆ downCost_

+ +
+
+ + + + + +
+ + + + +
double BlisPseudocost::downCost_
+ 		+private
+
+ +

Average object change when branching down.

+ +

Definition at line 45 of file BlisPseudo.h.

+ +
+
+ +

◆ downCount_

+ +
+
+ + + + + +
+ + + + +
int BlisPseudocost::downCount_
+ 		+private
+
+ +

How many times being branched down.

+ +

Definition at line 48 of file BlisPseudo.h.

+ +
+
+ +

◆ score_

+ +
+
+ + + + + +
+ + + + +
double BlisPseudocost::score_
+ 		+private
+
+ +

The estimated importance.

+

Score = weight * MIN(downCost_, upCost_) + (1.0 - weight) * MAX(downCost_, upCost_)

+ +

Definition at line 54 of file BlisPseudo.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisPseudocost__coll__graph.map b/Doxygen/0.94/classBlisPseudocost__coll__graph.map new file mode 100644 index 0000000..fffa8b9 --- /dev/null +++ b/Doxygen/0.94/classBlisPseudocost__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisPseudocost__coll__graph.md5 b/Doxygen/0.94/classBlisPseudocost__coll__graph.md5 new file mode 100644 index 0000000..54f7220 --- /dev/null +++ b/Doxygen/0.94/classBlisPseudocost__coll__graph.md5 @@ -0,0 +1 @@ +ac65c5caf7924059f8c088430abf9457 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisPseudocost__coll__graph.png b/Doxygen/0.94/classBlisPseudocost__coll__graph.png new file mode 100644 index 0000000..23aea14 Binary files /dev/null and b/Doxygen/0.94/classBlisPseudocost__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisPseudocost__inherit__graph.map b/Doxygen/0.94/classBlisPseudocost__inherit__graph.map new file mode 100644 index 0000000..fffa8b9 --- /dev/null +++ b/Doxygen/0.94/classBlisPseudocost__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisPseudocost__inherit__graph.md5 b/Doxygen/0.94/classBlisPseudocost__inherit__graph.md5 new file mode 100644 index 0000000..54f7220 --- /dev/null +++ b/Doxygen/0.94/classBlisPseudocost__inherit__graph.md5 @@ -0,0 +1 @@ +ac65c5caf7924059f8c088430abf9457 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisPseudocost__inherit__graph.png b/Doxygen/0.94/classBlisPseudocost__inherit__graph.png new file mode 100644 index 0000000..23aea14 Binary files /dev/null and b/Doxygen/0.94/classBlisPseudocost__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisSolution-members.html b/Doxygen/0.94/classBlisSolution-members.html new file mode 100644 index 0000000..03b02df --- /dev/null +++ b/Doxygen/0.94/classBlisSolution-members.html @@ -0,0 +1,86 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisSolution Member List
+
+
+ +

This is the complete list of members for BlisSolution, including all inherited members.

+ + + + + + + +
BlisSolution()BlisSolutioninline
BlisSolution(int s, const double *values, double objValue)BlisSolutioninline
decode(AlpsEncoded &encoded) constBlisSolutioninlinevirtual
encode() constBlisSolutioninlinevirtual
print(std::ostream &os) constBlisSolutioninlinevirtual
~BlisSolution()BlisSolutioninlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisSolution.html b/Doxygen/0.94/classBlisSolution.html new file mode 100644 index 0000000..afcb3ad --- /dev/null +++ b/Doxygen/0.94/classBlisSolution.html @@ -0,0 +1,340 @@ + + + + + + + +Blis: BlisSolution Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +List of all members
+
+
BlisSolution Class Reference
+
+
+ +

This class contains the solutions generated by the LP solver (either primal or dual. + More...

+ +

#include <BlisSolution.h>

+
+ + Inheritance diagram for BlisSolution:
+
+
+ +
+ + Collaboration diagram for BlisSolution:
+
+
+ + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisSolution ()
 Default constructor. More...
 
 BlisSolution (int s, const double *values, double objValue)
 Useful constructor. More...
 
virtual ~BlisSolution ()
 Destructor. More...
 
virtual void print (std::ostream &os) const
 Print out the solution. More...
 
virtual AlpsEncoded * encode () const
 The method that encodes the solution into a encoded object. More...
 
virtual AlpsKnowledge * decode (AlpsEncoded &encoded) const
 The method that decodes the solution from a encoded object. More...
 
+

Detailed Description

+

This class contains the solutions generated by the LP solver (either primal or dual.

+

The class exists primarily to pass solutions to the object generator(s).

+ +

Definition at line 36 of file BlisSolution.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisSolution() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
BlisSolution::BlisSolution ()
+ 		+inline
+
+ +

Default constructor.

+ +

Definition at line 43 of file BlisSolution.h.

+ +
+
+ +

◆ BlisSolution() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
BlisSolution::BlisSolution (int s,
const double * values,
double objValue 
)
+ 		+inline
+
+ +

Useful constructor.

+ +

Definition at line 49 of file BlisSolution.h.

+ +
+
+ +

◆ ~BlisSolution()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisSolution::~BlisSolution ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 55 of file BlisSolution.h.

+ +
+
+

Member Function Documentation

+ +

◆ print()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void BlisSolution::print (std::ostream & os) const
+ 		+inlinevirtual
+
+ +

Print out the solution.

+

Print the solution.

+ +

Reimplemented in VrpSolution.

+ +

Definition at line 59 of file BlisSolution.h.

+ +
+
+ +

◆ encode()

+ +
+
+ + + + + +
+ + + + + + + +
virtual AlpsEncoded* BlisSolution::encode () const
+ 		+inlinevirtual
+
+ +

The method that encodes the solution into a encoded object.

+ +

Reimplemented in VrpSolution.

+ +

Definition at line 80 of file BlisSolution.h.

+ +
+
+ +

◆ decode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsKnowledge* BlisSolution::decode (AlpsEncoded & encoded) const
+ 		+inlinevirtual
+
+ +

The method that decodes the solution from a encoded object.

+ +

Reimplemented in VrpSolution.

+ +

Definition at line 88 of file BlisSolution.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisSolution__coll__graph.map b/Doxygen/0.94/classBlisSolution__coll__graph.map new file mode 100644 index 0000000..c323d7d --- /dev/null +++ b/Doxygen/0.94/classBlisSolution__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisSolution__coll__graph.md5 b/Doxygen/0.94/classBlisSolution__coll__graph.md5 new file mode 100644 index 0000000..c6b06ab --- /dev/null +++ b/Doxygen/0.94/classBlisSolution__coll__graph.md5 @@ -0,0 +1 @@ +6f80dea51551ca0a6577b5562d4c67e5 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisSolution__coll__graph.png b/Doxygen/0.94/classBlisSolution__coll__graph.png new file mode 100644 index 0000000..98a8e5a Binary files /dev/null and b/Doxygen/0.94/classBlisSolution__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisSolution__inherit__graph.map b/Doxygen/0.94/classBlisSolution__inherit__graph.map new file mode 100644 index 0000000..110ded1 --- /dev/null +++ b/Doxygen/0.94/classBlisSolution__inherit__graph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/classBlisSolution__inherit__graph.md5 b/Doxygen/0.94/classBlisSolution__inherit__graph.md5 new file mode 100644 index 0000000..0c89432 --- /dev/null +++ b/Doxygen/0.94/classBlisSolution__inherit__graph.md5 @@ -0,0 +1 @@ +d0523622c3608921048b8c29808884a2 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisSolution__inherit__graph.png b/Doxygen/0.94/classBlisSolution__inherit__graph.png new file mode 100644 index 0000000..9995fe5 Binary files /dev/null and b/Doxygen/0.94/classBlisSolution__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisTreeNode-members.html b/Doxygen/0.94/classBlisTreeNode-members.html new file mode 100644 index 0000000..1e961ef --- /dev/null +++ b/Doxygen/0.94/classBlisTreeNode-members.html @@ -0,0 +1,108 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisTreeNode Member List
+
+
+ +

This is the complete list of members for BlisTreeNode, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
applyConstraints(BlisModel *model, const double *solution, BcpsConstraintPool &conPool)BlisTreeNode
BlisTreeNode(const BlisTreeNode &)BlisTreeNodeprivate
BlisTreeNode()BlisTreeNodeinline
BlisTreeNode(BlisModel *m)BlisTreeNodeinline
BlisTreeNode(AlpsNodeDesc *&desc)BlisTreeNodeinline
bound(BcpsModel *model)BlisTreeNodevirtual
branch(AlpsTreeNode &explicitNode)BlisTreeNodeprivate
branch()BlisTreeNodevirtual
callHeuristics(BlisModel *model, bool onlyBeforeRoot=false)BlisTreeNode
chooseBranchingObject(BcpsModel *)BlisTreeNodeinlinevirtual
convertToExplicit()BlisTreeNodevirtual
convertToRelative()BlisTreeNodevirtual
createNewTreeNode(AlpsNodeDesc *&desc) constBlisTreeNode
decode(AlpsEncoded &) constBlisTreeNodevirtual
encode() constBlisTreeNodevirtual
estimateSolution(BlisModel *model, const double *lpSolution, double lpObjValue) constBlisTreeNodeprivate
fathom()BlisTreeNodeprivatevirtual
generateConstraints(BlisModel *model, BcpsConstraintPool &conPool)BlisTreeNode
getViolatedConstraints(BlisModel *model, const double *currLpSolution, BcpsConstraintPool &conPool)BlisTreeNode
init()BlisTreeNodeinline
installSubProblem(BcpsModel *mode)BlisTreeNodevirtual
operator=(const BlisTreeNode &)BlisTreeNodeprivate
parallel(BlisModel *model, BcpsConstraintPool &conPool, int lastNew, BlisConstraint *aCon)BlisTreeNodeprivate
process()BlisTreeNodeprivatevirtual
process(bool isRoot=false, bool rampUp=false)BlisTreeNodevirtual
reducedCostFix(BlisModel *model)BlisTreeNode
selectBranchObject(BlisModel *model, bool &foundSol, int numPassesLeft)BlisTreeNode
~BlisTreeNode()BlisTreeNodeinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisTreeNode.html b/Doxygen/0.94/classBlisTreeNode.html new file mode 100644 index 0000000..6b53d67 --- /dev/null +++ b/Doxygen/0.94/classBlisTreeNode.html @@ -0,0 +1,1053 @@ + + + + + + + +Blis: BlisTreeNode Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Private Member Functions | +List of all members
+
+
BlisTreeNode Class Reference
+
+
+ +

This is the class in which we are finally able to concretely define the bounding procedure. + More...

+ +

#include <BlisSubTree.h>

+
+ + Inheritance diagram for BlisTreeNode:
+
+
+ +
+ + Collaboration diagram for BlisTreeNode:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisTreeNode ()
 Default constructor. More...
 
 BlisTreeNode (BlisModel *m)
 Useful constructor. More...
 
 BlisTreeNode (AlpsNodeDesc *&desc)
 Useful constructor. More...
 
virtual ~BlisTreeNode ()
 Destructor. More...
 
void init ()
 Initilize member data when constructing a node. More...
 
AlpsTreeNode * createNewTreeNode (AlpsNodeDesc *&desc) const
 Create a new node based on given desc. More...
 
virtual int installSubProblem (BcpsModel *mode)
 intall subproblem More...
 
virtual int process (bool isRoot=false, bool rampUp=false)
 Performing the bounding operation. More...
 
virtual int bound (BcpsModel *model)
 Bounding procedure. More...
 
virtual std::vector< CoinTriple< AlpsNodeDesc *, AlpsNodeStatus, double > > branch ()
 Takes the explicit description of the current active node and creates the children's descriptions, which contain information about how the branching is to be done. More...
 
int selectBranchObject (BlisModel *model, bool &foundSol, int numPassesLeft)
 Select a branching object based on give branching strategy. More...
 
virtual int chooseBranchingObject (BcpsModel *)
 To be defined. More...
 
int generateConstraints (BlisModel *model, BcpsConstraintPool &conPool)
 Generate constraints. More...
 
int callHeuristics (BlisModel *model, bool onlyBeforeRoot=false)
 Call heuristic to search solutions. More...
 
void getViolatedConstraints (BlisModel *model, const double *currLpSolution, BcpsConstraintPool &conPool)
 Get violated constraints. More...
 
BlisReturnStatus applyConstraints (BlisModel *model, const double *solution, BcpsConstraintPool &conPool)
 Select and apply constraints. More...
 
BlisReturnStatus reducedCostFix (BlisModel *model)
 Fix and tighten varaibles based optimality conditions. More...
 
virtual AlpsEncoded * encode () const
 Encode this node for message passing. More...
 
virtual AlpsKnowledge * decode (AlpsEncoded &) const
 Decode a node from an encoded object. More...
 
virtual void convertToExplicit ()
 Convert explicit description to difference, and vise-vesa. More...
 
virtual void convertToRelative ()
 
+ + + + + + + + + + + + + + + + + + + + +

+Private Member Functions

virtual void process ()
 
void branch (AlpsTreeNode &explicitNode)
 Takes the explicit description of the current active node and creates the children, adds them to the priority queue, etc. More...
 
virtual bool fathom ()
 Takes the explicit description of the current active node and decides whether or not it should be fathomed. More...
 
 BlisTreeNode (const BlisTreeNode &)
 No copy constructor, assignment operator. More...
 
BlisTreeNode & operator= (const BlisTreeNode &)
 
bool parallel (BlisModel *model, BcpsConstraintPool &conPool, int lastNew, BlisConstraint *aCon)
 Constraint pool. More...
 
double estimateSolution (BlisModel *model, const double *lpSolution, double lpObjValue) const
 Estimate quality of a feasible solution. More...
 
+

Detailed Description

+

This is the class in which we are finally able to concretely define the bounding procedure.

+

Here we can assume that we have an LP solver and that the objects are cuts and variables, etc.

+ +

Definition at line 33 of file BlisSubTree.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisTreeNode() [1/4]

+ +
+
+ + + + + +
+ + + + + + + + +
BlisTreeNode::BlisTreeNode (const BlisTreeNode & )
+ 		+private
+
+ +

No copy constructor, assignment operator.

+ +
+
+ +

◆ BlisTreeNode() [2/4]

+ +
+
+ + + + + +
+ + + + + + + +
BlisTreeNode::BlisTreeNode ()
+ 		+inline
+
+ +

Default constructor.

+ +

Definition at line 79 of file BlisTreeNode.h.

+ +
+
+ +

◆ BlisTreeNode() [3/4]

+ +
+
+ + + + + +
+ + + + + + + + +
BlisTreeNode::BlisTreeNode (BlisModel * m)
+ 		+inline
+
+ +

Useful constructor.

+ +

Definition at line 85 of file BlisTreeNode.h.

+ +
+
+ +

◆ BlisTreeNode() [4/4]

+ +
+
+ + + + + +
+ + + + + + + + +
BlisTreeNode::BlisTreeNode (AlpsNodeDesc *& desc)
+ 		+inline
+
+ +

Useful constructor.

+ +

Definition at line 91 of file BlisTreeNode.h.

+ +
+
+ +

◆ ~BlisTreeNode()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisTreeNode::~BlisTreeNode ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 98 of file BlisTreeNode.h.

+ +
+
+

Member Function Documentation

+ +

◆ process() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
virtual void BlisTreeNode::process ()
+ 		+privatevirtual
+
+ +
+
+ +

◆ branch() [1/2]

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisTreeNode::branch (AlpsTreeNode & explicitNode)
+ 		+private
+
+ +

Takes the explicit description of the current active node and creates the children, adds them to the priority queue, etc.

+

Most likely, the node description will contain information about how the branching is to be done.

+ +
+
+ +

◆ fathom()

+ +
+
+ + + + + +
+ + + + + + + +
virtual bool BlisTreeNode::fathom ()
+ 		+privatevirtual
+
+ +

Takes the explicit description of the current active node and decides whether or not it should be fathomed.

+ +
+
+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + + +
BlisTreeNode& BlisTreeNode::operator= (const BlisTreeNode & )
+ 		+private
+
+ +
+
+ +

◆ parallel()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool BlisTreeNode::parallel (BlisModel * model,
BcpsConstraintPool & conPool,
int lastNew,
BlisConstraint * aCon 
)
+ 		+private
+
+ +

Constraint pool.

+

Variable pool. Save an explicit node description. Check and remove parallel constraints.

+ +
+
+ +

◆ estimateSolution()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
double BlisTreeNode::estimateSolution (BlisModel * model,
const double * lpSolution,
double lpObjValue 
) const
+ 		+private
+
+ +

Estimate quality of a feasible solution.

+ +
+
+ +

◆ init()

+ +
+
+ + + + + +
+ + + + + + + +
void BlisTreeNode::init ()
+ 		+inline
+
+ +

Initilize member data when constructing a node.

+ +

Definition at line 103 of file BlisTreeNode.h.

+ +
+
+ +

◆ createNewTreeNode()

+ +
+
+ + + + + + + + +
AlpsTreeNode* BlisTreeNode::createNewTreeNode (AlpsNodeDesc *& desc) const
+
+ +

Create a new node based on given desc.

+ +
+
+ +

◆ convertToExplicit()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void BlisTreeNode::convertToExplicit ()
+ 		+virtual
+
+ +

Convert explicit description to difference, and vise-vesa.

+ +
+
+ +

◆ convertToRelative()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void BlisTreeNode::convertToRelative ()
+ 		+virtual
+
+ +
+
+ +

◆ installSubProblem()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual int BlisTreeNode::installSubProblem (BcpsModel * mode)
+ 		+virtual
+
+ +

intall subproblem

+ +
+
+ +

◆ process() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual int BlisTreeNode::process (bool isRoot = false,
bool rampUp = false 
)
+ 		+virtual
+
+ +

Performing the bounding operation.

+ +
+
+ +

◆ bound()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual int BlisTreeNode::bound (BcpsModel * model)
+ 		+virtual
+
+ +

Bounding procedure.

+ +
+
+ +

◆ branch() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
virtual std::vector< CoinTriple<AlpsNodeDesc*, AlpsNodeStatus, double> > BlisTreeNode::branch ()
+ 		+virtual
+
+ +

Takes the explicit description of the current active node and creates the children's descriptions, which contain information about how the branching is to be done.

+

The stati of the children are AlpsNodeStatusCandidate.

+ +
+
+ +

◆ selectBranchObject()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int BlisTreeNode::selectBranchObject (BlisModel * model,
bool & foundSol,
int numPassesLeft 
)
+
+ +

Select a branching object based on give branching strategy.

+ +
+
+ +

◆ chooseBranchingObject()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual int BlisTreeNode::chooseBranchingObject (BcpsModel * )
+ 		+inlinevirtual
+
+ +

To be defined.

+ +

Definition at line 139 of file BlisTreeNode.h.

+ +
+
+ +

◆ generateConstraints()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int BlisTreeNode::generateConstraints (BlisModel * model,
BcpsConstraintPool & conPool 
)
+
+ +

Generate constraints.

+ +
+
+ +

◆ callHeuristics()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int BlisTreeNode::callHeuristics (BlisModel * model,
bool onlyBeforeRoot = false 
)
+
+ +

Call heuristic to search solutions.

+

0: no solution; 1: found solutions; 2: fathom this node. onlyBeforeRoot is for heuristics like feasibility pump.

+ +
+
+ +

◆ getViolatedConstraints()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void BlisTreeNode::getViolatedConstraints (BlisModel * model,
const double * currLpSolution,
BcpsConstraintPool & conPool 
)
+
+ +

Get violated constraints.

+ +
+
+ +

◆ applyConstraints()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
BlisReturnStatus BlisTreeNode::applyConstraints (BlisModel * model,
const double * solution,
BcpsConstraintPool & conPool 
)
+
+ +

Select and apply constraints.

+ +
+
+ +

◆ reducedCostFix()

+ +
+
+ + + + + + + + +
BlisReturnStatus BlisTreeNode::reducedCostFix (BlisModel * model)
+
+ +

Fix and tighten varaibles based optimality conditions.

+ +
+
+ +

◆ encode()

+ +
+
+ + + + + +
+ + + + + + + +
virtual AlpsEncoded* BlisTreeNode::encode () const
+ 		+virtual
+
+ +

Encode this node for message passing.

+ +
+
+ +

◆ decode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsKnowledge* BlisTreeNode::decode (AlpsEncoded & ) const
+ 		+virtual
+
+ +

Decode a node from an encoded object.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisTreeNode__coll__graph.map b/Doxygen/0.94/classBlisTreeNode__coll__graph.map new file mode 100644 index 0000000..a5d716e --- /dev/null +++ b/Doxygen/0.94/classBlisTreeNode__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisTreeNode__coll__graph.md5 b/Doxygen/0.94/classBlisTreeNode__coll__graph.md5 new file mode 100644 index 0000000..517f1ab --- /dev/null +++ b/Doxygen/0.94/classBlisTreeNode__coll__graph.md5 @@ -0,0 +1 @@ +76454cffeaa13c8ab14cbd8f70372f28 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisTreeNode__coll__graph.png b/Doxygen/0.94/classBlisTreeNode__coll__graph.png new file mode 100644 index 0000000..9683d99 Binary files /dev/null and b/Doxygen/0.94/classBlisTreeNode__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisTreeNode__inherit__graph.map b/Doxygen/0.94/classBlisTreeNode__inherit__graph.map new file mode 100644 index 0000000..a5d716e --- /dev/null +++ b/Doxygen/0.94/classBlisTreeNode__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisTreeNode__inherit__graph.md5 b/Doxygen/0.94/classBlisTreeNode__inherit__graph.md5 new file mode 100644 index 0000000..517f1ab --- /dev/null +++ b/Doxygen/0.94/classBlisTreeNode__inherit__graph.md5 @@ -0,0 +1 @@ +76454cffeaa13c8ab14cbd8f70372f28 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisTreeNode__inherit__graph.png b/Doxygen/0.94/classBlisTreeNode__inherit__graph.png new file mode 100644 index 0000000..9683d99 Binary files /dev/null and b/Doxygen/0.94/classBlisTreeNode__inherit__graph.png differ diff --git a/Doxygen/0.94/classBlisVariable-members.html b/Doxygen/0.94/classBlisVariable-members.html new file mode 100644 index 0000000..d36c468 --- /dev/null +++ b/Doxygen/0.94/classBlisVariable-members.html @@ -0,0 +1,99 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
BlisVariable Member List
+
+
+ +

This is the complete list of members for BlisVariable, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + +
BlisVariable()BlisVariableinline
BlisVariable(double obj, int s, const int *ind, const double *val)BlisVariableinline
BlisVariable(double lbh, double ubh, double lbs, double ubs)BlisVariableinline
BlisVariable(double lbh, double ubh, double lbs, double ubs, double obj, int s, const int *ind, const double *val)BlisVariableinline
decode(AlpsEncoded &encoded) constBlisVariableinlinevirtual
decodeBlis(AlpsEncoded &encoded)BlisVariableinlineprotected
encode(AlpsEncoded *encoded)BlisVariableinlinevirtual
encodeBlis(AlpsEncoded *encoded)BlisVariableinlineprotected
getIndices() constBlisVariableinline
getObjCoef()BlisVariableinline
getSize() constBlisVariableinline
getValues()BlisVariableinline
indices_BlisVariableprivate
objCoef_BlisVariableprivate
setData(int s, const int *ind, const double *val)BlisVariableinline
setObjCoef(double coef)BlisVariableinline
size_BlisVariableprivate
values_BlisVariableprivate
~BlisVariable()BlisVariableinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisVariable.html b/Doxygen/0.94/classBlisVariable.html new file mode 100644 index 0000000..bb66552 --- /dev/null +++ b/Doxygen/0.94/classBlisVariable.html @@ -0,0 +1,808 @@ + + + + + + + +Blis: BlisVariable Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Protected Member Functions | +Private Attributes | +List of all members
+
+
BlisVariable Class Reference
+
+
+ +

#include <BlisVariable.h>

+
+ + Inheritance diagram for BlisVariable:
+
+
+ +
+ + Collaboration diagram for BlisVariable:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 BlisVariable ()
 
 BlisVariable (double obj, int s, const int *ind, const double *val)
 
 BlisVariable (double lbh, double ubh, double lbs, double ubs)
 
 BlisVariable (double lbh, double ubh, double lbs, double ubs, double obj, int s, const int *ind, const double *val)
 
virtual ~BlisVariable ()
 
virtual AlpsReturnStatus encode (AlpsEncoded *encoded)
 Pack to a encode object. More...
 
virtual AlpsKnowledge * decode (AlpsEncoded &encoded) const
 Decode a variable from an encoded object. More...
 
double getObjCoef ()
 Return data
+ More...
 
int getSize () const
 
int * getIndices () const
 
double * getValues ()
 
void setData (int s, const int *ind, const double *val)
 Set data
+ More...
 
void setObjCoef (double coef)
 
+ + + + + + + +

+Protected Member Functions

AlpsReturnStatus encodeBlis (AlpsEncoded *encoded)
 Pack Blis part into an encoded object. More...
 
AlpsReturnStatus decodeBlis (AlpsEncoded &encoded)
 Unpack Blis part from a encode object. More...
 
+ + + + + + + + + +

+Private Attributes

double objCoef_
 
int size_
 
int * indices_
 
double * values_
 
+

Detailed Description

+
+

Definition at line 31 of file BlisVariable.h.

+

Constructor & Destructor Documentation

+ +

◆ BlisVariable() [1/4]

+ +
+
+ + + + + +
+ + + + + + + +
BlisVariable::BlisVariable ()
+ 		+inline
+
+ +

Definition at line 42 of file BlisVariable.h.

+ +
+
+ +

◆ BlisVariable() [2/4]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisVariable::BlisVariable (double obj,
int s,
const int * ind,
const double * val 
)
+ 		+inline
+
+ +

Definition at line 44 of file BlisVariable.h.

+ +
+
+ +

◆ BlisVariable() [3/4]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisVariable::BlisVariable (double lbh,
double ubh,
double lbs,
double ubs 
)
+ 		+inline
+
+ +

Definition at line 54 of file BlisVariable.h.

+ +
+
+ +

◆ BlisVariable() [4/4]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisVariable::BlisVariable (double lbh,
double ubh,
double lbs,
double ubs,
double obj,
int s,
const int * ind,
const double * val 
)
+ 		+inline
+
+ +

Definition at line 61 of file BlisVariable.h.

+ +
+
+ +

◆ ~BlisVariable()

+ +
+
+ + + + + +
+ + + + + + + +
virtual BlisVariable::~BlisVariable ()
+ 		+inlinevirtual
+
+ +

Definition at line 74 of file BlisVariable.h.

+ +
+
+

Member Function Documentation

+ +

◆ getObjCoef()

+ +
+
+ + + + + +
+ + + + + + + +
double BlisVariable::getObjCoef ()
+ 		+inline
+
+ +

Return data
+

+ +

Definition at line 81 of file BlisVariable.h.

+ +
+
+ +

◆ getSize()

+ +
+
+ + + + + +
+ + + + + + + +
int BlisVariable::getSize () const
+ 		+inline
+
+ +

Definition at line 82 of file BlisVariable.h.

+ +
+
+ +

◆ getIndices()

+ +
+
+ + + + + +
+ + + + + + + +
int* BlisVariable::getIndices () const
+ 		+inline
+
+ +

Definition at line 83 of file BlisVariable.h.

+ +
+
+ +

◆ getValues()

+ +
+
+ + + + + +
+ + + + + + + +
double* BlisVariable::getValues ()
+ 		+inline
+
+ +

Definition at line 84 of file BlisVariable.h.

+ +
+
+ +

◆ setData()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void BlisVariable::setData (int s,
const int * ind,
const double * val 
)
+ 		+inline
+
+ +

Set data
+

+ +

Definition at line 89 of file BlisVariable.h.

+ +
+
+ +

◆ setObjCoef()

+ +
+
+ + + + + +
+ + + + + + + + +
void BlisVariable::setObjCoef (double coef)
+ 		+inline
+
+ +

Definition at line 100 of file BlisVariable.h.

+ +
+
+ +

◆ encodeBlis()

+ +
+
+ + + + + +
+ + + + + + + + +
AlpsReturnStatus BlisVariable::encodeBlis (AlpsEncoded * encoded)
+ 		+inlineprotected
+
+ +

Pack Blis part into an encoded object.

+ +

Definition at line 106 of file BlisVariable.h.

+ +
+
+ +

◆ decodeBlis()

+ +
+
+ + + + + +
+ + + + + + + + +
AlpsReturnStatus BlisVariable::decodeBlis (AlpsEncoded & encoded)
+ 		+inlineprotected
+
+ +

Unpack Blis part from a encode object.

+ +

Definition at line 119 of file BlisVariable.h.

+ +
+
+ +

◆ encode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsReturnStatus BlisVariable::encode (AlpsEncoded * encoded)
+ 		+inlinevirtual
+
+ +

Pack to a encode object.

+ +

Reimplemented in VrpVariable.

+ +

Definition at line 135 of file BlisVariable.h.

+ +
+
+ +

◆ decode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsKnowledge* BlisVariable::decode (AlpsEncoded & encoded) const
+ 		+inlinevirtual
+
+ +

Decode a variable from an encoded object.

+ +

Reimplemented in VrpVariable.

+ +

Definition at line 145 of file BlisVariable.h.

+ +
+
+

Member Data Documentation

+ +

◆ objCoef_

+ +
+
+ + + + + +
+ + + + +
double BlisVariable::objCoef_
+ 		+private
+
+ +

Definition at line 35 of file BlisVariable.h.

+ +
+
+ +

◆ size_

+ +
+
+ + + + + +
+ + + + +
int BlisVariable::size_
+ 		+private
+
+ +

Definition at line 36 of file BlisVariable.h.

+ +
+
+ +

◆ indices_

+ +
+
+ + + + + +
+ + + + +
int* BlisVariable::indices_
+ 		+private
+
+ +

Definition at line 37 of file BlisVariable.h.

+ +
+
+ +

◆ values_

+ +
+
+ + + + + +
+ + + + +
double* BlisVariable::values_
+ 		+private
+
+ +

Definition at line 38 of file BlisVariable.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classBlisVariable__coll__graph.map b/Doxygen/0.94/classBlisVariable__coll__graph.map new file mode 100644 index 0000000..56a300d --- /dev/null +++ b/Doxygen/0.94/classBlisVariable__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classBlisVariable__coll__graph.md5 b/Doxygen/0.94/classBlisVariable__coll__graph.md5 new file mode 100644 index 0000000..c2ccb7a --- /dev/null +++ b/Doxygen/0.94/classBlisVariable__coll__graph.md5 @@ -0,0 +1 @@ +4085232da006fd841e399ebc1869046c \ No newline at end of file diff --git a/Doxygen/0.94/classBlisVariable__coll__graph.png b/Doxygen/0.94/classBlisVariable__coll__graph.png new file mode 100644 index 0000000..65a4f34 Binary files /dev/null and b/Doxygen/0.94/classBlisVariable__coll__graph.png differ diff --git a/Doxygen/0.94/classBlisVariable__inherit__graph.map b/Doxygen/0.94/classBlisVariable__inherit__graph.map new file mode 100644 index 0000000..26b7ebe --- /dev/null +++ b/Doxygen/0.94/classBlisVariable__inherit__graph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/classBlisVariable__inherit__graph.md5 b/Doxygen/0.94/classBlisVariable__inherit__graph.md5 new file mode 100644 index 0000000..c7c7290 --- /dev/null +++ b/Doxygen/0.94/classBlisVariable__inherit__graph.md5 @@ -0,0 +1 @@ +6b281c1461d85c25e85a63f0e29af8b3 \ No newline at end of file diff --git a/Doxygen/0.94/classBlisVariable__inherit__graph.png b/Doxygen/0.94/classBlisVariable__inherit__graph.png new file mode 100644 index 0000000..c2e6d70 Binary files /dev/null and b/Doxygen/0.94/classBlisVariable__inherit__graph.png differ diff --git a/Doxygen/0.94/classVrpCutGenerator-members.html b/Doxygen/0.94/classVrpCutGenerator-members.html new file mode 100644 index 0000000..30dda93 --- /dev/null +++ b/Doxygen/0.94/classVrpCutGenerator-members.html @@ -0,0 +1,140 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
VrpCutGenerator Member List
+
+
+ +

This is the complete list of members for VrpCutGenerator, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
addCalls(int n=1)BlisConGeneratorinline
addNoConsCalls(int n=1)BlisConGeneratorinline
addNumConsGenerated(int n)BlisConGeneratorinline
addNumConsUsed(int n)BlisConGeneratorinline
addTime(double t)BlisConGeneratorinline
addVrpCut(BcpsConstraintPool &conPool, char *coef, int rhs, int type)VrpCutGenerator
atSolution() constBlisConGeneratorinline
atSolution_BlisConGeneratorprotected
BlisConGenerator()BlisConGeneratorinline
BlisConGenerator(BlisModel *model, CglCutGenerator *generator, const char *name=NULL, BlisCutStrategy strategy=BlisCutStrategyAuto, int cutGenerationFrequency_=1, bool normal=true, bool atSolution=false, bool infeasible=false)BlisConGenerator
BlisConGenerator(const BlisConGenerator &)BlisConGenerator
calls() constBlisConGeneratorinline
calls_BlisConGeneratorprotected
coef_listVrpCutGeneratorprivate
connectivityCuts(BcpsConstraintPool &conPool)VrpCutGenerator
cutGenerationFreq() constBlisConGeneratorinline
cutGenerationFrequency_BlisConGeneratorprotected
cutList_VrpCutGeneratorprivate
cutVal_VrpCutGeneratorprivate
generateConstraints(BcpsConstraintPool &conPool)VrpCutGeneratorvirtual
generator() constBlisConGeneratorinline
generator_BlisConGeneratorprotected
getModel()BlisConGeneratorinline
greedyShrinking1(VrpModel *m, int max_shrink_cuts, BcpsConstraintPool &conPool)VrpCutGenerator
greedyShrinking1One(VrpModel *m, int max_shrink_cuts, BcpsConstraintPool &conPool)VrpCutGenerator
greedyShrinking2One(VrpModel *m, int max_shrink_cuts, BcpsConstraintPool &conPool)VrpCutGenerator
greedyShrinking6(VrpModel *m, int max_shrink_cuts, int trial_num, double prob, BcpsConstraintPool &conPool)VrpCutGenerator
greedyShrinking6One(VrpModel *m, int max_shrink_cuts, int trial_num, double prob, BcpsConstraintPool &conPool)VrpCutGenerator
inSet_VrpCutGeneratorprivate
model_VrpCutGeneratorprivate
name() constBlisConGeneratorinline
name_BlisConGeneratorprotected
noConsCalls() constBlisConGeneratorinline
noConsCalls_BlisConGeneratorprotected
normal() constBlisConGeneratorinline
normal_BlisConGeneratorprotected
numConsGenerated()BlisConGeneratorinline
numConsGenerated_BlisConGeneratorprotected
numConsUsed()BlisConGeneratorinline
numConsUsed_BlisConGeneratorprotected
operator=(const BlisConGenerator &rhs)BlisConGenerator
ref_VrpCutGeneratorprivate
refreshModel(BlisModel *model)BlisConGenerator
setAtSolution(bool value)BlisConGeneratorinline
setCutGenerationFreq(int freq)BlisConGeneratorinline
setModel(VrpModel *vrp)VrpCutGeneratorinline
BlisConGenerator::setModel(BlisModel *m)BlisConGeneratorinline
setName(const char *str)BlisConGeneratorinline
setNormal(bool value)BlisConGeneratorinline
setStrategy(BlisCutStrategy value)BlisConGeneratorinline
setWhenInfeasible(bool value)BlisConGeneratorinline
strategy() constBlisConGeneratorinline
strategy_BlisConGeneratorprotected
time() constBlisConGeneratorinline
time_BlisConGeneratorprotected
VrpCutGenerator(VrpModel *vrp=0, int vertnum=0)VrpCutGenerator
whenInfeasible() constBlisConGeneratorinline
whenInfeasible_BlisConGeneratorprotected
~BlisConGenerator()BlisConGeneratorinlinevirtual
~VrpCutGenerator()VrpCutGeneratorinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classVrpCutGenerator.html b/Doxygen/0.94/classVrpCutGenerator.html new file mode 100644 index 0000000..5d6cea4 --- /dev/null +++ b/Doxygen/0.94/classVrpCutGenerator.html @@ -0,0 +1,835 @@ + + + + + + + +Blis: VrpCutGenerator Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Private Attributes | +List of all members
+
+
VrpCutGenerator Class Reference
+
+
+ +

#include <VrpCutGenerator.h>

+
+ + Inheritance diagram for VrpCutGenerator:
+
+
+ +
+ + Collaboration diagram for VrpCutGenerator:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 VrpCutGenerator (VrpModel *vrp=0, int vertnum=0)
 Construtors. More...
 
virtual ~VrpCutGenerator ()
 Destructor. More...
 
virtual bool generateConstraints (BcpsConstraintPool &conPool)
 Generate cons for the client model. More...
 
int connectivityCuts (BcpsConstraintPool &conPool)
 
int addVrpCut (BcpsConstraintPool &conPool, char *coef, int rhs, int type)
 
void setModel (VrpModel *vrp)
 
int greedyShrinking1 (VrpModel *m, int max_shrink_cuts, BcpsConstraintPool &conPool)
 
int greedyShrinking1One (VrpModel *m, int max_shrink_cuts, BcpsConstraintPool &conPool)
 
int greedyShrinking6 (VrpModel *m, int max_shrink_cuts, int trial_num, double prob, BcpsConstraintPool &conPool)
 
int greedyShrinking6One (VrpModel *m, int max_shrink_cuts, int trial_num, double prob, BcpsConstraintPool &conPool)
 
int greedyShrinking2One (VrpModel *m, int max_shrink_cuts, BcpsConstraintPool &conPool)
 
- Public Member Functions inherited from BlisConGenerator
 BlisConGenerator ()
 Default constructor. More...
 
 BlisConGenerator (BlisModel *model, CglCutGenerator *generator, const char *name=NULL, BlisCutStrategy strategy=BlisCutStrategyAuto, int cutGenerationFrequency_=1, bool normal=true, bool atSolution=false, bool infeasible=false)
 Useful constructor. More...
 
 BlisConGenerator (const BlisConGenerator &)
 Copy constructor. More...
 
BlisConGenerator & operator= (const BlisConGenerator &rhs)
 Assignment operator. More...
 
virtual ~BlisConGenerator ()
 Destructor. More...
 
BlisModel * getModel ()
 Set the client model. More...
 
void setModel (BlisModel *m)
 Set the model. More...
 
void refreshModel (BlisModel *model)
 Refresh the model. More...
 
void setName (const char *str)
 return name of generator. More...
 
std::string name () const
 return name of generator. More...
 
void setStrategy (BlisCutStrategy value)
 Set the con generation strategy. More...
 
BlisCutStrategy strategy () const
 Get the con generation interval. More...
 
void setCutGenerationFreq (int freq)
 Set the con generation strategy. More...
 
int cutGenerationFreq () const
 Get the con generation interval. More...
 
bool normal () const
 Get whether the con generator should be called in the normal place. More...
 
void setNormal (bool value)
 Set whether the con generator should be called in the normal place. More...
 
bool atSolution () const
 Get whether the con generator should be called when a solution is found. More...
 
void setAtSolution (bool value)
 Set whether the con generator should be called when a solution is found. More...
 
bool whenInfeasible () const
 Get whether the con generator should be called when the subproblem is found to be infeasible. More...
 
void setWhenInfeasible (bool value)
 Set whether the con generator should be called when the subproblem is found to be infeasible. More...
 
CglCutGenerator * generator () const
 Get the CglCutGenerator bound to this BlisConGenerator. More...
 
int numConsGenerated ()
 Get number of generated cons. More...
 
void addNumConsGenerated (int n)
 Increase the number of generated cons. More...
 
int numConsUsed ()
 Get number of used cons. More...
 
void addNumConsUsed (int n)
 Increase the number of generated cons. More...
 
double time () const
 Cpu time used. More...
 
void addTime (double t)
 Increase Cpu time used. More...
 
int calls () const
 Number called. More...
 
void addCalls (int n=1)
 Increase the number of called. More...
 
int noConsCalls () const
 Number called and no cons found. More...
 
void addNoConsCalls (int n=1)
 Increase the number of no cons called. More...
 
+ + + + + + + + + + + + + +

+Private Attributes

VrpModel * model_
 
char ** coef_list
 
int * ref_
 
double * cutVal_
 
char * cutList_
 
char * inSet_
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from BlisConGenerator
BlisModel * model_
 The client model. More...
 
CglCutGenerator * generator_
 The CglCutGenerator object. More...
 
BlisCutStrategy strategy_
 When to call CglCutGenerator::generateCuts routine. More...
 
int cutGenerationFrequency_
 The frequency of calls to the cut generator. More...
 
std::string name_
 Name of generator. More...
 
bool normal_
 Whether to call the generator in the normal place. More...
 
bool atSolution_
 Whether to call the generator when a new solution is found. More...
 
bool whenInfeasible_
 Whether to call generator when a subproblem is found to be infeasible. More...
 
int numConsGenerated_
 Number of cons generated. More...
 
int numConsUsed_
 Number of cons used. More...
 
double time_
 Used CPU/User time. More...
 
int calls_
 The times of calling this generator. More...
 
int noConsCalls_
 The times of calling this generator and no cons found. More...
 
+

Detailed Description

+
+

Definition at line 34 of file VrpCutGenerator.h.

+

Constructor & Destructor Documentation

+ +

◆ VrpCutGenerator()

+ +
+
+ + + + + + + + + + + + + + + + + + +
VrpCutGenerator::VrpCutGenerator (VrpModel * vrp = 0,
int vertnum = 0 
)
+
+ +

Construtors.

+ +
+
+ +

◆ ~VrpCutGenerator()

+ +
+
+ + + + + +
+ + + + + + + +
virtual VrpCutGenerator::~VrpCutGenerator ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 51 of file VrpCutGenerator.h.

+ +
+
+

Member Function Documentation

+ +

◆ generateConstraints()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual bool VrpCutGenerator::generateConstraints (BcpsConstraintPool & conPool)
+ 		+virtual
+
+ +

Generate cons for the client model.

+

The routine returns true if reoptimisation is needed (because the state of the solver interface has been modified).

+ +

Reimplemented from BlisConGenerator.

+ +
+
+ +

◆ connectivityCuts()

+ +
+
+ + + + + + + + +
int VrpCutGenerator::connectivityCuts (BcpsConstraintPool & conPool)
+
+ +
+
+ +

◆ addVrpCut()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
int VrpCutGenerator::addVrpCut (BcpsConstraintPool & conPool,
char * coef,
int rhs,
int type 
)
+
+ +
+
+ +

◆ setModel()

+ +
+
+ + + + + +
+ + + + + + + + +
void VrpCutGenerator::setModel (VrpModel * vrp)
+ 		+inline
+
+ +

Definition at line 68 of file VrpCutGenerator.h.

+ +
+
+ +

◆ greedyShrinking1()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int VrpCutGenerator::greedyShrinking1 (VrpModel * m,
int max_shrink_cuts,
BcpsConstraintPool & conPool 
)
+
+ +
+
+ +

◆ greedyShrinking1One()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int VrpCutGenerator::greedyShrinking1One (VrpModel * m,
int max_shrink_cuts,
BcpsConstraintPool & conPool 
)
+
+ +
+
+ +

◆ greedyShrinking6()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
int VrpCutGenerator::greedyShrinking6 (VrpModel * m,
int max_shrink_cuts,
int trial_num,
double prob,
BcpsConstraintPool & conPool 
)
+
+ +
+
+ +

◆ greedyShrinking6One()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
int VrpCutGenerator::greedyShrinking6One (VrpModel * m,
int max_shrink_cuts,
int trial_num,
double prob,
BcpsConstraintPool & conPool 
)
+
+ +
+
+ +

◆ greedyShrinking2One()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int VrpCutGenerator::greedyShrinking2One (VrpModel * m,
int max_shrink_cuts,
BcpsConstraintPool & conPool 
)
+
+ +
+
+

Member Data Documentation

+ +

◆ model_

+ +
+
+ + + + + +
+ + + + +
VrpModel* VrpCutGenerator::model_
+ 		+private
+
+ +

Definition at line 38 of file VrpCutGenerator.h.

+ +
+
+ +

◆ coef_list

+ +
+
+ + + + + +
+ + + + +
char** VrpCutGenerator::coef_list
+ 		+private
+
+ +

Definition at line 39 of file VrpCutGenerator.h.

+ +
+
+ +

◆ ref_

+ +
+
+ + + + + +
+ + + + +
int* VrpCutGenerator::ref_
+ 		+private
+
+ +

Definition at line 40 of file VrpCutGenerator.h.

+ +
+
+ +

◆ cutVal_

+ +
+
+ + + + + +
+ + + + +
double* VrpCutGenerator::cutVal_
+ 		+private
+
+ +

Definition at line 41 of file VrpCutGenerator.h.

+ +
+
+ +

◆ cutList_

+ +
+
+ + + + + +
+ + + + +
char* VrpCutGenerator::cutList_
+ 		+private
+
+ +

Definition at line 42 of file VrpCutGenerator.h.

+ +
+
+ +

◆ inSet_

+ +
+
+ + + + + +
+ + + + +
char* VrpCutGenerator::inSet_
+ 		+private
+
+ +

Definition at line 43 of file VrpCutGenerator.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classVrpCutGenerator__coll__graph.map b/Doxygen/0.94/classVrpCutGenerator__coll__graph.map new file mode 100644 index 0000000..6a7fe41 --- /dev/null +++ b/Doxygen/0.94/classVrpCutGenerator__coll__graph.map @@ -0,0 +1,30 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/classVrpCutGenerator__coll__graph.md5 b/Doxygen/0.94/classVrpCutGenerator__coll__graph.md5 new file mode 100644 index 0000000..c0e1b20 --- /dev/null +++ b/Doxygen/0.94/classVrpCutGenerator__coll__graph.md5 @@ -0,0 +1 @@ +f7fae8ccdfd5c0c20f0153d630ddc60f \ No newline at end of file diff --git a/Doxygen/0.94/classVrpCutGenerator__coll__graph.png b/Doxygen/0.94/classVrpCutGenerator__coll__graph.png new file mode 100644 index 0000000..c9a59f3 Binary files /dev/null and b/Doxygen/0.94/classVrpCutGenerator__coll__graph.png differ diff --git a/Doxygen/0.94/classVrpCutGenerator__inherit__graph.map b/Doxygen/0.94/classVrpCutGenerator__inherit__graph.map new file mode 100644 index 0000000..702f492 --- /dev/null +++ b/Doxygen/0.94/classVrpCutGenerator__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classVrpCutGenerator__inherit__graph.md5 b/Doxygen/0.94/classVrpCutGenerator__inherit__graph.md5 new file mode 100644 index 0000000..9292679 --- /dev/null +++ b/Doxygen/0.94/classVrpCutGenerator__inherit__graph.md5 @@ -0,0 +1 @@ +a3c90cd8ca95604c92a62c30828f8c7a \ No newline at end of file diff --git a/Doxygen/0.94/classVrpCutGenerator__inherit__graph.png b/Doxygen/0.94/classVrpCutGenerator__inherit__graph.png new file mode 100644 index 0000000..83b949d Binary files /dev/null and b/Doxygen/0.94/classVrpCutGenerator__inherit__graph.png differ diff --git a/Doxygen/0.94/classVrpHeurTSP-members.html b/Doxygen/0.94/classVrpHeurTSP-members.html new file mode 100644 index 0000000..876cdc0 --- /dev/null +++ b/Doxygen/0.94/classVrpHeurTSP-members.html @@ -0,0 +1,122 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
VrpHeurTSP Member List
+
+
+ +

This is the complete list of members for VrpHeurTSP, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
addCalls(int c=1)BlisHeuristicinline
addNoSolCalls(int n=1)BlisHeuristicinline
addNumSolutions(int num=1)BlisHeuristicinline
addTime(double t=0.0)BlisHeuristicinline
adjList_VrpHeurTSPprotected
BlisHeuristic()BlisHeuristicinline
BlisHeuristic(BlisModel *model, const char *name, BlisHeurStrategy strategy, int heurCallFrequency)BlisHeuristicinline
BlisHeuristic(const BlisHeuristic &rhs)BlisHeuristicinline
calls() constBlisHeuristicinline
calls_BlisHeuristicprotected
clone() constBlisHeuristicinlinevirtual
createAdjList(VrpModel *model)VrpHeurTSPprotected
edgeColMatch_VrpHeurTSPprotected
freeGuts()VrpHeurTSPinlineprotected
heurCallFrequency() constBlisHeuristicinlinevirtual
heurCallFrequency_BlisHeuristicprotected
model_BlisHeuristicprotected
name() constBlisHeuristicinline
name_BlisHeuristicprotected
neighbors_VrpHeurTSPprotected
nodeCalls_VrpHeurTSPprotected
noSolCalls() constBlisHeuristicinline
noSolsCalls_BlisHeuristicprotected
numSolutions() constBlisHeuristicinline
numSolutions_BlisHeuristicprotected
operator=(const VrpHeurTSP &rhs)VrpHeurTSPprivate
preNode_VrpHeurTSPprotected
searchSolution(double &objectiveValue, double *newSolution)VrpHeurTSPvirtual
BlisHeuristic::searchSolution(double &objectiveValue, double *newSolution, OsiCuts &cs)BlisHeuristicinlinevirtual
setHeurCallFrequency(int freq)BlisHeuristicinlinevirtual
setModel(BlisModel *model)BlisHeuristicinlinevirtual
setStrategy(BlisHeurStrategy strategy)BlisHeuristicinlinevirtual
strategy() constBlisHeuristicinlinevirtual
strategy_BlisHeuristicprotected
time() constBlisHeuristicinline
time_BlisHeuristicprotected
tour_VrpHeurTSPprotected
visited_VrpHeurTSPprotected
VrpHeurTSP()VrpHeurTSPinline
VrpHeurTSP(VrpModel *model, const char *name, BlisHeurStrategy strategy, int freq)VrpHeurTSPinline
~BlisHeuristic()BlisHeuristicinlinevirtual
~VrpHeurTSP()VrpHeurTSPinline
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classVrpHeurTSP.html b/Doxygen/0.94/classVrpHeurTSP.html new file mode 100644 index 0000000..ced1022 --- /dev/null +++ b/Doxygen/0.94/classVrpHeurTSP.html @@ -0,0 +1,686 @@ + + + + + + + +Blis: VrpHeurTSP Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Protected Member Functions | +Protected Attributes | +Private Member Functions | +List of all members
+
+
VrpHeurTSP Class Reference
+
+
+ +

#include <VrpHeurTSP.h>

+
+ + Inheritance diagram for VrpHeurTSP:
+
+
+ +
+ + Collaboration diagram for VrpHeurTSP:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 VrpHeurTSP ()
 Default Constructor. More...
 
 VrpHeurTSP (VrpModel *model, const char *name, BlisHeurStrategy strategy, int freq)
 Constructor with model. More...
 
 ~VrpHeurTSP ()
 Destructor. More...
 
virtual bool searchSolution (double &objectiveValue, double *newSolution)
 Returns 0 if no solution, 1 if valid solution. More...
 
- Public Member Functions inherited from BlisHeuristic
 BlisHeuristic ()
 Default Constructor. More...
 
 BlisHeuristic (BlisModel *model, const char *name, BlisHeurStrategy strategy, int heurCallFrequency)
 Useful constructor. More...
 
virtual ~BlisHeuristic ()
 Distructor. More...
 
 BlisHeuristic (const BlisHeuristic &rhs)
 Copy constructor. More...
 
virtual void setModel (BlisModel *model)
 update model (This is needed if cliques update matrix etc). More...
 
virtual void setStrategy (BlisHeurStrategy strategy)
 Get/set strategy. More...
 
virtual BlisHeurStrategy strategy () const
 
virtual void setHeurCallFrequency (int freq)
 Get/set call frequency. More...
 
virtual int heurCallFrequency () const
 
virtual BlisHeuristic * clone () const
 Clone a heuristic. More...
 
virtual bool searchSolution (double &objectiveValue, double *newSolution, OsiCuts &cs)
 returns 0 if no solution, 1 if valid solution, -1 if just returning an estimate of best possible solution with better objective value than one passed in Sets solution values if good, sets objective value (only if nonzero code) This is called at same time as cut generators - so can add cuts Default is do nothing More...
 
const char * name () const
 return name of generator. More...
 
void addNumSolutions (int num=1)
 Record number of solutions found. More...
 
int numSolutions () const
 Number of solutions found. More...
 
void addTime (double t=0.0)
 Record Cpu time used. More...
 
double time () const
 Cpu time used. More...
 
void addCalls (int c=1)
 Record number of times called. More...
 
int calls () const
 Number of times called. More...
 
int noSolCalls () const
 Number called and no cons found. More...
 
void addNoSolCalls (int n=1)
 Increase the number of no cons called. More...
 
+ + + + + + +

+Protected Member Functions

void createAdjList (VrpModel *model)
 Create adjacent list for each vertex. More...
 
void freeGuts ()
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Protected Attributes

std::vector< CoinPackedVector * > adjList_
 
std::vector< int > tour_
 TSP Tour. More...
 
bool * visited_
 Mark if vertices have been visited. More...
 
int preNode_
 The node at which this heuristic was call. More...
 
int * neighbors_
 Neighbors determined from LP solution. More...
 
int nodeCalls_
 Call how many time at a node. More...
 
std::vector< int > * edgeColMatch_
 Edge and column relationship. More...
 
- Protected Attributes inherited from BlisHeuristic
BlisModel * model_
 Pointer to the model. More...
 
char * name_
 Heuristics name. More...
 
BlisHeurStrategy strategy_
 When to call findSolution() routine. More...
 
int heurCallFrequency_
 The frequency with which to call the heuristic. More...
 
int numSolutions_
 Number of solutions found. More...
 
double time_
 Used CPU/User time. More...
 
int calls_
 The times of calling this heuristic. More...
 
int noSolsCalls_
 The times of calling this heuristic and no solutions found. More...
 
+ + + + +

+Private Member Functions

VrpHeurTSP & operator= (const VrpHeurTSP &rhs)
 Illegal Assignment operator. More...
 
+

Detailed Description

+
+

Definition at line 54 of file VrpHeurTSP.h.

+

Constructor & Destructor Documentation

+ +

◆ VrpHeurTSP() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
VrpHeurTSP::VrpHeurTSP ()
+ 		+inline
+
+ +

Default Constructor.

+ +

Definition at line 112 of file VrpHeurTSP.h.

+ +
+
+ +

◆ VrpHeurTSP() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
VrpHeurTSP::VrpHeurTSP (VrpModel * model,
const char * name,
BlisHeurStrategy strategy,
int freq 
)
+ 		+inline
+
+ +

Constructor with model.

+ +

Definition at line 118 of file VrpHeurTSP.h.

+ +
+
+ +

◆ ~VrpHeurTSP()

+ +
+
+ + + + + +
+ + + + + + + +
VrpHeurTSP::~VrpHeurTSP ()
+ 		+inline
+
+ +

Destructor.

+ +

Definition at line 132 of file VrpHeurTSP.h.

+ +
+
+

Member Function Documentation

+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + + +
VrpHeurTSP& VrpHeurTSP::operator= (const VrpHeurTSP & rhs)
+ 		+private
+
+ +

Illegal Assignment operator.

+ +
+
+ +

◆ createAdjList()

+ +
+
+ + + + + +
+ + + + + + + + +
void VrpHeurTSP::createAdjList (VrpModel * model)
+ 		+protected
+
+ +

Create adjacent list for each vertex.

+ +
+
+ +

◆ freeGuts()

+ +
+
+ + + + + +
+ + + + + + + +
void VrpHeurTSP::freeGuts ()
+ 		+inlineprotected
+
+ +

Definition at line 90 of file VrpHeurTSP.h.

+ +
+
+ +

◆ searchSolution()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual bool VrpHeurTSP::searchSolution (double & objectiveValue,
double * newSolution 
)
+ 		+virtual
+
+ +

Returns 0 if no solution, 1 if valid solution.

+

newSolution stores the solution in dense format.

+ +

Implements BlisHeuristic.

+ +
+
+

Member Data Documentation

+ +

◆ adjList_

+ +
+
+ + + + + +
+ + + + +
std::vector<CoinPackedVector *> VrpHeurTSP::adjList_
+ 		+protected
+
+ +

Definition at line 65 of file VrpHeurTSP.h.

+ +
+
+ +

◆ tour_

+ +
+
+ + + + + +
+ + + + +
std::vector<int> VrpHeurTSP::tour_
+ 		+protected
+
+ +

TSP Tour.

+ +

Definition at line 71 of file VrpHeurTSP.h.

+ +
+
+ +

◆ visited_

+ +
+
+ + + + + +
+ + + + +
bool* VrpHeurTSP::visited_
+ 		+protected
+
+ +

Mark if vertices have been visited.

+ +

Definition at line 74 of file VrpHeurTSP.h.

+ +
+
+ +

◆ preNode_

+ +
+
+ + + + + +
+ + + + +
int VrpHeurTSP::preNode_
+ 		+protected
+
+ +

The node at which this heuristic was call.

+ +

Definition at line 77 of file VrpHeurTSP.h.

+ +
+
+ +

◆ neighbors_

+ +
+
+ + + + + +
+ + + + +
int* VrpHeurTSP::neighbors_
+ 		+protected
+
+ +

Neighbors determined from LP solution.

+ +

Definition at line 81 of file VrpHeurTSP.h.

+ +
+
+ +

◆ nodeCalls_

+ +
+
+ + + + + +
+ + + + +
int VrpHeurTSP::nodeCalls_
+ 		+protected
+
+ +

Call how many time at a node.

+ +

Definition at line 84 of file VrpHeurTSP.h.

+ +
+
+ +

◆ edgeColMatch_

+ +
+
+ + + + + +
+ + + + +
std::vector<int>* VrpHeurTSP::edgeColMatch_
+ 		+protected
+
+ +

Edge and column relationship.

+

Give an edge {v0, v1}, edgeColMatch_[v1-1][v0] is the column index.

+ +

Definition at line 88 of file VrpHeurTSP.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classVrpHeurTSP__coll__graph.map b/Doxygen/0.94/classVrpHeurTSP__coll__graph.map new file mode 100644 index 0000000..fdc4e19 --- /dev/null +++ b/Doxygen/0.94/classVrpHeurTSP__coll__graph.map @@ -0,0 +1,22 @@ + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/classVrpHeurTSP__coll__graph.md5 b/Doxygen/0.94/classVrpHeurTSP__coll__graph.md5 new file mode 100644 index 0000000..c620da3 --- /dev/null +++ b/Doxygen/0.94/classVrpHeurTSP__coll__graph.md5 @@ -0,0 +1 @@ +6e0dbb69011eb4e4ff7d0dc3b6c11053 \ No newline at end of file diff --git a/Doxygen/0.94/classVrpHeurTSP__coll__graph.png b/Doxygen/0.94/classVrpHeurTSP__coll__graph.png new file mode 100644 index 0000000..4772aeb Binary files /dev/null and b/Doxygen/0.94/classVrpHeurTSP__coll__graph.png differ diff --git a/Doxygen/0.94/classVrpHeurTSP__inherit__graph.map b/Doxygen/0.94/classVrpHeurTSP__inherit__graph.map new file mode 100644 index 0000000..8364fef --- /dev/null +++ b/Doxygen/0.94/classVrpHeurTSP__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classVrpHeurTSP__inherit__graph.md5 b/Doxygen/0.94/classVrpHeurTSP__inherit__graph.md5 new file mode 100644 index 0000000..906d964 --- /dev/null +++ b/Doxygen/0.94/classVrpHeurTSP__inherit__graph.md5 @@ -0,0 +1 @@ +01bf6ab8e952fdd83fdea90f67304bdd \ No newline at end of file diff --git a/Doxygen/0.94/classVrpHeurTSP__inherit__graph.png b/Doxygen/0.94/classVrpHeurTSP__inherit__graph.png new file mode 100644 index 0000000..438afbb Binary files /dev/null and b/Doxygen/0.94/classVrpHeurTSP__inherit__graph.png differ diff --git a/Doxygen/0.94/classVrpModel-members.html b/Doxygen/0.94/classVrpModel-members.html new file mode 100644 index 0000000..d94df01 --- /dev/null +++ b/Doxygen/0.94/classVrpModel-members.html @@ -0,0 +1,329 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
VrpModel Member List
+
+
+ +

This is the complete list of members for VrpModel, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
activeNode_BlisModelprotected
addCutGenerator(BlisConGenerator *generator)BlisModel
addCutGenerator(CglCutGenerator *generator, const char *name=NULL, BlisCutStrategy strategy=BlisCutStrategyAuto, int cutGenerationFrequency=1, bool normal=true, bool atSolution=false, bool whenInfeasible=false)BlisModel
addFeasCheckTime(double t)BlisModelinline
addHeuristic(BlisHeuristic *heur)BlisModel
addNumIterations(int newIter)BlisModelinline
addNumNodes(int newNodes=1)BlisModelinline
addNumStrong(int num=1)BlisModelinline
addObjects(int numObjects, BcpsObject **objects)BlisModel
analyzeObjective()BlisModel
aveIterations_BlisModelprotected
blisMessageHandler() constBlisModelinline
blisMessageHandler_BlisModelprotected
blisMessages()BlisModelinline
blisMessages_BlisModelprotected
BlisModel()BlisModelinline
BlisPar()BlisModelinline
BlisPar_BlisModelprotected
boundingPass_BlisModel
branchStrategy() constBlisModelinline
branchStrategy_BlisModelprotected
capacity_VrpModelprivate
checkInteger(double value) constBlisModelinline
clearSharedObjectMark()BlisModelinline
colMatrix_BlisModelprotected
colType_BlisModelprotected
computeCost(int v0, int v1)VrpModel
conLB()BlisModelinline
conLB_BlisModelprotected
conRandoms_BlisModelprotected
constraintPool()BlisModelinline
constraintPool_BlisModelprotected
constraintPoolReceive()BlisModelinline
constraintPoolReceive_BlisModelprotected
constraintPoolSend()BlisModelinline
constraintPoolSend_BlisModelprotected
conUB()BlisModelinline
conUB_BlisModelprotected
coordx_VrpModelprivate
coordy_VrpModelprivate
coordz_VrpModelprivate
createIntgerObjects(bool startAgain)BlisModel
createNet(CoinPackedVector *vec)VrpModel
createObjects()BlisModelprotected
createRoot()BlisModelvirtual
currAbsGap_BlisModel
currRelGap_BlisModel
cutGenerationFrequency_BlisModelprotected
cutGenerators(int i) constBlisModelinline
cutoff_BlisModelprotected
cutoffInc_BlisModelprotected
cutStrategy_BlisModelprotected
decodeBlis(AlpsEncoded &encoded)BlisModelprotected
decodeToSelf(AlpsEncoded &)VrpModelvirtual
decodeVrp(AlpsEncoded &encoded)VrpModel
deleteObjects()BlisModel
delOldConstraints()BlisModelinline
demand_VrpModelprivate
denseConCutoff_BlisModelprotected
depot_VrpModelprivate
edgenum_VrpModelprivate
edges_VrpModelprivate
encode() constVrpModelvirtual
encodeBlis(AlpsEncoded *encoded) constBlisModelprotected
encodeVrp(AlpsEncoded *encoded) constVrpModel
etol_VrpModelprivate
fathomAllNodes()BlisModelvirtual
feasCheckTime_BlisModelprotected
feasibleSolution(int &numIntegerInfs, int &numObjectInfs)BlisModelvirtual
feasibleSolutionHeur(const double *solution)BlisModel
generators_BlisModelprotected
getAveIterations() constBlisModelinline
getColLower()BlisModelinline
getColUpper()BlisModelinline
getConRandoms() constBlisModelinline
getCutGenerationFrequency() constBlisModelinline
getCutoff() constBlisModelinline
getCutStrategy() constBlisModelinline
getDenseConCutoff() constBlisModelinline
getEdgeList()VrpModelinline
getFeasCheckTime()BlisModelinline
getIntColIndices() constBlisModelinline
getIntObjIndices() constBlisModelinline
getLpObjValue() constBlisModelinline
getLpSolution() constBlisModelinline
getMaxNumCons() constBlisModelinline
getNodeWeight() constBlisModelinline
getNumBranchResolve()BlisModelinline
getNumCols()BlisModelinline
getNumEdges()VrpModelinline
getNumHeurSolutions() constBlisModelinline
getNumIntObjects() constBlisModelinline
getNumIterations() constBlisModelinline
getNumNodes() constBlisModelinline
getNumOldConstraints() constBlisModelinline
getNumRows()BlisModelinline
getNumSolutions() constBlisModelinline
getNumStrong()BlisModelinline
getNumVertices()VrpModelinline
getObjCoef() constBlisModelinline
getOldConstraintsSize() constBlisModelinline
getSolution(const double *denseSol)VrpModel
getSolver()BlisModelinlinevirtual
gutsOfDestructor()BlisModel
heurCallFrequency_BlisModel
heuristics(int i) constBlisModelinline
heuristics_BlisModelprotected
heurStrategy_BlisModel
hotstartStrategy_BlisModelprotected
importModel(std::vector< BlisVariable * > vars, std::vector< BlisConstraint * > cons)BlisModelvirtual
incObjValue_BlisModelprotected
incumbent()BlisModelinline
incumbent_BlisModelprotected
index(int v0, int v1)VrpModelinline
init()BlisModelprotected
inputCon_BlisModelprotected
inputVar_BlisModelprotected
intColIndices_BlisModelprotected
integerTol_BlisModel
intObjIndices_BlisModelprotected
isRoot_BlisModel
leafToRootPathBlisModel
lpSolver_BlisModelprotected
maxNumCons_BlisModelprotected
modelLog()BlisModelvirtual
n_VrpModelprivate
name_VrpModelprivate
newCutPool_BlisModel
nodeLog(AlpsTreeNode *node, bool force)BlisModelvirtual
nodeWeight_BlisModelprotected
numBranchResolve_BlisModelprotected
numCols_BlisModelprotected
numCutGenerators() constBlisModelinline
numCutGenerators_BlisModelprotected
numElems_BlisModelprotected
numHeuristics() constBlisModelinline
numHeuristics_BlisModelprotected
numHeurSolutions_BlisModelprotected
numIntObjects_BlisModelprotected
numIterations_BlisModelprotected
numNodes_BlisModelprotected
numObjects() constBlisModelinline
numObjects_BlisModelprotected
numOldConstraints_BlisModelprotected
numroutes_VrpModelprivate
numRows_BlisModelprotected
numSolutions_BlisModelprotected
numStrong_BlisModelprotected
objCoef_BlisModelprotected
objects()BlisModelinline
objects(int which)BlisModelinline
objects_BlisModelprotected
objSense_BlisModelprotected
oldConstraints()BlisModelinline
oldConstraints_BlisModelprotected
oldConstraintsSize_BlisModelprotected
optimalAbsGap_BlisModel
optimalRelGap_BlisModel
origLpSolver_BlisModelprotected
packSharedConstraints(AlpsEncoded *encoded)BlisModelprotected
packSharedKnowlege()BlisModelvirtual
packSharedPseudocost(AlpsEncoded *encoded, int numToShare)BlisModelprotected
packSharedVariables(AlpsEncoded *encoded)BlisModelprotected
passInPriorities(const int *priorities, bool ifNotSimpleIntegers, int defaultValue=1000)BlisModel
postprocess()BlisModelvirtual
posx_VrpModelprivate
posy_VrpModelprivate
preprocess()BlisModelvirtual
presolve_BlisModelprotected
presolvedBlisModelprotected
presolvedLpSolver_BlisModelprotected
presolveForTheWholeTree()BlisModelvirtual
priority() constBlisModelinline
priority(int sequence) constBlisModelinline
priority_BlisModelprotected
problemSetupBlisModelprotected
rampUpBranchStrategy() constBlisModelinline
rampUpBranchStrategy_BlisModelprotected
readInstance(const char *dateFile)VrpModelvirtual
readParameters(const int argnum, const char *const *arglist)VrpModelvirtual
registerKnowledge()VrpModelvirtual
resolve()BlisModel
setActiveNode(AlpsTreeNode *node)BlisModelinline
setBranchingMethod(BcpsBranchStrategy *method)BlisModelinline
setBranchingMethod(BcpsBranchStrategy &method)BlisModelinline
setColMatrix(CoinPackedMatrix *mat)BlisModelinline
setColType(char *colType)BlisModelinline
setConLb(double *cl)BlisModelinline
setConUb(double *cu)BlisModelinline
setCutoff(double co)BlisModelinline
setCutStrategy(BlisCutStrategy u)BlisModelinline
setCutStrategy(int f)BlisModelinline
setDenseConCutoff(int cutoff)BlisModelinline
setFeasCheckTime(double t)BlisModelinline
setMaxNumCons(int m)BlisModelinline
setModelData()VrpModelprotected
setNodeWeight(double nw)BlisModelinline
setNumBranchResolve(int num)BlisModelinline
setNumCons(int num)BlisModelinline
setNumElems(int num)BlisModelinline
setNumObjects(int num)BlisModelinline
setNumOldConstraints(int num)BlisModelinline
setNumVars(int num)BlisModelinline
setObjCoef(double *obj)BlisModelinline
setOldConstraints(BlisConstraint **old)BlisModelinline
setOldConstraintsSize(int num)BlisModelinline
setSharedObjectMark(int i)BlisModelinline
setSolEstimate(double est)BlisModelinline
setSolver(OsiSolverInterface *si)BlisModelinlinevirtual
setupSelf()BlisModelvirtual
setVarLb(double *lb)BlisModelinline
setVarUb(double *ub)BlisModelinline
sharedObjectMark_BlisModelprotected
solver()BlisModelinlinevirtual
startConLB()BlisModelinline
startConLB_BlisModelprotected
startConUB()BlisModelinline
startConUB_BlisModelprotected
startVarLB()BlisModelinline
startVarLB_BlisModelprotected
startVarUB()BlisModelinline
startVarUB_BlisModelprotected
storeSolution(BlisSolutionType how, BlisSolution *sol)BlisModel
tempConLBPos()BlisModelinline
tempConLBPos_BlisModelprotected
tempConUBPos()BlisModelinline
tempConUBPos_BlisModelprotected
tempVarLBPos()BlisModelinline
tempVarLBPos_BlisModelprotected
tempVarUBPos()BlisModelinline
tempVarUBPos_BlisModelprotected
unpackSharedConstraints(AlpsEncoded &encoded)BlisModelprotected
unpackSharedKnowledge(AlpsEncoded &)BlisModelvirtual
unpackSharedPseudocost(AlpsEncoded &encoded)BlisModelprotected
unpackSharedVariables(AlpsEncoded &encoded)BlisModelprotected
userFeasibleSolution(const double *solution, bool &userFeasible)VrpModelvirtual
varLB()BlisModelinline
varLB_BlisModelprotected
varUB()BlisModelinline
varUB_BlisModelprotected
vertnum_VrpModelprivate
VrpCutGenerator classVrpModelfriend
VrpModel()VrpModelinline
VrpPar_VrpModelprivate
VrpSolution classVrpModelfriend
writeParameters(std::ostream &outstream) constBlisModelvirtual
wtype_VrpModelprivate
~BlisModel()BlisModelvirtual
~VrpModel()VrpModelinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classVrpModel.html b/Doxygen/0.94/classVrpModel.html new file mode 100644 index 0000000..743a154 --- /dev/null +++ b/Doxygen/0.94/classVrpModel.html @@ -0,0 +1,1816 @@ + + + + + + + +Blis: VrpModel Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Protected Member Functions | +Private Attributes | +Friends | +List of all members
+
+
VrpModel Class Reference
+
+
+ +

Model class for VRP. + More...

+ +

#include <VrpModel.h>

+
+ + Inheritance diagram for VrpModel:
+
+
+ +
+ + Collaboration diagram for VrpModel:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 VrpModel ()
 Default construtor. More...
 
virtual ~VrpModel ()
 Destructor. More...
 
virtual void readInstance (const char *dateFile)
 For parallel code, only the master calls this function. More...
 
virtual void readParameters (const int argnum, const char *const *arglist)
 Read in Alps, Blis, Vrp parameters. More...
 
virtual BlisSolution * userFeasibleSolution (const double *solution, bool &userFeasible)
 User's criteria for a feasible solution. More...
 
int index (int v0, int v1)
 
int computeCost (int v0, int v1)
 
int getNumVertices ()
 
int getNumEdges ()
 
std::vector< VrpVariable * > getEdgeList ()
 
CoinPackedVector * getSolution (const double *denseSol)
 
void createNet (CoinPackedVector *vec)
 
virtual void registerKnowledge ()
 Register knowledge. More...
 
AlpsReturnStatus encodeVrp (AlpsEncoded *encoded) const
 Pack Vrp portion of the model into an encoded object. More...
 
AlpsReturnStatus decodeVrp (AlpsEncoded &encoded)
 Unpack Vrp portion of the model from an encoded object. More...
 
virtual AlpsEncoded * encode () const
 The method that encodes the model into an encoded object. More...
 
virtual void decodeToSelf (AlpsEncoded &)
 The method that decodes the model from an encoded object. More...
 
- Public Member Functions inherited from BlisModel
 BlisModel ()
 Default construtor. More...
 
virtual ~BlisModel ()
 Destructor. More...
 
void gutsOfDestructor ()
 Actual destructor. More...
 
void setColMatrix (CoinPackedMatrix *mat)
 Pass a matrix in. More...
 
void setNumCons (int num)
 Pass column upper bounds. More...
 
void setNumVars (int num)
 Pass column upper bounds. More...
 
void setNumElems (int num)
 Pass column upper bounds. More...
 
void setConLb (double *cl)
 Pass column upper bounds. More...
 
void setConUb (double *cu)
 Pass column lower bounds. More...
 
void setVarLb (double *lb)
 Pass variable upper bounds. More...
 
void setVarUb (double *ub)
 Pass variable lower bounds. More...
 
void setColType (char *colType)
 Pass variable types. More...
 
void setObjCoef (double *obj)
 Pass objective coefficients. More...
 
virtual void importModel (std::vector< BlisVariable * > vars, std::vector< BlisConstraint * > cons)
 For parallel code, only the master calls this function. More...
 
virtual void writeParameters (std::ostream &outstream) const
 Write out parameters. More...
 
virtual AlpsTreeNode * createRoot ()
 For parallel code, only the master calls this function. More...
 
virtual bool setupSelf ()
 All processes call this function. More...
 
virtual void preprocess ()
 Preprocessing the model. More...
 
virtual void postprocess ()
 Postprocessing the searching results. More...
 
virtual void setSolver (OsiSolverInterface *si)
 Set lp solver. More...
 
virtual OsiSolverInterface * getSolver ()
 Get lp solver. More...
 
virtual OsiSolverInterface * solver ()
 Get lp solver. More...
 
bool resolve ()
 Resolving a lp. More...
 
void setActiveNode (AlpsTreeNode *node)
 Set active node. More...
 
void setSolEstimate (double est)
 Set the solution estimate of the active node. More...
 
int getNumStrong ()
 Get number of strong branchings. More...
 
void addNumStrong (int num=1)
 Add num to number of strong branchings. More...
 
int getNumBranchResolve ()
 Get the maximum number of resolve during branching. More...
 
void setNumBranchResolve (int num)
 Set the maximum number of resolve during branching. More...
 
double getFeasCheckTime ()
 Get the total time spent checking solutions for feasibility. More...
 
void setFeasCheckTime (double t)
 Set the total time spent checking solutions for feasibility. More...
 
void addFeasCheckTime (double t)
 Add to the time spent checking solutions for feasibility. More...
 
double * getObjCoef () const
 Get objective coefficients. More...
 
const double * getColLower ()
 Get column lower bound. More...
 
const double * getColUpper ()
 Get column upper bound. More...
 
int getNumCols ()
 Get number of columns. More...
 
int getNumRows ()
 Get number of rows. More...
 
double * varLB ()
 Get variable bounds arrary. More...
 
double * varUB ()
 
double * conLB ()
 Get original constraint bounds arrary. More...
 
double * conUB ()
 
double * startVarLB ()
 The starting variable bounds arrary of a subproblem (internal use). More...
 
double * startVarUB ()
 
double * startConLB ()
 The starting constraint bounds arrary of a subproblem (internal use). More...
 
double * startConUB ()
 
int * tempVarLBPos ()
 Temparory storage. More...
 
int * tempVarUBPos ()
 
int * tempConLBPos ()
 
int * tempConUBPos ()
 
double getLpObjValue () const
 Get current objective function value. More...
 
const double * getLpSolution () const
 Get active lp solution. More...
 
int getNumSolutions () const
 Get number of solutions. More...
 
int getNumHeurSolutions () const
 Get number of heuristic solutions. More...
 
double * incumbent ()
 Return best ip solution found so far. More...
 
int storeSolution (BlisSolutionType how, BlisSolution *sol)
 Record a new incumbent solution and update objectiveValue. More...
 
double getCutoff () const
 Get cut off value. More...
 
void setCutoff (double co)
 Set cut off value. More...
 
BlisSolution * feasibleSolutionHeur (const double *solution)
 Test if a solution found by heuristic is feasible. More...
 
virtual BlisSolution * feasibleSolution (int &numIntegerInfs, int &numObjectInfs)
 Test the current LP solution for feasiblility. More...
 
BcpsBranchStrategy * branchStrategy () const
 Get the current branching strategy. More...
 
void setBranchingMethod (BcpsBranchStrategy *method)
 Set the branching strategy. More...
 
void setBranchingMethod (BcpsBranchStrategy &method)
 Set the branching stratedy. More...
 
BcpsBranchStrategy * rampUpBranchStrategy () const
 
int numObjects () const
 Get the number of objects. More...
 
void setNumObjects (int num)
 Set the number of objects. More...
 
BcpsObject ** objects ()
 Get the array of objects. More...
 
BcpsObject * objects (int which)
 Get the specified object. More...
 
void setSharedObjectMark (int i)
 Mark object to be shared. More...
 
void clearSharedObjectMark ()
 Clear all the share mark. More...
 
void deleteObjects ()
 Delete all object information. More...
 
void addObjects (int numObjects, BcpsObject **objects)
 Add in object information. More...
 
void createIntgerObjects (bool startAgain)
 Identify integer variable. More...
 
int * getIntObjIndices () const
 Get integers' object indices. More...
 
int getNumIntObjects () const
 Get number of integers. More...
 
int * getIntColIndices () const
 Get integers' column indices. More...
 
bool checkInteger (double value) const
 Check if a value is integer. More...
 
void analyzeObjective ()
 
void addHeuristic (BlisHeuristic *heur)
 Add a heuristic. More...
 
BlisHeuristic * heuristics (int i) const
 Get a specific heuristic. More...
 
int numHeuristics () const
 Get the number of heuristics. More...
 
void addCutGenerator (BlisConGenerator *generator)
 Add a Blis cut generator. More...
 
void addCutGenerator (CglCutGenerator *generator, const char *name=NULL, BlisCutStrategy strategy=BlisCutStrategyAuto, int cutGenerationFrequency=1, bool normal=true, bool atSolution=false, bool whenInfeasible=false)
 Add a Cgl cut generator. More...
 
BlisConGenerator * cutGenerators (int i) const
 Get a specific cut generator. More...
 
int numCutGenerators () const
 Get the number of cut generators. More...
 
int getMaxNumCons () const
 Get the max number of cuts can be generated. More...
 
void setMaxNumCons (int m)
 Set the max number of cuts can be generated. More...
 
BcpsConstraintPool * constraintPool ()
 Access constraint pool. More...
 
BcpsConstraintPool * constraintPoolReceive ()
 Access receive constraint pool. More...
 
BcpsConstraintPool * constraintPoolSend ()
 Access send constraint pool. More...
 
int getNumOldConstraints () const
 Get number of old constraints. More...
 
void setNumOldConstraints (int num)
 Set number of old constraints. More...
 
int getOldConstraintsSize () const
 Get max number of old constraints. More...
 
void setOldConstraintsSize (int num)
 Set max number of old constraints. More...
 
BlisConstraint ** oldConstraints ()
 Access old constraints. More...
 
void setOldConstraints (BlisConstraint **old)
 set old constraints. More...
 
void delOldConstraints ()
 Set max number of old constraints. More...
 
BlisCutStrategy getCutStrategy () const
 Query constraint generation strategy. More...
 
void setCutStrategy (BlisCutStrategy u)
 Set constraint generation strategy. More...
 
int getCutGenerationFrequency () const
 Query constraint generation frequency. More...
 
void setCutStrategy (int f)
 Set constraint generation frequency. More...
 
int getDenseConCutoff () const
 Get the thresheld to be considered as a dense constraint. More...
 
void setDenseConCutoff (int cutoff)
 Set the thresheld to be considered as a dense constraint. More...
 
double * getConRandoms () const
 Get randoms for check parallel constraints. More...
 
void passInPriorities (const int *priorities, bool ifNotSimpleIntegers, int defaultValue=1000)
 Pass in branching priorities. More...
 
const int * priority () const
 Priorities. More...
 
int priority (int sequence) const
 Returns priority level for an object (or 1000 if no priorities exist) More...
 
double getNodeWeight () const
 
void setNodeWeight (double nw)
 
virtual void modelLog ()
 Log of specific models. More...
 
int getNumNodes () const
 Get how many Nodes it took to solve the problem. More...
 
int getNumIterations () const
 Get how many iterations it took to solve the problem. More...
 
int getAveIterations () const
 Get the average iterations it took to solve a lp. More...
 
void addNumNodes (int newNodes=1)
 Increment node count. More...
 
void addNumIterations (int newIter)
 Increment Iteration count. More...
 
CoinMessageHandler * blisMessageHandler () const
 Get the message handler. More...
 
CoinMessages blisMessages ()
 Return messages. More...
 
BlisParams * BlisPar ()
 Access parameters. More...
 
virtual void nodeLog (AlpsTreeNode *node, bool force)
 Node log. More...
 
virtual bool fathomAllNodes ()
 Return true, if all nodes can be fathomed. More...
 
virtual AlpsEncoded * packSharedKnowlege ()
 Pack knowledge to be shared with others into an encoded object. More...
 
virtual void unpackSharedKnowledge (AlpsEncoded &)
 Unpack and store shared knowledge from an encoded object. More...
 
virtual void presolveForTheWholeTree ()
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Protected Member Functions

void setModelData ()
 1) Set colMatrix_, varLB_, varUB_, conLB_, conUB, numCols_, numRows_ 2) Set objCoef_ and objSense_ 3) Set colType_ ('C', 'I', or 'B') More...
 
- Protected Member Functions inherited from BlisModel
void init ()
 Intialize member data. More...
 
void createObjects ()
 Create variables and constraints. More...
 
AlpsReturnStatus encodeBlis (AlpsEncoded *encoded) const
 Pack Blis portion of the model into an encoded object. More...
 
AlpsReturnStatus decodeBlis (AlpsEncoded &encoded)
 Unpack Blis portion of the model from an encoded object. More...
 
void packSharedPseudocost (AlpsEncoded *encoded, int numToShare)
 Retrieve and pack shared pseudocost. More...
 
void unpackSharedPseudocost (AlpsEncoded &encoded)
 Unpack and store shared pseduocost. More...
 
void packSharedConstraints (AlpsEncoded *encoded)
 Retrieve and pack shared constraints. More...
 
void unpackSharedConstraints (AlpsEncoded &encoded)
 Unpack and store shared constraints. More...
 
void packSharedVariables (AlpsEncoded *encoded)
 Retrieve and pack shared variables. More...
 
void unpackSharedVariables (AlpsEncoded &encoded)
 Unpack and store shared variables. More...
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Private Attributes

char name_ [100]
 
int vertnum_
 
int edgenum_
 
int numroutes_
 
int depot_
 
int capacity_
 
int wtype_
 
int * demand_
 
int * posx_
 
int * posy_
 
double * coordx_
 
double * coordy_
 
double * coordz_
 
double etol_
 
VrpParams * VrpPar_
 
VrpNetwork * n_
 
std::vector< VrpVariable * > edges_
 
+ + + + + +

+Friends

class VrpCutGenerator
 
class VrpSolution
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Public Attributes inherited from BlisModel
bool isRoot_
 If root node. More...
 
int boundingPass_
 The number of passes during bounding procedure. More...
 
double integerTol_
 Integer tolerance. More...
 
double optimalRelGap_
 Input relative optimal gap. More...
 
double optimalAbsGap_
 Input absolute optimal gap. More...
 
double currRelGap_
 Current relative optimal gap. More...
 
double currAbsGap_
 Current absolute optimal gap. More...
 
BlisHeurStrategy heurStrategy_
 If use heuristics. More...
 
int heurCallFrequency_
 Frequency of using heuristics. More...
 
OsiCuts newCutPool_
 Store new cuts in each pass. More...
 
std::vector< AlpsTreeNode * > leafToRootPath
 Record the path from leaf to root. More...
 
- Protected Attributes inherited from BlisModel
OsiSolverInterface * origLpSolver_
 Input by user. More...
 
OsiSolverInterface * presolvedLpSolver_
 Presolved. More...
 
OsiSolverInterface * lpSolver_
 Actually used. More...
 
CoinPackedMatrix * colMatrix_
 Column majored matrix. More...
 
double * varLB_
 Variable and constraint bounds. More...
 
double * varUB_
 
double * conLB_
 
double * conUB_
 
int numCols_
 Number of columns/rows/elements. More...
 
int numRows_
 
int numElems_
 
double objSense_
 Objective function. More...
 
double * objCoef_
 
int numIntObjects_
 Column types. More...
 
int * intColIndices_
 
std::vector< BcpsVariable * > inputVar_
 User's input objects. More...
 
std::vector< BcpsConstraint * > inputCon_
 
BlisPresolve * presolve_
 
bool presolved
 
bool problemSetup
 
int numSolutions_
 
int numHeurSolutions_
 
double incObjValue_
 Incumbent objective value. More...
 
double * incumbent_
 Incumbent. More...
 
double cutoff_
 Cutoff in lp solver. More...
 
double cutoffInc_
 Cutoff increment. More...
 
int * intObjIndices_
 
char * colType_
 
double * startVarLB_
 Starting var/con bounds for processing each node. More...
 
double * startVarUB_
 
double * startConLB_
 
double * startConUB_
 
BcpsBranchStrategy * branchStrategy_
 Variable selection function. More...
 
BcpsBranchStrategy * rampUpBranchStrategy_
 
BlisHotStartStrategy hotstartStrategy_
 
int numObjects_
 Number of objects. More...
 
BcpsObject ** objects_
 The set of objects. More...
 
char * sharedObjectMark_
 The objects that can be shared. More...
 
int * priority_
 Priorities of integer object. More...
 
AlpsTreeNode * activeNode_
 Active node. More...
 
int numStrong_
 Number of strong branching. More...
 
double nodeWeight_
 
int numBranchResolve_
 Maximum number of resolve during branching. More...
 
int numHeuristics_
 Number of heuristics. More...
 
BlisHeuristic ** heuristics_
 The list of heuristics. More...
 
BlisCutStrategy cutStrategy_
 If use cut generators. More...
 
int cutGenerationFrequency_
 Frequency of cut generation. More...
 
int numCutGenerators_
 Number of cut generators used. More...
 
int maxNumCons_
 Number of cuts can be generators. More...
 
BlisConGenerator ** generators_
 The list of cut generators used. More...
 
BcpsConstraintPool * constraintPool_
 Store all the cuts. More...
 
BlisConstraint ** oldConstraints_
 Temporary store old cuts at a node when installing a node. More...
 
int oldConstraintsSize_
 The memory size allocated for oldConstraints_. More...
 
int numOldConstraints_
 Number of old constraints. More...
 
double * conRandoms_
 Random keys. More...
 
int denseConCutoff_
 Dense constraint cutoff. More...
 
BlisParams * BlisPar_
 Blis parameters. More...
 
CoinMessageHandler * blisMessageHandler_
 Message handler. More...
 
CoinMessages blisMessages_
 Blis messages. More...
 
int numNodes_
 Number of processed nodes. More...
 
int numIterations_
 Number of lp(Simplex) iterations. More...
 
int aveIterations_
 Average number of lp iterations to solve a subproblem. More...
 
double feasCheckTime_
 Time spent checking feasibility of solutions. More...
 
int * tempVarLBPos_
 Tempory storage for var/con indices. More...
 
int * tempVarUBPos_
 
int * tempConLBPos_
 
int * tempConUBPos_
 
BcpsConstraintPool * constraintPoolSend_
 Constraints that can be sent/broadcasted to other processes. More...
 
BcpsConstraintPool * constraintPoolReceive_
 Constraints that are received from other processses. More...
 
+

Detailed Description

+

Model class for VRP.

+ +

Definition at line 32 of file VrpModel.h.

+

Constructor & Destructor Documentation

+ +

◆ VrpModel()

+ +
+
+ + + + + +
+ + + + + + + +
VrpModel::VrpModel ()
+ 		+inline
+
+ +

Default construtor.

+ +

Definition at line 73 of file VrpModel.h.

+ +
+
+ +

◆ ~VrpModel()

+ +
+
+ + + + + +
+ + + + + + + +
virtual VrpModel::~VrpModel ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 116 of file VrpModel.h.

+ +
+
+

Member Function Documentation

+ +

◆ setModelData()

+ +
+
+ + + + + +
+ + + + + + + +
void VrpModel::setModelData ()
+ 		+protected
+
+ +

1) Set colMatrix_, varLB_, varUB_, conLB_, conUB, numCols_, numRows_ 2) Set objCoef_ and objSense_ 3) Set colType_ ('C', 'I', or 'B')

+ +
+
+ +

◆ readInstance()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void VrpModel::readInstance (const char * dateFile)
+ 		+virtual
+
+ +

For parallel code, only the master calls this function.

+

1) Read in the instance data 2) Set colMatrix_, varLB_, varUB_, conLB_, conUB numCols_, numRows_ 3) Set objCoef_ and objSense_ 4) Set colType_ ('C', 'I', or 'B') 5) Create variables and constraints 6) Set numCoreVariables_ and numCoreConstraints_

+ +

Reimplemented from BlisModel.

+ +
+
+ +

◆ readParameters()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual void VrpModel::readParameters (const int argnum,
const char *const * arglist 
)
+ 		+virtual
+
+ +

Read in Alps, Blis, Vrp parameters.

+ +

Reimplemented from BlisModel.

+ +
+
+ +

◆ userFeasibleSolution()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
virtual BlisSolution* VrpModel::userFeasibleSolution (const double * solution,
bool & userFeasible 
)
+ 		+virtual
+
+ +

User's criteria for a feasible solution.

+

If user think the given solution is feasible then need 1) set userFeasible to true, and 2) return a non-null VRP solution. If user think the solution is infeasible then need 1) set userFeasible to false, and 2) return a null.

+ +

Reimplemented from BlisModel.

+ +
+
+ +

◆ index()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int VrpModel::index (int v0,
int v1 
)
+ 		+inline
+
+ +

Definition at line 152 of file VrpModel.h.

+ +
+
+ +

◆ computeCost()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int VrpModel::computeCost (int v0,
int v1 
)
+
+ +
+
+ +

◆ getNumVertices()

+ +
+
+ + + + + +
+ + + + + + + +
int VrpModel::getNumVertices ()
+ 		+inline
+
+ +

Definition at line 158 of file VrpModel.h.

+ +
+
+ +

◆ getNumEdges()

+ +
+
+ + + + + +
+ + + + + + + +
int VrpModel::getNumEdges ()
+ 		+inline
+
+ +

Definition at line 160 of file VrpModel.h.

+ +
+
+ +

◆ getEdgeList()

+ +
+
+ + + + + +
+ + + + + + + +
std::vector<VrpVariable *> VrpModel::getEdgeList ()
+ 		+inline
+
+ +

Definition at line 162 of file VrpModel.h.

+ +
+
+ +

◆ getSolution()

+ +
+
+ + + + + + + + +
CoinPackedVector* VrpModel::getSolution (const double * denseSol)
+
+ +
+
+ +

◆ createNet()

+ +
+
+ + + + + + + + +
void VrpModel::createNet (CoinPackedVector * vec)
+
+ +
+
+ +

◆ registerKnowledge()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void VrpModel::registerKnowledge ()
+ 		+virtual
+
+ +

Register knowledge.

+ +

Reimplemented from BlisModel.

+ +
+
+ +

◆ encodeVrp()

+ +
+
+ + + + + + + + +
AlpsReturnStatus VrpModel::encodeVrp (AlpsEncoded * encoded) const
+
+ +

Pack Vrp portion of the model into an encoded object.

+ +
+
+ +

◆ decodeVrp()

+ +
+
+ + + + + + + + +
AlpsReturnStatus VrpModel::decodeVrp (AlpsEncoded & encoded)
+
+ +

Unpack Vrp portion of the model from an encoded object.

+ +
+
+ +

◆ encode()

+ +
+
+ + + + + +
+ + + + + + + +
virtual AlpsEncoded* VrpModel::encode () const
+ 		+virtual
+
+ +

The method that encodes the model into an encoded object.

+ +

Reimplemented from BlisModel.

+ +
+
+ +

◆ decodeToSelf()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void VrpModel::decodeToSelf (AlpsEncoded & )
+ 		+virtual
+
+ +

The method that decodes the model from an encoded object.

+ +

Reimplemented from BlisModel.

+ +
+
+

Friends And Related Function Documentation

+ +

◆ VrpCutGenerator

+ +
+
+ + + + + +
+ + + + +
friend class VrpCutGenerator
+ 		+friend
+
+ +

Definition at line 35 of file VrpModel.h.

+ +
+
+ +

◆ VrpSolution

+ +
+
+ + + + + +
+ + + + +
friend class VrpSolution
+ 		+friend
+
+ +

Definition at line 36 of file VrpModel.h.

+ +
+
+

Member Data Documentation

+ +

◆ name_

+ +
+
+ + + + + +
+ + + + +
char VrpModel::name_[100]
+ 		+private
+
+ +

Definition at line 40 of file VrpModel.h.

+ +
+
+ +

◆ vertnum_

+ +
+
+ + + + + +
+ + + + +
int VrpModel::vertnum_
+ 		+private
+
+ +

Definition at line 41 of file VrpModel.h.

+ +
+
+ +

◆ edgenum_

+ +
+
+ + + + + +
+ + + + +
int VrpModel::edgenum_
+ 		+private
+
+ +

Definition at line 42 of file VrpModel.h.

+ +
+
+ +

◆ numroutes_

+ +
+
+ + + + + +
+ + + + +
int VrpModel::numroutes_
+ 		+private
+
+ +

Definition at line 43 of file VrpModel.h.

+ +
+
+ +

◆ depot_

+ +
+
+ + + + + +
+ + + + +
int VrpModel::depot_
+ 		+private
+
+ +

Definition at line 44 of file VrpModel.h.

+ +
+
+ +

◆ capacity_

+ +
+
+ + + + + +
+ + + + +
int VrpModel::capacity_
+ 		+private
+
+ +

Definition at line 45 of file VrpModel.h.

+ +
+
+ +

◆ wtype_

+ +
+
+ + + + + +
+ + + + +
int VrpModel::wtype_
+ 		+private
+
+ +

Definition at line 46 of file VrpModel.h.

+ +
+
+ +

◆ demand_

+ +
+
+ + + + + +
+ + + + +
int* VrpModel::demand_
+ 		+private
+
+ +

Definition at line 47 of file VrpModel.h.

+ +
+
+ +

◆ posx_

+ +
+
+ + + + + +
+ + + + +
int* VrpModel::posx_
+ 		+private
+
+ +

Definition at line 48 of file VrpModel.h.

+ +
+
+ +

◆ posy_

+ +
+
+ + + + + +
+ + + + +
int* VrpModel::posy_
+ 		+private
+
+ +

Definition at line 49 of file VrpModel.h.

+ +
+
+ +

◆ coordx_

+ +
+
+ + + + + +
+ + + + +
double* VrpModel::coordx_
+ 		+private
+
+ +

Definition at line 50 of file VrpModel.h.

+ +
+
+ +

◆ coordy_

+ +
+
+ + + + + +
+ + + + +
double* VrpModel::coordy_
+ 		+private
+
+ +

Definition at line 51 of file VrpModel.h.

+ +
+
+ +

◆ coordz_

+ +
+
+ + + + + +
+ + + + +
double* VrpModel::coordz_
+ 		+private
+
+ +

Definition at line 52 of file VrpModel.h.

+ +
+
+ +

◆ etol_

+ +
+
+ + + + + +
+ + + + +
double VrpModel::etol_
+ 		+private
+
+ +

Definition at line 53 of file VrpModel.h.

+ +
+
+ +

◆ VrpPar_

+ +
+
+ + + + + +
+ + + + +
VrpParams* VrpModel::VrpPar_
+ 		+private
+
+ +

Definition at line 55 of file VrpModel.h.

+ +
+
+ +

◆ n_

+ +
+
+ + + + + +
+ + + + +
VrpNetwork* VrpModel::n_
+ 		+private
+
+ +

Definition at line 56 of file VrpModel.h.

+ +
+
+ +

◆ edges_

+ +
+
+ + + + + +
+ + + + +
std::vector<VrpVariable *> VrpModel::edges_
+ 		+private
+
+ +

Definition at line 60 of file VrpModel.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classVrpModel__coll__graph.map b/Doxygen/0.94/classVrpModel__coll__graph.map new file mode 100644 index 0000000..8441246 --- /dev/null +++ b/Doxygen/0.94/classVrpModel__coll__graph.map @@ -0,0 +1,29 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/classVrpModel__coll__graph.md5 b/Doxygen/0.94/classVrpModel__coll__graph.md5 new file mode 100644 index 0000000..25befb9 --- /dev/null +++ b/Doxygen/0.94/classVrpModel__coll__graph.md5 @@ -0,0 +1 @@ +11d2d14952e746fd3d41a949cad617b9 \ No newline at end of file diff --git a/Doxygen/0.94/classVrpModel__coll__graph.png b/Doxygen/0.94/classVrpModel__coll__graph.png new file mode 100644 index 0000000..7eef467 Binary files /dev/null and b/Doxygen/0.94/classVrpModel__coll__graph.png differ diff --git a/Doxygen/0.94/classVrpModel__inherit__graph.map b/Doxygen/0.94/classVrpModel__inherit__graph.map new file mode 100644 index 0000000..79f407d --- /dev/null +++ b/Doxygen/0.94/classVrpModel__inherit__graph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/classVrpModel__inherit__graph.md5 b/Doxygen/0.94/classVrpModel__inherit__graph.md5 new file mode 100644 index 0000000..81213fd --- /dev/null +++ b/Doxygen/0.94/classVrpModel__inherit__graph.md5 @@ -0,0 +1 @@ +f085b94c46cd97191fbfd73b5da1858b \ No newline at end of file diff --git a/Doxygen/0.94/classVrpModel__inherit__graph.png b/Doxygen/0.94/classVrpModel__inherit__graph.png new file mode 100644 index 0000000..fe49c2c Binary files /dev/null and b/Doxygen/0.94/classVrpModel__inherit__graph.png differ diff --git a/Doxygen/0.94/classVrpNetwork-members.html b/Doxygen/0.94/classVrpNetwork-members.html new file mode 100644 index 0000000..ddce764 --- /dev/null +++ b/Doxygen/0.94/classVrpNetwork-members.html @@ -0,0 +1,107 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
VrpNetwork Member List
+
+
+ +

This is the complete list of members for VrpNetwork, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +
adjList_VrpNetworkprivate
biconnected()VrpNetwork
compCuts_VrpNetworkprivate
compDemands_VrpNetworkprivate
compMembers_VrpNetworkprivate
compNodes_VrpNetworkprivate
computeCompNums(vertex *v, int parent_comp, int *num_comps, bool parent_is_art_point)VrpNetwork
connected()VrpNetwork
createNet(CoinPackedVector *sol, int *demand, std::vector< VrpVariable * > edgeList, double etol, int vertnum)VrpNetwork
depthFirstSearch(vertex *v, int *count1, int *count2)VrpNetwork
edgenum_VrpNetworkprivate
edges_VrpNetworkprivate
gutsOfDestructor()VrpNetwork
isIntegral_VrpNetworkprivate
maxEdgenum_VrpNetworkprivate
mincut_VrpNetworkprivate
newDemand_VrpNetworkprivate
numComps_VrpNetworkprivate
reduce_graph(double etol)VrpNetwork
vertnum_VrpNetworkprivate
verts_VrpNetworkprivate
VrpCutGenerator classVrpNetworkfriend
VrpModel classVrpNetworkfriend
VrpNetwork()VrpNetworkinline
VrpNetwork(int edgenum, int vertnum)VrpNetwork
VrpSolution classVrpNetworkfriend
~VrpNetwork()VrpNetworkinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classVrpNetwork.html b/Doxygen/0.94/classVrpNetwork.html new file mode 100644 index 0000000..15abe17 --- /dev/null +++ b/Doxygen/0.94/classVrpNetwork.html @@ -0,0 +1,850 @@ + + + + + + + +Blis: VrpNetwork Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Private Attributes | +Friends | +List of all members
+
+
VrpNetwork Class Reference
+
+
+ +

#include <VrpNetwork.h>

+
+ + Collaboration diagram for VrpNetwork:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 VrpNetwork ()
 
 VrpNetwork (int edgenum, int vertnum)
 
virtual ~VrpNetwork ()
 
void createNet (CoinPackedVector *sol, int *demand, std::vector< VrpVariable * > edgeList, double etol, int vertnum)
 
void computeCompNums (vertex *v, int parent_comp, int *num_comps, bool parent_is_art_point)
 
void depthFirstSearch (vertex *v, int *count1, int *count2)
 
int connected ()
 
int biconnected ()
 
void reduce_graph (double etol)
 
void gutsOfDestructor ()
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Private Attributes

int edgenum_
 
int maxEdgenum_
 
int vertnum_
 
bool isIntegral_
 
int numComps_
 
struct EDGE * edges_
 
struct VERTEX * verts_
 
double mincut_
 
struct ELIST * adjList_
 
int * compNodes_
 
int * compDemands_
 
double * compCuts_
 
int * compMembers_
 
int * newDemand_
 
+ + + + + + + +

+Friends

class VrpModel
 
class VrpCutGenerator
 
class VrpSolution
 
+

Detailed Description

+
+

Definition at line 80 of file VrpNetwork.h.

+

Constructor & Destructor Documentation

+ +

◆ VrpNetwork() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
VrpNetwork::VrpNetwork ()
+ 		+inline
+
+ +

Definition at line 108 of file VrpNetwork.h.

+ +
+
+ +

◆ VrpNetwork() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + + + +
VrpNetwork::VrpNetwork (int edgenum,
int vertnum 
)
+
+ +
+
+ +

◆ ~VrpNetwork()

+ +
+
+ + + + + +
+ + + + + + + +
virtual VrpNetwork::~VrpNetwork ()
+ 		+inlinevirtual
+
+ +

Definition at line 121 of file VrpNetwork.h.

+ +
+
+

Member Function Documentation

+ +

◆ createNet()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void VrpNetwork::createNet (CoinPackedVector * sol,
int * demand,
std::vector< VrpVariable * > edgeList,
double etol,
int vertnum 
)
+
+ +
+
+ +

◆ computeCompNums()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void VrpNetwork::computeCompNums (vertex * v,
int parent_comp,
int * num_comps,
bool parent_is_art_point 
)
+
+ +
+
+ +

◆ depthFirstSearch()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void VrpNetwork::depthFirstSearch (vertex * v,
int * count1,
int * count2 
)
+
+ +
+
+ +

◆ connected()

+ +
+
+ + + + + + + +
int VrpNetwork::connected ()
+
+ +
+
+ +

◆ biconnected()

+ +
+
+ + + + + + + +
int VrpNetwork::biconnected ()
+
+ +
+
+ +

◆ reduce_graph()

+ +
+
+ + + + + + + + +
void VrpNetwork::reduce_graph (double etol)
+
+ +
+
+ +

◆ gutsOfDestructor()

+ +
+
+ + + + + + + +
void VrpNetwork::gutsOfDestructor ()
+
+ +
+
+

Friends And Related Function Documentation

+ +

◆ VrpModel

+ +
+
+ + + + + +
+ + + + +
friend class VrpModel
+ 		+friend
+
+ +

Definition at line 82 of file VrpNetwork.h.

+ +
+
+ +

◆ VrpCutGenerator

+ +
+
+ + + + + +
+ + + + +
friend class VrpCutGenerator
+ 		+friend
+
+ +

Definition at line 83 of file VrpNetwork.h.

+ +
+
+ +

◆ VrpSolution

+ +
+
+ + + + + +
+ + + + +
friend class VrpSolution
+ 		+friend
+
+ +

Definition at line 84 of file VrpNetwork.h.

+ +
+
+

Member Data Documentation

+ +

◆ edgenum_

+ +
+
+ + + + + +
+ + + + +
int VrpNetwork::edgenum_
+ 		+private
+
+ +

Definition at line 88 of file VrpNetwork.h.

+ +
+
+ +

◆ maxEdgenum_

+ +
+
+ + + + + +
+ + + + +
int VrpNetwork::maxEdgenum_
+ 		+private
+
+ +

Definition at line 89 of file VrpNetwork.h.

+ +
+
+ +

◆ vertnum_

+ +
+
+ + + + + +
+ + + + +
int VrpNetwork::vertnum_
+ 		+private
+
+ +

Definition at line 90 of file VrpNetwork.h.

+ +
+
+ +

◆ isIntegral_

+ +
+
+ + + + + +
+ + + + +
bool VrpNetwork::isIntegral_
+ 		+private
+
+ +

Definition at line 91 of file VrpNetwork.h.

+ +
+
+ +

◆ numComps_

+ +
+
+ + + + + +
+ + + + +
int VrpNetwork::numComps_
+ 		+private
+
+ +

Definition at line 93 of file VrpNetwork.h.

+ +
+
+ +

◆ edges_

+ +
+
+ + + + + +
+ + + + +
struct EDGE* VrpNetwork::edges_
+ 		+private
+
+ +

Definition at line 94 of file VrpNetwork.h.

+ +
+
+ +

◆ verts_

+ +
+
+ + + + + +
+ + + + +
struct VERTEX* VrpNetwork::verts_
+ 		+private
+
+ +

Definition at line 95 of file VrpNetwork.h.

+ +
+
+ +

◆ mincut_

+ +
+
+ + + + + +
+ + + + +
double VrpNetwork::mincut_
+ 		+private
+
+ +

Definition at line 96 of file VrpNetwork.h.

+ +
+
+ +

◆ adjList_

+ +
+
+ + + + + +
+ + + + +
struct ELIST* VrpNetwork::adjList_
+ 		+private
+
+ +

Definition at line 97 of file VrpNetwork.h.

+ +
+
+ +

◆ compNodes_

+ +
+
+ + + + + +
+ + + + +
int* VrpNetwork::compNodes_
+ 		+private
+
+ +

Definition at line 99 of file VrpNetwork.h.

+ +
+
+ +

◆ compDemands_

+ +
+
+ + + + + +
+ + + + +
int* VrpNetwork::compDemands_
+ 		+private
+
+ +

Definition at line 100 of file VrpNetwork.h.

+ +
+
+ +

◆ compCuts_

+ +
+
+ + + + + +
+ + + + +
double* VrpNetwork::compCuts_
+ 		+private
+
+ +

Definition at line 101 of file VrpNetwork.h.

+ +
+
+ +

◆ compMembers_

+ +
+
+ + + + + +
+ + + + +
int* VrpNetwork::compMembers_
+ 		+private
+
+ +

Definition at line 102 of file VrpNetwork.h.

+ +
+
+ +

◆ newDemand_

+ +
+
+ + + + + +
+ + + + +
int* VrpNetwork::newDemand_
+ 		+private
+
+ +

Definition at line 103 of file VrpNetwork.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classVrpNetwork__coll__graph.map b/Doxygen/0.94/classVrpNetwork__coll__graph.map new file mode 100644 index 0000000..6b7664b --- /dev/null +++ b/Doxygen/0.94/classVrpNetwork__coll__graph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/Doxygen/0.94/classVrpNetwork__coll__graph.md5 b/Doxygen/0.94/classVrpNetwork__coll__graph.md5 new file mode 100644 index 0000000..b658f39 --- /dev/null +++ b/Doxygen/0.94/classVrpNetwork__coll__graph.md5 @@ -0,0 +1 @@ +6d6a75c4ba799866a0072a463b979a35 \ No newline at end of file diff --git a/Doxygen/0.94/classVrpNetwork__coll__graph.png b/Doxygen/0.94/classVrpNetwork__coll__graph.png new file mode 100644 index 0000000..ec96cd9 Binary files /dev/null and b/Doxygen/0.94/classVrpNetwork__coll__graph.png differ diff --git a/Doxygen/0.94/classVrpParams-members.html b/Doxygen/0.94/classVrpParams-members.html new file mode 100644 index 0000000..96af4d5 --- /dev/null +++ b/Doxygen/0.94/classVrpParams-members.html @@ -0,0 +1,120 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
VrpParams Member List
+
+
+ +

This is the complete list of members for VrpParams, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
boolParams enum nameVrpParams
createKeywordList()VrpParamsvirtual
dblParams enum nameVrpParams
doExtraInRoot enum valueVrpParams
doGreedy enum valueVrpParams
endOfBoolParams enum valueVrpParams
endOfDblParams enum valueVrpParams
endOfIntParams enum valueVrpParams
endOfStrArrayParams enum valueVrpParams
endOfStrParams enum valueVrpParams
entry(const boolParams key) constVrpParamsinline
entry(const intParams key) constVrpParamsinline
entry(const dblParams key) constVrpParamsinline
entry(const strParams key) constVrpParamsinline
entry(const strArrayParams key) constVrpParamsinline
greedyNumTrials enum valueVrpParams
intParams enum nameVrpParams
maxNumCutsInShrink enum valueVrpParams
numRoutes enum valueVrpParams
pack(AlpsEncoded &buf)VrpParamsinline
setDefaultEntries()VrpParamsvirtual
setEntry(const boolParams key, const char *val)VrpParamsinline
setEntry(const boolParams key, const char val)VrpParamsinline
setEntry(const boolParams key, const bool val)VrpParamsinline
setEntry(const intParams key, const char *val)VrpParamsinline
setEntry(const intParams key, const int val)VrpParamsinline
setEntry(const dblParams key, const char *val)VrpParamsinline
setEntry(const dblParams key, const double val)VrpParamsinline
setEntry(const strParams key, const char *val)VrpParamsinline
setEntry(const strArrayParams key, const char *val)VrpParamsinline
strArrayDummy enum valueVrpParams
strArrayParams enum nameVrpParams
strDummy enum valueVrpParams
strParams enum nameVrpParams
tspProb enum valueVrpParams
unpack(AlpsEncoded &buf)VrpParamsinline
verbosity enum valueVrpParams
VrpParams()VrpParamsinline
whichConnectedRoutine enum valueVrpParams
whichTspCuts enum valueVrpParams
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classVrpParams.html b/Doxygen/0.94/classVrpParams.html new file mode 100644 index 0000000..055df6b --- /dev/null +++ b/Doxygen/0.94/classVrpParams.html @@ -0,0 +1,956 @@ + + + + + + + +Blis: VrpParams Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Types | +List of all members
+
+
VrpParams Class Reference
+
+
+ +

#include <VrpParams.h>

+
+ + Inheritance diagram for VrpParams:
+
+
+ +
+ + Collaboration diagram for VrpParams:
+
+
+ + + + + + + + + + + + + + + + + + +

+Public Types

enum  boolParams { doGreedy, +doExtraInRoot, +tspProb, +endOfBoolParams + }
 Character parameters. More...
 
enum  intParams {
+  numRoutes, +verbosity, +greedyNumTrials, +whichConnectedRoutine, +
+  maxNumCutsInShrink, +whichTspCuts, +endOfIntParams +
+ }
 Integer paramters. More...
 
enum  dblParams { endOfDblParams + }
 Double parameters. More...
 
enum  strParams { strDummy, +endOfStrParams + }
 String parameters. More...
 
enum  strArrayParams { strArrayDummy, +endOfStrArrayParams + }
 There are no string array parameters. More...
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

Constructors.
 VrpParams ()
 The default constructor creates a parameter set with from the template argument structure. More...
 
virtual void createKeywordList ()
 Method for creating the list of keyword looked for in the parameter file. More...
 
virtual void setDefaultEntries ()
 Method for setting the default values for the parameters. More...
 
Query methods

For user application: Following code are do NOT need to change.

+

The reason can not put following functions in base class AlpsParameterSet is that boolParams and endOfboolParams etc., are NOT the same as those declared in base class.

+

The members of the parameter set can be queried for using the overloaded entry() method. Using the example in the class documentation the user can get a parameter with the "<code>param.entry(USER_par::parameter_name)</code>" expression.

+
bool entry (const boolParams key) const
 
int entry (const intParams key) const
 
double entry (const dblParams key) const
 
const std::string & entry (const strParams key) const
 
const std::vector< std::string > & entry (const strArrayParams key) const
 
void setEntry (const boolParams key, const char *val)
 char* is true(1) or false(0), not used More...
 
void setEntry (const boolParams key, const char val)
 char is true(1) or false(0), not used More...
 
void setEntry (const boolParams key, const bool val)
 This method is the one that ever been used. More...
 
void setEntry (const intParams key, const char *val)
 
void setEntry (const intParams key, const int val)
 
void setEntry (const dblParams key, const char *val)
 
void setEntry (const dblParams key, const double val)
 
void setEntry (const strParams key, const char *val)
 
void setEntry (const strArrayParams key, const char *val)
 
Packing/unpacking methods
void pack (AlpsEncoded &buf)
 Pack the parameter set into the buffer (AlpsEncoded is used as buffer Here). More...
 
void unpack (AlpsEncoded &buf)
 Unpack the parameter set from the buffer. More...
 
+

Detailed Description

+
+

Definition at line 24 of file VrpParams.h.

+

Member Enumeration Documentation

+ +

◆ boolParams

+ +
+
+ + + + +
enum VrpParams::boolParams
+
+ +

Character parameters.

+

All of these variable are used as booleans (true = 1, false = 0).

+ + + + + +
Enumerator
doGreedy 
doExtraInRoot 
tspProb 
endOfBoolParams 
+ +

Definition at line 28 of file VrpParams.h.

+ +
+
+ +

◆ intParams

+ +
+
+ + + + +
enum VrpParams::intParams
+
+ +

Integer paramters.

+ + + + + + + + +
Enumerator
numRoutes 
verbosity 
greedyNumTrials 
whichConnectedRoutine 
maxNumCutsInShrink 
whichTspCuts 
endOfIntParams 
+ +

Definition at line 36 of file VrpParams.h.

+ +
+
+ +

◆ dblParams

+ +
+
+ + + + +
enum VrpParams::dblParams
+
+ +

Double parameters.

+ + +
Enumerator
endOfDblParams 
+ +

Definition at line 47 of file VrpParams.h.

+ +
+
+ +

◆ strParams

+ +
+
+ + + + +
enum VrpParams::strParams
+
+ +

String parameters.

+ + + +
Enumerator
strDummy 
endOfStrParams 
+ +

Definition at line 53 of file VrpParams.h.

+ +
+
+ +

◆ strArrayParams

+ +
+
+ + + + +
enum VrpParams::strArrayParams
+
+ +

There are no string array parameters.

+ + + +
Enumerator
strArrayDummy 
endOfStrArrayParams 
+ +

Definition at line 60 of file VrpParams.h.

+ +
+
+

Constructor & Destructor Documentation

+ +

◆ VrpParams()

+ +
+
+ + + + + +
+ + + + + + + +
VrpParams::VrpParams ()
+ 		+inline
+
+ +

The default constructor creates a parameter set with from the template argument structure.

+

The keyword list is created and the defaults are set.

+ +

Definition at line 72 of file VrpParams.h.

+ +
+
+

Member Function Documentation

+ +

◆ createKeywordList()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void VrpParams::createKeywordList ()
+ 		+virtual
+
+ +

Method for creating the list of keyword looked for in the parameter file.

+ +
+
+ +

◆ setDefaultEntries()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void VrpParams::setDefaultEntries ()
+ 		+virtual
+
+ +

Method for setting the default values for the parameters.

+ +
+
+ +

◆ entry() [1/5]

+ +
+
+ + + + + +
+ + + + + + + + +
bool VrpParams::entry (const boolParams key) const
+ 		+inline
+
+ +

Definition at line 115 of file VrpParams.h.

+ +
+
+ +

◆ entry() [2/5]

+ +
+
+ + + + + +
+ + + + + + + + +
int VrpParams::entry (const intParams key) const
+ 		+inline
+
+ +

Definition at line 117 of file VrpParams.h.

+ +
+
+ +

◆ entry() [3/5]

+ +
+
+ + + + + +
+ + + + + + + + +
double VrpParams::entry (const dblParams key) const
+ 		+inline
+
+ +

Definition at line 119 of file VrpParams.h.

+ +
+
+ +

◆ entry() [4/5]

+ +
+
+ + + + + +
+ + + + + + + + +
const std::string& VrpParams::entry (const strParams key) const
+ 		+inline
+
+ +

Definition at line 122 of file VrpParams.h.

+ +
+
+ +

◆ entry() [5/5]

+ +
+
+ + + + + +
+ + + + + + + + +
const std::vector<std::string>& VrpParams::entry (const strArrayParams key) const
+ 		+inline
+
+ +

Definition at line 125 of file VrpParams.h.

+ +
+
+ +

◆ setEntry() [1/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void VrpParams::setEntry (const boolParams key,
const char * val 
)
+ 		+inline
+
+ +

char* is true(1) or false(0), not used

+ +

Definition at line 130 of file VrpParams.h.

+ +
+
+ +

◆ setEntry() [2/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void VrpParams::setEntry (const boolParams key,
const char val 
)
+ 		+inline
+
+ +

char is true(1) or false(0), not used

+ +

Definition at line 133 of file VrpParams.h.

+ +
+
+ +

◆ setEntry() [3/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void VrpParams::setEntry (const boolParams key,
const bool val 
)
+ 		+inline
+
+ +

This method is the one that ever been used.

+ +

Definition at line 136 of file VrpParams.h.

+ +
+
+ +

◆ setEntry() [4/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void VrpParams::setEntry (const intParams key,
const char * val 
)
+ 		+inline
+
+ +

Definition at line 139 of file VrpParams.h.

+ +
+
+ +

◆ setEntry() [5/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void VrpParams::setEntry (const intParams key,
const int val 
)
+ 		+inline
+
+ +

Definition at line 142 of file VrpParams.h.

+ +
+
+ +

◆ setEntry() [6/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void VrpParams::setEntry (const dblParams key,
const char * val 
)
+ 		+inline
+
+ +

Definition at line 145 of file VrpParams.h.

+ +
+
+ +

◆ setEntry() [7/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void VrpParams::setEntry (const dblParams key,
const double val 
)
+ 		+inline
+
+ +

Definition at line 148 of file VrpParams.h.

+ +
+
+ +

◆ setEntry() [8/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void VrpParams::setEntry (const strParams key,
const char * val 
)
+ 		+inline
+
+ +

Definition at line 151 of file VrpParams.h.

+ +
+
+ +

◆ setEntry() [9/9]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void VrpParams::setEntry (const strArrayParams key,
const char * val 
)
+ 		+inline
+
+ +

Definition at line 154 of file VrpParams.h.

+ +
+
+ +

◆ pack()

+ +
+
+ + + + + +
+ + + + + + + + +
void VrpParams::pack (AlpsEncoded & buf)
+ 		+inline
+
+ +

Pack the parameter set into the buffer (AlpsEncoded is used as buffer Here).

+ +

Definition at line 163 of file VrpParams.h.

+ +
+
+ +

◆ unpack()

+ +
+
+ + + + + +
+ + + + + + + + +
void VrpParams::unpack (AlpsEncoded & buf)
+ 		+inline
+
+ +

Unpack the parameter set from the buffer.

+ +

Definition at line 176 of file VrpParams.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classVrpParams__coll__graph.map b/Doxygen/0.94/classVrpParams__coll__graph.map new file mode 100644 index 0000000..20b06f2 --- /dev/null +++ b/Doxygen/0.94/classVrpParams__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classVrpParams__coll__graph.md5 b/Doxygen/0.94/classVrpParams__coll__graph.md5 new file mode 100644 index 0000000..49cfb67 --- /dev/null +++ b/Doxygen/0.94/classVrpParams__coll__graph.md5 @@ -0,0 +1 @@ +d954518b82c9266aa23790e0c5420e74 \ No newline at end of file diff --git a/Doxygen/0.94/classVrpParams__coll__graph.png b/Doxygen/0.94/classVrpParams__coll__graph.png new file mode 100644 index 0000000..134bad8 Binary files /dev/null and b/Doxygen/0.94/classVrpParams__coll__graph.png differ diff --git a/Doxygen/0.94/classVrpParams__inherit__graph.map b/Doxygen/0.94/classVrpParams__inherit__graph.map new file mode 100644 index 0000000..20b06f2 --- /dev/null +++ b/Doxygen/0.94/classVrpParams__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/classVrpParams__inherit__graph.md5 b/Doxygen/0.94/classVrpParams__inherit__graph.md5 new file mode 100644 index 0000000..49cfb67 --- /dev/null +++ b/Doxygen/0.94/classVrpParams__inherit__graph.md5 @@ -0,0 +1 @@ +d954518b82c9266aa23790e0c5420e74 \ No newline at end of file diff --git a/Doxygen/0.94/classVrpParams__inherit__graph.png b/Doxygen/0.94/classVrpParams__inherit__graph.png new file mode 100644 index 0000000..134bad8 Binary files /dev/null and b/Doxygen/0.94/classVrpParams__inherit__graph.png differ diff --git a/Doxygen/0.94/classVrpSolution-members.html b/Doxygen/0.94/classVrpSolution-members.html new file mode 100644 index 0000000..1e8d463 --- /dev/null +++ b/Doxygen/0.94/classVrpSolution-members.html @@ -0,0 +1,91 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
VrpSolution Member List
+
+
+ +

This is the complete list of members for VrpSolution, including all inherited members.

+ + + + + + + + + + + + +
BlisSolution()BlisSolutioninline
BlisSolution(int s, const double *values, double objValue)BlisSolutioninline
decode(AlpsEncoded &encoded) constVrpSolutioninlinevirtual
encode() constVrpSolutioninlinevirtual
opt_VrpSolutionprotected
print(std::ostream &os) constVrpSolutionvirtual
setOpt(_node *opt)VrpSolutioninline
VrpSolution()VrpSolutioninline
VrpSolution(int s, const double *values, double objValue, VrpModel *vrp=0)VrpSolution
~BlisSolution()BlisSolutioninlinevirtual
~VrpSolution()VrpSolutioninlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classVrpSolution.html b/Doxygen/0.94/classVrpSolution.html new file mode 100644 index 0000000..e7b20cb --- /dev/null +++ b/Doxygen/0.94/classVrpSolution.html @@ -0,0 +1,408 @@ + + + + + + + +Blis: VrpSolution Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Protected Attributes | +List of all members
+
+
VrpSolution Class Reference
+
+
+ +

This class contains a vrp solution. + More...

+ +

#include <VrpSolution.h>

+
+ + Inheritance diagram for VrpSolution:
+
+
+ +
+ + Collaboration diagram for VrpSolution:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 VrpSolution ()
 Default constructor. More...
 
 VrpSolution (int s, const double *values, double objValue, VrpModel *vrp=0)
 Useful constructor. More...
 
virtual ~VrpSolution ()
 Destructor. More...
 
void setOpt (_node *opt)
 Set opt. More...
 
virtual void print (std::ostream &os) const
 Print the solution. More...
 
virtual AlpsEncoded * encode () const
 The method that encodes the solution into a encoded object. More...
 
virtual AlpsKnowledge * decode (AlpsEncoded &encoded) const
 The method that decodes the solution from a encoded object. More...
 
- Public Member Functions inherited from BlisSolution
 BlisSolution ()
 Default constructor. More...
 
 BlisSolution (int s, const double *values, double objValue)
 Useful constructor. More...
 
virtual ~BlisSolution ()
 Destructor. More...
 
+ + + +

+Protected Attributes

_node * opt_
 
+

Detailed Description

+

This class contains a vrp solution.

+ +

Definition at line 26 of file VrpSolution.h.

+

Constructor & Destructor Documentation

+ +

◆ VrpSolution() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
VrpSolution::VrpSolution ()
+ 		+inline
+
+ +

Default constructor.

+ +

Definition at line 35 of file VrpSolution.h.

+ +
+
+ +

◆ VrpSolution() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
VrpSolution::VrpSolution (int s,
const double * values,
double objValue,
VrpModel * vrp = 0 
)
+
+ +

Useful constructor.

+ +
+
+ +

◆ ~VrpSolution()

+ +
+
+ + + + + +
+ + + + + + + +
virtual VrpSolution::~VrpSolution ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 42 of file VrpSolution.h.

+ +
+
+

Member Function Documentation

+ +

◆ setOpt()

+ +
+
+ + + + + +
+ + + + + + + + +
void VrpSolution::setOpt (_node * opt)
+ 		+inline
+
+ +

Set opt.

+ +

Definition at line 47 of file VrpSolution.h.

+ +
+
+ +

◆ print()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual void VrpSolution::print (std::ostream & os) const
+ 		+virtual
+
+ +

Print the solution.

+ +

Reimplemented from BlisSolution.

+ +
+
+ +

◆ encode()

+ +
+
+ + + + + +
+ + + + + + + +
virtual AlpsEncoded* VrpSolution::encode () const
+ 		+inlinevirtual
+
+ +

The method that encodes the solution into a encoded object.

+ +

Reimplemented from BlisSolution.

+ +

Definition at line 56 of file VrpSolution.h.

+ +
+
+ +

◆ decode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsKnowledge* VrpSolution::decode (AlpsEncoded & encoded) const
+ 		+inlinevirtual
+
+ +

The method that decodes the solution from a encoded object.

+ +

Reimplemented from BlisSolution.

+ +

Definition at line 76 of file VrpSolution.h.

+ +
+
+

Member Data Documentation

+ +

◆ opt_

+ +
+
+ + + + + +
+ + + + +
_node* VrpSolution::opt_
+ 		+protected
+
+ +

Definition at line 30 of file VrpSolution.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classVrpSolution__coll__graph.map b/Doxygen/0.94/classVrpSolution__coll__graph.map new file mode 100644 index 0000000..5e75c02 --- /dev/null +++ b/Doxygen/0.94/classVrpSolution__coll__graph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/Doxygen/0.94/classVrpSolution__coll__graph.md5 b/Doxygen/0.94/classVrpSolution__coll__graph.md5 new file mode 100644 index 0000000..63af5a7 --- /dev/null +++ b/Doxygen/0.94/classVrpSolution__coll__graph.md5 @@ -0,0 +1 @@ +cc8af35e848d1ea5c6bcbb04a1712b9b \ No newline at end of file diff --git a/Doxygen/0.94/classVrpSolution__coll__graph.png b/Doxygen/0.94/classVrpSolution__coll__graph.png new file mode 100644 index 0000000..171f04b Binary files /dev/null and b/Doxygen/0.94/classVrpSolution__coll__graph.png differ diff --git a/Doxygen/0.94/classVrpSolution__inherit__graph.map b/Doxygen/0.94/classVrpSolution__inherit__graph.map new file mode 100644 index 0000000..d7bcddc --- /dev/null +++ b/Doxygen/0.94/classVrpSolution__inherit__graph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/classVrpSolution__inherit__graph.md5 b/Doxygen/0.94/classVrpSolution__inherit__graph.md5 new file mode 100644 index 0000000..8d8da18 --- /dev/null +++ b/Doxygen/0.94/classVrpSolution__inherit__graph.md5 @@ -0,0 +1 @@ +7b7d174c08a530b5991354853ef7e6d0 \ No newline at end of file diff --git a/Doxygen/0.94/classVrpSolution__inherit__graph.png b/Doxygen/0.94/classVrpSolution__inherit__graph.png new file mode 100644 index 0000000..7a0f73d Binary files /dev/null and b/Doxygen/0.94/classVrpSolution__inherit__graph.png differ diff --git a/Doxygen/0.94/classVrpVariable-members.html b/Doxygen/0.94/classVrpVariable-members.html new file mode 100644 index 0000000..ec0976f --- /dev/null +++ b/Doxygen/0.94/classVrpVariable-members.html @@ -0,0 +1,110 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+
VrpVariable Member List
+
+
+ +

This is the complete list of members for VrpVariable, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
BlisVariable()BlisVariableinline
BlisVariable(double obj, int s, const int *ind, const double *val)BlisVariableinline
BlisVariable(double lbh, double ubh, double lbs, double ubs)BlisVariableinline
BlisVariable(double lbh, double ubh, double lbs, double ubs, double obj, int s, const int *ind, const double *val)BlisVariableinline
decode(AlpsEncoded &encoded) constVrpVariableinlinevirtual
decodeBlis(AlpsEncoded &encoded)BlisVariableinlineprotected
decodeVrp(AlpsEncoded &encoded)VrpVariableinlineprotected
encode(AlpsEncoded *encoded)VrpVariableinlinevirtual
encodeBlis(AlpsEncoded *encoded)BlisVariableinlineprotected
encodeVrp(AlpsEncoded *encoded)VrpVariableinlineprotected
ends_VrpVariableprivate
getIndex()VrpVariableinline
getIndices() constBlisVariableinline
getObjCoef()BlisVariableinline
getSize() constBlisVariableinline
getv0()VrpVariableinline
getv1()VrpVariableinline
getValues()BlisVariableinline
indices_BlisVariableprivate
objCoef_BlisVariableprivate
printDesc()VrpVariableinlinevirtual
setData(int s, const int *ind, const double *val)BlisVariableinline
setObjCoef(double coef)BlisVariableinline
size_BlisVariableprivate
uind_VrpVariableprivate
values_BlisVariableprivate
VrpVariable()VrpVariableinline
VrpVariable(int v1, int v2, int cost, int ub)VrpVariableinline
~BlisVariable()BlisVariableinlinevirtual
~VrpVariable()VrpVariableinlinevirtual
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classVrpVariable.html b/Doxygen/0.94/classVrpVariable.html new file mode 100644 index 0000000..37fe9a9 --- /dev/null +++ b/Doxygen/0.94/classVrpVariable.html @@ -0,0 +1,594 @@ + + + + + + + +Blis: VrpVariable Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ +
+
+
+Public Member Functions | +Protected Member Functions | +Private Attributes | +List of all members
+
+
VrpVariable Class Reference
+
+
+ +

Variable class for VRP. + More...

+ +

#include <VrpVariable.h>

+
+ + Inheritance diagram for VrpVariable:
+
+
+ +
+ + Collaboration diagram for VrpVariable:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 VrpVariable ()
 Default constructor. More...
 
 VrpVariable (int v1, int v2, int cost, int ub)
 Useful constructor. More...
 
virtual ~VrpVariable ()
 Destructor. More...
 
virtual void printDesc ()
 
virtual AlpsReturnStatus encode (AlpsEncoded *encoded)
 Pack to a encode object. More...
 
virtual AlpsKnowledge * decode (AlpsEncoded &encoded) const
 Decode a variable from an encoded object. More...
 
int getIndex ()
 Get data
+ More...
 
int getv0 ()
 
int getv1 ()
 
- Public Member Functions inherited from BlisVariable
 BlisVariable ()
 
 BlisVariable (double obj, int s, const int *ind, const double *val)
 
 BlisVariable (double lbh, double ubh, double lbs, double ubs)
 
 BlisVariable (double lbh, double ubh, double lbs, double ubs, double obj, int s, const int *ind, const double *val)
 
virtual ~BlisVariable ()
 
double getObjCoef ()
 Return data
+ More...
 
int getSize () const
 
int * getIndices () const
 
double * getValues ()
 
void setData (int s, const int *ind, const double *val)
 Set data
+ More...
 
void setObjCoef (double coef)
 
+ + + + + + + + + + + + + + +

+Protected Member Functions

AlpsReturnStatus encodeVrp (AlpsEncoded *encoded)
 Pack Vrp part into an encoded object. More...
 
AlpsReturnStatus decodeVrp (AlpsEncoded &encoded)
 Unpack Vrp part from a encode object. More...
 
- Protected Member Functions inherited from BlisVariable
AlpsReturnStatus encodeBlis (AlpsEncoded *encoded)
 Pack Blis part into an encoded object. More...
 
AlpsReturnStatus decodeBlis (AlpsEncoded &encoded)
 Unpack Blis part from a encode object. More...
 
+ + + + + +

+Private Attributes

int ends_ [2]
 
int uind_
 
+

Detailed Description

+

Variable class for VRP.

+ +

Definition at line 25 of file VrpVariable.h.

+

Constructor & Destructor Documentation

+ +

◆ VrpVariable() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
VrpVariable::VrpVariable ()
+ 		+inline
+
+ +

Default constructor.

+ +

Definition at line 64 of file VrpVariable.h.

+ +
+
+ +

◆ VrpVariable() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
VrpVariable::VrpVariable (int v1,
int v2,
int cost,
int ub 
)
+ 		+inline
+
+ +

Useful constructor.

+ +

Definition at line 70 of file VrpVariable.h.

+ +
+
+ +

◆ ~VrpVariable()

+ +
+
+ + + + + +
+ + + + + + + +
virtual VrpVariable::~VrpVariable ()
+ 		+inlinevirtual
+
+ +

Destructor.

+ +

Definition at line 87 of file VrpVariable.h.

+ +
+
+

Member Function Documentation

+ +

◆ encodeVrp()

+ +
+
+ + + + + +
+ + + + + + + + +
AlpsReturnStatus VrpVariable::encodeVrp (AlpsEncoded * encoded)
+ 		+inlineprotected
+
+ +

Pack Vrp part into an encoded object.

+ +

Definition at line 36 of file VrpVariable.h.

+ +
+
+ +

◆ decodeVrp()

+ +
+
+ + + + + +
+ + + + + + + + +
AlpsReturnStatus VrpVariable::decodeVrp (AlpsEncoded & encoded)
+ 		+inlineprotected
+
+ +

Unpack Vrp part from a encode object.

+ +

Definition at line 49 of file VrpVariable.h.

+ +
+
+ +

◆ getIndex()

+ +
+
+ + + + + +
+ + + + + + + +
int VrpVariable::getIndex ()
+ 		+inline
+
+ +

Get data
+

+ +

Definition at line 93 of file VrpVariable.h.

+ +
+
+ +

◆ getv0()

+ +
+
+ + + + + +
+ + + + + + + +
int VrpVariable::getv0 ()
+ 		+inline
+
+ +

Definition at line 94 of file VrpVariable.h.

+ +
+
+ +

◆ getv1()

+ +
+
+ + + + + +
+ + + + + + + +
int VrpVariable::getv1 ()
+ 		+inline
+
+ +

Definition at line 95 of file VrpVariable.h.

+ +
+
+ +

◆ printDesc()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void VrpVariable::printDesc ()
+ 		+inlinevirtual
+
+ +

Definition at line 98 of file VrpVariable.h.

+ +
+
+ +

◆ encode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsReturnStatus VrpVariable::encode (AlpsEncoded * encoded)
+ 		+inlinevirtual
+
+ +

Pack to a encode object.

+ +

Reimplemented from BlisVariable.

+ +

Definition at line 103 of file VrpVariable.h.

+ +
+
+ +

◆ decode()

+ +
+
+ + + + + +
+ + + + + + + + +
virtual AlpsKnowledge* VrpVariable::decode (AlpsEncoded & encoded) const
+ 		+inlinevirtual
+
+ +

Decode a variable from an encoded object.

+ +

Reimplemented from BlisVariable.

+ +

Definition at line 114 of file VrpVariable.h.

+ +
+
+

Member Data Documentation

+ +

◆ ends_

+ +
+
+ + + + + +
+ + + + +
int VrpVariable::ends_[2]
+ 		+private
+
+ +

Definition at line 30 of file VrpVariable.h.

+ +
+
+ +

◆ uind_

+ +
+
+ + + + + +
+ + + + +
int VrpVariable::uind_
+ 		+private
+
+ +

Definition at line 31 of file VrpVariable.h.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/classVrpVariable__coll__graph.map b/Doxygen/0.94/classVrpVariable__coll__graph.map new file mode 100644 index 0000000..afd93c3 --- /dev/null +++ b/Doxygen/0.94/classVrpVariable__coll__graph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/classVrpVariable__coll__graph.md5 b/Doxygen/0.94/classVrpVariable__coll__graph.md5 new file mode 100644 index 0000000..1d43c3e --- /dev/null +++ b/Doxygen/0.94/classVrpVariable__coll__graph.md5 @@ -0,0 +1 @@ +170691046ffd0d24e9ab5c64c333def1 \ No newline at end of file diff --git a/Doxygen/0.94/classVrpVariable__coll__graph.png b/Doxygen/0.94/classVrpVariable__coll__graph.png new file mode 100644 index 0000000..5af4bca Binary files /dev/null and b/Doxygen/0.94/classVrpVariable__coll__graph.png differ diff --git a/Doxygen/0.94/classVrpVariable__inherit__graph.map b/Doxygen/0.94/classVrpVariable__inherit__graph.map new file mode 100644 index 0000000..afd93c3 --- /dev/null +++ b/Doxygen/0.94/classVrpVariable__inherit__graph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/classVrpVariable__inherit__graph.md5 b/Doxygen/0.94/classVrpVariable__inherit__graph.md5 new file mode 100644 index 0000000..1d43c3e --- /dev/null +++ b/Doxygen/0.94/classVrpVariable__inherit__graph.md5 @@ -0,0 +1 @@ +170691046ffd0d24e9ab5c64c333def1 \ No newline at end of file diff --git a/Doxygen/0.94/classVrpVariable__inherit__graph.png b/Doxygen/0.94/classVrpVariable__inherit__graph.png new file mode 100644 index 0000000..5af4bca Binary files /dev/null and b/Doxygen/0.94/classVrpVariable__inherit__graph.png differ diff --git a/Doxygen/0.94/classes.html b/Doxygen/0.94/classes.html new file mode 100644 index 0000000..6e0d7b4 --- /dev/null +++ b/Doxygen/0.94/classes.html @@ -0,0 +1,150 @@ + + + + + + + +Blis: Class Index + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
+
Class Index
+
+
+
_ | b | e | r | s | v
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
  _  
+		BlisMessage   
  s  
+
BlisModel   
_NODE   BlisNodeDesc   SMALL_GRAPH   
  b  
+		BlisObjectInt   
  v  
+
BlisParams   
BEST_TOURS   BlisPresolve   VERTEX   
BlisBranchObjectBilevel   BlisPseudocost   VrpCutGenerator   
BlisBranchObjectInt   BlisSolution   VrpHeurTSP   
BlisBranchStrategyBilevel   BlisStrong   VrpModel   
BlisBranchStrategyMaxInf   BlisTreeNode   VrpNetwork   
BlisBranchStrategyPseudo   BlisVariable   VrpParams   
BlisBranchStrategyRel   
  e  
+		VrpSolution   
BlisBranchStrategyStrong   VrpVariable   
BlisConGenerator   EDGE   
BlisConstraint   EDGE_DATA   
BlisHeuristic   ELIST   
BlisHeurRound   
  r  
+
ROUTE_DATA   
+
_ | b | e | r | s | v
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/closed.png b/Doxygen/0.94/closed.png new file mode 100644 index 0000000..98cc2c9 Binary files /dev/null and b/Doxygen/0.94/closed.png differ diff --git a/Doxygen/0.94/config_8h.html b/Doxygen/0.94/config_8h.html new file mode 100644 index 0000000..a181e81 --- /dev/null +++ b/Doxygen/0.94/config_8h.html @@ -0,0 +1,558 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/tmp_doxygen/Blis/src/config.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Macros
+
+
config.h File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Macros

#define BLIS_VERSION   "0.94.12"
 
#define BLIS_VERSION_MAJOR   0
 
#define BLIS_VERSION_MINOR   94
 
#define BLIS_VERSION_RELEASE   12
 
#define COIN_BLIS_CHECKLEVEL   0
 
#define COIN_BLIS_VERBOSITY   0
 
#define COIN_HAS_COINDEPEND   1
 
#define COIN_HAS_SAMPLE   1
 
#define HAVE_DLFCN_H   1
 
#define HAVE_INTTYPES_H   1
 
#define HAVE_MEMORY_H   1
 
#define HAVE_STDINT_H   1
 
#define HAVE_STDLIB_H   1
 
#define HAVE_STRINGS_H   1
 
#define HAVE_STRING_H   1
 
#define HAVE_SYS_STAT_H   1
 
#define HAVE_SYS_TYPES_H   1
 
#define HAVE_UNISTD_H   1
 
#define PACKAGE   "blis"
 
#define PACKAGE_BUGREPORT   "https://github.com/coin-or/CHiPPS-BLIS/issues/new"
 
#define PACKAGE_NAME   "Blis"
 
#define PACKAGE_STRING   "Blis 0.94.12"
 
#define PACKAGE_TARNAME   "blis"
 
#define PACKAGE_VERSION   "0.94.12"
 
#define STDC_HEADERS   1
 
#define VERSION   "0.94.12"
 
+

Macro Definition Documentation

+ +

◆ BLIS_VERSION

+ +
+
+ + + + +
#define BLIS_VERSION   "0.94.12"
+
+ +

Definition at line 8 of file config.h.

+ +
+
+ +

◆ BLIS_VERSION_MAJOR

+ +
+
+ + + + +
#define BLIS_VERSION_MAJOR   0
+
+ +

Definition at line 11 of file config.h.

+ +
+
+ +

◆ BLIS_VERSION_MINOR

+ +
+
+ + + + +
#define BLIS_VERSION_MINOR   94
+
+ +

Definition at line 14 of file config.h.

+ +
+
+ +

◆ BLIS_VERSION_RELEASE

+ +
+
+ + + + +
#define BLIS_VERSION_RELEASE   12
+
+ +

Definition at line 17 of file config.h.

+ +
+
+ +

◆ COIN_BLIS_CHECKLEVEL

+ +
+
+ + + + +
#define COIN_BLIS_CHECKLEVEL   0
+
+ +

Definition at line 20 of file config.h.

+ +
+
+ +

◆ COIN_BLIS_VERBOSITY

+ +
+
+ + + + +
#define COIN_BLIS_VERBOSITY   0
+
+ +

Definition at line 23 of file config.h.

+ +
+
+ +

◆ COIN_HAS_COINDEPEND

+ +
+
+ + + + +
#define COIN_HAS_COINDEPEND   1
+
+ +

Definition at line 26 of file config.h.

+ +
+
+ +

◆ COIN_HAS_SAMPLE

+ +
+
+ + + + +
#define COIN_HAS_SAMPLE   1
+
+ +

Definition at line 29 of file config.h.

+ +
+
+ +

◆ HAVE_DLFCN_H

+ +
+
+ + + + +
#define HAVE_DLFCN_H   1
+
+ +

Definition at line 32 of file config.h.

+ +
+
+ +

◆ HAVE_INTTYPES_H

+ +
+
+ + + + +
#define HAVE_INTTYPES_H   1
+
+ +

Definition at line 35 of file config.h.

+ +
+
+ +

◆ HAVE_MEMORY_H

+ +
+
+ + + + +
#define HAVE_MEMORY_H   1
+
+ +

Definition at line 38 of file config.h.

+ +
+
+ +

◆ HAVE_STDINT_H

+ +
+
+ + + + +
#define HAVE_STDINT_H   1
+
+ +

Definition at line 41 of file config.h.

+ +
+
+ +

◆ HAVE_STDLIB_H

+ +
+
+ + + + +
#define HAVE_STDLIB_H   1
+
+ +

Definition at line 44 of file config.h.

+ +
+
+ +

◆ HAVE_STRINGS_H

+ +
+
+ + + + +
#define HAVE_STRINGS_H   1
+
+ +

Definition at line 47 of file config.h.

+ +
+
+ +

◆ HAVE_STRING_H

+ +
+
+ + + + +
#define HAVE_STRING_H   1
+
+ +

Definition at line 50 of file config.h.

+ +
+
+ +

◆ HAVE_SYS_STAT_H

+ +
+
+ + + + +
#define HAVE_SYS_STAT_H   1
+
+ +

Definition at line 53 of file config.h.

+ +
+
+ +

◆ HAVE_SYS_TYPES_H

+ +
+
+ + + + +
#define HAVE_SYS_TYPES_H   1
+
+ +

Definition at line 56 of file config.h.

+ +
+
+ +

◆ HAVE_UNISTD_H

+ +
+
+ + + + +
#define HAVE_UNISTD_H   1
+
+ +

Definition at line 59 of file config.h.

+ +
+
+ +

◆ PACKAGE

+ +
+
+ + + + +
#define PACKAGE   "blis"
+
+ +

Definition at line 62 of file config.h.

+ +
+
+ +

◆ PACKAGE_BUGREPORT

+ +
+
+ + + + +
#define PACKAGE_BUGREPORT   "https://github.com/coin-or/CHiPPS-BLIS/issues/new"
+
+ +

Definition at line 65 of file config.h.

+ +
+
+ +

◆ PACKAGE_NAME

+ +
+
+ + + + +
#define PACKAGE_NAME   "Blis"
+
+ +

Definition at line 68 of file config.h.

+ +
+
+ +

◆ PACKAGE_STRING

+ +
+
+ + + + +
#define PACKAGE_STRING   "Blis 0.94.12"
+
+ +

Definition at line 71 of file config.h.

+ +
+
+ +

◆ PACKAGE_TARNAME

+ +
+
+ + + + +
#define PACKAGE_TARNAME   "blis"
+
+ +

Definition at line 74 of file config.h.

+ +
+
+ +

◆ PACKAGE_VERSION

+ +
+
+ + + + +
#define PACKAGE_VERSION   "0.94.12"
+
+ +

Definition at line 77 of file config.h.

+ +
+
+ +

◆ STDC_HEADERS

+ +
+
+ + + + +
#define STDC_HEADERS   1
+
+ +

Definition at line 80 of file config.h.

+ +
+
+ +

◆ VERSION

+ +
+
+ + + + +
#define VERSION   "0.94.12"
+
+ +

Definition at line 83 of file config.h.

+ +
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/config_8h_source.html b/Doxygen/0.94/config_8h_source.html new file mode 100644 index 0000000..202da13 --- /dev/null +++ b/Doxygen/0.94/config_8h_source.html @@ -0,0 +1,164 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/tmp_doxygen/Blis/src/config.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
config.h
+
+
+Go to the documentation of this file.
1 /* src/config.h. Generated by configure. */
+
2 /* src/config.h.in. Generated from configure.ac by autoheader. */
+
3 
+
4 /* SVN revision number of project */
+
5 /* #undef BLIS_SVN_REV */
+
6 
+
7 /* Version number of project */
+
8 #define BLIS_VERSION "0.94.12"
+
9 
+
10 /* Major Version number of project */
+
11 #define BLIS_VERSION_MAJOR 0
+
12 
+
13 /* Minor Version number of project */
+
14 #define BLIS_VERSION_MINOR 94
+
15 
+
16 /* Release Version number of project */
+
17 #define BLIS_VERSION_RELEASE 12
+
18 
+
19 /* Define to the debug sanity check level (0 is no test) */
+
20 #define COIN_BLIS_CHECKLEVEL 0
+
21 
+
22 /* Define to the debug verbosity level (0 is no output) */
+
23 #define COIN_BLIS_VERBOSITY 0
+
24 
+
25 /* Define to 1 if the CoinDepend package is available */
+
26 #define COIN_HAS_COINDEPEND 1
+
27 
+
28 /* Define to 1 if the Sample package is available */
+
29 #define COIN_HAS_SAMPLE 1
+
30 
+
31 /* Define to 1 if you have the <dlfcn.h> header file. */
+
32 #define HAVE_DLFCN_H 1
+
33 
+
34 /* Define to 1 if you have the <inttypes.h> header file. */
+
35 #define HAVE_INTTYPES_H 1
+
36 
+
37 /* Define to 1 if you have the <memory.h> header file. */
+
38 #define HAVE_MEMORY_H 1
+
39 
+
40 /* Define to 1 if you have the <stdint.h> header file. */
+
41 #define HAVE_STDINT_H 1
+
42 
+
43 /* Define to 1 if you have the <stdlib.h> header file. */
+
44 #define HAVE_STDLIB_H 1
+
45 
+
46 /* Define to 1 if you have the <strings.h> header file. */
+
47 #define HAVE_STRINGS_H 1
+
48 
+
49 /* Define to 1 if you have the <string.h> header file. */
+
50 #define HAVE_STRING_H 1
+
51 
+
52 /* Define to 1 if you have the <sys/stat.h> header file. */
+
53 #define HAVE_SYS_STAT_H 1
+
54 
+
55 /* Define to 1 if you have the <sys/types.h> header file. */
+
56 #define HAVE_SYS_TYPES_H 1
+
57 
+
58 /* Define to 1 if you have the <unistd.h> header file. */
+
59 #define HAVE_UNISTD_H 1
+
60 
+
61 /* Name of package */
+
62 #define PACKAGE "blis"
+
63 
+
64 /* Define to the address where bug reports for this package should be sent. */
+
65 #define PACKAGE_BUGREPORT "https://github.com/coin-or/CHiPPS-BLIS/issues/new"
+
66 
+
67 /* Define to the full name of this package. */
+
68 #define PACKAGE_NAME "Blis"
+
69 
+
70 /* Define to the full name and version of this package. */
+
71 #define PACKAGE_STRING "Blis 0.94.12"
+
72 
+
73 /* Define to the one symbol short name of this package. */
+
74 #define PACKAGE_TARNAME "blis"
+
75 
+
76 /* Define to the version of this package. */
+
77 #define PACKAGE_VERSION "0.94.12"
+
78 
+
79 /* Define to 1 if you have the ANSI C header files. */
+
80 #define STDC_HEADERS 1
+
81 
+
82 /* Version number of package */
+
83 #define VERSION "0.94.12"
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/config__blis_8h.html b/Doxygen/0.94/config__blis_8h.html new file mode 100644 index 0000000..f004413 --- /dev/null +++ b/Doxygen/0.94/config__blis_8h.html @@ -0,0 +1,162 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/tmp_doxygen/Blis/src/config_blis.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Macros
+
+
config_blis.h File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + + + +

+Macros

#define BLIS_VERSION   "0.94.12"
 
#define BLIS_VERSION_MAJOR   0
 
#define BLIS_VERSION_MINOR   94
 
#define BLIS_VERSION_RELEASE   12
 
+

Macro Definition Documentation

+ +

◆ BLIS_VERSION

+ +
+
+ + + + +
#define BLIS_VERSION   "0.94.12"
+
+ +

Definition at line 29 of file config_blis.h.

+ +
+
+ +

◆ BLIS_VERSION_MAJOR

+ +
+
+ + + + +
#define BLIS_VERSION_MAJOR   0
+
+ +

Definition at line 32 of file config_blis.h.

+ +
+
+ +

◆ BLIS_VERSION_MINOR

+ +
+
+ + + + +
#define BLIS_VERSION_MINOR   94
+
+ +

Definition at line 35 of file config_blis.h.

+ +
+
+ +

◆ BLIS_VERSION_RELEASE

+ +
+
+ + + + +
#define BLIS_VERSION_RELEASE   12
+
+ +

Definition at line 38 of file config_blis.h.

+ +
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/config__blis_8h_source.html b/Doxygen/0.94/config__blis_8h_source.html new file mode 100644 index 0000000..2ecc553 --- /dev/null +++ b/Doxygen/0.94/config__blis_8h_source.html @@ -0,0 +1,124 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/tmp_doxygen/Blis/src/config_blis.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
config_blis.h
+
+
+Go to the documentation of this file.
1 /* src/config_blis.h. Generated by configure. */
+
2 /*===========================================================================*
+
3  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
4  * *
+
5  * BLIS is distributed under the Eclipse Public License as part of the *
+
6  * COIN-OR repository (http://www.coin-or.org). *
+
7  * *
+
8  * Authors: *
+
9  * *
+
10  * Yan Xu, Lehigh University *
+
11  * Ted Ralphs, Lehigh University *
+
12  * *
+
13  * Conceptual Design: *
+
14  * *
+
15  * Yan Xu, Lehigh University *
+
16  * Ted Ralphs, Lehigh University *
+
17  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
18  * Matthew Saltzman, Clemson University *
+
19  * *
+
20  * *
+
21  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
22  * All Rights Reserved. *
+
23  *===========================================================================*/
+
24 
+
25 #ifndef __CONFIG_BLIS_H__
+
26 #define __CONFIG_BLIS_H__
+
27 
+
28 /* Version number of project */
+
29 #define BLIS_VERSION "0.94.12"
+
30 
+
31 /* Major Version number of project */
+
32 #define BLIS_VERSION_MAJOR 0
+
33 
+
34 /* Minor Version number of project */
+
35 #define BLIS_VERSION_MINOR 94
+
36 
+
37 /* Release Version number of project */
+
38 #define BLIS_VERSION_RELEASE 12
+
39 
+
40 /* SVN revision of project */
+
41 /* #undef BLIS_SVN_REV */
+
42 
+
43 #endif
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/config__blis__default_8h.html b/Doxygen/0.94/config__blis__default_8h.html new file mode 100644 index 0000000..4cd5f1f --- /dev/null +++ b/Doxygen/0.94/config__blis__default_8h.html @@ -0,0 +1,193 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/config_blis_default.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Macros
+
+
config_blis_default.h File Reference
+
+
+
+ + This graph shows which files directly or indirectly include this file:
+
+
+ +
+

Go to the source code of this file.

+ + + + + + + + + + +

+Macros

#define BLIS_VERSION   "trunk"
 
#define BLIS_VERSION_MAJOR   9999
 
#define BLIS_VERSION_MINOR   9999
 
#define BLIS_VERSION_RELEASE   9999
 
+

Macro Definition Documentation

+ +

◆ BLIS_VERSION

+ +
+
+ + + + +
#define BLIS_VERSION   "trunk"
+
+ +

Definition at line 30 of file config_blis_default.h.

+ +
+
+ +

◆ BLIS_VERSION_MAJOR

+ +
+
+ + + + +
#define BLIS_VERSION_MAJOR   9999
+
+ +

Definition at line 33 of file config_blis_default.h.

+ +
+
+ +

◆ BLIS_VERSION_MINOR

+ +
+
+ + + + +
#define BLIS_VERSION_MINOR   9999
+
+ +

Definition at line 36 of file config_blis_default.h.

+ +
+
+ +

◆ BLIS_VERSION_RELEASE

+ +
+
+ + + + +
#define BLIS_VERSION_RELEASE   9999
+
+ +

Definition at line 39 of file config_blis_default.h.

+ +
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/config__blis__default_8h__dep__incl.map b/Doxygen/0.94/config__blis__default_8h__dep__incl.map new file mode 100644 index 0000000..b5bd533 --- /dev/null +++ b/Doxygen/0.94/config__blis__default_8h__dep__incl.map @@ -0,0 +1,24 @@ + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/config__blis__default_8h__dep__incl.md5 b/Doxygen/0.94/config__blis__default_8h__dep__incl.md5 new file mode 100644 index 0000000..8ff5675 --- /dev/null +++ b/Doxygen/0.94/config__blis__default_8h__dep__incl.md5 @@ -0,0 +1 @@ +2e775f644f51b807f9eb1024a7ae8574 \ No newline at end of file diff --git a/Doxygen/0.94/config__blis__default_8h__dep__incl.png b/Doxygen/0.94/config__blis__default_8h__dep__incl.png new file mode 100644 index 0000000..e7a4a6b Binary files /dev/null and b/Doxygen/0.94/config__blis__default_8h__dep__incl.png differ diff --git a/Doxygen/0.94/config__blis__default_8h_source.html b/Doxygen/0.94/config__blis__default_8h_source.html new file mode 100644 index 0000000..08c942d --- /dev/null +++ b/Doxygen/0.94/config__blis__default_8h_source.html @@ -0,0 +1,121 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/config_blis_default.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
config_blis_default.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 /***************************************************************************/
+
25 /* HERE DEFINE THE PROJECT SPECIFIC PUBLIC MACROS */
+
26 /* These are only in effect in a setting that doesn't use configure */
+
27 /***************************************************************************/
+
28 
+
29 /* Version number of project */
+
30 #define BLIS_VERSION "trunk"
+
31 
+
32 /* Major Version number of project */
+
33 #define BLIS_VERSION_MAJOR 9999
+
34 
+
35 /* Minor Version number of project */
+
36 #define BLIS_VERSION_MINOR 9999
+
37 
+
38 /* Release Version number of project */
+
39 #define BLIS_VERSION_RELEASE 9999
+
40 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/config__default_8h.html b/Doxygen/0.94/config__default_8h.html new file mode 100644 index 0000000..9341ba6 --- /dev/null +++ b/Doxygen/0.94/config__default_8h.html @@ -0,0 +1,230 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/config_default.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Macros
+
+
config_default.h File Reference
+
+
+
#include "configall_system.h"
+#include "config_blis_default.h"
+
+ + Include dependency graph for config_default.h:
+
+
+ +
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + +

+Macros

#define COIN_BLIS_CHECKLEVEL   0
 
#define COIN_BLIS_VERBOSITY   0
 
#define COIN_HAS_ALPS   1
 
#define COIN_HAS_BCPS   1
 
#define COIN_HAS_BLIS   1
 
#define COIN_HAS_COINUTILS   1
 
#define COIN_HAS_CLP   1
 
+

Macro Definition Documentation

+ +

◆ COIN_BLIS_CHECKLEVEL

+ +
+
+ + + + +
#define COIN_BLIS_CHECKLEVEL   0
+
+ +

Definition at line 36 of file config_default.h.

+ +
+
+ +

◆ COIN_BLIS_VERBOSITY

+ +
+
+ + + + +
#define COIN_BLIS_VERBOSITY   0
+
+ +

Definition at line 39 of file config_default.h.

+ +
+
+ +

◆ COIN_HAS_ALPS

+ +
+
+ + + + +
#define COIN_HAS_ALPS   1
+
+ +

Definition at line 42 of file config_default.h.

+ +
+
+ +

◆ COIN_HAS_BCPS

+ +
+
+ + + + +
#define COIN_HAS_BCPS   1
+
+ +

Definition at line 45 of file config_default.h.

+ +
+
+ +

◆ COIN_HAS_BLIS

+ +
+
+ + + + +
#define COIN_HAS_BLIS   1
+
+ +

Definition at line 48 of file config_default.h.

+ +
+
+ +

◆ COIN_HAS_COINUTILS

+ +
+
+ + + + +
#define COIN_HAS_COINUTILS   1
+
+ +

Definition at line 51 of file config_default.h.

+ +
+
+ +

◆ COIN_HAS_CLP

+ +
+
+ + + + +
#define COIN_HAS_CLP   1
+
+ +

Definition at line 54 of file config_default.h.

+ +
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/config__default_8h__incl.map b/Doxygen/0.94/config__default_8h__incl.map new file mode 100644 index 0000000..4821fae --- /dev/null +++ b/Doxygen/0.94/config__default_8h__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/config__default_8h__incl.md5 b/Doxygen/0.94/config__default_8h__incl.md5 new file mode 100644 index 0000000..27b1a51 --- /dev/null +++ b/Doxygen/0.94/config__default_8h__incl.md5 @@ -0,0 +1 @@ +71ab7445d721742cfca8199eb1f321f7 \ No newline at end of file diff --git a/Doxygen/0.94/config__default_8h__incl.png b/Doxygen/0.94/config__default_8h__incl.png new file mode 100644 index 0000000..f895816 Binary files /dev/null and b/Doxygen/0.94/config__default_8h__incl.png differ diff --git a/Doxygen/0.94/config__default_8h_source.html b/Doxygen/0.94/config__default_8h_source.html new file mode 100644 index 0000000..de541cd --- /dev/null +++ b/Doxygen/0.94/config__default_8h_source.html @@ -0,0 +1,136 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src/config_default.h Source File + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
config_default.h
+
+
+Go to the documentation of this file.
1 /*===========================================================================*
+
2  * This file is part of the BiCePS Linear Integer Solver (BLIS). *
+
3  * *
+
4  * BLIS is distributed under the Eclipse Public License as part of the *
+
5  * COIN-OR repository (http://www.coin-or.org). *
+
6  * *
+
7  * Authors: *
+
8  * *
+
9  * Yan Xu, Lehigh University *
+
10  * Ted Ralphs, Lehigh University *
+
11  * *
+
12  * Conceptual Design: *
+
13  * *
+
14  * Yan Xu, Lehigh University *
+
15  * Ted Ralphs, Lehigh University *
+
16  * Laszlo Ladanyi, IBM T.J. Watson Research Center *
+
17  * Matthew Saltzman, Clemson University *
+
18  * *
+
19  * *
+
20  * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
+
21  * All Rights Reserved. *
+
22  *===========================================================================*/
+
23 
+
24 /* include the COIN-wide system specific configure header */
+
25 #include "configall_system.h"
+
26 
+
27 /* include the public project specific macros */
+
28 #include "config_blis_default.h"
+
29 
+
30 /***************************************************************************/
+
31 /* HERE DEFINE THE PROJECT SPECIFIC MACROS */
+
32 /* These are only in effect in a setting that doesn't use configure */
+
33 /***************************************************************************/
+
34 
+
35 /* Define to the debug sanity check level (0 is no test) */
+
36 #define COIN_BLIS_CHECKLEVEL 0
+
37 
+
38 /* Define to the debug verbosity level (0 is no output) */
+
39 #define COIN_BLIS_VERBOSITY 0
+
40 
+
41 /* Define to 1 if the ALPS package is used */
+
42 #define COIN_HAS_ALPS 1
+
43 
+
44 /* Define to 1 if the BiCePS package is used */
+
45 #define COIN_HAS_BCPS 1
+
46 
+
47 /* Define to 1 if the Blis package is used */
+
48 #define COIN_HAS_BLIS 1
+
49 
+
50 /* Define to 1 if the CoinUtils package is used */
+
51 #define COIN_HAS_COINUTILS 1
+
52 
+
53 /* Define to 1 if the Clp package is used */
+
54 #define COIN_HAS_CLP 1
+
+
config_blis_default.h
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/dir_000001_000003.html b/Doxygen/0.94/dir_000001_000003.html new file mode 100644 index 0000000..2d39811 --- /dev/null +++ b/Doxygen/0.94/dir_000001_000003.html @@ -0,0 +1,77 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples -> src Relation + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+

examples → src Relation

File in Blis/examplesIncludes file in Blis/src
VRP / VrpCutGenerator.hBlisConGenerator.h
VRP / VrpHeurTSP.hBlisHeuristic.h
VRP / VrpModel.hBlisModel.h
VRP / VrpSolution.hBlisSolution.h
VRP / VrpVariable.hBlisVariable.h
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/dir_000002_000003.html b/Doxygen/0.94/dir_000002_000003.html new file mode 100644 index 0000000..f80e221 --- /dev/null +++ b/Doxygen/0.94/dir_000002_000003.html @@ -0,0 +1,77 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP -> src Relation + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+

VRP → src Relation

File in Blis/examples/VRPIncludes file in Blis/src
VrpCutGenerator.hBlisConGenerator.h
VrpHeurTSP.hBlisHeuristic.h
VrpModel.hBlisModel.h
VrpSolution.hBlisSolution.h
VrpVariable.hBlisVariable.h
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/dir_554b7a2569cf28f8c19b555343d548b9.html b/Doxygen/0.94/dir_554b7a2569cf28f8c19b555343d548b9.html new file mode 100644 index 0000000..61f47ae --- /dev/null +++ b/Doxygen/0.94/dir_554b7a2569cf28f8c19b555343d548b9.html @@ -0,0 +1,141 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/src Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
src Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  Blis.h [code]
 
file  BlisBranchObjectBilevel.h [code]
 
file  BlisBranchObjectInt.h [code]
 
file  BlisBranchStrategyBilevel.h [code]
 
file  BlisBranchStrategyMaxInf.h [code]
 
file  BlisBranchStrategyPseudo.h [code]
 
file  BlisBranchStrategyRel.h [code]
 
file  BlisBranchStrategyStrong.h [code]
 
file  BlisConfig.h [code]
 
file  BlisConGenerator.h [code]
 
file  BlisConstraint.h [code]
 
file  BlisHelp.h [code]
 
file  BlisHeuristic.h [code]
 
file  BlisHeurRound.h [code]
 
file  BlisLicense.h [code]
 
file  BlisMessage.h [code]
 
file  BlisModel.h [code]
 
file  BlisNodeDesc.h [code]
 
file  BlisObjectInt.h [code]
 
file  BlisParams.h [code]
 
file  BlisPresolve.h [code]
 
file  BlisPseudo.h [code]
 
file  BlisSolution.h [code]
 
file  BlisSubTree.h [code]
 
file  BlisTreeNode.h [code]
 
file  BlisVariable.h [code]
 
file  config_blis_default.h [code]
 
file  config_default.h [code]
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/dir_55ca51966c1c18979eacbb6d4d003581.html b/Doxygen/0.94/dir_55ca51966c1c18979eacbb6d4d003581.html new file mode 100644 index 0000000..7dbb680 --- /dev/null +++ b/Doxygen/0.94/dir_55ca51966c1c18979eacbb6d4d003581.html @@ -0,0 +1,101 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
examples Directory Reference
+
+
+
+ + Directory dependency graph for examples:
+
+
+ + + + + +

+Directories

directory  VRP
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/dir_55ca51966c1c18979eacbb6d4d003581_dep.map b/Doxygen/0.94/dir_55ca51966c1c18979eacbb6d4d003581_dep.map new file mode 100644 index 0000000..24fe486 --- /dev/null +++ b/Doxygen/0.94/dir_55ca51966c1c18979eacbb6d4d003581_dep.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/Doxygen/0.94/dir_55ca51966c1c18979eacbb6d4d003581_dep.md5 b/Doxygen/0.94/dir_55ca51966c1c18979eacbb6d4d003581_dep.md5 new file mode 100644 index 0000000..6204cf0 --- /dev/null +++ b/Doxygen/0.94/dir_55ca51966c1c18979eacbb6d4d003581_dep.md5 @@ -0,0 +1 @@ +3a9c65fb24ff89e902aa2f3d2b7b3849 \ No newline at end of file diff --git a/Doxygen/0.94/dir_55ca51966c1c18979eacbb6d4d003581_dep.png b/Doxygen/0.94/dir_55ca51966c1c18979eacbb6d4d003581_dep.png new file mode 100644 index 0000000..4895f49 Binary files /dev/null and b/Doxygen/0.94/dir_55ca51966c1c18979eacbb6d4d003581_dep.png differ diff --git a/Doxygen/0.94/dir_607c2a3b27e3bca679d5c577f9185c38.html b/Doxygen/0.94/dir_607c2a3b27e3bca679d5c577f9185c38.html new file mode 100644 index 0000000..efa594a --- /dev/null +++ b/Doxygen/0.94/dir_607c2a3b27e3bca679d5c577f9185c38.html @@ -0,0 +1,89 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/tmp_doxygen/Blis/src Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
src Directory Reference
+
+
+ + + + + + +

+Files

file  config.h [code]
 
file  config_blis.h [code]
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/dir_7e4d6e422f1e998dec5cade084ec4640.html b/Doxygen/0.94/dir_7e4d6e422f1e998dec5cade084ec4640.html new file mode 100644 index 0000000..c835ebf --- /dev/null +++ b/Doxygen/0.94/dir_7e4d6e422f1e998dec5cade084ec4640.html @@ -0,0 +1,118 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis/examples/VRP Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
VRP Directory Reference
+
+
+
+ + Directory dependency graph for VRP:
+
+
+ + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  VrpCommonTypes.h [code]
 
file  VrpConstants.h [code]
 
file  VrpCutGenerator.h [code]
 
file  VrpHeurTSP.h [code]
 
file  VrpMacros.h [code]
 
file  VrpModel.h [code]
 
file  VrpNetwork.h [code]
 
file  VrpParams.h [code]
 
file  VrpSolution.h [code]
 
file  VrpVariable.h [code]
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/dir_7e4d6e422f1e998dec5cade084ec4640_dep.map b/Doxygen/0.94/dir_7e4d6e422f1e998dec5cade084ec4640_dep.map new file mode 100644 index 0000000..ed95111 --- /dev/null +++ b/Doxygen/0.94/dir_7e4d6e422f1e998dec5cade084ec4640_dep.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/Doxygen/0.94/dir_7e4d6e422f1e998dec5cade084ec4640_dep.md5 b/Doxygen/0.94/dir_7e4d6e422f1e998dec5cade084ec4640_dep.md5 new file mode 100644 index 0000000..4e667f3 --- /dev/null +++ b/Doxygen/0.94/dir_7e4d6e422f1e998dec5cade084ec4640_dep.md5 @@ -0,0 +1 @@ +fba5c14e3d7b759bdac8fd184bbbc5e3 \ No newline at end of file diff --git a/Doxygen/0.94/dir_7e4d6e422f1e998dec5cade084ec4640_dep.png b/Doxygen/0.94/dir_7e4d6e422f1e998dec5cade084ec4640_dep.png new file mode 100644 index 0000000..152f42c Binary files /dev/null and b/Doxygen/0.94/dir_7e4d6e422f1e998dec5cade084ec4640_dep.png differ diff --git a/Doxygen/0.94/dir_86b817134009daa61ecf0df9524ec1f2.html b/Doxygen/0.94/dir_86b817134009daa61ecf0df9524ec1f2.html new file mode 100644 index 0000000..2f8f8c6 --- /dev/null +++ b/Doxygen/0.94/dir_86b817134009daa61ecf0df9524ec1f2.html @@ -0,0 +1,102 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/Blis Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Blis Directory Reference
+
+
+
+ + Directory dependency graph for Blis:
+
+
+ + + + + + + +

+Directories

directory  examples
 
directory  src
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/dir_86b817134009daa61ecf0df9524ec1f2_dep.map b/Doxygen/0.94/dir_86b817134009daa61ecf0df9524ec1f2_dep.map new file mode 100644 index 0000000..877a547 --- /dev/null +++ b/Doxygen/0.94/dir_86b817134009daa61ecf0df9524ec1f2_dep.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/Doxygen/0.94/dir_86b817134009daa61ecf0df9524ec1f2_dep.md5 b/Doxygen/0.94/dir_86b817134009daa61ecf0df9524ec1f2_dep.md5 new file mode 100644 index 0000000..7ed736a --- /dev/null +++ b/Doxygen/0.94/dir_86b817134009daa61ecf0df9524ec1f2_dep.md5 @@ -0,0 +1 @@ +bc00154607d8eb583b6638985ad6a5f7 \ No newline at end of file diff --git a/Doxygen/0.94/dir_86b817134009daa61ecf0df9524ec1f2_dep.png b/Doxygen/0.94/dir_86b817134009daa61ecf0df9524ec1f2_dep.png new file mode 100644 index 0000000..133e3f1 Binary files /dev/null and b/Doxygen/0.94/dir_86b817134009daa61ecf0df9524ec1f2_dep.png differ diff --git a/Doxygen/0.94/dir_dc5a0d43c35b49054d93af8a78b2156f.html b/Doxygen/0.94/dir_dc5a0d43c35b49054d93af8a78b2156f.html new file mode 100644 index 0000000..9af588e --- /dev/null +++ b/Doxygen/0.94/dir_dc5a0d43c35b49054d93af8a78b2156f.html @@ -0,0 +1,87 @@ + + + + + + + +Blis: /home/ted/tmp/Blis/tmp_doxygen/Blis Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Blis Directory Reference
+
+
+ + + + +

+Directories

directory  src
 
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/doc.png b/Doxygen/0.94/doc.png new file mode 100644 index 0000000..17edabf Binary files /dev/null and b/Doxygen/0.94/doc.png differ diff --git a/Doxygen/0.94/doxygen.css b/Doxygen/0.94/doxygen.css new file mode 100644 index 0000000..73ecbb2 --- /dev/null +++ b/Doxygen/0.94/doxygen.css @@ -0,0 +1,1771 @@ +/* The standard CSS for doxygen 1.8.17 */ + +body, table, div, p, dl { + font: 400 14px/22px Roboto,sans-serif; +} + +p.reference, p.definition { + font: 400 14px/22px Roboto,sans-serif; +} + +/* @group Heading Levels */ + +h1.groupheader { + font-size: 150%; +} + +.title { + font: 400 14px/28px Roboto,sans-serif; + font-size: 150%; + font-weight: bold; + margin: 10px 2px; +} + +h2.groupheader { + border-bottom: 1px solid #879ECB; + color: #354C7B; + font-size: 150%; + font-weight: normal; + margin-top: 1.75em; + padding-top: 8px; + padding-bottom: 4px; + width: 100%; +} + +h3.groupheader { + font-size: 100%; +} + +h1, h2, h3, h4, h5, h6 { + -webkit-transition: text-shadow 0.5s linear; + -moz-transition: text-shadow 0.5s linear; + -ms-transition: text-shadow 0.5s linear; + -o-transition: text-shadow 0.5s linear; + transition: text-shadow 0.5s linear; + margin-right: 15px; +} + +h1.glow, h2.glow, h3.glow, h4.glow, h5.glow, h6.glow { + text-shadow: 0 0 15px cyan; +} + +dt { + font-weight: bold; +} + +ul.multicol { + -moz-column-gap: 1em; + -webkit-column-gap: 1em; + column-gap: 1em; + -moz-column-count: 3; + -webkit-column-count: 3; + column-count: 3; +} + +p.startli, p.startdd { + margin-top: 2px; +} + +th p.starttd, p.intertd, p.endtd { + font-size: 100%; + font-weight: 700; +} + +p.starttd { + margin-top: 0px; +} + +p.endli { + margin-bottom: 0px; +} + +p.enddd { + margin-bottom: 4px; +} + +p.endtd { + margin-bottom: 2px; +} + +p.interli { +} + +p.interdd { +} + +p.intertd { +} + +/* @end */ + +caption { + font-weight: bold; +} + +span.legend { + font-size: 70%; + text-align: center; +} + +h3.version { + font-size: 90%; + text-align: center; +} + +div.qindex, div.navtab{ + background-color: #EBEFF6; + border: 1px solid #A3B4D7; + text-align: center; +} + +div.qindex, div.navpath { + width: 100%; + line-height: 140%; +} + +div.navtab { + margin-right: 15px; +} + +/* @group Link Styling */ + +a { + color: #3D578C; + font-weight: normal; + text-decoration: none; +} + +.contents a:visited { + color: #4665A2; +} + +a:hover { + text-decoration: underline; +} + +a.qindex { + font-weight: bold; +} + +a.qindexHL { + font-weight: bold; + background-color: #9CAFD4; + color: #FFFFFF; + border: 1px double #869DCA; +} + +.contents a.qindexHL:visited { + color: #FFFFFF; +} + +a.el { + font-weight: bold; +} + +a.elRef { +} + +a.code, a.code:visited, a.line, a.line:visited { + color: #4665A2; +} + +a.codeRef, a.codeRef:visited, a.lineRef, a.lineRef:visited { + color: #4665A2; +} + +/* @end */ + +dl.el { + margin-left: -1cm; +} + +ul { + overflow: hidden; /*Fixed: list item bullets overlap floating elements*/ +} + +#side-nav ul { + overflow: visible; /* reset ul rule for scroll bar in GENERATE_TREEVIEW window */ +} + +#main-nav ul { + overflow: visible; /* reset ul rule for the navigation bar drop down lists */ +} + +.fragment { + text-align: left; + direction: ltr; + overflow-x: auto; /*Fixed: fragment lines overlap floating elements*/ + overflow-y: hidden; +} + +pre.fragment { + border: 1px solid #C4CFE5; + background-color: #FBFCFD; + padding: 4px 6px; + margin: 4px 8px 4px 2px; + overflow: auto; + word-wrap: break-word; + font-size: 9pt; + line-height: 125%; + font-family: monospace, fixed; + font-size: 105%; +} + +div.fragment { + padding: 0 0 1px 0; /*Fixed: last line underline overlap border*/ + margin: 4px 8px 4px 2px; + background-color: #FBFCFD; + border: 1px solid #C4CFE5; +} + +div.line { + font-family: monospace, fixed; + font-size: 13px; + min-height: 13px; + line-height: 1.0; + text-wrap: unrestricted; + white-space: -moz-pre-wrap; /* Moz */ + white-space: -pre-wrap; /* Opera 4-6 */ + white-space: -o-pre-wrap; /* Opera 7 */ + white-space: pre-wrap; /* CSS3 */ + word-wrap: break-word; /* IE 5.5+ */ + text-indent: -53px; + padding-left: 53px; + padding-bottom: 0px; + margin: 0px; + -webkit-transition-property: background-color, box-shadow; + -webkit-transition-duration: 0.5s; + -moz-transition-property: background-color, box-shadow; + -moz-transition-duration: 0.5s; + -ms-transition-property: background-color, box-shadow; + -ms-transition-duration: 0.5s; + -o-transition-property: background-color, box-shadow; + -o-transition-duration: 0.5s; + transition-property: background-color, box-shadow; + transition-duration: 0.5s; +} + +div.line:after { + content:"\000A"; + white-space: pre; +} + +div.line.glow { + background-color: cyan; + box-shadow: 0 0 10px cyan; +} + + +span.lineno { + padding-right: 4px; + text-align: right; + border-right: 2px solid #0F0; + background-color: #E8E8E8; + white-space: pre; +} +span.lineno a { + background-color: #D8D8D8; +} + +span.lineno a:hover { + background-color: #C8C8C8; +} + +.lineno { + -webkit-touch-callout: none; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; +} + +div.ah, span.ah { + background-color: black; + font-weight: bold; + color: #FFFFFF; + margin-bottom: 3px; + margin-top: 3px; + padding: 0.2em; + border: solid thin #333; + border-radius: 0.5em; + -webkit-border-radius: .5em; + -moz-border-radius: .5em; + box-shadow: 2px 2px 3px #999; + -webkit-box-shadow: 2px 2px 3px #999; + -moz-box-shadow: rgba(0, 0, 0, 0.15) 2px 2px 2px; + background-image: -webkit-gradient(linear, left top, left bottom, from(#eee), to(#000),color-stop(0.3, #444)); + background-image: -moz-linear-gradient(center top, #eee 0%, #444 40%, #000 110%); +} + +div.classindex ul { + list-style: none; + padding-left: 0; +} + +div.classindex span.ai { + display: inline-block; +} + +div.groupHeader { + margin-left: 16px; + margin-top: 12px; + font-weight: bold; +} + +div.groupText { + margin-left: 16px; + font-style: italic; +} + +body { + background-color: white; + color: black; + margin: 0; +} + +div.contents { + margin-top: 10px; + margin-left: 12px; + margin-right: 8px; +} + +td.indexkey { + background-color: #EBEFF6; + font-weight: bold; + border: 1px solid #C4CFE5; + margin: 2px 0px 2px 0; + padding: 2px 10px; + white-space: nowrap; + vertical-align: top; +} + +td.indexvalue { + background-color: #EBEFF6; + border: 1px solid #C4CFE5; + padding: 2px 10px; + margin: 2px 0px; +} + +tr.memlist { + background-color: #EEF1F7; +} + +p.formulaDsp { + text-align: center; +} + +img.formulaDsp { + +} + +img.formulaInl, img.inline { + vertical-align: middle; +} + +div.center { + text-align: center; + margin-top: 0px; + margin-bottom: 0px; + padding: 0px; +} + +div.center img { + border: 0px; +} + +address.footer { + text-align: right; + padding-right: 12px; +} + +img.footer { + border: 0px; + vertical-align: middle; +} + +/* @group Code Colorization */ + +span.keyword { + color: #008000 +} + +span.keywordtype { + color: #604020 +} + +span.keywordflow { + color: #e08000 +} + +span.comment { + color: #800000 +} + +span.preprocessor { + color: #806020 +} + +span.stringliteral { + color: #002080 +} + +span.charliteral { + color: #008080 +} + +span.vhdldigit { + color: #ff00ff +} + +span.vhdlchar { + color: #000000 +} + +span.vhdlkeyword { + color: #700070 +} + +span.vhdllogic { + color: #ff0000 +} + +blockquote { + background-color: #F7F8FB; + border-left: 2px solid #9CAFD4; + margin: 0 24px 0 4px; + padding: 0 12px 0 16px; +} + +blockquote.DocNodeRTL { + border-left: 0; + border-right: 2px solid #9CAFD4; + margin: 0 4px 0 24px; + padding: 0 16px 0 12px; +} + +/* @end */ + +/* +.search { + color: #003399; + font-weight: bold; +} + +form.search { + margin-bottom: 0px; + margin-top: 0px; +} + +input.search { + font-size: 75%; + color: #000080; + font-weight: normal; + background-color: #e8eef2; +} +*/ + +td.tiny { + font-size: 75%; +} + +.dirtab { + padding: 4px; + border-collapse: collapse; + border: 1px solid #A3B4D7; +} + +th.dirtab { + background: #EBEFF6; + font-weight: bold; +} + +hr { + height: 0px; + border: none; + border-top: 1px solid #4A6AAA; +} + +hr.footer { + height: 1px; +} + +/* @group Member Descriptions */ + +table.memberdecls { + border-spacing: 0px; + padding: 0px; +} + +.memberdecls td, .fieldtable tr { + -webkit-transition-property: background-color, box-shadow; + -webkit-transition-duration: 0.5s; + -moz-transition-property: background-color, box-shadow; + -moz-transition-duration: 0.5s; + -ms-transition-property: background-color, box-shadow; + -ms-transition-duration: 0.5s; + -o-transition-property: background-color, box-shadow; + -o-transition-duration: 0.5s; + transition-property: background-color, box-shadow; + transition-duration: 0.5s; +} + +.memberdecls td.glow, .fieldtable tr.glow { + background-color: cyan; + box-shadow: 0 0 15px cyan; +} + +.mdescLeft, .mdescRight, +.memItemLeft, .memItemRight, +.memTemplItemLeft, .memTemplItemRight, .memTemplParams { + background-color: #F9FAFC; + border: none; + margin: 4px; + padding: 1px 0 0 8px; +} + +.mdescLeft, .mdescRight { + padding: 0px 8px 4px 8px; + color: #555; +} + +.memSeparator { + border-bottom: 1px solid #DEE4F0; + line-height: 1px; + margin: 0px; + padding: 0px; +} + +.memItemLeft, .memTemplItemLeft { + white-space: nowrap; +} + +.memItemRight, .memTemplItemRight { + width: 100%; +} + +.memTemplParams { + color: #4665A2; + white-space: nowrap; + font-size: 80%; +} + +/* @end */ + +/* @group Member Details */ + +/* Styles for detailed member documentation */ + +.memtitle { + padding: 8px; + border-top: 1px solid #A8B8D9; + border-left: 1px solid #A8B8D9; + border-right: 1px solid #A8B8D9; + border-top-right-radius: 4px; + border-top-left-radius: 4px; + margin-bottom: -1px; + background-image: url('nav_f.png'); + background-repeat: repeat-x; + background-color: #E2E8F2; + line-height: 1.25; + font-weight: 300; + float:left; +} + +.permalink +{ + font-size: 65%; + display: inline-block; + vertical-align: middle; +} + +.memtemplate { + font-size: 80%; + color: #4665A2; + font-weight: normal; + margin-left: 9px; +} + +.memnav { + background-color: #EBEFF6; + border: 1px solid #A3B4D7; + text-align: center; + margin: 2px; + margin-right: 15px; + padding: 2px; +} + +.mempage { + width: 100%; +} + +.memitem { + padding: 0; + margin-bottom: 10px; + margin-right: 5px; + -webkit-transition: box-shadow 0.5s linear; + -moz-transition: box-shadow 0.5s linear; + -ms-transition: box-shadow 0.5s linear; + -o-transition: box-shadow 0.5s linear; + transition: box-shadow 0.5s linear; + display: table !important; + width: 100%; +} + +.memitem.glow { + box-shadow: 0 0 15px cyan; +} + +.memname { + font-weight: 400; + margin-left: 6px; +} + +.memname td { + vertical-align: bottom; +} + +.memproto, dl.reflist dt { + border-top: 1px solid #A8B8D9; + border-left: 1px solid #A8B8D9; + border-right: 1px solid #A8B8D9; + padding: 6px 0px 6px 0px; + color: #253555; + font-weight: bold; + text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); + background-color: #DFE5F1; + /* opera specific markup */ + box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + border-top-right-radius: 4px; + /* firefox specific markup */ + -moz-box-shadow: rgba(0, 0, 0, 0.15) 5px 5px 5px; + -moz-border-radius-topright: 4px; + /* webkit specific markup */ + -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + -webkit-border-top-right-radius: 4px; + +} + +.overload { + font-family: "courier new",courier,monospace; + font-size: 65%; +} + +.memdoc, dl.reflist dd { + border-bottom: 1px solid #A8B8D9; + border-left: 1px solid #A8B8D9; + border-right: 1px solid #A8B8D9; + padding: 6px 10px 2px 10px; + background-color: #FBFCFD; + border-top-width: 0; + background-image:url('nav_g.png'); + background-repeat:repeat-x; + background-color: #FFFFFF; + /* opera specific markup */ + border-bottom-left-radius: 4px; + border-bottom-right-radius: 4px; + box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + /* firefox specific markup */ + -moz-border-radius-bottomleft: 4px; + -moz-border-radius-bottomright: 4px; + -moz-box-shadow: rgba(0, 0, 0, 0.15) 5px 5px 5px; + /* webkit specific markup */ + -webkit-border-bottom-left-radius: 4px; + -webkit-border-bottom-right-radius: 4px; + -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); +} + +dl.reflist dt { + padding: 5px; +} + +dl.reflist dd { + margin: 0px 0px 10px 0px; + padding: 5px; +} + +.paramkey { + text-align: right; +} + +.paramtype { + white-space: nowrap; +} + +.paramname { + color: #602020; + white-space: nowrap; +} +.paramname em { + font-style: normal; +} +.paramname code { + line-height: 14px; +} + +.params, .retval, .exception, .tparams { + margin-left: 0px; + padding-left: 0px; +} + +.params .paramname, .retval .paramname, .tparams .paramname, .exception .paramname { + font-weight: bold; + vertical-align: top; +} + +.params .paramtype, .tparams .paramtype { + font-style: italic; + vertical-align: top; +} + +.params .paramdir, .tparams .paramdir { + font-family: "courier new",courier,monospace; + vertical-align: top; +} + +table.mlabels { + border-spacing: 0px; +} + +td.mlabels-left { + width: 100%; + padding: 0px; +} + +td.mlabels-right { + vertical-align: bottom; + padding: 0px; + white-space: nowrap; +} + +span.mlabels { + margin-left: 8px; +} + +span.mlabel { + background-color: #728DC1; + border-top:1px solid #5373B4; + border-left:1px solid #5373B4; + border-right:1px solid #C4CFE5; + border-bottom:1px solid #C4CFE5; + text-shadow: none; + color: white; + margin-right: 4px; + padding: 2px 3px; + border-radius: 3px; + font-size: 7pt; + white-space: nowrap; + vertical-align: middle; +} + + + +/* @end */ + +/* these are for tree view inside a (index) page */ + +div.directory { + margin: 10px 0px; + border-top: 1px solid #9CAFD4; + border-bottom: 1px solid #9CAFD4; + width: 100%; +} + +.directory table { + border-collapse:collapse; +} + +.directory td { + margin: 0px; + padding: 0px; + vertical-align: top; +} + +.directory td.entry { + white-space: nowrap; + padding-right: 6px; + padding-top: 3px; +} + +.directory td.entry a { + outline:none; +} + +.directory td.entry a img { + border: none; +} + +.directory td.desc { + width: 100%; + padding-left: 6px; + padding-right: 6px; + padding-top: 3px; + border-left: 1px solid rgba(0,0,0,0.05); +} + +.directory tr.even { + padding-left: 6px; + background-color: #F7F8FB; +} + +.directory img { + vertical-align: -30%; +} + +.directory .levels { + white-space: nowrap; + width: 100%; + text-align: right; + font-size: 9pt; +} + +.directory .levels span { + cursor: pointer; + padding-left: 2px; + padding-right: 2px; + color: #3D578C; +} + +.arrow { + color: #9CAFD4; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; + cursor: pointer; + font-size: 80%; + display: inline-block; + width: 16px; + height: 22px; +} + +.icon { + font-family: Arial, Helvetica; + font-weight: bold; + font-size: 12px; + height: 14px; + width: 16px; + display: inline-block; + background-color: #728DC1; + color: white; + text-align: center; + border-radius: 4px; + margin-left: 2px; + margin-right: 2px; +} + +.icona { + width: 24px; + height: 22px; + display: inline-block; +} + +.iconfopen { + width: 24px; + height: 18px; + margin-bottom: 4px; + background-image:url('folderopen.png'); + background-position: 0px -4px; + background-repeat: repeat-y; + vertical-align:top; + display: inline-block; +} + +.iconfclosed { + width: 24px; + height: 18px; + margin-bottom: 4px; + background-image:url('folderclosed.png'); + background-position: 0px -4px; + background-repeat: repeat-y; + vertical-align:top; + display: inline-block; +} + +.icondoc { + width: 24px; + height: 18px; + margin-bottom: 4px; + background-image:url('doc.png'); + background-position: 0px -4px; + background-repeat: repeat-y; + vertical-align:top; + display: inline-block; +} + +table.directory { + font: 400 14px Roboto,sans-serif; +} + +/* @end */ + +div.dynheader { + margin-top: 8px; + -webkit-touch-callout: none; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; +} + +address { + font-style: normal; + color: #2A3D61; +} + +table.doxtable caption { + caption-side: top; +} + +table.doxtable { + border-collapse:collapse; + margin-top: 4px; + margin-bottom: 4px; +} + +table.doxtable td, table.doxtable th { + border: 1px solid #2D4068; + padding: 3px 7px 2px; +} + +table.doxtable th { + background-color: #374F7F; + color: #FFFFFF; + font-size: 110%; + padding-bottom: 4px; + padding-top: 5px; +} + +table.fieldtable { + /*width: 100%;*/ + margin-bottom: 10px; + border: 1px solid #A8B8D9; + border-spacing: 0px; + -moz-border-radius: 4px; + -webkit-border-radius: 4px; + border-radius: 4px; + -moz-box-shadow: rgba(0, 0, 0, 0.15) 2px 2px 2px; + -webkit-box-shadow: 2px 2px 2px rgba(0, 0, 0, 0.15); + box-shadow: 2px 2px 2px rgba(0, 0, 0, 0.15); +} + +.fieldtable td, .fieldtable th { + padding: 3px 7px 2px; +} + +.fieldtable td.fieldtype, .fieldtable td.fieldname { + white-space: nowrap; + border-right: 1px solid #A8B8D9; + border-bottom: 1px solid #A8B8D9; + vertical-align: top; +} + +.fieldtable td.fieldname { + padding-top: 3px; +} + +.fieldtable td.fielddoc { + border-bottom: 1px solid #A8B8D9; + /*width: 100%;*/ +} + +.fieldtable td.fielddoc p:first-child { + margin-top: 0px; +} + +.fieldtable td.fielddoc p:last-child { + margin-bottom: 2px; +} + +.fieldtable tr:last-child td { + border-bottom: none; +} + +.fieldtable th { + background-image:url('nav_f.png'); + background-repeat:repeat-x; + background-color: #E2E8F2; + font-size: 90%; + color: #253555; + padding-bottom: 4px; + padding-top: 5px; + text-align:left; + font-weight: 400; + -moz-border-radius-topleft: 4px; + -moz-border-radius-topright: 4px; + -webkit-border-top-left-radius: 4px; + -webkit-border-top-right-radius: 4px; + border-top-left-radius: 4px; + border-top-right-radius: 4px; + border-bottom: 1px solid #A8B8D9; +} + + +.tabsearch { + top: 0px; + left: 10px; + height: 36px; + background-image: url('tab_b.png'); + z-index: 101; + overflow: hidden; + font-size: 13px; +} + +.navpath ul +{ + font-size: 11px; + background-image:url('tab_b.png'); + background-repeat:repeat-x; + background-position: 0 -5px; + height:30px; + line-height:30px; + color:#8AA0CC; + border:solid 1px #C2CDE4; + overflow:hidden; + margin:0px; + padding:0px; +} + +.navpath li +{ + list-style-type:none; + float:left; + padding-left:10px; + padding-right:15px; + background-image:url('bc_s.png'); + background-repeat:no-repeat; + background-position:right; + color:#364D7C; +} + +.navpath li.navelem a +{ + height:32px; + display:block; + text-decoration: none; + outline: none; + color: #283A5D; + font-family: 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif; + text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); + text-decoration: none; +} + +.navpath li.navelem a:hover +{ + color:#6884BD; +} + +.navpath li.footer +{ + list-style-type:none; + float:right; + padding-left:10px; + padding-right:15px; + background-image:none; + background-repeat:no-repeat; + background-position:right; + color:#364D7C; + font-size: 8pt; +} + + +div.summary +{ + float: right; + font-size: 8pt; + padding-right: 5px; + width: 50%; + text-align: right; +} + +div.summary a +{ + white-space: nowrap; +} + +table.classindex +{ + margin: 10px; + white-space: nowrap; + margin-left: 3%; + margin-right: 3%; + width: 94%; + border: 0; + border-spacing: 0; + padding: 0; +} + +div.ingroups +{ + font-size: 8pt; + width: 50%; + text-align: left; +} + +div.ingroups a +{ + white-space: nowrap; +} + +div.header +{ + background-image:url('nav_h.png'); + background-repeat:repeat-x; + background-color: #F9FAFC; + margin: 0px; + border-bottom: 1px solid #C4CFE5; +} + +div.headertitle +{ + padding: 5px 5px 5px 10px; +} + +.PageDocRTL-title div.headertitle { + text-align: right; + direction: rtl; +} + +dl { + padding: 0 0 0 0; +} + +/* dl.note, dl.warning, dl.attention, dl.pre, dl.post, dl.invariant, dl.deprecated, dl.todo, dl.test, dl.bug, dl.examples */ +dl.section { + margin-left: 0px; + padding-left: 0px; +} + +dl.section.DocNodeRTL { + margin-right: 0px; + padding-right: 0px; +} + +dl.note { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #D0C000; +} + +dl.note.DocNodeRTL { + margin-left: 0; + padding-left: 0; + border-left: 0; + margin-right: -7px; + padding-right: 3px; + border-right: 4px solid; + border-color: #D0C000; +} + +dl.warning, dl.attention { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #FF0000; +} + +dl.warning.DocNodeRTL, dl.attention.DocNodeRTL { + margin-left: 0; + padding-left: 0; + border-left: 0; + margin-right: -7px; + padding-right: 3px; + border-right: 4px solid; + border-color: #FF0000; +} + +dl.pre, dl.post, dl.invariant { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #00D000; +} + +dl.pre.DocNodeRTL, dl.post.DocNodeRTL, dl.invariant.DocNodeRTL { + margin-left: 0; + padding-left: 0; + border-left: 0; + margin-right: -7px; + padding-right: 3px; + border-right: 4px solid; + border-color: #00D000; +} + +dl.deprecated { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #505050; +} + +dl.deprecated.DocNodeRTL { + margin-left: 0; + padding-left: 0; + border-left: 0; + margin-right: -7px; + padding-right: 3px; + border-right: 4px solid; + border-color: #505050; +} + +dl.todo { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #00C0E0; +} + +dl.todo.DocNodeRTL { + margin-left: 0; + padding-left: 0; + border-left: 0; + margin-right: -7px; + padding-right: 3px; + border-right: 4px solid; + border-color: #00C0E0; +} + +dl.test { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #3030E0; +} + +dl.test.DocNodeRTL { + margin-left: 0; + padding-left: 0; + border-left: 0; + margin-right: -7px; + padding-right: 3px; + border-right: 4px solid; + border-color: #3030E0; +} + +dl.bug { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #C08050; +} + +dl.bug.DocNodeRTL { + margin-left: 0; + padding-left: 0; + border-left: 0; + margin-right: -7px; + padding-right: 3px; + border-right: 4px solid; + border-color: #C08050; +} + +dl.section dd { + margin-bottom: 6px; +} + + +#projectlogo +{ + text-align: center; + vertical-align: bottom; + border-collapse: separate; +} + +#projectlogo img +{ + border: 0px none; +} + +#projectalign +{ + vertical-align: middle; +} + +#projectname +{ + font: 300% Tahoma, Arial,sans-serif; + margin: 0px; + padding: 2px 0px; +} + +#projectbrief +{ + font: 120% Tahoma, Arial,sans-serif; + margin: 0px; + padding: 0px; +} + +#projectnumber +{ + font: 50% Tahoma, Arial,sans-serif; + margin: 0px; + padding: 0px; +} + +#titlearea +{ + padding: 0px; + margin: 0px; + width: 100%; + border-bottom: 1px solid #5373B4; +} + +.image +{ + text-align: center; +} + +.dotgraph +{ + text-align: center; +} + +.mscgraph +{ + text-align: center; +} + +.plantumlgraph +{ + text-align: center; +} + +.diagraph +{ + text-align: center; +} + +.caption +{ + font-weight: bold; +} + +div.zoom +{ + border: 1px solid #90A5CE; +} + +dl.citelist { + margin-bottom:50px; +} + +dl.citelist dt { + color:#334975; + float:left; + font-weight:bold; + margin-right:10px; + padding:5px; +} + +dl.citelist dd { + margin:2px 0; + padding:5px 0; +} + +div.toc { + padding: 14px 25px; + background-color: #F4F6FA; + border: 1px solid #D8DFEE; + border-radius: 7px 7px 7px 7px; + float: right; + height: auto; + margin: 0 8px 10px 10px; + width: 200px; +} + +.PageDocRTL-title div.toc { + float: left !important; + text-align: right; +} + +div.toc li { + background: url("bdwn.png") no-repeat scroll 0 5px transparent; + font: 10px/1.2 Verdana,DejaVu Sans,Geneva,sans-serif; + margin-top: 5px; + padding-left: 10px; + padding-top: 2px; +} + +.PageDocRTL-title div.toc li { + background-position-x: right !important; + padding-left: 0 !important; + padding-right: 10px; +} + +div.toc h3 { + font: bold 12px/1.2 Arial,FreeSans,sans-serif; + color: #4665A2; + border-bottom: 0 none; + margin: 0; +} + +div.toc ul { + list-style: none outside none; + border: medium none; + padding: 0px; +} + +div.toc li.level1 { + margin-left: 0px; +} + +div.toc li.level2 { + margin-left: 15px; +} + +div.toc li.level3 { + margin-left: 30px; +} + +div.toc li.level4 { + margin-left: 45px; +} + +.PageDocRTL-title div.toc li.level1 { + margin-left: 0 !important; + margin-right: 0; +} + +.PageDocRTL-title div.toc li.level2 { + margin-left: 0 !important; + margin-right: 15px; +} + +.PageDocRTL-title div.toc li.level3 { + margin-left: 0 !important; + margin-right: 30px; +} + +.PageDocRTL-title div.toc li.level4 { + margin-left: 0 !important; + margin-right: 45px; +} + +.inherit_header { + font-weight: bold; + color: gray; + cursor: pointer; + -webkit-touch-callout: none; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; +} + +.inherit_header td { + padding: 6px 0px 2px 5px; +} + +.inherit { + display: none; +} + +tr.heading h2 { + margin-top: 12px; + margin-bottom: 4px; +} + +/* tooltip related style info */ + +.ttc { + position: absolute; + display: none; +} + +#powerTip { + cursor: default; + white-space: nowrap; + background-color: white; + border: 1px solid gray; + border-radius: 4px 4px 4px 4px; + box-shadow: 1px 1px 7px gray; + display: none; + font-size: smaller; + max-width: 80%; + opacity: 0.9; + padding: 1ex 1em 1em; + position: absolute; + z-index: 2147483647; +} + +#powerTip div.ttdoc { + color: grey; + font-style: italic; +} + +#powerTip div.ttname a { + font-weight: bold; +} + +#powerTip div.ttname { + font-weight: bold; +} + +#powerTip div.ttdeci { + color: #006318; +} + +#powerTip div { + margin: 0px; + padding: 0px; + font: 12px/16px Roboto,sans-serif; +} + +#powerTip:before, #powerTip:after { + content: ""; + position: absolute; + margin: 0px; +} + +#powerTip.n:after, #powerTip.n:before, +#powerTip.s:after, #powerTip.s:before, +#powerTip.w:after, #powerTip.w:before, +#powerTip.e:after, #powerTip.e:before, +#powerTip.ne:after, #powerTip.ne:before, +#powerTip.se:after, #powerTip.se:before, +#powerTip.nw:after, #powerTip.nw:before, +#powerTip.sw:after, #powerTip.sw:before { + border: solid transparent; + content: " "; + height: 0; + width: 0; + position: absolute; +} + +#powerTip.n:after, #powerTip.s:after, +#powerTip.w:after, #powerTip.e:after, +#powerTip.nw:after, #powerTip.ne:after, +#powerTip.sw:after, #powerTip.se:after { + border-color: rgba(255, 255, 255, 0); +} + +#powerTip.n:before, #powerTip.s:before, +#powerTip.w:before, #powerTip.e:before, +#powerTip.nw:before, #powerTip.ne:before, +#powerTip.sw:before, #powerTip.se:before { + border-color: rgba(128, 128, 128, 0); +} + +#powerTip.n:after, #powerTip.n:before, +#powerTip.ne:after, #powerTip.ne:before, +#powerTip.nw:after, #powerTip.nw:before { + top: 100%; +} + +#powerTip.n:after, #powerTip.ne:after, #powerTip.nw:after { + border-top-color: #FFFFFF; + border-width: 10px; + margin: 0px -10px; +} +#powerTip.n:before { + border-top-color: #808080; + border-width: 11px; + margin: 0px -11px; +} +#powerTip.n:after, #powerTip.n:before { + left: 50%; +} + +#powerTip.nw:after, #powerTip.nw:before { + right: 14px; +} + +#powerTip.ne:after, #powerTip.ne:before { + left: 14px; +} + +#powerTip.s:after, #powerTip.s:before, +#powerTip.se:after, #powerTip.se:before, +#powerTip.sw:after, #powerTip.sw:before { + bottom: 100%; +} + +#powerTip.s:after, #powerTip.se:after, #powerTip.sw:after { + border-bottom-color: #FFFFFF; + border-width: 10px; + margin: 0px -10px; +} + +#powerTip.s:before, #powerTip.se:before, #powerTip.sw:before { + border-bottom-color: #808080; + border-width: 11px; + margin: 0px -11px; +} + +#powerTip.s:after, #powerTip.s:before { + left: 50%; +} + +#powerTip.sw:after, #powerTip.sw:before { + right: 14px; +} + +#powerTip.se:after, #powerTip.se:before { + left: 14px; +} + +#powerTip.e:after, #powerTip.e:before { + left: 100%; +} +#powerTip.e:after { + border-left-color: #FFFFFF; + border-width: 10px; + top: 50%; + margin-top: -10px; +} +#powerTip.e:before { + border-left-color: #808080; + border-width: 11px; + top: 50%; + margin-top: -11px; +} + +#powerTip.w:after, #powerTip.w:before { + right: 100%; +} +#powerTip.w:after { + border-right-color: #FFFFFF; + border-width: 10px; + top: 50%; + margin-top: -10px; +} +#powerTip.w:before { + border-right-color: #808080; + border-width: 11px; + top: 50%; + margin-top: -11px; +} + +@media print +{ + #top { display: none; } + #side-nav { display: none; } + #nav-path { display: none; } + body { overflow:visible; } + h1, h2, h3, h4, h5, h6 { page-break-after: avoid; } + .summary { display: none; } + .memitem { page-break-inside: avoid; } + #doc-content + { + margin-left:0 !important; + height:auto !important; + width:auto !important; + overflow:inherit; + display:inline; + } +} + +/* @group Markdown */ + +/* +table.markdownTable { + border-collapse:collapse; + margin-top: 4px; + margin-bottom: 4px; +} + +table.markdownTable td, table.markdownTable th { + border: 1px solid #2D4068; + padding: 3px 7px 2px; +} + +table.markdownTableHead tr { +} + +table.markdownTableBodyLeft td, table.markdownTable th { + border: 1px solid #2D4068; + padding: 3px 7px 2px; +} + +th.markdownTableHeadLeft th.markdownTableHeadRight th.markdownTableHeadCenter th.markdownTableHeadNone { + background-color: #374F7F; + color: #FFFFFF; + font-size: 110%; + padding-bottom: 4px; + padding-top: 5px; +} + +th.markdownTableHeadLeft { + text-align: left +} + +th.markdownTableHeadRight { + text-align: right +} + +th.markdownTableHeadCenter { + text-align: center +} +*/ + +table.markdownTable { + border-collapse:collapse; + margin-top: 4px; + margin-bottom: 4px; +} + +table.markdownTable td, table.markdownTable th { + border: 1px solid #2D4068; + padding: 3px 7px 2px; +} + +table.markdownTable tr { +} + +th.markdownTableHeadLeft, th.markdownTableHeadRight, th.markdownTableHeadCenter, th.markdownTableHeadNone { + background-color: #374F7F; + color: #FFFFFF; + font-size: 110%; + padding-bottom: 4px; + padding-top: 5px; +} + +th.markdownTableHeadLeft, td.markdownTableBodyLeft { + text-align: left +} + +th.markdownTableHeadRight, td.markdownTableBodyRight { + text-align: right +} + +th.markdownTableHeadCenter, td.markdownTableBodyCenter { + text-align: center +} + +.DocNodeRTL { + text-align: right; + direction: rtl; +} + +.DocNodeLTR { + text-align: left; + direction: ltr; +} + +table.DocNodeRTL { + width: auto; + margin-right: 0; + margin-left: auto; +} + +table.DocNodeLTR { + width: auto; + margin-right: auto; + margin-left: 0; +} + +tt, code, kbd, samp +{ + display: inline-block; + direction:ltr; +} +/* @end */ + +u { + text-decoration: underline; +} + diff --git a/Doxygen/0.94/doxygen.png b/Doxygen/0.94/doxygen.png new file mode 100644 index 0000000..3ff17d8 Binary files /dev/null and b/Doxygen/0.94/doxygen.png differ diff --git a/Doxygen/0.94/dynsections.js b/Doxygen/0.94/dynsections.js new file mode 100644 index 0000000..c8e84aa --- /dev/null +++ b/Doxygen/0.94/dynsections.js @@ -0,0 +1,127 @@ +/* + @licstart The following is the entire license notice for the + JavaScript code in this file. + + Copyright (C) 1997-2017 by Dimitri van Heesch + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License along + with this program; if not, write to the Free Software Foundation, Inc., + 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. + + @licend The above is the entire license notice + for the JavaScript code in this file + */ +function toggleVisibility(linkObj) +{ + var base = $(linkObj).attr('id'); + var summary = $('#'+base+'-summary'); + var content = $('#'+base+'-content'); + var trigger = $('#'+base+'-trigger'); + var src=$(trigger).attr('src'); + if (content.is(':visible')===true) { + content.hide(); + summary.show(); + $(linkObj).addClass('closed').removeClass('opened'); + $(trigger).attr('src',src.substring(0,src.length-8)+'closed.png'); + } else { + content.show(); + summary.hide(); + $(linkObj).removeClass('closed').addClass('opened'); + $(trigger).attr('src',src.substring(0,src.length-10)+'open.png'); + } + return false; +} + +function updateStripes() +{ + $('table.directory tr'). + removeClass('even').filter(':visible:even').addClass('even'); +} + +function toggleLevel(level) +{ + $('table.directory tr').each(function() { + var l = this.id.split('_').length-1; + var i = $('#img'+this.id.substring(3)); + var a = $('#arr'+this.id.substring(3)); + if (l + + + + + + +Blis: File List + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
+
File List
+
+
+
Here is a list of all files with brief descriptions:
+
[detail level 1234]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
 ▼ Blis
 ▼ examples
 ▼ VRP
 VrpCommonTypes.h
 VrpConstants.h
 VrpCutGenerator.h
 VrpHeurTSP.h
 VrpMacros.h
 VrpModel.h
 VrpNetwork.h
 VrpParams.h
 VrpSolution.h
 VrpVariable.h
 ▼ src
 Blis.h
 BlisBranchObjectBilevel.h
 BlisBranchObjectInt.h
 BlisBranchStrategyBilevel.h
 BlisBranchStrategyMaxInf.h
 BlisBranchStrategyPseudo.h
 BlisBranchStrategyRel.h
 BlisBranchStrategyStrong.h
 BlisConfig.h
 BlisConGenerator.h
 BlisConstraint.h
 BlisHelp.h
 BlisHeuristic.h
 BlisHeurRound.h
 BlisLicense.h
 BlisMessage.h
 BlisModel.h
 BlisNodeDesc.h
 BlisObjectInt.h
 BlisParams.h
 BlisPresolve.h
 BlisPseudo.h
 BlisSolution.h
 BlisSubTree.h
 BlisTreeNode.h
 BlisVariable.h
 config_blis_default.h
 config_default.h
 ▼ Blis
 ▼ src
 config.h
 config_blis.h
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/folderclosed.png b/Doxygen/0.94/folderclosed.png new file mode 100644 index 0000000..bb8ab35 Binary files /dev/null and b/Doxygen/0.94/folderclosed.png differ diff --git a/Doxygen/0.94/folderopen.png b/Doxygen/0.94/folderopen.png new file mode 100644 index 0000000..d6c7f67 Binary files /dev/null and b/Doxygen/0.94/folderopen.png differ diff --git a/Doxygen/0.94/functions.html b/Doxygen/0.94/functions.html new file mode 100644 index 0000000..3e9fb00 --- /dev/null +++ b/Doxygen/0.94/functions.html @@ -0,0 +1,155 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- a -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_b.html b/Doxygen/0.94/functions_b.html new file mode 100644 index 0000000..cbb8ad3 --- /dev/null +++ b/Doxygen/0.94/functions_b.html @@ -0,0 +1,216 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- b -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_c.html b/Doxygen/0.94/functions_c.html new file mode 100644 index 0000000..273b451 --- /dev/null +++ b/Doxygen/0.94/functions_c.html @@ -0,0 +1,347 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- c -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_d.html b/Doxygen/0.94/functions_d.html new file mode 100644 index 0000000..d0ff669 --- /dev/null +++ b/Doxygen/0.94/functions_d.html @@ -0,0 +1,170 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- d -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_e.html b/Doxygen/0.94/functions_e.html new file mode 100644 index 0000000..cadb7eb --- /dev/null +++ b/Doxygen/0.94/functions_e.html @@ -0,0 +1,161 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- e -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_enum.html b/Doxygen/0.94/functions_enum.html new file mode 100644 index 0000000..ac49860 --- /dev/null +++ b/Doxygen/0.94/functions_enum.html @@ -0,0 +1,97 @@ + + + + + + + +Blis: Class Members - Enumerations + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_eval.html b/Doxygen/0.94/functions_eval.html new file mode 100644 index 0000000..2c189a1 --- /dev/null +++ b/Doxygen/0.94/functions_eval.html @@ -0,0 +1,345 @@ + + + + + + + +Blis: Class Members - Enumerator + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- b -

+ + +

- c -

+ + +

- d -

+ + +

- e -

+ + +

- g -

+ + +

- h -

+ + +

- i -

+ + +

- l -

+ + +

- m -

+ + +

- n -

+ + +

- o -

+ + +

- p -

+ + +

- q -

+ + +

- s -

+ + +

- t -

+ + +

- v -

+ + +

- w -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_f.html b/Doxygen/0.94/functions_f.html new file mode 100644 index 0000000..cd16470 --- /dev/null +++ b/Doxygen/0.94/functions_f.html @@ -0,0 +1,108 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- f -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func.html b/Doxygen/0.94/functions_func.html new file mode 100644 index 0000000..d255229 --- /dev/null +++ b/Doxygen/0.94/functions_func.html @@ -0,0 +1,136 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- a -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_b.html b/Doxygen/0.94/functions_func_b.html new file mode 100644 index 0000000..30420af --- /dev/null +++ b/Doxygen/0.94/functions_func_b.html @@ -0,0 +1,173 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- b -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_c.html b/Doxygen/0.94/functions_func_c.html new file mode 100644 index 0000000..b59a20f --- /dev/null +++ b/Doxygen/0.94/functions_func_c.html @@ -0,0 +1,183 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- c -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_d.html b/Doxygen/0.94/functions_func_d.html new file mode 100644 index 0000000..48972d2 --- /dev/null +++ b/Doxygen/0.94/functions_func_d.html @@ -0,0 +1,117 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- d -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_e.html b/Doxygen/0.94/functions_func_e.html new file mode 100644 index 0000000..d610330 --- /dev/null +++ b/Doxygen/0.94/functions_func_e.html @@ -0,0 +1,113 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- e -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_f.html b/Doxygen/0.94/functions_func_f.html new file mode 100644 index 0000000..871fb8b --- /dev/null +++ b/Doxygen/0.94/functions_func_f.html @@ -0,0 +1,95 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- f -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_g.html b/Doxygen/0.94/functions_func_g.html new file mode 100644 index 0000000..050c5ab --- /dev/null +++ b/Doxygen/0.94/functions_func_g.html @@ -0,0 +1,264 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- g -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_h.html b/Doxygen/0.94/functions_func_h.html new file mode 100644 index 0000000..64f9425 --- /dev/null +++ b/Doxygen/0.94/functions_func_h.html @@ -0,0 +1,86 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- h -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_i.html b/Doxygen/0.94/functions_func_i.html new file mode 100644 index 0000000..44af79a --- /dev/null +++ b/Doxygen/0.94/functions_func_i.html @@ -0,0 +1,96 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- i -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_m.html b/Doxygen/0.94/functions_func_m.html new file mode 100644 index 0000000..83e66df --- /dev/null +++ b/Doxygen/0.94/functions_func_m.html @@ -0,0 +1,80 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- m -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_n.html b/Doxygen/0.94/functions_func_n.html new file mode 100644 index 0000000..b627a45 --- /dev/null +++ b/Doxygen/0.94/functions_func_n.html @@ -0,0 +1,114 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- n -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_o.html b/Doxygen/0.94/functions_func_o.html new file mode 100644 index 0000000..4ca5848 --- /dev/null +++ b/Doxygen/0.94/functions_func_o.html @@ -0,0 +1,105 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- o -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_p.html b/Doxygen/0.94/functions_func_p.html new file mode 100644 index 0000000..2aae7bc --- /dev/null +++ b/Doxygen/0.94/functions_func_p.html @@ -0,0 +1,131 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- p -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_r.html b/Doxygen/0.94/functions_func_r.html new file mode 100644 index 0000000..64d3fe1 --- /dev/null +++ b/Doxygen/0.94/functions_func_r.html @@ -0,0 +1,107 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- r -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_s.html b/Doxygen/0.94/functions_func_s.html new file mode 100644 index 0000000..c99465d --- /dev/null +++ b/Doxygen/0.94/functions_func_s.html @@ -0,0 +1,269 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- s -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_t.html b/Doxygen/0.94/functions_func_t.html new file mode 100644 index 0000000..3e77292 --- /dev/null +++ b/Doxygen/0.94/functions_func_t.html @@ -0,0 +1,93 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- t -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_u.html b/Doxygen/0.94/functions_func_u.html new file mode 100644 index 0000000..9803708 --- /dev/null +++ b/Doxygen/0.94/functions_func_u.html @@ -0,0 +1,100 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- u -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_v.html b/Doxygen/0.94/functions_func_v.html new file mode 100644 index 0000000..4518922 --- /dev/null +++ b/Doxygen/0.94/functions_func_v.html @@ -0,0 +1,107 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- v -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_w.html b/Doxygen/0.94/functions_func_w.html new file mode 100644 index 0000000..6abab3a --- /dev/null +++ b/Doxygen/0.94/functions_func_w.html @@ -0,0 +1,83 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- w -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_func_~.html b/Doxygen/0.94/functions_func_~.html new file mode 100644 index 0000000..23eedd5 --- /dev/null +++ b/Doxygen/0.94/functions_func_~.html @@ -0,0 +1,149 @@ + + + + + + + +Blis: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- ~ -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_g.html b/Doxygen/0.94/functions_g.html new file mode 100644 index 0000000..0a7970b --- /dev/null +++ b/Doxygen/0.94/functions_g.html @@ -0,0 +1,273 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- g -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_h.html b/Doxygen/0.94/functions_h.html new file mode 100644 index 0000000..02930e2 --- /dev/null +++ b/Doxygen/0.94/functions_h.html @@ -0,0 +1,109 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- h -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_i.html b/Doxygen/0.94/functions_i.html new file mode 100644 index 0000000..15c8094 --- /dev/null +++ b/Doxygen/0.94/functions_i.html @@ -0,0 +1,140 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- i -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_l.html b/Doxygen/0.94/functions_l.html new file mode 100644 index 0000000..f0650db --- /dev/null +++ b/Doxygen/0.94/functions_l.html @@ -0,0 +1,93 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- l -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_m.html b/Doxygen/0.94/functions_m.html new file mode 100644 index 0000000..8db8587 --- /dev/null +++ b/Doxygen/0.94/functions_m.html @@ -0,0 +1,103 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- m -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_n.html b/Doxygen/0.94/functions_n.html new file mode 100644 index 0000000..c0c25d5 --- /dev/null +++ b/Doxygen/0.94/functions_n.html @@ -0,0 +1,228 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- n -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_o.html b/Doxygen/0.94/functions_o.html new file mode 100644 index 0000000..cfed4b5 --- /dev/null +++ b/Doxygen/0.94/functions_o.html @@ -0,0 +1,166 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- o -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_p.html b/Doxygen/0.94/functions_p.html new file mode 100644 index 0000000..4c7624c --- /dev/null +++ b/Doxygen/0.94/functions_p.html @@ -0,0 +1,173 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- p -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_q.html b/Doxygen/0.94/functions_q.html new file mode 100644 index 0000000..cfb0ed6 --- /dev/null +++ b/Doxygen/0.94/functions_q.html @@ -0,0 +1,80 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- q -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_r.html b/Doxygen/0.94/functions_r.html new file mode 100644 index 0000000..bab1948 --- /dev/null +++ b/Doxygen/0.94/functions_r.html @@ -0,0 +1,123 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- r -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_rela.html b/Doxygen/0.94/functions_rela.html new file mode 100644 index 0000000..105b3a2 --- /dev/null +++ b/Doxygen/0.94/functions_rela.html @@ -0,0 +1,86 @@ + + + + + + + +Blis: Class Members - Related Functions + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_s.html b/Doxygen/0.94/functions_s.html new file mode 100644 index 0000000..9e00122 --- /dev/null +++ b/Doxygen/0.94/functions_s.html @@ -0,0 +1,345 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- s -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_t.html b/Doxygen/0.94/functions_t.html new file mode 100644 index 0000000..24296b6 --- /dev/null +++ b/Doxygen/0.94/functions_t.html @@ -0,0 +1,124 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- t -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_u.html b/Doxygen/0.94/functions_u.html new file mode 100644 index 0000000..7e7c558 --- /dev/null +++ b/Doxygen/0.94/functions_u.html @@ -0,0 +1,112 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- u -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_v.html b/Doxygen/0.94/functions_v.html new file mode 100644 index 0000000..7ff2518 --- /dev/null +++ b/Doxygen/0.94/functions_v.html @@ -0,0 +1,149 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- v -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars.html b/Doxygen/0.94/functions_vars.html new file mode 100644 index 0000000..67baba1 --- /dev/null +++ b/Doxygen/0.94/functions_vars.html @@ -0,0 +1,96 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- a -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_b.html b/Doxygen/0.94/functions_vars_b.html new file mode 100644 index 0000000..947bd56 --- /dev/null +++ b/Doxygen/0.94/functions_vars_b.html @@ -0,0 +1,113 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- b -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_c.html b/Doxygen/0.94/functions_vars_c.html new file mode 100644 index 0000000..93e2ad8 --- /dev/null +++ b/Doxygen/0.94/functions_vars_c.html @@ -0,0 +1,169 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- c -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_d.html b/Doxygen/0.94/functions_vars_d.html new file mode 100644 index 0000000..66e4f50 --- /dev/null +++ b/Doxygen/0.94/functions_vars_d.html @@ -0,0 +1,114 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- d -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_e.html b/Doxygen/0.94/functions_vars_e.html new file mode 100644 index 0000000..df773a1 --- /dev/null +++ b/Doxygen/0.94/functions_vars_e.html @@ -0,0 +1,103 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- e -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_f.html b/Doxygen/0.94/functions_vars_f.html new file mode 100644 index 0000000..7b3db81 --- /dev/null +++ b/Doxygen/0.94/functions_vars_f.html @@ -0,0 +1,90 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- f -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_g.html b/Doxygen/0.94/functions_vars_g.html new file mode 100644 index 0000000..487eb42 --- /dev/null +++ b/Doxygen/0.94/functions_vars_g.html @@ -0,0 +1,83 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- g -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_h.html b/Doxygen/0.94/functions_vars_h.html new file mode 100644 index 0000000..b32ec55 --- /dev/null +++ b/Doxygen/0.94/functions_vars_h.html @@ -0,0 +1,90 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- h -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_i.html b/Doxygen/0.94/functions_vars_i.html new file mode 100644 index 0000000..8594e15 --- /dev/null +++ b/Doxygen/0.94/functions_vars_i.html @@ -0,0 +1,114 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- i -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_l.html b/Doxygen/0.94/functions_vars_l.html new file mode 100644 index 0000000..08265bf --- /dev/null +++ b/Doxygen/0.94/functions_vars_l.html @@ -0,0 +1,90 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- l -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_m.html b/Doxygen/0.94/functions_vars_m.html new file mode 100644 index 0000000..3de6900 --- /dev/null +++ b/Doxygen/0.94/functions_vars_m.html @@ -0,0 +1,97 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- m -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_n.html b/Doxygen/0.94/functions_vars_n.html new file mode 100644 index 0000000..4319414 --- /dev/null +++ b/Doxygen/0.94/functions_vars_n.html @@ -0,0 +1,188 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- n -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_o.html b/Doxygen/0.94/functions_vars_o.html new file mode 100644 index 0000000..027b1d0 --- /dev/null +++ b/Doxygen/0.94/functions_vars_o.html @@ -0,0 +1,129 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- o -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_p.html b/Doxygen/0.94/functions_vars_p.html new file mode 100644 index 0000000..b43c67a --- /dev/null +++ b/Doxygen/0.94/functions_vars_p.html @@ -0,0 +1,110 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- p -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_r.html b/Doxygen/0.94/functions_vars_r.html new file mode 100644 index 0000000..5a5fc46 --- /dev/null +++ b/Doxygen/0.94/functions_vars_r.html @@ -0,0 +1,93 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- r -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_s.html b/Doxygen/0.94/functions_vars_s.html new file mode 100644 index 0000000..0c39996 --- /dev/null +++ b/Doxygen/0.94/functions_vars_s.html @@ -0,0 +1,113 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- s -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_t.html b/Doxygen/0.94/functions_vars_t.html new file mode 100644 index 0000000..0444b2f --- /dev/null +++ b/Doxygen/0.94/functions_vars_t.html @@ -0,0 +1,102 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- t -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_u.html b/Doxygen/0.94/functions_vars_u.html new file mode 100644 index 0000000..9fe0f8a --- /dev/null +++ b/Doxygen/0.94/functions_vars_u.html @@ -0,0 +1,89 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- u -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_v.html b/Doxygen/0.94/functions_vars_v.html new file mode 100644 index 0000000..e69c257 --- /dev/null +++ b/Doxygen/0.94/functions_vars_v.html @@ -0,0 +1,111 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- v -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_vars_w.html b/Doxygen/0.94/functions_vars_w.html new file mode 100644 index 0000000..3f55314 --- /dev/null +++ b/Doxygen/0.94/functions_vars_w.html @@ -0,0 +1,90 @@ + + + + + + + +Blis: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- w -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_w.html b/Doxygen/0.94/functions_w.html new file mode 100644 index 0000000..8a93ca4 --- /dev/null +++ b/Doxygen/0.94/functions_w.html @@ -0,0 +1,102 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- w -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/functions_~.html b/Doxygen/0.94/functions_~.html new file mode 100644 index 0000000..9bfd4fc --- /dev/null +++ b/Doxygen/0.94/functions_~.html @@ -0,0 +1,149 @@ + + + + + + + +Blis: Class Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- ~ -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals.html b/Doxygen/0.94/globals.html new file mode 100644 index 0000000..629a5ea --- /dev/null +++ b/Doxygen/0.94/globals.html @@ -0,0 +1,110 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- _ -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_a.html b/Doxygen/0.94/globals_a.html new file mode 100644 index 0000000..dbb6068 --- /dev/null +++ b/Doxygen/0.94/globals_a.html @@ -0,0 +1,83 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- a -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_b.html b/Doxygen/0.94/globals_b.html new file mode 100644 index 0000000..c56d982 --- /dev/null +++ b/Doxygen/0.94/globals_b.html @@ -0,0 +1,340 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- b -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_c.html b/Doxygen/0.94/globals_c.html new file mode 100644 index 0000000..ae5a1a0 --- /dev/null +++ b/Doxygen/0.94/globals_c.html @@ -0,0 +1,118 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- c -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_d.html b/Doxygen/0.94/globals_d.html new file mode 100644 index 0000000..bf1a0a7 --- /dev/null +++ b/Doxygen/0.94/globals_d.html @@ -0,0 +1,92 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- d -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_defs.html b/Doxygen/0.94/globals_defs.html new file mode 100644 index 0000000..b673597 --- /dev/null +++ b/Doxygen/0.94/globals_defs.html @@ -0,0 +1,604 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- _ -

+ + +

- a -

+ + +

- b -

+ + +

- c -

+ + +

- d -

+ + +

- e -

+ + +

- f -

+ + +

- g -

+ + +

- h -

+ + +

- i -

+ + +

- k -

+ + +

- l -

+ + +

- m -

+ + +

- n -

+ + +

- o -

+ + +

- p -

+ + +

- r -

+ + +

- s -

+ + +

- t -

+ + +

- v -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_e.html b/Doxygen/0.94/globals_e.html new file mode 100644 index 0000000..96e62ef --- /dev/null +++ b/Doxygen/0.94/globals_e.html @@ -0,0 +1,101 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- e -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_enum.html b/Doxygen/0.94/globals_enum.html new file mode 100644 index 0000000..a30549b --- /dev/null +++ b/Doxygen/0.94/globals_enum.html @@ -0,0 +1,102 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_eval.html b/Doxygen/0.94/globals_eval.html new file mode 100644 index 0000000..1ba9dc2 --- /dev/null +++ b/Doxygen/0.94/globals_eval.html @@ -0,0 +1,245 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  + +

- b -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_f.html b/Doxygen/0.94/globals_f.html new file mode 100644 index 0000000..280b11d --- /dev/null +++ b/Doxygen/0.94/globals_f.html @@ -0,0 +1,95 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- f -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_func.html b/Doxygen/0.94/globals_func.html new file mode 100644 index 0000000..e71d5eb --- /dev/null +++ b/Doxygen/0.94/globals_func.html @@ -0,0 +1,99 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_g.html b/Doxygen/0.94/globals_g.html new file mode 100644 index 0000000..7f3e977 --- /dev/null +++ b/Doxygen/0.94/globals_g.html @@ -0,0 +1,80 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- g -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_h.html b/Doxygen/0.94/globals_h.html new file mode 100644 index 0000000..ea0240c --- /dev/null +++ b/Doxygen/0.94/globals_h.html @@ -0,0 +1,113 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- h -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_i.html b/Doxygen/0.94/globals_i.html new file mode 100644 index 0000000..4a83f1b --- /dev/null +++ b/Doxygen/0.94/globals_i.html @@ -0,0 +1,83 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- i -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_k.html b/Doxygen/0.94/globals_k.html new file mode 100644 index 0000000..bcfc173 --- /dev/null +++ b/Doxygen/0.94/globals_k.html @@ -0,0 +1,80 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- k -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_l.html b/Doxygen/0.94/globals_l.html new file mode 100644 index 0000000..7fa2df0 --- /dev/null +++ b/Doxygen/0.94/globals_l.html @@ -0,0 +1,89 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- l -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_m.html b/Doxygen/0.94/globals_m.html new file mode 100644 index 0000000..f833919 --- /dev/null +++ b/Doxygen/0.94/globals_m.html @@ -0,0 +1,89 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- m -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_n.html b/Doxygen/0.94/globals_n.html new file mode 100644 index 0000000..9fbc5b3 --- /dev/null +++ b/Doxygen/0.94/globals_n.html @@ -0,0 +1,101 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- n -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_o.html b/Doxygen/0.94/globals_o.html new file mode 100644 index 0000000..5ef3ae5 --- /dev/null +++ b/Doxygen/0.94/globals_o.html @@ -0,0 +1,80 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- o -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_p.html b/Doxygen/0.94/globals_p.html new file mode 100644 index 0000000..b556da5 --- /dev/null +++ b/Doxygen/0.94/globals_p.html @@ -0,0 +1,95 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- p -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_r.html b/Doxygen/0.94/globals_r.html new file mode 100644 index 0000000..9bb75a7 --- /dev/null +++ b/Doxygen/0.94/globals_r.html @@ -0,0 +1,110 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- r -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_s.html b/Doxygen/0.94/globals_s.html new file mode 100644 index 0000000..ebf779b --- /dev/null +++ b/Doxygen/0.94/globals_s.html @@ -0,0 +1,179 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- s -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_t.html b/Doxygen/0.94/globals_t.html new file mode 100644 index 0000000..c83ccb2 --- /dev/null +++ b/Doxygen/0.94/globals_t.html @@ -0,0 +1,101 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- t -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_type.html b/Doxygen/0.94/globals_type.html new file mode 100644 index 0000000..4440169 --- /dev/null +++ b/Doxygen/0.94/globals_type.html @@ -0,0 +1,99 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+  +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/globals_v.html b/Doxygen/0.94/globals_v.html new file mode 100644 index 0000000..24695ae --- /dev/null +++ b/Doxygen/0.94/globals_v.html @@ -0,0 +1,95 @@ + + + + + + + +Blis: File Members + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- v -

+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/graph_legend.html b/Doxygen/0.94/graph_legend.html new file mode 100644 index 0000000..77e71ad --- /dev/null +++ b/Doxygen/0.94/graph_legend.html @@ -0,0 +1,137 @@ + + + + + + + +Blis: Graph Legend + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
+
Graph Legend
+
+
+

This page explains how to interpret the graphs that are generated by doxygen.

+

Consider the following example:

/*! Invisible class because of truncation */
+
class Invisible { };
+
+
/*! Truncated class, inheritance relation is hidden */
+
class Truncated : public Invisible { };
+
+
/* Class not documented with doxygen comments */
+
class Undocumented { };
+
+
/*! Class that is inherited using public inheritance */
+
class PublicBase : public Truncated { };
+
+
/*! A template class */
+
template<class T> class Templ { };
+
+
/*! Class that is inherited using protected inheritance */
+
class ProtectedBase { };
+
+
/*! Class that is inherited using private inheritance */
+
class PrivateBase { };
+
+
/*! Class that is used by the Inherited class */
+
class Used { };
+
+
/*! Super class that inherits a number of other classes */
+
class Inherited : public PublicBase,
+
protected ProtectedBase,
+
private PrivateBase,
+
public Undocumented,
+
public Templ<int>
+
{
+
private:
+
Used *m_usedClass;
+
};
+

This will result in the following graph:

+

The boxes in the above graph have the following meaning:

+ +

The arrows have the following meaning:

+ +
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/graph_legend.md5 b/Doxygen/0.94/graph_legend.md5 new file mode 100644 index 0000000..8fcdccd --- /dev/null +++ b/Doxygen/0.94/graph_legend.md5 @@ -0,0 +1 @@ +f51bf6e9a10430aafef59831b08dcbfe \ No newline at end of file diff --git a/Doxygen/0.94/graph_legend.png b/Doxygen/0.94/graph_legend.png new file mode 100644 index 0000000..140796b Binary files /dev/null and b/Doxygen/0.94/graph_legend.png differ diff --git a/Doxygen/0.94/hierarchy.html b/Doxygen/0.94/hierarchy.html new file mode 100644 index 0000000..67c76a6 --- /dev/null +++ b/Doxygen/0.94/hierarchy.html @@ -0,0 +1,378 @@ + + + + + + + +Blis: Class Hierarchy + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
+
Class Hierarchy
+
+
+
+

Go to the graphical class hierarchy

+This inheritance list is sorted roughly, but not completely, alphabetically:
+
[detail level 123456]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
 C_NODE
 Cstd::allocator< T >STL class
 ►CAlpsKnowledge
 ►CAlpsParameterSet
 Cstd::array< T >STL class
 Cstd::atomic< T >STL class
 Cstd::atomic_ref< T >STL class
 Cstd::auto_ptr< T >STL class
 ►Cstd::basic_string< Char >STL class
 Cstd::basic_string< char >
 Cstd::basic_string< char16_t >
 Cstd::basic_string< char32_t >
 Cstd::basic_string< char8_t >
 Cstd::basic_string< wchar_t >
 ►Cstd::basic_string_view< Char >STL class
 Cstd::basic_string_view< char >
 Cstd::basic_string_view< char16_t >
 Cstd::basic_string_view< char32_t >
 Cstd::basic_string_view< char8_t >
 Cstd::basic_string_view< wchar_t >
 ►CBcpsBranchObject
 ►CBcpsBranchStrategy
 ►CBcpsConstraint
 ►CBcpsModel
 ►CBcpsNodeDesc
 ►CBcpsObject
 ►CBcpsSolution
 ►CBcpsTreeNode
 ►CBcpsVariable
 CBEST_TOURS
 Cstd::bitset< Bits >STL class
 ►CBlisConGeneratorInterface between Blis and Cut Generation Library
 ►CBlisHeuristicHeuristic base class
 CBlisStrong
 ►CCoinMessages
 Cstd::complexSTL class
 Cstd::wstring::const_iteratorSTL iterator class
 Cstd::multimap< K, T >::const_iteratorSTL iterator class
 Cstd::map< K, T >::const_iteratorSTL iterator class
 Cstd::unordered_map< K, T >::const_iteratorSTL iterator class
 Cstd::u8string::const_iteratorSTL iterator class
 Cstd::u16string::const_iteratorSTL iterator class
 Cstd::unordered_multimap< K, T >::const_iteratorSTL iterator class
 Cstd::set< K >::const_iteratorSTL iterator class
 Cstd::unordered_set< K >::const_iteratorSTL iterator class
 Cstd::multiset< K >::const_iteratorSTL iterator class
 Cstd::unordered_multiset< K >::const_iteratorSTL iterator class
 Cstd::u32string::const_iteratorSTL iterator class
 Cstd::basic_string_view< Char >::const_iteratorSTL iterator class
 Cstd::array< T >::const_iteratorSTL iterator class
 Cstd::vector< T >::const_iteratorSTL iterator class
 Cstd::span< T >::const_iteratorSTL iterator class
 Cstd::string_view::const_iteratorSTL iterator class
 Cstd::wstring_view::const_iteratorSTL iterator class
 Cstd::u8string_view::const_iteratorSTL iterator class
 Cstd::u16string_view::const_iteratorSTL iterator class
 Cstd::u32string_view::const_iteratorSTL iterator class
 Cstd::basic_string< Char >::const_iteratorSTL iterator class
 Cstd::deque< T >::const_iteratorSTL iterator class
 Cstd::string::const_iteratorSTL iterator class
 Cstd::list< T >::const_iteratorSTL iterator class
 Cstd::forward_list< T >::const_iteratorSTL iterator class
 Cstd::unordered_map< K, T >::const_reverse_iteratorSTL iterator class
 Cstd::u8string::const_reverse_iteratorSTL iterator class
 Cstd::deque< T >::const_reverse_iteratorSTL iterator class
 Cstd::multimap< K, T >::const_reverse_iteratorSTL iterator class
 Cstd::unordered_multimap< K, T >::const_reverse_iteratorSTL iterator class
 Cstd::u16string::const_reverse_iteratorSTL iterator class
 Cstd::set< K >::const_reverse_iteratorSTL iterator class
 Cstd::unordered_set< K >::const_reverse_iteratorSTL iterator class
 Cstd::u32string::const_reverse_iteratorSTL iterator class
 Cstd::multiset< K >::const_reverse_iteratorSTL iterator class
 Cstd::unordered_multiset< K >::const_reverse_iteratorSTL iterator class
 Cstd::basic_string_view< Char >::const_reverse_iteratorSTL iterator class
 Cstd::array< T >::const_reverse_iteratorSTL iterator class
 Cstd::vector< T >::const_reverse_iteratorSTL iterator class
 Cstd::span< T >::const_reverse_iteratorSTL iterator class
 Cstd::string_view::const_reverse_iteratorSTL iterator class
 Cstd::u8string_view::const_reverse_iteratorSTL iterator class
 Cstd::wstring_view::const_reverse_iteratorSTL iterator class
 Cstd::u16string_view::const_reverse_iteratorSTL iterator class
 Cstd::basic_string< Char >::const_reverse_iteratorSTL iterator class
 Cstd::u32string_view::const_reverse_iteratorSTL iterator class
 Cstd::map< K, T >::const_reverse_iteratorSTL iterator class
 Cstd::list< T >::const_reverse_iteratorSTL iterator class
 Cstd::string::const_reverse_iteratorSTL iterator class
 Cstd::forward_list< T >::const_reverse_iteratorSTL iterator class
 Cstd::wstring::const_reverse_iteratorSTL iterator class
 Cstd::deque< T >STL class
 Cstd::deque< int >
 CEDGE
 CEDGE_DATA
 CELIST
 Cstd::error_categorySTL class
 Cstd::error_codeSTL class
 Cstd::error_conditionSTL class
 ►Cstd::exceptionSTL class
 Cstd::forward_list< T >STL class
 ►Cstd::ios_baseSTL class
 Cstd::multimap< K, T >::iteratorSTL iterator class
 Cstd::map< K, T >::iteratorSTL iterator class
 Cstd::u8string::iteratorSTL iterator class
 Cstd::unordered_map< K, T >::iteratorSTL iterator class
 Cstd::deque< T >::iteratorSTL iterator class
 Cstd::unordered_multimap< K, T >::iteratorSTL iterator class
 Cstd::u16string::iteratorSTL iterator class
 Cstd::set< K >::iteratorSTL iterator class
 Cstd::u32string::iteratorSTL iterator class
 Cstd::unordered_set< K >::iteratorSTL iterator class
 Cstd::multiset< K >::iteratorSTL iterator class
 Cstd::unordered_multiset< K >::iteratorSTL iterator class
 Cstd::basic_string_view< Char >::iteratorSTL iterator class
 Cstd::array< T >::iteratorSTL iterator class
 Cstd::vector< T >::iteratorSTL iterator class
 Cstd::wstring_view::iteratorSTL iterator class
 Cstd::span< T >::iteratorSTL iterator class
 Cstd::string_view::iteratorSTL iterator class
 Cstd::u8string_view::iteratorSTL iterator class
 Cstd::u16string_view::iteratorSTL iterator class
 Cstd::basic_string< Char >::iteratorSTL iterator class
 Cstd::u32string_view::iteratorSTL iterator class
 Cstd::string::iteratorSTL iterator class
 Cstd::list< T >::iteratorSTL iterator class
 Cstd::wstring::iteratorSTL iterator class
 Cstd::forward_list< T >::iteratorSTL iterator class
 Cstd::jthreadSTL class
 Cstd::list< T >STL class
 Cstd::lock_guard< T >STL class
 Cstd::map< K, T >STL class
 Cstd::multimap< K, T >STL class
 Cstd::multiset< K >STL class
 Cstd::mutexSTL class
 ►COsiPresolve
 Cstd::priority_queue< T >STL class
 Cstd::queue< T >STL class
 Cstd::recursive_mutexSTL class
 Cstd::recursive_timed_mutexSTL class
 Cstd::list< T >::reverse_iteratorSTL iterator class
 Cstd::wstring::reverse_iteratorSTL iterator class
 Cstd::unordered_map< K, T >::reverse_iteratorSTL iterator class
 Cstd::map< K, T >::reverse_iteratorSTL iterator class
 Cstd::string::reverse_iteratorSTL iterator class
 Cstd::wstring_view::reverse_iteratorSTL iterator class
 Cstd::basic_string_view< Char >::reverse_iteratorSTL iterator class
 Cstd::multimap< K, T >::reverse_iteratorSTL iterator class
 Cstd::array< T >::reverse_iteratorSTL iterator class
 Cstd::u32string::reverse_iteratorSTL iterator class
 Cstd::multiset< K >::reverse_iteratorSTL iterator class
 Cstd::deque< T >::reverse_iteratorSTL iterator class
 Cstd::unordered_multiset< K >::reverse_iteratorSTL iterator class
 Cstd::u8string::reverse_iteratorSTL iterator class
 Cstd::unordered_multimap< K, T >::reverse_iteratorSTL iterator class
 Cstd::u8string_view::reverse_iteratorSTL iterator class
 Cstd::string_view::reverse_iteratorSTL iterator class
 Cstd::span< T >::reverse_iteratorSTL iterator class
 Cstd::unordered_set< K >::reverse_iteratorSTL iterator class
 Cstd::basic_string< Char >::reverse_iteratorSTL iterator class
 Cstd::u32string_view::reverse_iteratorSTL iterator class
 Cstd::u16string_view::reverse_iteratorSTL iterator class
 Cstd::vector< T >::reverse_iteratorSTL iterator class
 Cstd::forward_list< T >::reverse_iteratorSTL iterator class
 Cstd::u16string::reverse_iteratorSTL iterator class
 Cstd::set< K >::reverse_iteratorSTL iterator class
 CROUTE_DATA
 Cstd::set< K >STL class
 Cstd::shared_lock< T >STL class
 Cstd::shared_mutexSTL class
 Cstd::shared_ptr< T >STL class
 Cstd::shared_timed_mutexSTL class
 CSMALL_GRAPH
 Cstd::smart_ptr< T >STL class
 Cstd::span< T >STL class
 Cstd::stack< T >STL class
 Cstd::system_errorSTL class
 Cstd::threadSTL class
 Cstd::timed_mutexSTL class
 Cstd::unique_lock< T >STL class
 Cstd::unique_ptr< T >STL class
 Cstd::unordered_map< K, T >STL class
 Cstd::unordered_multimap< K, T >STL class
 Cstd::unordered_multiset< K >STL class
 Cstd::unordered_set< K >STL class
 Cstd::valarray< T >STL class
 Cstd::vector< T >STL class
 Cstd::vector< AlpsTreeNode * >
 Cstd::vector< BcpsConstraint * >
 Cstd::vector< BcpsVariable * >
 Cstd::vector< CoinPackedVector * >
 Cstd::vector< int >
 Cstd::vector< VrpVariable * >
 CVERTEX
 CVrpNetwork
 Cstd::weak_ptr< T >STL class
 CK
 CT
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/index.html b/Doxygen/0.94/index.html new file mode 100644 index 0000000..15bab1b --- /dev/null +++ b/Doxygen/0.94/index.html @@ -0,0 +1,77 @@ + + + + + + + +Blis: Main Page + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
+
Blis Documentation
+
+
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/inherit_graph_0.map b/Doxygen/0.94/inherit_graph_0.map new file mode 100644 index 0000000..ed590c3 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_0.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_0.md5 b/Doxygen/0.94/inherit_graph_0.md5 new file mode 100644 index 0000000..45df0ed --- /dev/null +++ b/Doxygen/0.94/inherit_graph_0.md5 @@ -0,0 +1 @@ +e4af4e4314953e9917f476bdf22e23b7 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_0.png b/Doxygen/0.94/inherit_graph_0.png new file mode 100644 index 0000000..22ade2f Binary files /dev/null and b/Doxygen/0.94/inherit_graph_0.png differ diff --git a/Doxygen/0.94/inherit_graph_1.map b/Doxygen/0.94/inherit_graph_1.map new file mode 100644 index 0000000..3e5f668 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_1.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_1.md5 b/Doxygen/0.94/inherit_graph_1.md5 new file mode 100644 index 0000000..0bd7aa4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_1.md5 @@ -0,0 +1 @@ +e45d869a85ffcf29167125dffdc5d278 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_1.png b/Doxygen/0.94/inherit_graph_1.png new file mode 100644 index 0000000..2152e51 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_1.png differ diff --git a/Doxygen/0.94/inherit_graph_10.map b/Doxygen/0.94/inherit_graph_10.map new file mode 100644 index 0000000..da78958 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_10.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/inherit_graph_10.md5 b/Doxygen/0.94/inherit_graph_10.md5 new file mode 100644 index 0000000..3e9eb2f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_10.md5 @@ -0,0 +1 @@ +f6af78d1825278af8bc8e7e509c3539e \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_10.png b/Doxygen/0.94/inherit_graph_10.png new file mode 100644 index 0000000..75ac8e1 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_10.png differ diff --git a/Doxygen/0.94/inherit_graph_100.map b/Doxygen/0.94/inherit_graph_100.map new file mode 100644 index 0000000..d636afe --- /dev/null +++ b/Doxygen/0.94/inherit_graph_100.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_100.md5 b/Doxygen/0.94/inherit_graph_100.md5 new file mode 100644 index 0000000..ca0fe94 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_100.md5 @@ -0,0 +1 @@ +1d0eee0b692ef36b2dba40a48dd8ab01 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_100.png b/Doxygen/0.94/inherit_graph_100.png new file mode 100644 index 0000000..cdb8b71 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_100.png differ diff --git a/Doxygen/0.94/inherit_graph_101.map b/Doxygen/0.94/inherit_graph_101.map new file mode 100644 index 0000000..665050a --- /dev/null +++ b/Doxygen/0.94/inherit_graph_101.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_101.md5 b/Doxygen/0.94/inherit_graph_101.md5 new file mode 100644 index 0000000..d0e064b --- /dev/null +++ b/Doxygen/0.94/inherit_graph_101.md5 @@ -0,0 +1 @@ +e850180ed1cb7e06009189e6f3e7c818 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_101.png b/Doxygen/0.94/inherit_graph_101.png new file mode 100644 index 0000000..455854d Binary files /dev/null and b/Doxygen/0.94/inherit_graph_101.png differ diff --git a/Doxygen/0.94/inherit_graph_102.map b/Doxygen/0.94/inherit_graph_102.map new file mode 100644 index 0000000..e3a0da4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_102.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_102.md5 b/Doxygen/0.94/inherit_graph_102.md5 new file mode 100644 index 0000000..3c4cffc --- /dev/null +++ b/Doxygen/0.94/inherit_graph_102.md5 @@ -0,0 +1 @@ +d4c1910e7dea662819280853f7f56774 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_102.png b/Doxygen/0.94/inherit_graph_102.png new file mode 100644 index 0000000..18913bc Binary files /dev/null and b/Doxygen/0.94/inherit_graph_102.png differ diff --git a/Doxygen/0.94/inherit_graph_103.map b/Doxygen/0.94/inherit_graph_103.map new file mode 100644 index 0000000..5092880 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_103.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_103.md5 b/Doxygen/0.94/inherit_graph_103.md5 new file mode 100644 index 0000000..a0890d4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_103.md5 @@ -0,0 +1 @@ +fc7b88fcaa0c8d867e66f39884e9f357 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_103.png b/Doxygen/0.94/inherit_graph_103.png new file mode 100644 index 0000000..0ce9a10 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_103.png differ diff --git a/Doxygen/0.94/inherit_graph_104.map b/Doxygen/0.94/inherit_graph_104.map new file mode 100644 index 0000000..857e7ba --- /dev/null +++ b/Doxygen/0.94/inherit_graph_104.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_104.md5 b/Doxygen/0.94/inherit_graph_104.md5 new file mode 100644 index 0000000..b4d5c2a --- /dev/null +++ b/Doxygen/0.94/inherit_graph_104.md5 @@ -0,0 +1 @@ +c547253e707a9e51f055e62307dfaa4a \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_104.png b/Doxygen/0.94/inherit_graph_104.png new file mode 100644 index 0000000..cd3ccd9 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_104.png differ diff --git a/Doxygen/0.94/inherit_graph_105.map b/Doxygen/0.94/inherit_graph_105.map new file mode 100644 index 0000000..53cce46 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_105.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_105.md5 b/Doxygen/0.94/inherit_graph_105.md5 new file mode 100644 index 0000000..4231bbe --- /dev/null +++ b/Doxygen/0.94/inherit_graph_105.md5 @@ -0,0 +1 @@ +a8adacfa70a81891a057d4ca86eea165 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_105.png b/Doxygen/0.94/inherit_graph_105.png new file mode 100644 index 0000000..d98c4bb Binary files /dev/null and b/Doxygen/0.94/inherit_graph_105.png differ diff --git a/Doxygen/0.94/inherit_graph_106.map b/Doxygen/0.94/inherit_graph_106.map new file mode 100644 index 0000000..d1a099c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_106.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_106.md5 b/Doxygen/0.94/inherit_graph_106.md5 new file mode 100644 index 0000000..edc1f54 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_106.md5 @@ -0,0 +1 @@ +26eda36a26665c58f77bf415141d61a3 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_106.png b/Doxygen/0.94/inherit_graph_106.png new file mode 100644 index 0000000..ac0e8d6 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_106.png differ diff --git a/Doxygen/0.94/inherit_graph_107.map b/Doxygen/0.94/inherit_graph_107.map new file mode 100644 index 0000000..8e5dec7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_107.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_107.md5 b/Doxygen/0.94/inherit_graph_107.md5 new file mode 100644 index 0000000..d00a128 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_107.md5 @@ -0,0 +1 @@ +491976d8807ee0472686bece4a76ad82 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_107.png b/Doxygen/0.94/inherit_graph_107.png new file mode 100644 index 0000000..b1dcce6 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_107.png differ diff --git a/Doxygen/0.94/inherit_graph_108.map b/Doxygen/0.94/inherit_graph_108.map new file mode 100644 index 0000000..cf90080 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_108.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_108.md5 b/Doxygen/0.94/inherit_graph_108.md5 new file mode 100644 index 0000000..73aafd1 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_108.md5 @@ -0,0 +1 @@ +93cfc6353089d6a4c98c4d5dc0592313 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_108.png b/Doxygen/0.94/inherit_graph_108.png new file mode 100644 index 0000000..ac8c354 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_108.png differ diff --git a/Doxygen/0.94/inherit_graph_109.map b/Doxygen/0.94/inherit_graph_109.map new file mode 100644 index 0000000..fd1ae26 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_109.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_109.md5 b/Doxygen/0.94/inherit_graph_109.md5 new file mode 100644 index 0000000..f06e4e4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_109.md5 @@ -0,0 +1 @@ +0fc8217e5a6b014e7545bb30cb33c5a9 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_109.png b/Doxygen/0.94/inherit_graph_109.png new file mode 100644 index 0000000..88d73fa Binary files /dev/null and b/Doxygen/0.94/inherit_graph_109.png differ diff --git a/Doxygen/0.94/inherit_graph_11.map b/Doxygen/0.94/inherit_graph_11.map new file mode 100644 index 0000000..e259ab0 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_11.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/inherit_graph_11.md5 b/Doxygen/0.94/inherit_graph_11.md5 new file mode 100644 index 0000000..f37eb31 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_11.md5 @@ -0,0 +1 @@ +9ad1b073630ecad71ef76e0fd62e6104 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_11.png b/Doxygen/0.94/inherit_graph_11.png new file mode 100644 index 0000000..50bb834 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_11.png differ diff --git a/Doxygen/0.94/inherit_graph_110.map b/Doxygen/0.94/inherit_graph_110.map new file mode 100644 index 0000000..fd1ae26 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_110.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_110.md5 b/Doxygen/0.94/inherit_graph_110.md5 new file mode 100644 index 0000000..78089af --- /dev/null +++ b/Doxygen/0.94/inherit_graph_110.md5 @@ -0,0 +1 @@ +709d987e5e584b21147bf3944474468c \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_110.png b/Doxygen/0.94/inherit_graph_110.png new file mode 100644 index 0000000..335430b Binary files /dev/null and b/Doxygen/0.94/inherit_graph_110.png differ diff --git a/Doxygen/0.94/inherit_graph_111.map b/Doxygen/0.94/inherit_graph_111.map new file mode 100644 index 0000000..9bd855b --- /dev/null +++ b/Doxygen/0.94/inherit_graph_111.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_111.md5 b/Doxygen/0.94/inherit_graph_111.md5 new file mode 100644 index 0000000..727a57d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_111.md5 @@ -0,0 +1 @@ +a0ad1a83fa8e156b5a381d978de99a23 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_111.png b/Doxygen/0.94/inherit_graph_111.png new file mode 100644 index 0000000..f9c80b6 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_111.png differ diff --git a/Doxygen/0.94/inherit_graph_112.map b/Doxygen/0.94/inherit_graph_112.map new file mode 100644 index 0000000..de572e6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_112.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_112.md5 b/Doxygen/0.94/inherit_graph_112.md5 new file mode 100644 index 0000000..cc7087c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_112.md5 @@ -0,0 +1 @@ +8f2b84031f907a5b808723821bc48005 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_112.png b/Doxygen/0.94/inherit_graph_112.png new file mode 100644 index 0000000..3d45963 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_112.png differ diff --git a/Doxygen/0.94/inherit_graph_113.map b/Doxygen/0.94/inherit_graph_113.map new file mode 100644 index 0000000..58a9c4f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_113.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_113.md5 b/Doxygen/0.94/inherit_graph_113.md5 new file mode 100644 index 0000000..006a176 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_113.md5 @@ -0,0 +1 @@ +1443ffb9b4baaf2fde89094d4ee48759 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_113.png b/Doxygen/0.94/inherit_graph_113.png new file mode 100644 index 0000000..9a3aea5 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_113.png differ diff --git a/Doxygen/0.94/inherit_graph_114.map b/Doxygen/0.94/inherit_graph_114.map new file mode 100644 index 0000000..460f918 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_114.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_114.md5 b/Doxygen/0.94/inherit_graph_114.md5 new file mode 100644 index 0000000..bcfbc96 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_114.md5 @@ -0,0 +1 @@ +92a0742241ef29bcf55c674ebf569f45 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_114.png b/Doxygen/0.94/inherit_graph_114.png new file mode 100644 index 0000000..1b87e36 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_114.png differ diff --git a/Doxygen/0.94/inherit_graph_115.map b/Doxygen/0.94/inherit_graph_115.map new file mode 100644 index 0000000..460f918 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_115.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_115.md5 b/Doxygen/0.94/inherit_graph_115.md5 new file mode 100644 index 0000000..8bfebf7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_115.md5 @@ -0,0 +1 @@ +fa3104d223280ab55a973203e6052b49 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_115.png b/Doxygen/0.94/inherit_graph_115.png new file mode 100644 index 0000000..3c302b6 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_115.png differ diff --git a/Doxygen/0.94/inherit_graph_116.map b/Doxygen/0.94/inherit_graph_116.map new file mode 100644 index 0000000..ad44f42 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_116.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_116.md5 b/Doxygen/0.94/inherit_graph_116.md5 new file mode 100644 index 0000000..0ba36e4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_116.md5 @@ -0,0 +1 @@ +60fe33ea40aa7da0ad634a664cb66683 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_116.png b/Doxygen/0.94/inherit_graph_116.png new file mode 100644 index 0000000..feed0cc Binary files /dev/null and b/Doxygen/0.94/inherit_graph_116.png differ diff --git a/Doxygen/0.94/inherit_graph_117.map b/Doxygen/0.94/inherit_graph_117.map new file mode 100644 index 0000000..0cd4f19 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_117.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_117.md5 b/Doxygen/0.94/inherit_graph_117.md5 new file mode 100644 index 0000000..30d741c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_117.md5 @@ -0,0 +1 @@ +66de0b2d27f8967b58d5d45791e1582f \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_117.png b/Doxygen/0.94/inherit_graph_117.png new file mode 100644 index 0000000..c3b0928 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_117.png differ diff --git a/Doxygen/0.94/inherit_graph_118.map b/Doxygen/0.94/inherit_graph_118.map new file mode 100644 index 0000000..6910abc --- /dev/null +++ b/Doxygen/0.94/inherit_graph_118.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_118.md5 b/Doxygen/0.94/inherit_graph_118.md5 new file mode 100644 index 0000000..aefcc77 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_118.md5 @@ -0,0 +1 @@ +312ef64ab535965c7c01b60493cccee4 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_118.png b/Doxygen/0.94/inherit_graph_118.png new file mode 100644 index 0000000..53d7714 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_118.png differ diff --git a/Doxygen/0.94/inherit_graph_119.map b/Doxygen/0.94/inherit_graph_119.map new file mode 100644 index 0000000..6910abc --- /dev/null +++ b/Doxygen/0.94/inherit_graph_119.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_119.md5 b/Doxygen/0.94/inherit_graph_119.md5 new file mode 100644 index 0000000..7f911cb --- /dev/null +++ b/Doxygen/0.94/inherit_graph_119.md5 @@ -0,0 +1 @@ +76eb038ed725db7efa6a2e4d6658759c \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_119.png b/Doxygen/0.94/inherit_graph_119.png new file mode 100644 index 0000000..02bbd84 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_119.png differ diff --git a/Doxygen/0.94/inherit_graph_12.map b/Doxygen/0.94/inherit_graph_12.map new file mode 100644 index 0000000..0bbb385 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_12.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/inherit_graph_12.md5 b/Doxygen/0.94/inherit_graph_12.md5 new file mode 100644 index 0000000..9715d61 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_12.md5 @@ -0,0 +1 @@ +d72d1be982d2e7e06fc10ec71a6d7468 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_12.png b/Doxygen/0.94/inherit_graph_12.png new file mode 100644 index 0000000..0d285f8 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_12.png differ diff --git a/Doxygen/0.94/inherit_graph_120.map b/Doxygen/0.94/inherit_graph_120.map new file mode 100644 index 0000000..7ad91a0 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_120.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_120.md5 b/Doxygen/0.94/inherit_graph_120.md5 new file mode 100644 index 0000000..9192262 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_120.md5 @@ -0,0 +1 @@ +96b8a91172dabb08c63f1c164b2888ef \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_120.png b/Doxygen/0.94/inherit_graph_120.png new file mode 100644 index 0000000..35276bc Binary files /dev/null and b/Doxygen/0.94/inherit_graph_120.png differ diff --git a/Doxygen/0.94/inherit_graph_121.map b/Doxygen/0.94/inherit_graph_121.map new file mode 100644 index 0000000..4442a0f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_121.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_121.md5 b/Doxygen/0.94/inherit_graph_121.md5 new file mode 100644 index 0000000..76d4c30 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_121.md5 @@ -0,0 +1 @@ +cebe1aaafb27250740db06e0f6161529 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_121.png b/Doxygen/0.94/inherit_graph_121.png new file mode 100644 index 0000000..617679c Binary files /dev/null and b/Doxygen/0.94/inherit_graph_121.png differ diff --git a/Doxygen/0.94/inherit_graph_122.map b/Doxygen/0.94/inherit_graph_122.map new file mode 100644 index 0000000..92b2fb9 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_122.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_122.md5 b/Doxygen/0.94/inherit_graph_122.md5 new file mode 100644 index 0000000..8c604f1 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_122.md5 @@ -0,0 +1 @@ +e72e77b4c844f2967df547990871842b \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_122.png b/Doxygen/0.94/inherit_graph_122.png new file mode 100644 index 0000000..0f698f1 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_122.png differ diff --git a/Doxygen/0.94/inherit_graph_123.map b/Doxygen/0.94/inherit_graph_123.map new file mode 100644 index 0000000..d59139d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_123.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_123.md5 b/Doxygen/0.94/inherit_graph_123.md5 new file mode 100644 index 0000000..ba38fd1 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_123.md5 @@ -0,0 +1 @@ +d9e6dfe53cae6cba40669419ec2b6ab8 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_123.png b/Doxygen/0.94/inherit_graph_123.png new file mode 100644 index 0000000..a1a6284 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_123.png differ diff --git a/Doxygen/0.94/inherit_graph_124.map b/Doxygen/0.94/inherit_graph_124.map new file mode 100644 index 0000000..ce1e0c4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_124.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_124.md5 b/Doxygen/0.94/inherit_graph_124.md5 new file mode 100644 index 0000000..9db5259 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_124.md5 @@ -0,0 +1 @@ +cace180f79f8a4337e149d98846daaaf \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_124.png b/Doxygen/0.94/inherit_graph_124.png new file mode 100644 index 0000000..02c0f85 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_124.png differ diff --git a/Doxygen/0.94/inherit_graph_125.map b/Doxygen/0.94/inherit_graph_125.map new file mode 100644 index 0000000..261ff04 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_125.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_125.md5 b/Doxygen/0.94/inherit_graph_125.md5 new file mode 100644 index 0000000..98b8f01 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_125.md5 @@ -0,0 +1 @@ +098c04a95d4b6207e27ef6ebb280b590 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_125.png b/Doxygen/0.94/inherit_graph_125.png new file mode 100644 index 0000000..c720b63 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_125.png differ diff --git a/Doxygen/0.94/inherit_graph_126.map b/Doxygen/0.94/inherit_graph_126.map new file mode 100644 index 0000000..261ff04 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_126.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_126.md5 b/Doxygen/0.94/inherit_graph_126.md5 new file mode 100644 index 0000000..dae232c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_126.md5 @@ -0,0 +1 @@ +9cf84b3bc70c10bcc9f9f11218a0e632 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_126.png b/Doxygen/0.94/inherit_graph_126.png new file mode 100644 index 0000000..9c9182c Binary files /dev/null and b/Doxygen/0.94/inherit_graph_126.png differ diff --git a/Doxygen/0.94/inherit_graph_127.map b/Doxygen/0.94/inherit_graph_127.map new file mode 100644 index 0000000..d00f4b0 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_127.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_127.md5 b/Doxygen/0.94/inherit_graph_127.md5 new file mode 100644 index 0000000..d69d11a --- /dev/null +++ b/Doxygen/0.94/inherit_graph_127.md5 @@ -0,0 +1 @@ +d284ae3dfecb3c0da324a92d6beb5ea1 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_127.png b/Doxygen/0.94/inherit_graph_127.png new file mode 100644 index 0000000..4c74366 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_127.png differ diff --git a/Doxygen/0.94/inherit_graph_128.map b/Doxygen/0.94/inherit_graph_128.map new file mode 100644 index 0000000..cbdeb57 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_128.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_128.md5 b/Doxygen/0.94/inherit_graph_128.md5 new file mode 100644 index 0000000..945e08a --- /dev/null +++ b/Doxygen/0.94/inherit_graph_128.md5 @@ -0,0 +1 @@ +0db3b4cfa6a4dc51a0ac58e6c8329552 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_128.png b/Doxygen/0.94/inherit_graph_128.png new file mode 100644 index 0000000..761a195 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_128.png differ diff --git a/Doxygen/0.94/inherit_graph_129.map b/Doxygen/0.94/inherit_graph_129.map new file mode 100644 index 0000000..85aa0d7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_129.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_129.md5 b/Doxygen/0.94/inherit_graph_129.md5 new file mode 100644 index 0000000..9ad901f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_129.md5 @@ -0,0 +1 @@ +5c4d0e1d8f112eb26dfeedc80e0b0d3d \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_129.png b/Doxygen/0.94/inherit_graph_129.png new file mode 100644 index 0000000..4933e27 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_129.png differ diff --git a/Doxygen/0.94/inherit_graph_13.map b/Doxygen/0.94/inherit_graph_13.map new file mode 100644 index 0000000..7d7e789 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_13.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/inherit_graph_13.md5 b/Doxygen/0.94/inherit_graph_13.md5 new file mode 100644 index 0000000..e7dcad6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_13.md5 @@ -0,0 +1 @@ +e72dcee9ac0a7f9f65d3536cb290bfc9 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_13.png b/Doxygen/0.94/inherit_graph_13.png new file mode 100644 index 0000000..da2e2bc Binary files /dev/null and b/Doxygen/0.94/inherit_graph_13.png differ diff --git a/Doxygen/0.94/inherit_graph_130.map b/Doxygen/0.94/inherit_graph_130.map new file mode 100644 index 0000000..de572e6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_130.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_130.md5 b/Doxygen/0.94/inherit_graph_130.md5 new file mode 100644 index 0000000..32d3f81 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_130.md5 @@ -0,0 +1 @@ +2b55d842f9e3f24399c1e28764a9ea6c \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_130.png b/Doxygen/0.94/inherit_graph_130.png new file mode 100644 index 0000000..0d928d0 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_130.png differ diff --git a/Doxygen/0.94/inherit_graph_131.map b/Doxygen/0.94/inherit_graph_131.map new file mode 100644 index 0000000..85aa0d7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_131.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_131.md5 b/Doxygen/0.94/inherit_graph_131.md5 new file mode 100644 index 0000000..a4157a5 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_131.md5 @@ -0,0 +1 @@ +2efce66808730d24701d7845745ffc54 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_131.png b/Doxygen/0.94/inherit_graph_131.png new file mode 100644 index 0000000..a17271e Binary files /dev/null and b/Doxygen/0.94/inherit_graph_131.png differ diff --git a/Doxygen/0.94/inherit_graph_132.map b/Doxygen/0.94/inherit_graph_132.map new file mode 100644 index 0000000..85aa0d7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_132.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_132.md5 b/Doxygen/0.94/inherit_graph_132.md5 new file mode 100644 index 0000000..1986ada --- /dev/null +++ b/Doxygen/0.94/inherit_graph_132.md5 @@ -0,0 +1 @@ +c3f2b5f9b41e14f3bba3d7ebb68a43e6 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_132.png b/Doxygen/0.94/inherit_graph_132.png new file mode 100644 index 0000000..f3e3baf Binary files /dev/null and b/Doxygen/0.94/inherit_graph_132.png differ diff --git a/Doxygen/0.94/inherit_graph_133.map b/Doxygen/0.94/inherit_graph_133.map new file mode 100644 index 0000000..261ff04 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_133.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_133.md5 b/Doxygen/0.94/inherit_graph_133.md5 new file mode 100644 index 0000000..972fea4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_133.md5 @@ -0,0 +1 @@ +89630facfe1da99e79016fa47274d58a \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_133.png b/Doxygen/0.94/inherit_graph_133.png new file mode 100644 index 0000000..c3d0ea2 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_133.png differ diff --git a/Doxygen/0.94/inherit_graph_134.map b/Doxygen/0.94/inherit_graph_134.map new file mode 100644 index 0000000..261ff04 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_134.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_134.md5 b/Doxygen/0.94/inherit_graph_134.md5 new file mode 100644 index 0000000..0960ecc --- /dev/null +++ b/Doxygen/0.94/inherit_graph_134.md5 @@ -0,0 +1 @@ +51c8d743535781f73d16fc18aa26bade \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_134.png b/Doxygen/0.94/inherit_graph_134.png new file mode 100644 index 0000000..5200c91 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_134.png differ diff --git a/Doxygen/0.94/inherit_graph_135.map b/Doxygen/0.94/inherit_graph_135.map new file mode 100644 index 0000000..d00f4b0 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_135.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_135.md5 b/Doxygen/0.94/inherit_graph_135.md5 new file mode 100644 index 0000000..3a3f6f3 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_135.md5 @@ -0,0 +1 @@ +9d604f686cae6b9244b87cae2eb20020 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_135.png b/Doxygen/0.94/inherit_graph_135.png new file mode 100644 index 0000000..b5e2196 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_135.png differ diff --git a/Doxygen/0.94/inherit_graph_136.map b/Doxygen/0.94/inherit_graph_136.map new file mode 100644 index 0000000..cbdeb57 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_136.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_136.md5 b/Doxygen/0.94/inherit_graph_136.md5 new file mode 100644 index 0000000..e5fb137 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_136.md5 @@ -0,0 +1 @@ +79b0a05627b39560a0482e5c07cce86c \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_136.png b/Doxygen/0.94/inherit_graph_136.png new file mode 100644 index 0000000..1716802 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_136.png differ diff --git a/Doxygen/0.94/inherit_graph_137.map b/Doxygen/0.94/inherit_graph_137.map new file mode 100644 index 0000000..85aa0d7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_137.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_137.md5 b/Doxygen/0.94/inherit_graph_137.md5 new file mode 100644 index 0000000..e6ed41f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_137.md5 @@ -0,0 +1 @@ +dbe0caa37829f59cf6d2611cd1a6def5 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_137.png b/Doxygen/0.94/inherit_graph_137.png new file mode 100644 index 0000000..7a1f98a Binary files /dev/null and b/Doxygen/0.94/inherit_graph_137.png differ diff --git a/Doxygen/0.94/inherit_graph_138.map b/Doxygen/0.94/inherit_graph_138.map new file mode 100644 index 0000000..de572e6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_138.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_138.md5 b/Doxygen/0.94/inherit_graph_138.md5 new file mode 100644 index 0000000..4fb9a60 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_138.md5 @@ -0,0 +1 @@ +b875dde009ae5f836b0ebd5fb442c652 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_138.png b/Doxygen/0.94/inherit_graph_138.png new file mode 100644 index 0000000..da4f360 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_138.png differ diff --git a/Doxygen/0.94/inherit_graph_139.map b/Doxygen/0.94/inherit_graph_139.map new file mode 100644 index 0000000..85aa0d7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_139.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_139.md5 b/Doxygen/0.94/inherit_graph_139.md5 new file mode 100644 index 0000000..b763a67 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_139.md5 @@ -0,0 +1 @@ +af158f05871cbc827a002e4bc02b22a0 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_139.png b/Doxygen/0.94/inherit_graph_139.png new file mode 100644 index 0000000..8ea77c6 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_139.png differ diff --git a/Doxygen/0.94/inherit_graph_14.map b/Doxygen/0.94/inherit_graph_14.map new file mode 100644 index 0000000..808293b --- /dev/null +++ b/Doxygen/0.94/inherit_graph_14.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/inherit_graph_14.md5 b/Doxygen/0.94/inherit_graph_14.md5 new file mode 100644 index 0000000..cd3a642 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_14.md5 @@ -0,0 +1 @@ +c759a8c7a8346d8b13e6bcd404d5193d \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_14.png b/Doxygen/0.94/inherit_graph_14.png new file mode 100644 index 0000000..7904ac8 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_14.png differ diff --git a/Doxygen/0.94/inherit_graph_140.map b/Doxygen/0.94/inherit_graph_140.map new file mode 100644 index 0000000..85aa0d7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_140.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_140.md5 b/Doxygen/0.94/inherit_graph_140.md5 new file mode 100644 index 0000000..013dd0f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_140.md5 @@ -0,0 +1 @@ +271695052d79ff710bbfc64aee8d045b \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_140.png b/Doxygen/0.94/inherit_graph_140.png new file mode 100644 index 0000000..a66abb9 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_140.png differ diff --git a/Doxygen/0.94/inherit_graph_141.map b/Doxygen/0.94/inherit_graph_141.map new file mode 100644 index 0000000..85aa0d7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_141.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_141.md5 b/Doxygen/0.94/inherit_graph_141.md5 new file mode 100644 index 0000000..92341b6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_141.md5 @@ -0,0 +1 @@ +a4a3af5717c32fbf16e37c05f2305edd \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_141.png b/Doxygen/0.94/inherit_graph_141.png new file mode 100644 index 0000000..a24cfac Binary files /dev/null and b/Doxygen/0.94/inherit_graph_141.png differ diff --git a/Doxygen/0.94/inherit_graph_142.map b/Doxygen/0.94/inherit_graph_142.map new file mode 100644 index 0000000..85aa0d7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_142.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_142.md5 b/Doxygen/0.94/inherit_graph_142.md5 new file mode 100644 index 0000000..5496e90 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_142.md5 @@ -0,0 +1 @@ +7b6e7dc79684afbf28ba5794ca96ffa7 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_142.png b/Doxygen/0.94/inherit_graph_142.png new file mode 100644 index 0000000..f742d0d Binary files /dev/null and b/Doxygen/0.94/inherit_graph_142.png differ diff --git a/Doxygen/0.94/inherit_graph_143.map b/Doxygen/0.94/inherit_graph_143.map new file mode 100644 index 0000000..ae0ec99 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_143.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_143.md5 b/Doxygen/0.94/inherit_graph_143.md5 new file mode 100644 index 0000000..543d4ff --- /dev/null +++ b/Doxygen/0.94/inherit_graph_143.md5 @@ -0,0 +1 @@ +28ac15f2a37b5d4e570f0564e0e464bf \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_143.png b/Doxygen/0.94/inherit_graph_143.png new file mode 100644 index 0000000..c1a20e5 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_143.png differ diff --git a/Doxygen/0.94/inherit_graph_144.map b/Doxygen/0.94/inherit_graph_144.map new file mode 100644 index 0000000..d0f8952 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_144.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_144.md5 b/Doxygen/0.94/inherit_graph_144.md5 new file mode 100644 index 0000000..29d6b3c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_144.md5 @@ -0,0 +1 @@ +f7eebecc544736b60d0702ccbb4bf409 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_144.png b/Doxygen/0.94/inherit_graph_144.png new file mode 100644 index 0000000..a0a2a61 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_144.png differ diff --git a/Doxygen/0.94/inherit_graph_145.map b/Doxygen/0.94/inherit_graph_145.map new file mode 100644 index 0000000..9e45694 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_145.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_145.md5 b/Doxygen/0.94/inherit_graph_145.md5 new file mode 100644 index 0000000..4356be2 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_145.md5 @@ -0,0 +1 @@ +a7b29e08a38f507716aab35a265387c9 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_145.png b/Doxygen/0.94/inherit_graph_145.png new file mode 100644 index 0000000..7d2fd42 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_145.png differ diff --git a/Doxygen/0.94/inherit_graph_146.map b/Doxygen/0.94/inherit_graph_146.map new file mode 100644 index 0000000..de572e6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_146.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_146.md5 b/Doxygen/0.94/inherit_graph_146.md5 new file mode 100644 index 0000000..d3ff959 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_146.md5 @@ -0,0 +1 @@ +2d8ff9e7524a0429b56e58ea301de8f6 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_146.png b/Doxygen/0.94/inherit_graph_146.png new file mode 100644 index 0000000..07fe994 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_146.png differ diff --git a/Doxygen/0.94/inherit_graph_147.map b/Doxygen/0.94/inherit_graph_147.map new file mode 100644 index 0000000..9e45694 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_147.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_147.md5 b/Doxygen/0.94/inherit_graph_147.md5 new file mode 100644 index 0000000..8daeed8 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_147.md5 @@ -0,0 +1 @@ +ec530e20b9bb862f15d5719dd5fe690d \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_147.png b/Doxygen/0.94/inherit_graph_147.png new file mode 100644 index 0000000..4bda987 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_147.png differ diff --git a/Doxygen/0.94/inherit_graph_148.map b/Doxygen/0.94/inherit_graph_148.map new file mode 100644 index 0000000..9e45694 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_148.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_148.md5 b/Doxygen/0.94/inherit_graph_148.md5 new file mode 100644 index 0000000..c4468f8 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_148.md5 @@ -0,0 +1 @@ +0da66e6f01d4d8e4050780af1f74b727 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_148.png b/Doxygen/0.94/inherit_graph_148.png new file mode 100644 index 0000000..5a1269d Binary files /dev/null and b/Doxygen/0.94/inherit_graph_148.png differ diff --git a/Doxygen/0.94/inherit_graph_149.map b/Doxygen/0.94/inherit_graph_149.map new file mode 100644 index 0000000..a50f1ab --- /dev/null +++ b/Doxygen/0.94/inherit_graph_149.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_149.md5 b/Doxygen/0.94/inherit_graph_149.md5 new file mode 100644 index 0000000..7f3242f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_149.md5 @@ -0,0 +1 @@ +c8aed3c26539f2967208805bd3b71b87 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_149.png b/Doxygen/0.94/inherit_graph_149.png new file mode 100644 index 0000000..772a74a Binary files /dev/null and b/Doxygen/0.94/inherit_graph_149.png differ diff --git a/Doxygen/0.94/inherit_graph_15.map b/Doxygen/0.94/inherit_graph_15.map new file mode 100644 index 0000000..f2f4c15 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_15.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_15.md5 b/Doxygen/0.94/inherit_graph_15.md5 new file mode 100644 index 0000000..8140123 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_15.md5 @@ -0,0 +1 @@ +1b50eb70b0dc9e1c3deef45bbea11f7c \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_15.png b/Doxygen/0.94/inherit_graph_15.png new file mode 100644 index 0000000..de033cc Binary files /dev/null and b/Doxygen/0.94/inherit_graph_15.png differ diff --git a/Doxygen/0.94/inherit_graph_150.map b/Doxygen/0.94/inherit_graph_150.map new file mode 100644 index 0000000..2f346b5 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_150.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_150.md5 b/Doxygen/0.94/inherit_graph_150.md5 new file mode 100644 index 0000000..d92d342 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_150.md5 @@ -0,0 +1 @@ +690953fa4932828f023ad40427c7ad45 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_150.png b/Doxygen/0.94/inherit_graph_150.png new file mode 100644 index 0000000..a7fa2c1 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_150.png differ diff --git a/Doxygen/0.94/inherit_graph_151.map b/Doxygen/0.94/inherit_graph_151.map new file mode 100644 index 0000000..1170e86 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_151.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_151.md5 b/Doxygen/0.94/inherit_graph_151.md5 new file mode 100644 index 0000000..785ec10 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_151.md5 @@ -0,0 +1 @@ +caf371f6d1ed1bfa21ac9f4572bf5704 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_151.png b/Doxygen/0.94/inherit_graph_151.png new file mode 100644 index 0000000..13df850 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_151.png differ diff --git a/Doxygen/0.94/inherit_graph_152.map b/Doxygen/0.94/inherit_graph_152.map new file mode 100644 index 0000000..de572e6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_152.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_152.md5 b/Doxygen/0.94/inherit_graph_152.md5 new file mode 100644 index 0000000..e0c0a6d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_152.md5 @@ -0,0 +1 @@ +dbb0f740136bc3e0afcb387356a48a00 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_152.png b/Doxygen/0.94/inherit_graph_152.png new file mode 100644 index 0000000..087bf6a Binary files /dev/null and b/Doxygen/0.94/inherit_graph_152.png differ diff --git a/Doxygen/0.94/inherit_graph_153.map b/Doxygen/0.94/inherit_graph_153.map new file mode 100644 index 0000000..d960810 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_153.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_153.md5 b/Doxygen/0.94/inherit_graph_153.md5 new file mode 100644 index 0000000..10b68ab --- /dev/null +++ b/Doxygen/0.94/inherit_graph_153.md5 @@ -0,0 +1 @@ +359d7d48119716662f40ce91429c53ae \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_153.png b/Doxygen/0.94/inherit_graph_153.png new file mode 100644 index 0000000..8d280f5 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_153.png differ diff --git a/Doxygen/0.94/inherit_graph_154.map b/Doxygen/0.94/inherit_graph_154.map new file mode 100644 index 0000000..1045801 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_154.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_154.md5 b/Doxygen/0.94/inherit_graph_154.md5 new file mode 100644 index 0000000..dd5a4a7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_154.md5 @@ -0,0 +1 @@ +fbacc04008813e06512ae44ab8a70eb5 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_154.png b/Doxygen/0.94/inherit_graph_154.png new file mode 100644 index 0000000..e98677b Binary files /dev/null and b/Doxygen/0.94/inherit_graph_154.png differ diff --git a/Doxygen/0.94/inherit_graph_155.map b/Doxygen/0.94/inherit_graph_155.map new file mode 100644 index 0000000..cbdf3e7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_155.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_155.md5 b/Doxygen/0.94/inherit_graph_155.md5 new file mode 100644 index 0000000..a9ddaa1 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_155.md5 @@ -0,0 +1 @@ +4561316280bdd95c2b6ce01c9cf4a3cd \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_155.png b/Doxygen/0.94/inherit_graph_155.png new file mode 100644 index 0000000..e47809e Binary files /dev/null and b/Doxygen/0.94/inherit_graph_155.png differ diff --git a/Doxygen/0.94/inherit_graph_156.map b/Doxygen/0.94/inherit_graph_156.map new file mode 100644 index 0000000..c9c5968 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_156.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_156.md5 b/Doxygen/0.94/inherit_graph_156.md5 new file mode 100644 index 0000000..81ade87 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_156.md5 @@ -0,0 +1 @@ +6a419d1a96735cb76ddcdf88151e7ce5 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_156.png b/Doxygen/0.94/inherit_graph_156.png new file mode 100644 index 0000000..6cb6027 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_156.png differ diff --git a/Doxygen/0.94/inherit_graph_157.map b/Doxygen/0.94/inherit_graph_157.map new file mode 100644 index 0000000..4442a0f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_157.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_157.md5 b/Doxygen/0.94/inherit_graph_157.md5 new file mode 100644 index 0000000..558e9c5 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_157.md5 @@ -0,0 +1 @@ +2062507b747d6900b7231ef6961ac83e \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_157.png b/Doxygen/0.94/inherit_graph_157.png new file mode 100644 index 0000000..baafe94 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_157.png differ diff --git a/Doxygen/0.94/inherit_graph_158.map b/Doxygen/0.94/inherit_graph_158.map new file mode 100644 index 0000000..c989406 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_158.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_158.md5 b/Doxygen/0.94/inherit_graph_158.md5 new file mode 100644 index 0000000..f119a32 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_158.md5 @@ -0,0 +1 @@ +f9b28e09bde0ec0907e76137eae6588e \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_158.png b/Doxygen/0.94/inherit_graph_158.png new file mode 100644 index 0000000..fa1903f Binary files /dev/null and b/Doxygen/0.94/inherit_graph_158.png differ diff --git a/Doxygen/0.94/inherit_graph_159.map b/Doxygen/0.94/inherit_graph_159.map new file mode 100644 index 0000000..4442a0f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_159.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_159.md5 b/Doxygen/0.94/inherit_graph_159.md5 new file mode 100644 index 0000000..1bb5d95 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_159.md5 @@ -0,0 +1 @@ +7d37213f450b2b2daff5b2642376ceef \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_159.png b/Doxygen/0.94/inherit_graph_159.png new file mode 100644 index 0000000..6fa4f6a Binary files /dev/null and b/Doxygen/0.94/inherit_graph_159.png differ diff --git a/Doxygen/0.94/inherit_graph_16.map b/Doxygen/0.94/inherit_graph_16.map new file mode 100644 index 0000000..6038ebc --- /dev/null +++ b/Doxygen/0.94/inherit_graph_16.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/inherit_graph_16.md5 b/Doxygen/0.94/inherit_graph_16.md5 new file mode 100644 index 0000000..9c685a7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_16.md5 @@ -0,0 +1 @@ +60b69d7a7d6a3e3f117372e36b964c74 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_16.png b/Doxygen/0.94/inherit_graph_16.png new file mode 100644 index 0000000..a802ff0 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_16.png differ diff --git a/Doxygen/0.94/inherit_graph_160.map b/Doxygen/0.94/inherit_graph_160.map new file mode 100644 index 0000000..cbdf3e7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_160.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_160.md5 b/Doxygen/0.94/inherit_graph_160.md5 new file mode 100644 index 0000000..3d39f4f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_160.md5 @@ -0,0 +1 @@ +e3f452818396a3fbe0d8f85faf7e7dc7 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_160.png b/Doxygen/0.94/inherit_graph_160.png new file mode 100644 index 0000000..bbddde5 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_160.png differ diff --git a/Doxygen/0.94/inherit_graph_161.map b/Doxygen/0.94/inherit_graph_161.map new file mode 100644 index 0000000..cca3d7a --- /dev/null +++ b/Doxygen/0.94/inherit_graph_161.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_161.md5 b/Doxygen/0.94/inherit_graph_161.md5 new file mode 100644 index 0000000..24d96b4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_161.md5 @@ -0,0 +1 @@ +a0c0f107ad8e002f8bd844ebf1dd0078 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_161.png b/Doxygen/0.94/inherit_graph_161.png new file mode 100644 index 0000000..9a7c871 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_161.png differ diff --git a/Doxygen/0.94/inherit_graph_162.map b/Doxygen/0.94/inherit_graph_162.map new file mode 100644 index 0000000..de572e6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_162.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_162.md5 b/Doxygen/0.94/inherit_graph_162.md5 new file mode 100644 index 0000000..16254b9 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_162.md5 @@ -0,0 +1 @@ +ede3d810429adfa7f08aa9a8a3681956 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_162.png b/Doxygen/0.94/inherit_graph_162.png new file mode 100644 index 0000000..ae63fd9 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_162.png differ diff --git a/Doxygen/0.94/inherit_graph_163.map b/Doxygen/0.94/inherit_graph_163.map new file mode 100644 index 0000000..cbf2d8a --- /dev/null +++ b/Doxygen/0.94/inherit_graph_163.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_163.md5 b/Doxygen/0.94/inherit_graph_163.md5 new file mode 100644 index 0000000..e3be608 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_163.md5 @@ -0,0 +1 @@ +1386f179f5ee572f5418d0a27eb0db46 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_163.png b/Doxygen/0.94/inherit_graph_163.png new file mode 100644 index 0000000..0bdd88c Binary files /dev/null and b/Doxygen/0.94/inherit_graph_163.png differ diff --git a/Doxygen/0.94/inherit_graph_164.map b/Doxygen/0.94/inherit_graph_164.map new file mode 100644 index 0000000..de572e6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_164.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_164.md5 b/Doxygen/0.94/inherit_graph_164.md5 new file mode 100644 index 0000000..39aada3 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_164.md5 @@ -0,0 +1 @@ +d8b3cd89af63221ee1c4f6e33943b7ac \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_164.png b/Doxygen/0.94/inherit_graph_164.png new file mode 100644 index 0000000..68453b0 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_164.png differ diff --git a/Doxygen/0.94/inherit_graph_165.map b/Doxygen/0.94/inherit_graph_165.map new file mode 100644 index 0000000..de572e6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_165.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_165.md5 b/Doxygen/0.94/inherit_graph_165.md5 new file mode 100644 index 0000000..b509a35 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_165.md5 @@ -0,0 +1 @@ +12fc9c4946169b5d2fd62c555415ee4b \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_165.png b/Doxygen/0.94/inherit_graph_165.png new file mode 100644 index 0000000..fdb45ba Binary files /dev/null and b/Doxygen/0.94/inherit_graph_165.png differ diff --git a/Doxygen/0.94/inherit_graph_166.map b/Doxygen/0.94/inherit_graph_166.map new file mode 100644 index 0000000..4606283 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_166.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_166.md5 b/Doxygen/0.94/inherit_graph_166.md5 new file mode 100644 index 0000000..e3f61b5 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_166.md5 @@ -0,0 +1 @@ +31af41341958ad6a3803c72d55e737c7 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_166.png b/Doxygen/0.94/inherit_graph_166.png new file mode 100644 index 0000000..936b92d Binary files /dev/null and b/Doxygen/0.94/inherit_graph_166.png differ diff --git a/Doxygen/0.94/inherit_graph_167.map b/Doxygen/0.94/inherit_graph_167.map new file mode 100644 index 0000000..53a7161 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_167.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_167.md5 b/Doxygen/0.94/inherit_graph_167.md5 new file mode 100644 index 0000000..05200d6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_167.md5 @@ -0,0 +1 @@ +a7e3ac8014d514fb65e962e171320de7 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_167.png b/Doxygen/0.94/inherit_graph_167.png new file mode 100644 index 0000000..9aba861 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_167.png differ diff --git a/Doxygen/0.94/inherit_graph_168.map b/Doxygen/0.94/inherit_graph_168.map new file mode 100644 index 0000000..f87abea --- /dev/null +++ b/Doxygen/0.94/inherit_graph_168.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_168.md5 b/Doxygen/0.94/inherit_graph_168.md5 new file mode 100644 index 0000000..a141cfe --- /dev/null +++ b/Doxygen/0.94/inherit_graph_168.md5 @@ -0,0 +1 @@ +e2992b7d3ac5c30aaea7a186e599844c \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_168.png b/Doxygen/0.94/inherit_graph_168.png new file mode 100644 index 0000000..8d982b3 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_168.png differ diff --git a/Doxygen/0.94/inherit_graph_169.map b/Doxygen/0.94/inherit_graph_169.map new file mode 100644 index 0000000..0cd4f19 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_169.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_169.md5 b/Doxygen/0.94/inherit_graph_169.md5 new file mode 100644 index 0000000..15885d4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_169.md5 @@ -0,0 +1 @@ +d88dc2e386d02e179354051225e76ed9 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_169.png b/Doxygen/0.94/inherit_graph_169.png new file mode 100644 index 0000000..08ed781 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_169.png differ diff --git a/Doxygen/0.94/inherit_graph_17.map b/Doxygen/0.94/inherit_graph_17.map new file mode 100644 index 0000000..017866b --- /dev/null +++ b/Doxygen/0.94/inherit_graph_17.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/inherit_graph_17.md5 b/Doxygen/0.94/inherit_graph_17.md5 new file mode 100644 index 0000000..e0b3ea2 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_17.md5 @@ -0,0 +1 @@ +a3a4aba3c1ad4e280e4b0952c1758e11 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_17.png b/Doxygen/0.94/inherit_graph_17.png new file mode 100644 index 0000000..2ad8128 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_17.png differ diff --git a/Doxygen/0.94/inherit_graph_170.map b/Doxygen/0.94/inherit_graph_170.map new file mode 100644 index 0000000..0a69c9b --- /dev/null +++ b/Doxygen/0.94/inherit_graph_170.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_170.md5 b/Doxygen/0.94/inherit_graph_170.md5 new file mode 100644 index 0000000..56cd630 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_170.md5 @@ -0,0 +1 @@ +7359f787d3bc2ff904cb5a55b2f9f3bd \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_170.png b/Doxygen/0.94/inherit_graph_170.png new file mode 100644 index 0000000..e3ff877 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_170.png differ diff --git a/Doxygen/0.94/inherit_graph_171.map b/Doxygen/0.94/inherit_graph_171.map new file mode 100644 index 0000000..414b93f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_171.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_171.md5 b/Doxygen/0.94/inherit_graph_171.md5 new file mode 100644 index 0000000..699c8d3 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_171.md5 @@ -0,0 +1 @@ +e583a5b5215026289ec576e409dd1087 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_171.png b/Doxygen/0.94/inherit_graph_171.png new file mode 100644 index 0000000..0eb5973 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_171.png differ diff --git a/Doxygen/0.94/inherit_graph_172.map b/Doxygen/0.94/inherit_graph_172.map new file mode 100644 index 0000000..763797d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_172.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_172.md5 b/Doxygen/0.94/inherit_graph_172.md5 new file mode 100644 index 0000000..35e3544 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_172.md5 @@ -0,0 +1 @@ +ee6dfed0522f8cd2b6a04eb3b2218e81 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_172.png b/Doxygen/0.94/inherit_graph_172.png new file mode 100644 index 0000000..40636df Binary files /dev/null and b/Doxygen/0.94/inherit_graph_172.png differ diff --git a/Doxygen/0.94/inherit_graph_173.map b/Doxygen/0.94/inherit_graph_173.map new file mode 100644 index 0000000..29bd0d0 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_173.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_173.md5 b/Doxygen/0.94/inherit_graph_173.md5 new file mode 100644 index 0000000..5e84a21 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_173.md5 @@ -0,0 +1 @@ +11e2917dcd9c52836418a9df9d01a3fc \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_173.png b/Doxygen/0.94/inherit_graph_173.png new file mode 100644 index 0000000..7a1de06 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_173.png differ diff --git a/Doxygen/0.94/inherit_graph_174.map b/Doxygen/0.94/inherit_graph_174.map new file mode 100644 index 0000000..94b2784 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_174.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_174.md5 b/Doxygen/0.94/inherit_graph_174.md5 new file mode 100644 index 0000000..cc0c98b --- /dev/null +++ b/Doxygen/0.94/inherit_graph_174.md5 @@ -0,0 +1 @@ +0bfd9aab1d5192d8bc624fcfa101df60 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_174.png b/Doxygen/0.94/inherit_graph_174.png new file mode 100644 index 0000000..1aa4068 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_174.png differ diff --git a/Doxygen/0.94/inherit_graph_175.map b/Doxygen/0.94/inherit_graph_175.map new file mode 100644 index 0000000..a112e99 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_175.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_175.md5 b/Doxygen/0.94/inherit_graph_175.md5 new file mode 100644 index 0000000..d4669f7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_175.md5 @@ -0,0 +1 @@ +38cd16c072b1d567f6fee83688692eb8 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_175.png b/Doxygen/0.94/inherit_graph_175.png new file mode 100644 index 0000000..96159d6 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_175.png differ diff --git a/Doxygen/0.94/inherit_graph_176.map b/Doxygen/0.94/inherit_graph_176.map new file mode 100644 index 0000000..9923676 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_176.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_176.md5 b/Doxygen/0.94/inherit_graph_176.md5 new file mode 100644 index 0000000..5a60dcb --- /dev/null +++ b/Doxygen/0.94/inherit_graph_176.md5 @@ -0,0 +1 @@ +f6d2edff9a51b54dd9537ec3760e85e7 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_176.png b/Doxygen/0.94/inherit_graph_176.png new file mode 100644 index 0000000..08270a9 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_176.png differ diff --git a/Doxygen/0.94/inherit_graph_177.map b/Doxygen/0.94/inherit_graph_177.map new file mode 100644 index 0000000..a3bea90 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_177.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_177.md5 b/Doxygen/0.94/inherit_graph_177.md5 new file mode 100644 index 0000000..3d4143b --- /dev/null +++ b/Doxygen/0.94/inherit_graph_177.md5 @@ -0,0 +1 @@ +73e20f5e84029bfcfef2bffc6bc9650b \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_177.png b/Doxygen/0.94/inherit_graph_177.png new file mode 100644 index 0000000..9ea1453 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_177.png differ diff --git a/Doxygen/0.94/inherit_graph_178.map b/Doxygen/0.94/inherit_graph_178.map new file mode 100644 index 0000000..81e1214 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_178.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_178.md5 b/Doxygen/0.94/inherit_graph_178.md5 new file mode 100644 index 0000000..ca9432f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_178.md5 @@ -0,0 +1 @@ +96940c901b0b98187377169e4f38bc6b \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_178.png b/Doxygen/0.94/inherit_graph_178.png new file mode 100644 index 0000000..ab10c8c Binary files /dev/null and b/Doxygen/0.94/inherit_graph_178.png differ diff --git a/Doxygen/0.94/inherit_graph_179.map b/Doxygen/0.94/inherit_graph_179.map new file mode 100644 index 0000000..81e1214 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_179.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_179.md5 b/Doxygen/0.94/inherit_graph_179.md5 new file mode 100644 index 0000000..d0c4265 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_179.md5 @@ -0,0 +1 @@ +1ffb61d3d29d7680a6e3588f5dfee0b2 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_179.png b/Doxygen/0.94/inherit_graph_179.png new file mode 100644 index 0000000..cd53d52 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_179.png differ diff --git a/Doxygen/0.94/inherit_graph_18.map b/Doxygen/0.94/inherit_graph_18.map new file mode 100644 index 0000000..c2bb9a1 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_18.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_18.md5 b/Doxygen/0.94/inherit_graph_18.md5 new file mode 100644 index 0000000..00a308c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_18.md5 @@ -0,0 +1 @@ +276617c61812b5e6a66d3f62393e7728 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_18.png b/Doxygen/0.94/inherit_graph_18.png new file mode 100644 index 0000000..caf223b Binary files /dev/null and b/Doxygen/0.94/inherit_graph_18.png differ diff --git a/Doxygen/0.94/inherit_graph_180.map b/Doxygen/0.94/inherit_graph_180.map new file mode 100644 index 0000000..adc790c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_180.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_180.md5 b/Doxygen/0.94/inherit_graph_180.md5 new file mode 100644 index 0000000..35d74ac --- /dev/null +++ b/Doxygen/0.94/inherit_graph_180.md5 @@ -0,0 +1 @@ +9eeec14489745864bf1a4ad85c836d70 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_180.png b/Doxygen/0.94/inherit_graph_180.png new file mode 100644 index 0000000..21cb97e Binary files /dev/null and b/Doxygen/0.94/inherit_graph_180.png differ diff --git a/Doxygen/0.94/inherit_graph_181.map b/Doxygen/0.94/inherit_graph_181.map new file mode 100644 index 0000000..d613da7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_181.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_181.md5 b/Doxygen/0.94/inherit_graph_181.md5 new file mode 100644 index 0000000..4521d60 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_181.md5 @@ -0,0 +1 @@ +2550987d22cf1d6519b67febf04ddee7 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_181.png b/Doxygen/0.94/inherit_graph_181.png new file mode 100644 index 0000000..f671e0f Binary files /dev/null and b/Doxygen/0.94/inherit_graph_181.png differ diff --git a/Doxygen/0.94/inherit_graph_182.map b/Doxygen/0.94/inherit_graph_182.map new file mode 100644 index 0000000..4ece004 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_182.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_182.md5 b/Doxygen/0.94/inherit_graph_182.md5 new file mode 100644 index 0000000..8788eeb --- /dev/null +++ b/Doxygen/0.94/inherit_graph_182.md5 @@ -0,0 +1 @@ +56de39793ecb2f5ca174705f5e976555 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_182.png b/Doxygen/0.94/inherit_graph_182.png new file mode 100644 index 0000000..051a09c Binary files /dev/null and b/Doxygen/0.94/inherit_graph_182.png differ diff --git a/Doxygen/0.94/inherit_graph_183.map b/Doxygen/0.94/inherit_graph_183.map new file mode 100644 index 0000000..def642f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_183.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_183.md5 b/Doxygen/0.94/inherit_graph_183.md5 new file mode 100644 index 0000000..bae6662 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_183.md5 @@ -0,0 +1 @@ +61140615b38c35d9d40b76e08854b76a \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_183.png b/Doxygen/0.94/inherit_graph_183.png new file mode 100644 index 0000000..91fe41b Binary files /dev/null and b/Doxygen/0.94/inherit_graph_183.png differ diff --git a/Doxygen/0.94/inherit_graph_184.map b/Doxygen/0.94/inherit_graph_184.map new file mode 100644 index 0000000..0cd4f19 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_184.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_184.md5 b/Doxygen/0.94/inherit_graph_184.md5 new file mode 100644 index 0000000..2e8c359 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_184.md5 @@ -0,0 +1 @@ +22ee840c39e69a5d1059cde0e40db187 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_184.png b/Doxygen/0.94/inherit_graph_184.png new file mode 100644 index 0000000..acf7b9d Binary files /dev/null and b/Doxygen/0.94/inherit_graph_184.png differ diff --git a/Doxygen/0.94/inherit_graph_185.map b/Doxygen/0.94/inherit_graph_185.map new file mode 100644 index 0000000..0cd4f19 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_185.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_185.md5 b/Doxygen/0.94/inherit_graph_185.md5 new file mode 100644 index 0000000..ed433d0 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_185.md5 @@ -0,0 +1 @@ +68c6f83b94ca8ca7d7f21e1e1daded10 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_185.png b/Doxygen/0.94/inherit_graph_185.png new file mode 100644 index 0000000..9bde213 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_185.png differ diff --git a/Doxygen/0.94/inherit_graph_186.map b/Doxygen/0.94/inherit_graph_186.map new file mode 100644 index 0000000..01053e2 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_186.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_186.md5 b/Doxygen/0.94/inherit_graph_186.md5 new file mode 100644 index 0000000..5e6dd5d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_186.md5 @@ -0,0 +1 @@ +df7292567d392824e80295ad29448054 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_186.png b/Doxygen/0.94/inherit_graph_186.png new file mode 100644 index 0000000..d3acc7b Binary files /dev/null and b/Doxygen/0.94/inherit_graph_186.png differ diff --git a/Doxygen/0.94/inherit_graph_187.map b/Doxygen/0.94/inherit_graph_187.map new file mode 100644 index 0000000..261ff04 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_187.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_187.md5 b/Doxygen/0.94/inherit_graph_187.md5 new file mode 100644 index 0000000..49e807e --- /dev/null +++ b/Doxygen/0.94/inherit_graph_187.md5 @@ -0,0 +1 @@ +d4543a4067b8b4d997129dac53afea24 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_187.png b/Doxygen/0.94/inherit_graph_187.png new file mode 100644 index 0000000..fc70955 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_187.png differ diff --git a/Doxygen/0.94/inherit_graph_188.map b/Doxygen/0.94/inherit_graph_188.map new file mode 100644 index 0000000..8240e38 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_188.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_188.md5 b/Doxygen/0.94/inherit_graph_188.md5 new file mode 100644 index 0000000..0d6bebc --- /dev/null +++ b/Doxygen/0.94/inherit_graph_188.md5 @@ -0,0 +1 @@ +c97f172215eba2ebf2338a0d642c7e50 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_188.png b/Doxygen/0.94/inherit_graph_188.png new file mode 100644 index 0000000..50176b6 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_188.png differ diff --git a/Doxygen/0.94/inherit_graph_189.map b/Doxygen/0.94/inherit_graph_189.map new file mode 100644 index 0000000..e3a0da4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_189.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_189.md5 b/Doxygen/0.94/inherit_graph_189.md5 new file mode 100644 index 0000000..041c4d4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_189.md5 @@ -0,0 +1 @@ +14c951e570c940f945003f95737b5524 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_189.png b/Doxygen/0.94/inherit_graph_189.png new file mode 100644 index 0000000..b74a51c Binary files /dev/null and b/Doxygen/0.94/inherit_graph_189.png differ diff --git a/Doxygen/0.94/inherit_graph_19.map b/Doxygen/0.94/inherit_graph_19.map new file mode 100644 index 0000000..f4ed180 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_19.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_19.md5 b/Doxygen/0.94/inherit_graph_19.md5 new file mode 100644 index 0000000..2a5c462 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_19.md5 @@ -0,0 +1 @@ +e6f29e851cf5ee37f28a8458d43c1c0a \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_19.png b/Doxygen/0.94/inherit_graph_19.png new file mode 100644 index 0000000..a5b4ed4 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_19.png differ diff --git a/Doxygen/0.94/inherit_graph_190.map b/Doxygen/0.94/inherit_graph_190.map new file mode 100644 index 0000000..8240e38 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_190.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_190.md5 b/Doxygen/0.94/inherit_graph_190.md5 new file mode 100644 index 0000000..ed80e9e --- /dev/null +++ b/Doxygen/0.94/inherit_graph_190.md5 @@ -0,0 +1 @@ +165f696076f046cb929c7a2664b4f9c9 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_190.png b/Doxygen/0.94/inherit_graph_190.png new file mode 100644 index 0000000..0b871eb Binary files /dev/null and b/Doxygen/0.94/inherit_graph_190.png differ diff --git a/Doxygen/0.94/inherit_graph_191.map b/Doxygen/0.94/inherit_graph_191.map new file mode 100644 index 0000000..8240e38 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_191.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_191.md5 b/Doxygen/0.94/inherit_graph_191.md5 new file mode 100644 index 0000000..e65a42f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_191.md5 @@ -0,0 +1 @@ +cfe762ea6af4b75aa4bf24443b849ff7 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_191.png b/Doxygen/0.94/inherit_graph_191.png new file mode 100644 index 0000000..df6df3f Binary files /dev/null and b/Doxygen/0.94/inherit_graph_191.png differ diff --git a/Doxygen/0.94/inherit_graph_192.map b/Doxygen/0.94/inherit_graph_192.map new file mode 100644 index 0000000..93177bb --- /dev/null +++ b/Doxygen/0.94/inherit_graph_192.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_192.md5 b/Doxygen/0.94/inherit_graph_192.md5 new file mode 100644 index 0000000..93865eb --- /dev/null +++ b/Doxygen/0.94/inherit_graph_192.md5 @@ -0,0 +1 @@ +6a3ac98c46c6b226fb062b3fec1c5fe3 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_192.png b/Doxygen/0.94/inherit_graph_192.png new file mode 100644 index 0000000..e0bd05b Binary files /dev/null and b/Doxygen/0.94/inherit_graph_192.png differ diff --git a/Doxygen/0.94/inherit_graph_193.map b/Doxygen/0.94/inherit_graph_193.map new file mode 100644 index 0000000..0bbcb44 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_193.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_193.md5 b/Doxygen/0.94/inherit_graph_193.md5 new file mode 100644 index 0000000..ca3b3dd --- /dev/null +++ b/Doxygen/0.94/inherit_graph_193.md5 @@ -0,0 +1 @@ +18bfbe7c1e3d3300929c047de4553a93 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_193.png b/Doxygen/0.94/inherit_graph_193.png new file mode 100644 index 0000000..4a6ca06 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_193.png differ diff --git a/Doxygen/0.94/inherit_graph_194.map b/Doxygen/0.94/inherit_graph_194.map new file mode 100644 index 0000000..4935b29 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_194.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_194.md5 b/Doxygen/0.94/inherit_graph_194.md5 new file mode 100644 index 0000000..f870fd7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_194.md5 @@ -0,0 +1 @@ +de57c0cd2a989b6c762bfe1d9cf8b330 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_194.png b/Doxygen/0.94/inherit_graph_194.png new file mode 100644 index 0000000..d8d6a60 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_194.png differ diff --git a/Doxygen/0.94/inherit_graph_2.map b/Doxygen/0.94/inherit_graph_2.map new file mode 100644 index 0000000..f02a482 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_2.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/inherit_graph_2.md5 b/Doxygen/0.94/inherit_graph_2.md5 new file mode 100644 index 0000000..13aaa8d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_2.md5 @@ -0,0 +1 @@ +15a54a0227cd247e1fd9ac356c04df12 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_2.png b/Doxygen/0.94/inherit_graph_2.png new file mode 100644 index 0000000..03d5190 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_2.png differ diff --git a/Doxygen/0.94/inherit_graph_20.map b/Doxygen/0.94/inherit_graph_20.map new file mode 100644 index 0000000..3cfa261 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_20.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_20.md5 b/Doxygen/0.94/inherit_graph_20.md5 new file mode 100644 index 0000000..99f393d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_20.md5 @@ -0,0 +1 @@ +bbee9955f443a7fad584fc40778e5a02 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_20.png b/Doxygen/0.94/inherit_graph_20.png new file mode 100644 index 0000000..1765a22 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_20.png differ diff --git a/Doxygen/0.94/inherit_graph_21.map b/Doxygen/0.94/inherit_graph_21.map new file mode 100644 index 0000000..93177bb --- /dev/null +++ b/Doxygen/0.94/inherit_graph_21.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_21.md5 b/Doxygen/0.94/inherit_graph_21.md5 new file mode 100644 index 0000000..410d5ae --- /dev/null +++ b/Doxygen/0.94/inherit_graph_21.md5 @@ -0,0 +1 @@ +2f0b7610c5d52d04bb94ce0aa0aedafd \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_21.png b/Doxygen/0.94/inherit_graph_21.png new file mode 100644 index 0000000..da1ffe7 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_21.png differ diff --git a/Doxygen/0.94/inherit_graph_22.map b/Doxygen/0.94/inherit_graph_22.map new file mode 100644 index 0000000..d71188e --- /dev/null +++ b/Doxygen/0.94/inherit_graph_22.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_22.md5 b/Doxygen/0.94/inherit_graph_22.md5 new file mode 100644 index 0000000..f1170d7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_22.md5 @@ -0,0 +1 @@ +b07894712a882a3d184e9aa27c9e683b \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_22.png b/Doxygen/0.94/inherit_graph_22.png new file mode 100644 index 0000000..9c53609 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_22.png differ diff --git a/Doxygen/0.94/inherit_graph_23.map b/Doxygen/0.94/inherit_graph_23.map new file mode 100644 index 0000000..ce9eef8 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_23.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_23.md5 b/Doxygen/0.94/inherit_graph_23.md5 new file mode 100644 index 0000000..fea1830 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_23.md5 @@ -0,0 +1 @@ +f8cbf1596ec3f137acc8ce07f0cec68f \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_23.png b/Doxygen/0.94/inherit_graph_23.png new file mode 100644 index 0000000..93a3f19 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_23.png differ diff --git a/Doxygen/0.94/inherit_graph_24.map b/Doxygen/0.94/inherit_graph_24.map new file mode 100644 index 0000000..c5e2cf4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_24.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_24.md5 b/Doxygen/0.94/inherit_graph_24.md5 new file mode 100644 index 0000000..1407b3a --- /dev/null +++ b/Doxygen/0.94/inherit_graph_24.md5 @@ -0,0 +1 @@ +e87ae304669f185c73052ab97ba334b8 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_24.png b/Doxygen/0.94/inherit_graph_24.png new file mode 100644 index 0000000..b396f66 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_24.png differ diff --git a/Doxygen/0.94/inherit_graph_25.map b/Doxygen/0.94/inherit_graph_25.map new file mode 100644 index 0000000..76c0bc1 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_25.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_25.md5 b/Doxygen/0.94/inherit_graph_25.md5 new file mode 100644 index 0000000..30e9b85 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_25.md5 @@ -0,0 +1 @@ +433d425c86b66e2dd58cc65001730b3a \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_25.png b/Doxygen/0.94/inherit_graph_25.png new file mode 100644 index 0000000..e9a8bee Binary files /dev/null and b/Doxygen/0.94/inherit_graph_25.png differ diff --git a/Doxygen/0.94/inherit_graph_26.map b/Doxygen/0.94/inherit_graph_26.map new file mode 100644 index 0000000..d5418dd --- /dev/null +++ b/Doxygen/0.94/inherit_graph_26.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_26.md5 b/Doxygen/0.94/inherit_graph_26.md5 new file mode 100644 index 0000000..8548461 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_26.md5 @@ -0,0 +1 @@ +53e343362a0cb5796ebe1fbdd88740ee \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_26.png b/Doxygen/0.94/inherit_graph_26.png new file mode 100644 index 0000000..667bbfb Binary files /dev/null and b/Doxygen/0.94/inherit_graph_26.png differ diff --git a/Doxygen/0.94/inherit_graph_27.map b/Doxygen/0.94/inherit_graph_27.map new file mode 100644 index 0000000..d5418dd --- /dev/null +++ b/Doxygen/0.94/inherit_graph_27.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_27.md5 b/Doxygen/0.94/inherit_graph_27.md5 new file mode 100644 index 0000000..80c64c9 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_27.md5 @@ -0,0 +1 @@ +937dcbb573505d1b74dfa0622766fcc5 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_27.png b/Doxygen/0.94/inherit_graph_27.png new file mode 100644 index 0000000..ac71d1a Binary files /dev/null and b/Doxygen/0.94/inherit_graph_27.png differ diff --git a/Doxygen/0.94/inherit_graph_28.map b/Doxygen/0.94/inherit_graph_28.map new file mode 100644 index 0000000..7856334 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_28.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_28.md5 b/Doxygen/0.94/inherit_graph_28.md5 new file mode 100644 index 0000000..57d5626 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_28.md5 @@ -0,0 +1 @@ +79001ded58e5d8ad900ace218fc7cd09 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_28.png b/Doxygen/0.94/inherit_graph_28.png new file mode 100644 index 0000000..70881a1 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_28.png differ diff --git a/Doxygen/0.94/inherit_graph_29.map b/Doxygen/0.94/inherit_graph_29.map new file mode 100644 index 0000000..496e076 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_29.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_29.md5 b/Doxygen/0.94/inherit_graph_29.md5 new file mode 100644 index 0000000..e2fbb49 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_29.md5 @@ -0,0 +1 @@ +fea3692ec026f5e4a2f75eeec4894914 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_29.png b/Doxygen/0.94/inherit_graph_29.png new file mode 100644 index 0000000..6172667 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_29.png differ diff --git a/Doxygen/0.94/inherit_graph_3.map b/Doxygen/0.94/inherit_graph_3.map new file mode 100644 index 0000000..a14776b --- /dev/null +++ b/Doxygen/0.94/inherit_graph_3.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/Doxygen/0.94/inherit_graph_3.md5 b/Doxygen/0.94/inherit_graph_3.md5 new file mode 100644 index 0000000..a8db54f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_3.md5 @@ -0,0 +1 @@ +17a2d25711799e545e79b2dd73a66a0a \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_3.png b/Doxygen/0.94/inherit_graph_3.png new file mode 100644 index 0000000..0a65866 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_3.png differ diff --git a/Doxygen/0.94/inherit_graph_30.map b/Doxygen/0.94/inherit_graph_30.map new file mode 100644 index 0000000..31337f9 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_30.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_30.md5 b/Doxygen/0.94/inherit_graph_30.md5 new file mode 100644 index 0000000..5cdea9f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_30.md5 @@ -0,0 +1 @@ +480bf14f2bda01074e5cfc18180cc28a \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_30.png b/Doxygen/0.94/inherit_graph_30.png new file mode 100644 index 0000000..272a69a Binary files /dev/null and b/Doxygen/0.94/inherit_graph_30.png differ diff --git a/Doxygen/0.94/inherit_graph_31.map b/Doxygen/0.94/inherit_graph_31.map new file mode 100644 index 0000000..53cce46 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_31.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_31.md5 b/Doxygen/0.94/inherit_graph_31.md5 new file mode 100644 index 0000000..63cd840 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_31.md5 @@ -0,0 +1 @@ +0feb53b6db28396b7330600de8221be2 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_31.png b/Doxygen/0.94/inherit_graph_31.png new file mode 100644 index 0000000..057876c Binary files /dev/null and b/Doxygen/0.94/inherit_graph_31.png differ diff --git a/Doxygen/0.94/inherit_graph_32.map b/Doxygen/0.94/inherit_graph_32.map new file mode 100644 index 0000000..414b93f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_32.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_32.md5 b/Doxygen/0.94/inherit_graph_32.md5 new file mode 100644 index 0000000..e69c391 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_32.md5 @@ -0,0 +1 @@ +8c47e977205bd7dd0939ea20ed6fe195 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_32.png b/Doxygen/0.94/inherit_graph_32.png new file mode 100644 index 0000000..1e9d315 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_32.png differ diff --git a/Doxygen/0.94/inherit_graph_33.map b/Doxygen/0.94/inherit_graph_33.map new file mode 100644 index 0000000..222593f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_33.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/Doxygen/0.94/inherit_graph_33.md5 b/Doxygen/0.94/inherit_graph_33.md5 new file mode 100644 index 0000000..8a44995 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_33.md5 @@ -0,0 +1 @@ +79869f107f2e5d966078ae89049aadad \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_33.png b/Doxygen/0.94/inherit_graph_33.png new file mode 100644 index 0000000..2d477aa Binary files /dev/null and b/Doxygen/0.94/inherit_graph_33.png differ diff --git a/Doxygen/0.94/inherit_graph_34.map b/Doxygen/0.94/inherit_graph_34.map new file mode 100644 index 0000000..3decf1d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_34.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_34.md5 b/Doxygen/0.94/inherit_graph_34.md5 new file mode 100644 index 0000000..8e8241f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_34.md5 @@ -0,0 +1 @@ +0ff63b607955868007cb472e8997e667 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_34.png b/Doxygen/0.94/inherit_graph_34.png new file mode 100644 index 0000000..459b9c2 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_34.png differ diff --git a/Doxygen/0.94/inherit_graph_35.map b/Doxygen/0.94/inherit_graph_35.map new file mode 100644 index 0000000..0a69c9b --- /dev/null +++ b/Doxygen/0.94/inherit_graph_35.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_35.md5 b/Doxygen/0.94/inherit_graph_35.md5 new file mode 100644 index 0000000..3654e74 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_35.md5 @@ -0,0 +1 @@ +f21c738190261eb732716154176313ad \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_35.png b/Doxygen/0.94/inherit_graph_35.png new file mode 100644 index 0000000..bd14aff Binary files /dev/null and b/Doxygen/0.94/inherit_graph_35.png differ diff --git a/Doxygen/0.94/inherit_graph_36.map b/Doxygen/0.94/inherit_graph_36.map new file mode 100644 index 0000000..5a21d62 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_36.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_36.md5 b/Doxygen/0.94/inherit_graph_36.md5 new file mode 100644 index 0000000..224bded --- /dev/null +++ b/Doxygen/0.94/inherit_graph_36.md5 @@ -0,0 +1 @@ +bb41df579250620c94b8208104b246fa \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_36.png b/Doxygen/0.94/inherit_graph_36.png new file mode 100644 index 0000000..7da771e Binary files /dev/null and b/Doxygen/0.94/inherit_graph_36.png differ diff --git a/Doxygen/0.94/inherit_graph_37.map b/Doxygen/0.94/inherit_graph_37.map new file mode 100644 index 0000000..e46dce2 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_37.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_37.md5 b/Doxygen/0.94/inherit_graph_37.md5 new file mode 100644 index 0000000..600df56 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_37.md5 @@ -0,0 +1 @@ +2ef38f5de4c1a0e51d83d3bd88db25c2 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_37.png b/Doxygen/0.94/inherit_graph_37.png new file mode 100644 index 0000000..2010134 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_37.png differ diff --git a/Doxygen/0.94/inherit_graph_38.map b/Doxygen/0.94/inherit_graph_38.map new file mode 100644 index 0000000..7a93d84 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_38.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_38.md5 b/Doxygen/0.94/inherit_graph_38.md5 new file mode 100644 index 0000000..1e15e5c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_38.md5 @@ -0,0 +1 @@ +23d29a9bb67c47fb4ccbe57b82c1815d \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_38.png b/Doxygen/0.94/inherit_graph_38.png new file mode 100644 index 0000000..e4ecc19 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_38.png differ diff --git a/Doxygen/0.94/inherit_graph_39.map b/Doxygen/0.94/inherit_graph_39.map new file mode 100644 index 0000000..3decf1d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_39.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_39.md5 b/Doxygen/0.94/inherit_graph_39.md5 new file mode 100644 index 0000000..a2e982b --- /dev/null +++ b/Doxygen/0.94/inherit_graph_39.md5 @@ -0,0 +1 @@ +035e48f8c9a159ee82d0c2975e6a9a67 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_39.png b/Doxygen/0.94/inherit_graph_39.png new file mode 100644 index 0000000..01ae695 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_39.png differ diff --git a/Doxygen/0.94/inherit_graph_4.map b/Doxygen/0.94/inherit_graph_4.map new file mode 100644 index 0000000..0ac6c22 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_4.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/inherit_graph_4.md5 b/Doxygen/0.94/inherit_graph_4.md5 new file mode 100644 index 0000000..9efb79e --- /dev/null +++ b/Doxygen/0.94/inherit_graph_4.md5 @@ -0,0 +1 @@ +1f96a4ed65487bf678ddf1e90b03794f \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_4.png b/Doxygen/0.94/inherit_graph_4.png new file mode 100644 index 0000000..25cac62 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_4.png differ diff --git a/Doxygen/0.94/inherit_graph_40.map b/Doxygen/0.94/inherit_graph_40.map new file mode 100644 index 0000000..3decf1d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_40.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_40.md5 b/Doxygen/0.94/inherit_graph_40.md5 new file mode 100644 index 0000000..b41b925 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_40.md5 @@ -0,0 +1 @@ +14e36ce943abc8428f4a948766271638 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_40.png b/Doxygen/0.94/inherit_graph_40.png new file mode 100644 index 0000000..cf2c9d1 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_40.png differ diff --git a/Doxygen/0.94/inherit_graph_41.map b/Doxygen/0.94/inherit_graph_41.map new file mode 100644 index 0000000..3decf1d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_41.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_41.md5 b/Doxygen/0.94/inherit_graph_41.md5 new file mode 100644 index 0000000..788dfd7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_41.md5 @@ -0,0 +1 @@ +92cd4d7db14b1245cd4c4ac65b8e1e95 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_41.png b/Doxygen/0.94/inherit_graph_41.png new file mode 100644 index 0000000..25d6b8e Binary files /dev/null and b/Doxygen/0.94/inherit_graph_41.png differ diff --git a/Doxygen/0.94/inherit_graph_42.map b/Doxygen/0.94/inherit_graph_42.map new file mode 100644 index 0000000..3decf1d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_42.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_42.md5 b/Doxygen/0.94/inherit_graph_42.md5 new file mode 100644 index 0000000..9b2dffd --- /dev/null +++ b/Doxygen/0.94/inherit_graph_42.md5 @@ -0,0 +1 @@ +ff800387191c2a7cd8bc81e68d405040 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_42.png b/Doxygen/0.94/inherit_graph_42.png new file mode 100644 index 0000000..625cff1 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_42.png differ diff --git a/Doxygen/0.94/inherit_graph_43.map b/Doxygen/0.94/inherit_graph_43.map new file mode 100644 index 0000000..882e113 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_43.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/Doxygen/0.94/inherit_graph_43.md5 b/Doxygen/0.94/inherit_graph_43.md5 new file mode 100644 index 0000000..1f392aa --- /dev/null +++ b/Doxygen/0.94/inherit_graph_43.md5 @@ -0,0 +1 @@ +a2a4bc74c09f46481febc47120f22955 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_43.png b/Doxygen/0.94/inherit_graph_43.png new file mode 100644 index 0000000..feefe33 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_43.png differ diff --git a/Doxygen/0.94/inherit_graph_44.map b/Doxygen/0.94/inherit_graph_44.map new file mode 100644 index 0000000..c022c47 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_44.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_44.md5 b/Doxygen/0.94/inherit_graph_44.md5 new file mode 100644 index 0000000..9a0a906 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_44.md5 @@ -0,0 +1 @@ +84cab89fa7ccb2fbfa1b906003f0b23b \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_44.png b/Doxygen/0.94/inherit_graph_44.png new file mode 100644 index 0000000..a260fe4 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_44.png differ diff --git a/Doxygen/0.94/inherit_graph_45.map b/Doxygen/0.94/inherit_graph_45.map new file mode 100644 index 0000000..e48b9e4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_45.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_45.md5 b/Doxygen/0.94/inherit_graph_45.md5 new file mode 100644 index 0000000..6a87459 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_45.md5 @@ -0,0 +1 @@ +44d036f1dc184d78cc744332a12da9c0 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_45.png b/Doxygen/0.94/inherit_graph_45.png new file mode 100644 index 0000000..a4a8f81 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_45.png differ diff --git a/Doxygen/0.94/inherit_graph_46.map b/Doxygen/0.94/inherit_graph_46.map new file mode 100644 index 0000000..71ea949 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_46.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_46.md5 b/Doxygen/0.94/inherit_graph_46.md5 new file mode 100644 index 0000000..aa24a4c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_46.md5 @@ -0,0 +1 @@ +bdeb77f96bba23da7ef6a38dcf53d767 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_46.png b/Doxygen/0.94/inherit_graph_46.png new file mode 100644 index 0000000..594688a Binary files /dev/null and b/Doxygen/0.94/inherit_graph_46.png differ diff --git a/Doxygen/0.94/inherit_graph_47.map b/Doxygen/0.94/inherit_graph_47.map new file mode 100644 index 0000000..cbdeb57 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_47.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_47.md5 b/Doxygen/0.94/inherit_graph_47.md5 new file mode 100644 index 0000000..a9fa173 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_47.md5 @@ -0,0 +1 @@ +a4baa46b573e0970a1000af258b58471 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_47.png b/Doxygen/0.94/inherit_graph_47.png new file mode 100644 index 0000000..a63a0d2 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_47.png differ diff --git a/Doxygen/0.94/inherit_graph_48.map b/Doxygen/0.94/inherit_graph_48.map new file mode 100644 index 0000000..4393082 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_48.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_48.md5 b/Doxygen/0.94/inherit_graph_48.md5 new file mode 100644 index 0000000..5cba37e --- /dev/null +++ b/Doxygen/0.94/inherit_graph_48.md5 @@ -0,0 +1 @@ +57bb42aaacf6f5a3f66f508789a6491a \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_48.png b/Doxygen/0.94/inherit_graph_48.png new file mode 100644 index 0000000..6b069e1 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_48.png differ diff --git a/Doxygen/0.94/inherit_graph_49.map b/Doxygen/0.94/inherit_graph_49.map new file mode 100644 index 0000000..c022c47 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_49.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_49.md5 b/Doxygen/0.94/inherit_graph_49.md5 new file mode 100644 index 0000000..e93436b --- /dev/null +++ b/Doxygen/0.94/inherit_graph_49.md5 @@ -0,0 +1 @@ +3c8868689f3c7b96f23c65825120b778 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_49.png b/Doxygen/0.94/inherit_graph_49.png new file mode 100644 index 0000000..c26e5d5 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_49.png differ diff --git a/Doxygen/0.94/inherit_graph_5.map b/Doxygen/0.94/inherit_graph_5.map new file mode 100644 index 0000000..a25ae89 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_5.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/inherit_graph_5.md5 b/Doxygen/0.94/inherit_graph_5.md5 new file mode 100644 index 0000000..3e7d50c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_5.md5 @@ -0,0 +1 @@ +c8cea8a937bdf86c5c2c53d1950c9347 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_5.png b/Doxygen/0.94/inherit_graph_5.png new file mode 100644 index 0000000..639a79e Binary files /dev/null and b/Doxygen/0.94/inherit_graph_5.png differ diff --git a/Doxygen/0.94/inherit_graph_50.map b/Doxygen/0.94/inherit_graph_50.map new file mode 100644 index 0000000..c022c47 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_50.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_50.md5 b/Doxygen/0.94/inherit_graph_50.md5 new file mode 100644 index 0000000..7b5eb3e --- /dev/null +++ b/Doxygen/0.94/inherit_graph_50.md5 @@ -0,0 +1 @@ +422e1d30ae331201f3d2c537d05cafcd \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_50.png b/Doxygen/0.94/inherit_graph_50.png new file mode 100644 index 0000000..59deccb Binary files /dev/null and b/Doxygen/0.94/inherit_graph_50.png differ diff --git a/Doxygen/0.94/inherit_graph_51.map b/Doxygen/0.94/inherit_graph_51.map new file mode 100644 index 0000000..c022c47 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_51.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_51.md5 b/Doxygen/0.94/inherit_graph_51.md5 new file mode 100644 index 0000000..a390e55 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_51.md5 @@ -0,0 +1 @@ +56b7e987102268a962f61f2ff7b8605c \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_51.png b/Doxygen/0.94/inherit_graph_51.png new file mode 100644 index 0000000..9a548d7 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_51.png differ diff --git a/Doxygen/0.94/inherit_graph_52.map b/Doxygen/0.94/inherit_graph_52.map new file mode 100644 index 0000000..c022c47 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_52.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_52.md5 b/Doxygen/0.94/inherit_graph_52.md5 new file mode 100644 index 0000000..e086e61 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_52.md5 @@ -0,0 +1 @@ +6a3769828218e0cb70fcab1d2a4bf591 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_52.png b/Doxygen/0.94/inherit_graph_52.png new file mode 100644 index 0000000..ec2a934 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_52.png differ diff --git a/Doxygen/0.94/inherit_graph_53.map b/Doxygen/0.94/inherit_graph_53.map new file mode 100644 index 0000000..414b93f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_53.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_53.md5 b/Doxygen/0.94/inherit_graph_53.md5 new file mode 100644 index 0000000..24903ef --- /dev/null +++ b/Doxygen/0.94/inherit_graph_53.md5 @@ -0,0 +1 @@ +bbb2e876859992e1d54172070a9c7c85 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_53.png b/Doxygen/0.94/inherit_graph_53.png new file mode 100644 index 0000000..fe19c96 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_53.png differ diff --git a/Doxygen/0.94/inherit_graph_54.map b/Doxygen/0.94/inherit_graph_54.map new file mode 100644 index 0000000..c792df4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_54.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_54.md5 b/Doxygen/0.94/inherit_graph_54.md5 new file mode 100644 index 0000000..f60c61b --- /dev/null +++ b/Doxygen/0.94/inherit_graph_54.md5 @@ -0,0 +1 @@ +6a393aa5b7207689e11a641759fd51a3 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_54.png b/Doxygen/0.94/inherit_graph_54.png new file mode 100644 index 0000000..373849c Binary files /dev/null and b/Doxygen/0.94/inherit_graph_54.png differ diff --git a/Doxygen/0.94/inherit_graph_55.map b/Doxygen/0.94/inherit_graph_55.map new file mode 100644 index 0000000..ee94cf8 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_55.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_55.md5 b/Doxygen/0.94/inherit_graph_55.md5 new file mode 100644 index 0000000..94c82f2 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_55.md5 @@ -0,0 +1 @@ +914a0b91894e2c8a1639369c00070911 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_55.png b/Doxygen/0.94/inherit_graph_55.png new file mode 100644 index 0000000..63071ff Binary files /dev/null and b/Doxygen/0.94/inherit_graph_55.png differ diff --git a/Doxygen/0.94/inherit_graph_56.map b/Doxygen/0.94/inherit_graph_56.map new file mode 100644 index 0000000..e6d678d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_56.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_56.md5 b/Doxygen/0.94/inherit_graph_56.md5 new file mode 100644 index 0000000..5fe38bd --- /dev/null +++ b/Doxygen/0.94/inherit_graph_56.md5 @@ -0,0 +1 @@ +2d70172a5191a7c75972941e7064c16a \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_56.png b/Doxygen/0.94/inherit_graph_56.png new file mode 100644 index 0000000..6aa1191 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_56.png differ diff --git a/Doxygen/0.94/inherit_graph_57.map b/Doxygen/0.94/inherit_graph_57.map new file mode 100644 index 0000000..6910abc --- /dev/null +++ b/Doxygen/0.94/inherit_graph_57.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_57.md5 b/Doxygen/0.94/inherit_graph_57.md5 new file mode 100644 index 0000000..ba32e45 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_57.md5 @@ -0,0 +1 @@ +f1b17eab1115b8a4f7a4de31a851b417 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_57.png b/Doxygen/0.94/inherit_graph_57.png new file mode 100644 index 0000000..5ec2530 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_57.png differ diff --git a/Doxygen/0.94/inherit_graph_58.map b/Doxygen/0.94/inherit_graph_58.map new file mode 100644 index 0000000..6910abc --- /dev/null +++ b/Doxygen/0.94/inherit_graph_58.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_58.md5 b/Doxygen/0.94/inherit_graph_58.md5 new file mode 100644 index 0000000..209952a --- /dev/null +++ b/Doxygen/0.94/inherit_graph_58.md5 @@ -0,0 +1 @@ +c169b9f65a247c63cb85ac2d6a95c3e9 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_58.png b/Doxygen/0.94/inherit_graph_58.png new file mode 100644 index 0000000..94277b3 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_58.png differ diff --git a/Doxygen/0.94/inherit_graph_59.map b/Doxygen/0.94/inherit_graph_59.map new file mode 100644 index 0000000..7ad91a0 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_59.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_59.md5 b/Doxygen/0.94/inherit_graph_59.md5 new file mode 100644 index 0000000..32ed85c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_59.md5 @@ -0,0 +1 @@ +f79073a590b051bb4a47b576f0acd0f3 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_59.png b/Doxygen/0.94/inherit_graph_59.png new file mode 100644 index 0000000..92c528d Binary files /dev/null and b/Doxygen/0.94/inherit_graph_59.png differ diff --git a/Doxygen/0.94/inherit_graph_6.map b/Doxygen/0.94/inherit_graph_6.map new file mode 100644 index 0000000..857985a --- /dev/null +++ b/Doxygen/0.94/inherit_graph_6.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/inherit_graph_6.md5 b/Doxygen/0.94/inherit_graph_6.md5 new file mode 100644 index 0000000..66af386 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_6.md5 @@ -0,0 +1 @@ +ccca316948b70769cf1f0be3616c6a11 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_6.png b/Doxygen/0.94/inherit_graph_6.png new file mode 100644 index 0000000..148d1a7 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_6.png differ diff --git a/Doxygen/0.94/inherit_graph_60.map b/Doxygen/0.94/inherit_graph_60.map new file mode 100644 index 0000000..d613da7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_60.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_60.md5 b/Doxygen/0.94/inherit_graph_60.md5 new file mode 100644 index 0000000..25476e6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_60.md5 @@ -0,0 +1 @@ +fe6273b4e3be0bcd7593d8f4be572c83 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_60.png b/Doxygen/0.94/inherit_graph_60.png new file mode 100644 index 0000000..9c8136c Binary files /dev/null and b/Doxygen/0.94/inherit_graph_60.png differ diff --git a/Doxygen/0.94/inherit_graph_61.map b/Doxygen/0.94/inherit_graph_61.map new file mode 100644 index 0000000..857e7ba --- /dev/null +++ b/Doxygen/0.94/inherit_graph_61.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_61.md5 b/Doxygen/0.94/inherit_graph_61.md5 new file mode 100644 index 0000000..fe149c0 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_61.md5 @@ -0,0 +1 @@ +4a8497a00a009a542f1b5276c58b10c8 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_61.png b/Doxygen/0.94/inherit_graph_61.png new file mode 100644 index 0000000..ba81cd4 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_61.png differ diff --git a/Doxygen/0.94/inherit_graph_62.map b/Doxygen/0.94/inherit_graph_62.map new file mode 100644 index 0000000..76c0bc1 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_62.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_62.md5 b/Doxygen/0.94/inherit_graph_62.md5 new file mode 100644 index 0000000..d21c961 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_62.md5 @@ -0,0 +1 @@ +9865532acc769c7168347cf56d33158c \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_62.png b/Doxygen/0.94/inherit_graph_62.png new file mode 100644 index 0000000..d450bc2 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_62.png differ diff --git a/Doxygen/0.94/inherit_graph_63.map b/Doxygen/0.94/inherit_graph_63.map new file mode 100644 index 0000000..def642f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_63.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_63.md5 b/Doxygen/0.94/inherit_graph_63.md5 new file mode 100644 index 0000000..fc3c1bc --- /dev/null +++ b/Doxygen/0.94/inherit_graph_63.md5 @@ -0,0 +1 @@ +d34a63b0f2486e99205f4285efe6ae9c \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_63.png b/Doxygen/0.94/inherit_graph_63.png new file mode 100644 index 0000000..5ae1d04 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_63.png differ diff --git a/Doxygen/0.94/inherit_graph_64.map b/Doxygen/0.94/inherit_graph_64.map new file mode 100644 index 0000000..ea17be2 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_64.map @@ -0,0 +1,17 @@ + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/inherit_graph_64.md5 b/Doxygen/0.94/inherit_graph_64.md5 new file mode 100644 index 0000000..6740e7f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_64.md5 @@ -0,0 +1 @@ +3023c60bc13ae54573300b8c5d6fd966 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_64.png b/Doxygen/0.94/inherit_graph_64.png new file mode 100644 index 0000000..9c9aaea Binary files /dev/null and b/Doxygen/0.94/inherit_graph_64.png differ diff --git a/Doxygen/0.94/inherit_graph_65.map b/Doxygen/0.94/inherit_graph_65.map new file mode 100644 index 0000000..112ee7a --- /dev/null +++ b/Doxygen/0.94/inherit_graph_65.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_65.md5 b/Doxygen/0.94/inherit_graph_65.md5 new file mode 100644 index 0000000..f665900 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_65.md5 @@ -0,0 +1 @@ +71ed0d4e48520100aceeb3e5ce0900ad \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_65.png b/Doxygen/0.94/inherit_graph_65.png new file mode 100644 index 0000000..e27438f Binary files /dev/null and b/Doxygen/0.94/inherit_graph_65.png differ diff --git a/Doxygen/0.94/inherit_graph_66.map b/Doxygen/0.94/inherit_graph_66.map new file mode 100644 index 0000000..b36cc6f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_66.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_66.md5 b/Doxygen/0.94/inherit_graph_66.md5 new file mode 100644 index 0000000..99882b2 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_66.md5 @@ -0,0 +1 @@ +2728bd3323f8b5f3e6534ddba4a9c5f9 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_66.png b/Doxygen/0.94/inherit_graph_66.png new file mode 100644 index 0000000..9ccbab8 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_66.png differ diff --git a/Doxygen/0.94/inherit_graph_67.map b/Doxygen/0.94/inherit_graph_67.map new file mode 100644 index 0000000..f4ca8ca --- /dev/null +++ b/Doxygen/0.94/inherit_graph_67.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_67.md5 b/Doxygen/0.94/inherit_graph_67.md5 new file mode 100644 index 0000000..915aa16 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_67.md5 @@ -0,0 +1 @@ +8419a981640e10387ff25867d4cd990e \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_67.png b/Doxygen/0.94/inherit_graph_67.png new file mode 100644 index 0000000..77b2988 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_67.png differ diff --git a/Doxygen/0.94/inherit_graph_68.map b/Doxygen/0.94/inherit_graph_68.map new file mode 100644 index 0000000..15d25e5 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_68.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_68.md5 b/Doxygen/0.94/inherit_graph_68.md5 new file mode 100644 index 0000000..a6a80a6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_68.md5 @@ -0,0 +1 @@ +4f4862aa406d7da7f58dcd92963a0b0c \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_68.png b/Doxygen/0.94/inherit_graph_68.png new file mode 100644 index 0000000..601799d Binary files /dev/null and b/Doxygen/0.94/inherit_graph_68.png differ diff --git a/Doxygen/0.94/inherit_graph_69.map b/Doxygen/0.94/inherit_graph_69.map new file mode 100644 index 0000000..203a030 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_69.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_69.md5 b/Doxygen/0.94/inherit_graph_69.md5 new file mode 100644 index 0000000..6ceb260 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_69.md5 @@ -0,0 +1 @@ +26bf8e4bd86b7c6f0e68f3f38c5fd36e \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_69.png b/Doxygen/0.94/inherit_graph_69.png new file mode 100644 index 0000000..89b0f71 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_69.png differ diff --git a/Doxygen/0.94/inherit_graph_7.map b/Doxygen/0.94/inherit_graph_7.map new file mode 100644 index 0000000..e2ce219 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_7.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/inherit_graph_7.md5 b/Doxygen/0.94/inherit_graph_7.md5 new file mode 100644 index 0000000..c8266b1 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_7.md5 @@ -0,0 +1 @@ +18cb1ff3fabfbaccc1987e5cbcd5fbad \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_7.png b/Doxygen/0.94/inherit_graph_7.png new file mode 100644 index 0000000..a054e62 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_7.png differ diff --git a/Doxygen/0.94/inherit_graph_70.map b/Doxygen/0.94/inherit_graph_70.map new file mode 100644 index 0000000..8141562 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_70.map @@ -0,0 +1,51 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/Doxygen/0.94/inherit_graph_70.md5 b/Doxygen/0.94/inherit_graph_70.md5 new file mode 100644 index 0000000..3c22eb8 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_70.md5 @@ -0,0 +1 @@ +5513b28d8aa7b5e3f9f62939194dde48 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_70.png b/Doxygen/0.94/inherit_graph_70.png new file mode 100644 index 0000000..29d91ae Binary files /dev/null and b/Doxygen/0.94/inherit_graph_70.png differ diff --git a/Doxygen/0.94/inherit_graph_71.map b/Doxygen/0.94/inherit_graph_71.map new file mode 100644 index 0000000..11c25d0 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_71.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_71.md5 b/Doxygen/0.94/inherit_graph_71.md5 new file mode 100644 index 0000000..e46caa7 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_71.md5 @@ -0,0 +1 @@ +33ad8f62b9a3f9ee189b81ccc8bf98c6 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_71.png b/Doxygen/0.94/inherit_graph_71.png new file mode 100644 index 0000000..a2a6221 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_71.png differ diff --git a/Doxygen/0.94/inherit_graph_72.map b/Doxygen/0.94/inherit_graph_72.map new file mode 100644 index 0000000..c792df4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_72.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_72.md5 b/Doxygen/0.94/inherit_graph_72.md5 new file mode 100644 index 0000000..00fa50e --- /dev/null +++ b/Doxygen/0.94/inherit_graph_72.md5 @@ -0,0 +1 @@ +08aea3444d5f84ee75b680a6507f25f5 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_72.png b/Doxygen/0.94/inherit_graph_72.png new file mode 100644 index 0000000..2d8cff1 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_72.png differ diff --git a/Doxygen/0.94/inherit_graph_73.map b/Doxygen/0.94/inherit_graph_73.map new file mode 100644 index 0000000..1045801 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_73.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_73.md5 b/Doxygen/0.94/inherit_graph_73.md5 new file mode 100644 index 0000000..bc5bd0f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_73.md5 @@ -0,0 +1 @@ +65a6139783dcbb533b2bb614c97950d2 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_73.png b/Doxygen/0.94/inherit_graph_73.png new file mode 100644 index 0000000..17bb4fd Binary files /dev/null and b/Doxygen/0.94/inherit_graph_73.png differ diff --git a/Doxygen/0.94/inherit_graph_74.map b/Doxygen/0.94/inherit_graph_74.map new file mode 100644 index 0000000..1045801 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_74.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_74.md5 b/Doxygen/0.94/inherit_graph_74.md5 new file mode 100644 index 0000000..df9f68b --- /dev/null +++ b/Doxygen/0.94/inherit_graph_74.md5 @@ -0,0 +1 @@ +30282737c686fdae91fa81eee2e1312f \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_74.png b/Doxygen/0.94/inherit_graph_74.png new file mode 100644 index 0000000..7fe9ca3 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_74.png differ diff --git a/Doxygen/0.94/inherit_graph_75.map b/Doxygen/0.94/inherit_graph_75.map new file mode 100644 index 0000000..b2dc7b4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_75.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_75.md5 b/Doxygen/0.94/inherit_graph_75.md5 new file mode 100644 index 0000000..16fef94 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_75.md5 @@ -0,0 +1 @@ +137fcd2e84e191497e3e08c1de82503f \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_75.png b/Doxygen/0.94/inherit_graph_75.png new file mode 100644 index 0000000..51cfc3a Binary files /dev/null and b/Doxygen/0.94/inherit_graph_75.png differ diff --git a/Doxygen/0.94/inherit_graph_76.map b/Doxygen/0.94/inherit_graph_76.map new file mode 100644 index 0000000..fd1ae26 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_76.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_76.md5 b/Doxygen/0.94/inherit_graph_76.md5 new file mode 100644 index 0000000..522dca6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_76.md5 @@ -0,0 +1 @@ +c45532452380f24c8c471701f22088bb \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_76.png b/Doxygen/0.94/inherit_graph_76.png new file mode 100644 index 0000000..8009ec9 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_76.png differ diff --git a/Doxygen/0.94/inherit_graph_77.map b/Doxygen/0.94/inherit_graph_77.map new file mode 100644 index 0000000..c12d14c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_77.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_77.md5 b/Doxygen/0.94/inherit_graph_77.md5 new file mode 100644 index 0000000..6a18507 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_77.md5 @@ -0,0 +1 @@ +db8367018ad4030a8ec137fba2efb695 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_77.png b/Doxygen/0.94/inherit_graph_77.png new file mode 100644 index 0000000..3792cba Binary files /dev/null and b/Doxygen/0.94/inherit_graph_77.png differ diff --git a/Doxygen/0.94/inherit_graph_78.map b/Doxygen/0.94/inherit_graph_78.map new file mode 100644 index 0000000..ce1e0c4 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_78.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_78.md5 b/Doxygen/0.94/inherit_graph_78.md5 new file mode 100644 index 0000000..a1d1b82 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_78.md5 @@ -0,0 +1 @@ +8d87004f73270624f36cd4f876e15b82 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_78.png b/Doxygen/0.94/inherit_graph_78.png new file mode 100644 index 0000000..32d5181 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_78.png differ diff --git a/Doxygen/0.94/inherit_graph_79.map b/Doxygen/0.94/inherit_graph_79.map new file mode 100644 index 0000000..bcfea98 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_79.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_79.md5 b/Doxygen/0.94/inherit_graph_79.md5 new file mode 100644 index 0000000..4b8abf8 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_79.md5 @@ -0,0 +1 @@ +cfddcfa42105e459cf87a050f817f0c4 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_79.png b/Doxygen/0.94/inherit_graph_79.png new file mode 100644 index 0000000..ad80952 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_79.png differ diff --git a/Doxygen/0.94/inherit_graph_8.map b/Doxygen/0.94/inherit_graph_8.map new file mode 100644 index 0000000..ade89e2 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_8.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/inherit_graph_8.md5 b/Doxygen/0.94/inherit_graph_8.md5 new file mode 100644 index 0000000..f9af191 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_8.md5 @@ -0,0 +1 @@ +cbf9814a6c010076ce119c445fd7432f \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_8.png b/Doxygen/0.94/inherit_graph_8.png new file mode 100644 index 0000000..c5b98d5 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_8.png differ diff --git a/Doxygen/0.94/inherit_graph_80.map b/Doxygen/0.94/inherit_graph_80.map new file mode 100644 index 0000000..bcfea98 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_80.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_80.md5 b/Doxygen/0.94/inherit_graph_80.md5 new file mode 100644 index 0000000..d96134d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_80.md5 @@ -0,0 +1 @@ +584bd8da66345648f19f78845ef9f7db \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_80.png b/Doxygen/0.94/inherit_graph_80.png new file mode 100644 index 0000000..a965f14 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_80.png differ diff --git a/Doxygen/0.94/inherit_graph_81.map b/Doxygen/0.94/inherit_graph_81.map new file mode 100644 index 0000000..73fab3e --- /dev/null +++ b/Doxygen/0.94/inherit_graph_81.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_81.md5 b/Doxygen/0.94/inherit_graph_81.md5 new file mode 100644 index 0000000..6dae990 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_81.md5 @@ -0,0 +1 @@ +8c3c8b9d2446cba8f3c90c8e1b0abfc1 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_81.png b/Doxygen/0.94/inherit_graph_81.png new file mode 100644 index 0000000..0e2ec6d Binary files /dev/null and b/Doxygen/0.94/inherit_graph_81.png differ diff --git a/Doxygen/0.94/inherit_graph_82.map b/Doxygen/0.94/inherit_graph_82.map new file mode 100644 index 0000000..d6393ba --- /dev/null +++ b/Doxygen/0.94/inherit_graph_82.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_82.md5 b/Doxygen/0.94/inherit_graph_82.md5 new file mode 100644 index 0000000..78fd595 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_82.md5 @@ -0,0 +1 @@ +1ad7c97452af2665371221d361fc75a6 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_82.png b/Doxygen/0.94/inherit_graph_82.png new file mode 100644 index 0000000..76c3afb Binary files /dev/null and b/Doxygen/0.94/inherit_graph_82.png differ diff --git a/Doxygen/0.94/inherit_graph_83.map b/Doxygen/0.94/inherit_graph_83.map new file mode 100644 index 0000000..5092880 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_83.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_83.md5 b/Doxygen/0.94/inherit_graph_83.md5 new file mode 100644 index 0000000..f09681c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_83.md5 @@ -0,0 +1 @@ +c46c3fa5d879104c65da94c1c93be5e2 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_83.png b/Doxygen/0.94/inherit_graph_83.png new file mode 100644 index 0000000..6586644 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_83.png differ diff --git a/Doxygen/0.94/inherit_graph_84.map b/Doxygen/0.94/inherit_graph_84.map new file mode 100644 index 0000000..d636afe --- /dev/null +++ b/Doxygen/0.94/inherit_graph_84.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_84.md5 b/Doxygen/0.94/inherit_graph_84.md5 new file mode 100644 index 0000000..c379028 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_84.md5 @@ -0,0 +1 @@ +0a436bd55f68bf727d44064ad2760f02 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_84.png b/Doxygen/0.94/inherit_graph_84.png new file mode 100644 index 0000000..9de2687 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_84.png differ diff --git a/Doxygen/0.94/inherit_graph_85.map b/Doxygen/0.94/inherit_graph_85.map new file mode 100644 index 0000000..feec354 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_85.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_85.md5 b/Doxygen/0.94/inherit_graph_85.md5 new file mode 100644 index 0000000..febec93 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_85.md5 @@ -0,0 +1 @@ +4329b9d5846e5b580ef2c3afee836c07 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_85.png b/Doxygen/0.94/inherit_graph_85.png new file mode 100644 index 0000000..067efdb Binary files /dev/null and b/Doxygen/0.94/inherit_graph_85.png differ diff --git a/Doxygen/0.94/inherit_graph_86.map b/Doxygen/0.94/inherit_graph_86.map new file mode 100644 index 0000000..d636afe --- /dev/null +++ b/Doxygen/0.94/inherit_graph_86.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_86.md5 b/Doxygen/0.94/inherit_graph_86.md5 new file mode 100644 index 0000000..5b3ed09 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_86.md5 @@ -0,0 +1 @@ +2b26052bd33f363893c596e10a25ee94 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_86.png b/Doxygen/0.94/inherit_graph_86.png new file mode 100644 index 0000000..5429999 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_86.png differ diff --git a/Doxygen/0.94/inherit_graph_87.map b/Doxygen/0.94/inherit_graph_87.map new file mode 100644 index 0000000..d636afe --- /dev/null +++ b/Doxygen/0.94/inherit_graph_87.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_87.md5 b/Doxygen/0.94/inherit_graph_87.md5 new file mode 100644 index 0000000..68279b5 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_87.md5 @@ -0,0 +1 @@ +9434839bb24b867bcfb78ac9e697f06b \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_87.png b/Doxygen/0.94/inherit_graph_87.png new file mode 100644 index 0000000..8bc6a1a Binary files /dev/null and b/Doxygen/0.94/inherit_graph_87.png differ diff --git a/Doxygen/0.94/inherit_graph_88.map b/Doxygen/0.94/inherit_graph_88.map new file mode 100644 index 0000000..414b93f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_88.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_88.md5 b/Doxygen/0.94/inherit_graph_88.md5 new file mode 100644 index 0000000..4b4510e --- /dev/null +++ b/Doxygen/0.94/inherit_graph_88.md5 @@ -0,0 +1 @@ +e632a011813fb56a6aa673124f2a8cf7 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_88.png b/Doxygen/0.94/inherit_graph_88.png new file mode 100644 index 0000000..1fe5532 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_88.png differ diff --git a/Doxygen/0.94/inherit_graph_89.map b/Doxygen/0.94/inherit_graph_89.map new file mode 100644 index 0000000..e46dce2 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_89.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_89.md5 b/Doxygen/0.94/inherit_graph_89.md5 new file mode 100644 index 0000000..cf12f11 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_89.md5 @@ -0,0 +1 @@ +621da635e662a05aac874697036bdd53 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_89.png b/Doxygen/0.94/inherit_graph_89.png new file mode 100644 index 0000000..4968a57 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_89.png differ diff --git a/Doxygen/0.94/inherit_graph_9.map b/Doxygen/0.94/inherit_graph_9.map new file mode 100644 index 0000000..e89e69c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_9.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/inherit_graph_9.md5 b/Doxygen/0.94/inherit_graph_9.md5 new file mode 100644 index 0000000..fe4fc7c --- /dev/null +++ b/Doxygen/0.94/inherit_graph_9.md5 @@ -0,0 +1 @@ +c864f73aba274e16e58f6ca47e4c8a98 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_9.png b/Doxygen/0.94/inherit_graph_9.png new file mode 100644 index 0000000..29ed5ab Binary files /dev/null and b/Doxygen/0.94/inherit_graph_9.png differ diff --git a/Doxygen/0.94/inherit_graph_90.map b/Doxygen/0.94/inherit_graph_90.map new file mode 100644 index 0000000..de572e6 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_90.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_90.md5 b/Doxygen/0.94/inherit_graph_90.md5 new file mode 100644 index 0000000..54e24ce --- /dev/null +++ b/Doxygen/0.94/inherit_graph_90.md5 @@ -0,0 +1 @@ +9cef0a41f4c2a5d05400c86a54f4f300 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_90.png b/Doxygen/0.94/inherit_graph_90.png new file mode 100644 index 0000000..ad444cb Binary files /dev/null and b/Doxygen/0.94/inherit_graph_90.png differ diff --git a/Doxygen/0.94/inherit_graph_91.map b/Doxygen/0.94/inherit_graph_91.map new file mode 100644 index 0000000..e46dce2 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_91.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_91.md5 b/Doxygen/0.94/inherit_graph_91.md5 new file mode 100644 index 0000000..325c34d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_91.md5 @@ -0,0 +1 @@ +d15fdf97e7242d35f09e2287776e1c17 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_91.png b/Doxygen/0.94/inherit_graph_91.png new file mode 100644 index 0000000..b50281e Binary files /dev/null and b/Doxygen/0.94/inherit_graph_91.png differ diff --git a/Doxygen/0.94/inherit_graph_92.map b/Doxygen/0.94/inherit_graph_92.map new file mode 100644 index 0000000..e46dce2 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_92.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_92.md5 b/Doxygen/0.94/inherit_graph_92.md5 new file mode 100644 index 0000000..5a6b390 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_92.md5 @@ -0,0 +1 @@ +aa166081b09bf717c078cea1d49b877d \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_92.png b/Doxygen/0.94/inherit_graph_92.png new file mode 100644 index 0000000..b951878 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_92.png differ diff --git a/Doxygen/0.94/inherit_graph_93.map b/Doxygen/0.94/inherit_graph_93.map new file mode 100644 index 0000000..d59139d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_93.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_93.md5 b/Doxygen/0.94/inherit_graph_93.md5 new file mode 100644 index 0000000..c0bd046 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_93.md5 @@ -0,0 +1 @@ +20d4cfe3b83f8383a769715ca51231c7 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_93.png b/Doxygen/0.94/inherit_graph_93.png new file mode 100644 index 0000000..76ed1ac Binary files /dev/null and b/Doxygen/0.94/inherit_graph_93.png differ diff --git a/Doxygen/0.94/inherit_graph_94.map b/Doxygen/0.94/inherit_graph_94.map new file mode 100644 index 0000000..5b13fee --- /dev/null +++ b/Doxygen/0.94/inherit_graph_94.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_94.md5 b/Doxygen/0.94/inherit_graph_94.md5 new file mode 100644 index 0000000..d430a65 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_94.md5 @@ -0,0 +1 @@ +f412647aeca0f7a459366f5cb9e4729d \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_94.png b/Doxygen/0.94/inherit_graph_94.png new file mode 100644 index 0000000..8a54b4f Binary files /dev/null and b/Doxygen/0.94/inherit_graph_94.png differ diff --git a/Doxygen/0.94/inherit_graph_95.map b/Doxygen/0.94/inherit_graph_95.map new file mode 100644 index 0000000..e6d678d --- /dev/null +++ b/Doxygen/0.94/inherit_graph_95.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_95.md5 b/Doxygen/0.94/inherit_graph_95.md5 new file mode 100644 index 0000000..60ff91f --- /dev/null +++ b/Doxygen/0.94/inherit_graph_95.md5 @@ -0,0 +1 @@ +83ef8c7645a51267c3a58281826d13b6 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_95.png b/Doxygen/0.94/inherit_graph_95.png new file mode 100644 index 0000000..2b14630 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_95.png differ diff --git a/Doxygen/0.94/inherit_graph_96.map b/Doxygen/0.94/inherit_graph_96.map new file mode 100644 index 0000000..70572b9 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_96.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_96.md5 b/Doxygen/0.94/inherit_graph_96.md5 new file mode 100644 index 0000000..7c48fc3 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_96.md5 @@ -0,0 +1 @@ +42cb5351103a5971b93fa6f6563ff516 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_96.png b/Doxygen/0.94/inherit_graph_96.png new file mode 100644 index 0000000..54a4079 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_96.png differ diff --git a/Doxygen/0.94/inherit_graph_97.map b/Doxygen/0.94/inherit_graph_97.map new file mode 100644 index 0000000..ec399bb --- /dev/null +++ b/Doxygen/0.94/inherit_graph_97.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_97.md5 b/Doxygen/0.94/inherit_graph_97.md5 new file mode 100644 index 0000000..36a1825 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_97.md5 @@ -0,0 +1 @@ +3822ba2fcd7d550e616664e4276d9fc5 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_97.png b/Doxygen/0.94/inherit_graph_97.png new file mode 100644 index 0000000..9bfd83f Binary files /dev/null and b/Doxygen/0.94/inherit_graph_97.png differ diff --git a/Doxygen/0.94/inherit_graph_98.map b/Doxygen/0.94/inherit_graph_98.map new file mode 100644 index 0000000..26dcece --- /dev/null +++ b/Doxygen/0.94/inherit_graph_98.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_98.md5 b/Doxygen/0.94/inherit_graph_98.md5 new file mode 100644 index 0000000..c9541db --- /dev/null +++ b/Doxygen/0.94/inherit_graph_98.md5 @@ -0,0 +1 @@ +e3df1239db5dac83876a505b4d354691 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_98.png b/Doxygen/0.94/inherit_graph_98.png new file mode 100644 index 0000000..48b1843 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_98.png differ diff --git a/Doxygen/0.94/inherit_graph_99.map b/Doxygen/0.94/inherit_graph_99.map new file mode 100644 index 0000000..d636afe --- /dev/null +++ b/Doxygen/0.94/inherit_graph_99.map @@ -0,0 +1,3 @@ + + + diff --git a/Doxygen/0.94/inherit_graph_99.md5 b/Doxygen/0.94/inherit_graph_99.md5 new file mode 100644 index 0000000..2c9a732 --- /dev/null +++ b/Doxygen/0.94/inherit_graph_99.md5 @@ -0,0 +1 @@ +86598467a67a5f4d5eaab88df1831e06 \ No newline at end of file diff --git a/Doxygen/0.94/inherit_graph_99.png b/Doxygen/0.94/inherit_graph_99.png new file mode 100644 index 0000000..9b29906 Binary files /dev/null and b/Doxygen/0.94/inherit_graph_99.png differ diff --git a/Doxygen/0.94/inherits.html b/Doxygen/0.94/inherits.html new file mode 100644 index 0000000..9a59d0b --- /dev/null +++ b/Doxygen/0.94/inherits.html @@ -0,0 +1,1153 @@ + + + + + + + +Blis: Class Hierarchy + + + + + + + + + +
+
+ + + + + + +
+
Blis +  0.94.12 +
+
+
+ + + + + + + +
+ +
+
+ + +
+ +
+ +
+
+
Class Hierarchy
+
+
+
+

Go to the textual class hierarchy

+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + +
+ + + + + +
+ + + + + + + + +
+ + + + +
+ + + + +
+ + + + + +
+ + + + +
+ + + + + +
+ + + + +
+ + + + +
+ + + + + +
+ + + + +
+ + + + +
+ + + + + +
+ + + +
+ + + + +
+ + + + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + + + + + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + + + + + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + + + + + + + + + + + + + + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+ + + +
+
+ +
+Generated by   +doxygen + 1.8.17 +
+ + diff --git a/Doxygen/0.94/jquery.js b/Doxygen/0.94/jquery.js new file mode 100644 index 0000000..103c32d --- /dev/null +++ b/Doxygen/0.94/jquery.js @@ -0,0 +1,35 @@ +/*! jQuery v3.4.1 | (c) JS Foundation and other contributors | jquery.org/license */ +!function(e,t){"use strict";"object"==typeof module&&"object"==typeof module.exports?module.exports=e.document?t(e,!0):function(e){if(!e.document)throw new Error("jQuery requires a window with a document");return t(e)}:t(e)}("undefined"!=typeof window?window:this,function(C,e){"use strict";var t=[],E=C.document,r=Object.getPrototypeOf,s=t.slice,g=t.concat,u=t.push,i=t.indexOf,n={},o=n.toString,v=n.hasOwnProperty,a=v.toString,l=a.call(Object),y={},m=function(e){return"function"==typeof e&&"number"!=typeof e.nodeType},x=function(e){return null!=e&&e===e.window},c={type:!0,src:!0,nonce:!0,noModule:!0};function b(e,t,n){var r,i,o=(n=n||E).createElement("script");if(o.text=e,t)for(r in c)(i=t[r]||t.getAttribute&&t.getAttribute(r))&&o.setAttribute(r,i);n.head.appendChild(o).parentNode.removeChild(o)}function w(e){return null==e?e+"":"object"==typeof e||"function"==typeof e?n[o.call(e)]||"object":typeof e}var f="3.4.1",k=function(e,t){return new k.fn.init(e,t)},p=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g;function d(e){var t=!!e&&"length"in e&&e.length,n=w(e);return!m(e)&&!x(e)&&("array"===n||0===t||"number"==typeof t&&0+~]|"+M+")"+M+"*"),U=new RegExp(M+"|>"),X=new RegExp($),V=new RegExp("^"+I+"$"),G={ID:new RegExp("^#("+I+")"),CLASS:new RegExp("^\\.("+I+")"),TAG:new RegExp("^("+I+"|[*])"),ATTR:new RegExp("^"+W),PSEUDO:new RegExp("^"+$),CHILD:new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+M+"*(even|odd|(([+-]|)(\\d*)n|)"+M+"*(?:([+-]|)"+M+"*(\\d+)|))"+M+"*\\)|)","i"),bool:new RegExp("^(?:"+R+")$","i"),needsContext:new RegExp("^"+M+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+M+"*((?:-\\d)?\\d*)"+M+"*\\)|)(?=[^-]|$)","i")},Y=/HTML$/i,Q=/^(?:input|select|textarea|button)$/i,J=/^h\d$/i,K=/^[^{]+\{\s*\[native \w/,Z=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,ee=/[+~]/,te=new RegExp("\\\\([\\da-f]{1,6}"+M+"?|("+M+")|.)","ig"),ne=function(e,t,n){var r="0x"+t-65536;return r!=r||n?t:r<0?String.fromCharCode(r+65536):String.fromCharCode(r>>10|55296,1023&r|56320)},re=/([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,ie=function(e,t){return t?"\0"===e?"\ufffd":e.slice(0,-1)+"\\"+e.charCodeAt(e.length-1).toString(16)+" ":"\\"+e},oe=function(){T()},ae=be(function(e){return!0===e.disabled&&"fieldset"===e.nodeName.toLowerCase()},{dir:"parentNode",next:"legend"});try{H.apply(t=O.call(m.childNodes),m.childNodes),t[m.childNodes.length].nodeType}catch(e){H={apply:t.length?function(e,t){L.apply(e,O.call(t))}:function(e,t){var n=e.length,r=0;while(e[n++]=t[r++]);e.length=n-1}}}function se(t,e,n,r){var i,o,a,s,u,l,c,f=e&&e.ownerDocument,p=e?e.nodeType:9;if(n=n||[],"string"!=typeof t||!t||1!==p&&9!==p&&11!==p)return n;if(!r&&((e?e.ownerDocument||e:m)!==C&&T(e),e=e||C,E)){if(11!==p&&(u=Z.exec(t)))if(i=u[1]){if(9===p){if(!(a=e.getElementById(i)))return n;if(a.id===i)return n.push(a),n}else if(f&&(a=f.getElementById(i))&&y(e,a)&&a.id===i)return n.push(a),n}else{if(u[2])return H.apply(n,e.getElementsByTagName(t)),n;if((i=u[3])&&d.getElementsByClassName&&e.getElementsByClassName)return H.apply(n,e.getElementsByClassName(i)),n}if(d.qsa&&!A[t+" "]&&(!v||!v.test(t))&&(1!==p||"object"!==e.nodeName.toLowerCase())){if(c=t,f=e,1===p&&U.test(t)){(s=e.getAttribute("id"))?s=s.replace(re,ie):e.setAttribute("id",s=k),o=(l=h(t)).length;while(o--)l[o]="#"+s+" "+xe(l[o]);c=l.join(","),f=ee.test(t)&&ye(e.parentNode)||e}try{return H.apply(n,f.querySelectorAll(c)),n}catch(e){A(t,!0)}finally{s===k&&e.removeAttribute("id")}}}return g(t.replace(B,"$1"),e,n,r)}function ue(){var r=[];return function e(t,n){return r.push(t+" ")>b.cacheLength&&delete e[r.shift()],e[t+" "]=n}}function le(e){return e[k]=!0,e}function ce(e){var t=C.createElement("fieldset");try{return!!e(t)}catch(e){return!1}finally{t.parentNode&&t.parentNode.removeChild(t),t=null}}function fe(e,t){var n=e.split("|"),r=n.length;while(r--)b.attrHandle[n[r]]=t}function pe(e,t){var n=t&&e,r=n&&1===e.nodeType&&1===t.nodeType&&e.sourceIndex-t.sourceIndex;if(r)return r;if(n)while(n=n.nextSibling)if(n===t)return-1;return e?1:-1}function de(t){return function(e){return"input"===e.nodeName.toLowerCase()&&e.type===t}}function he(n){return function(e){var t=e.nodeName.toLowerCase();return("input"===t||"button"===t)&&e.type===n}}function ge(t){return function(e){return"form"in e?e.parentNode&&!1===e.disabled?"label"in e?"label"in e.parentNode?e.parentNode.disabled===t:e.disabled===t:e.isDisabled===t||e.isDisabled!==!t&&ae(e)===t:e.disabled===t:"label"in e&&e.disabled===t}}function ve(a){return le(function(o){return o=+o,le(function(e,t){var n,r=a([],e.length,o),i=r.length;while(i--)e[n=r[i]]&&(e[n]=!(t[n]=e[n]))})})}function ye(e){return e&&"undefined"!=typeof e.getElementsByTagName&&e}for(e in d=se.support={},i=se.isXML=function(e){var t=e.namespaceURI,n=(e.ownerDocument||e).documentElement;return!Y.test(t||n&&n.nodeName||"HTML")},T=se.setDocument=function(e){var t,n,r=e?e.ownerDocument||e:m;return r!==C&&9===r.nodeType&&r.documentElement&&(a=(C=r).documentElement,E=!i(C),m!==C&&(n=C.defaultView)&&n.top!==n&&(n.addEventListener?n.addEventListener("unload",oe,!1):n.attachEvent&&n.attachEvent("onunload",oe)),d.attributes=ce(function(e){return e.className="i",!e.getAttribute("className")}),d.getElementsByTagName=ce(function(e){return e.appendChild(C.createComment("")),!e.getElementsByTagName("*").length}),d.getElementsByClassName=K.test(C.getElementsByClassName),d.getById=ce(function(e){return a.appendChild(e).id=k,!C.getElementsByName||!C.getElementsByName(k).length}),d.getById?(b.filter.ID=function(e){var t=e.replace(te,ne);return function(e){return e.getAttribute("id")===t}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n=t.getElementById(e);return n?[n]:[]}}):(b.filter.ID=function(e){var n=e.replace(te,ne);return function(e){var t="undefined"!=typeof e.getAttributeNode&&e.getAttributeNode("id");return t&&t.value===n}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n,r,i,o=t.getElementById(e);if(o){if((n=o.getAttributeNode("id"))&&n.value===e)return[o];i=t.getElementsByName(e),r=0;while(o=i[r++])if((n=o.getAttributeNode("id"))&&n.value===e)return[o]}return[]}}),b.find.TAG=d.getElementsByTagName?function(e,t){return"undefined"!=typeof t.getElementsByTagName?t.getElementsByTagName(e):d.qsa?t.querySelectorAll(e):void 0}:function(e,t){var n,r=[],i=0,o=t.getElementsByTagName(e);if("*"===e){while(n=o[i++])1===n.nodeType&&r.push(n);return r}return o},b.find.CLASS=d.getElementsByClassName&&function(e,t){if("undefined"!=typeof t.getElementsByClassName&&E)return t.getElementsByClassName(e)},s=[],v=[],(d.qsa=K.test(C.querySelectorAll))&&(ce(function(e){a.appendChild(e).innerHTML="",e.querySelectorAll("[msallowcapture^='']").length&&v.push("[*^$]="+M+"*(?:''|\"\")"),e.querySelectorAll("[selected]").length||v.push("\\["+M+"*(?:value|"+R+")"),e.querySelectorAll("[id~="+k+"-]").length||v.push("~="),e.querySelectorAll(":checked").length||v.push(":checked"),e.querySelectorAll("a#"+k+"+*").length||v.push(".#.+[+~]")}),ce(function(e){e.innerHTML="";var t=C.createElement("input");t.setAttribute("type","hidden"),e.appendChild(t).setAttribute("name","D"),e.querySelectorAll("[name=d]").length&&v.push("name"+M+"*[*^$|!~]?="),2!==e.querySelectorAll(":enabled").length&&v.push(":enabled",":disabled"),a.appendChild(e).disabled=!0,2!==e.querySelectorAll(":disabled").length&&v.push(":enabled",":disabled"),e.querySelectorAll("*,:x"),v.push(",.*:")})),(d.matchesSelector=K.test(c=a.matches||a.webkitMatchesSelector||a.mozMatchesSelector||a.oMatchesSelector||a.msMatchesSelector))&&ce(function(e){d.disconnectedMatch=c.call(e,"*"),c.call(e,"[s!='']:x"),s.push("!=",$)}),v=v.length&&new RegExp(v.join("|")),s=s.length&&new RegExp(s.join("|")),t=K.test(a.compareDocumentPosition),y=t||K.test(a.contains)?function(e,t){var n=9===e.nodeType?e.documentElement:e,r=t&&t.parentNode;return e===r||!(!r||1!==r.nodeType||!(n.contains?n.contains(r):e.compareDocumentPosition&&16&e.compareDocumentPosition(r)))}:function(e,t){if(t)while(t=t.parentNode)if(t===e)return!0;return!1},D=t?function(e,t){if(e===t)return l=!0,0;var n=!e.compareDocumentPosition-!t.compareDocumentPosition;return n||(1&(n=(e.ownerDocument||e)===(t.ownerDocument||t)?e.compareDocumentPosition(t):1)||!d.sortDetached&&t.compareDocumentPosition(e)===n?e===C||e.ownerDocument===m&&y(m,e)?-1:t===C||t.ownerDocument===m&&y(m,t)?1:u?P(u,e)-P(u,t):0:4&n?-1:1)}:function(e,t){if(e===t)return l=!0,0;var n,r=0,i=e.parentNode,o=t.parentNode,a=[e],s=[t];if(!i||!o)return e===C?-1:t===C?1:i?-1:o?1:u?P(u,e)-P(u,t):0;if(i===o)return pe(e,t);n=e;while(n=n.parentNode)a.unshift(n);n=t;while(n=n.parentNode)s.unshift(n);while(a[r]===s[r])r++;return r?pe(a[r],s[r]):a[r]===m?-1:s[r]===m?1:0}),C},se.matches=function(e,t){return se(e,null,null,t)},se.matchesSelector=function(e,t){if((e.ownerDocument||e)!==C&&T(e),d.matchesSelector&&E&&!A[t+" "]&&(!s||!s.test(t))&&(!v||!v.test(t)))try{var n=c.call(e,t);if(n||d.disconnectedMatch||e.document&&11!==e.document.nodeType)return n}catch(e){A(t,!0)}return 0":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(e){return e[1]=e[1].replace(te,ne),e[3]=(e[3]||e[4]||e[5]||"").replace(te,ne),"~="===e[2]&&(e[3]=" "+e[3]+" "),e.slice(0,4)},CHILD:function(e){return e[1]=e[1].toLowerCase(),"nth"===e[1].slice(0,3)?(e[3]||se.error(e[0]),e[4]=+(e[4]?e[5]+(e[6]||1):2*("even"===e[3]||"odd"===e[3])),e[5]=+(e[7]+e[8]||"odd"===e[3])):e[3]&&se.error(e[0]),e},PSEUDO:function(e){var t,n=!e[6]&&e[2];return G.CHILD.test(e[0])?null:(e[3]?e[2]=e[4]||e[5]||"":n&&X.test(n)&&(t=h(n,!0))&&(t=n.indexOf(")",n.length-t)-n.length)&&(e[0]=e[0].slice(0,t),e[2]=n.slice(0,t)),e.slice(0,3))}},filter:{TAG:function(e){var t=e.replace(te,ne).toLowerCase();return"*"===e?function(){return!0}:function(e){return e.nodeName&&e.nodeName.toLowerCase()===t}},CLASS:function(e){var t=p[e+" "];return t||(t=new RegExp("(^|"+M+")"+e+"("+M+"|$)"))&&p(e,function(e){return t.test("string"==typeof e.className&&e.className||"undefined"!=typeof e.getAttribute&&e.getAttribute("class")||"")})},ATTR:function(n,r,i){return function(e){var t=se.attr(e,n);return null==t?"!="===r:!r||(t+="","="===r?t===i:"!="===r?t!==i:"^="===r?i&&0===t.indexOf(i):"*="===r?i&&-1:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i;function j(e,n,r){return m(n)?k.grep(e,function(e,t){return!!n.call(e,t,e)!==r}):n.nodeType?k.grep(e,function(e){return e===n!==r}):"string"!=typeof n?k.grep(e,function(e){return-1)[^>]*|#([\w-]+))$/;(k.fn.init=function(e,t,n){var r,i;if(!e)return this;if(n=n||q,"string"==typeof e){if(!(r="<"===e[0]&&">"===e[e.length-1]&&3<=e.length?[null,e,null]:L.exec(e))||!r[1]&&t)return!t||t.jquery?(t||n).find(e):this.constructor(t).find(e);if(r[1]){if(t=t instanceof k?t[0]:t,k.merge(this,k.parseHTML(r[1],t&&t.nodeType?t.ownerDocument||t:E,!0)),D.test(r[1])&&k.isPlainObject(t))for(r in t)m(this[r])?this[r](t[r]):this.attr(r,t[r]);return this}return(i=E.getElementById(r[2]))&&(this[0]=i,this.length=1),this}return e.nodeType?(this[0]=e,this.length=1,this):m(e)?void 0!==n.ready?n.ready(e):e(k):k.makeArray(e,this)}).prototype=k.fn,q=k(E);var H=/^(?:parents|prev(?:Until|All))/,O={children:!0,contents:!0,next:!0,prev:!0};function P(e,t){while((e=e[t])&&1!==e.nodeType);return e}k.fn.extend({has:function(e){var t=k(e,this),n=t.length;return this.filter(function(){for(var e=0;e\x20\t\r\n\f]*)/i,he=/^$|^module$|\/(?:java|ecma)script/i,ge={option:[1,""],thead:[1,"","
"],col:[2,"","
"],tr:[2,"","
"],td:[3,"","
"],_default:[0,"",""]};function ve(e,t){var n;return n="undefined"!=typeof e.getElementsByTagName?e.getElementsByTagName(t||"*"):"undefined"!=typeof e.querySelectorAll?e.querySelectorAll(t||"*"):[],void 0===t||t&&A(e,t)?k.merge([e],n):n}function ye(e,t){for(var n=0,r=e.length;nx",y.noCloneChecked=!!me.cloneNode(!0).lastChild.defaultValue;var Te=/^key/,Ce=/^(?:mouse|pointer|contextmenu|drag|drop)|click/,Ee=/^([^.]*)(?:\.(.+)|)/;function ke(){return!0}function Se(){return!1}function Ne(e,t){return e===function(){try{return E.activeElement}catch(e){}}()==("focus"===t)}function Ae(e,t,n,r,i,o){var a,s;if("object"==typeof t){for(s in"string"!=typeof n&&(r=r||n,n=void 0),t)Ae(e,s,n,r,t[s],o);return e}if(null==r&&null==i?(i=n,r=n=void 0):null==i&&("string"==typeof n?(i=r,r=void 0):(i=r,r=n,n=void 0)),!1===i)i=Se;else if(!i)return e;return 1===o&&(a=i,(i=function(e){return k().off(e),a.apply(this,arguments)}).guid=a.guid||(a.guid=k.guid++)),e.each(function(){k.event.add(this,t,i,r,n)})}function De(e,i,o){o?(Q.set(e,i,!1),k.event.add(e,i,{namespace:!1,handler:function(e){var t,n,r=Q.get(this,i);if(1&e.isTrigger&&this[i]){if(r.length)(k.event.special[i]||{}).delegateType&&e.stopPropagation();else if(r=s.call(arguments),Q.set(this,i,r),t=o(this,i),this[i](),r!==(n=Q.get(this,i))||t?Q.set(this,i,!1):n={},r!==n)return e.stopImmediatePropagation(),e.preventDefault(),n.value}else r.length&&(Q.set(this,i,{value:k.event.trigger(k.extend(r[0],k.Event.prototype),r.slice(1),this)}),e.stopImmediatePropagation())}})):void 0===Q.get(e,i)&&k.event.add(e,i,ke)}k.event={global:{},add:function(t,e,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Q.get(t);if(v){n.handler&&(n=(o=n).handler,i=o.selector),i&&k.find.matchesSelector(ie,i),n.guid||(n.guid=k.guid++),(u=v.events)||(u=v.events={}),(a=v.handle)||(a=v.handle=function(e){return"undefined"!=typeof k&&k.event.triggered!==e.type?k.event.dispatch.apply(t,arguments):void 0}),l=(e=(e||"").match(R)||[""]).length;while(l--)d=g=(s=Ee.exec(e[l])||[])[1],h=(s[2]||"").split(".").sort(),d&&(f=k.event.special[d]||{},d=(i?f.delegateType:f.bindType)||d,f=k.event.special[d]||{},c=k.extend({type:d,origType:g,data:r,handler:n,guid:n.guid,selector:i,needsContext:i&&k.expr.match.needsContext.test(i),namespace:h.join(".")},o),(p=u[d])||((p=u[d]=[]).delegateCount=0,f.setup&&!1!==f.setup.call(t,r,h,a)||t.addEventListener&&t.addEventListener(d,a)),f.add&&(f.add.call(t,c),c.handler.guid||(c.handler.guid=n.guid)),i?p.splice(p.delegateCount++,0,c):p.push(c),k.event.global[d]=!0)}},remove:function(e,t,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Q.hasData(e)&&Q.get(e);if(v&&(u=v.events)){l=(t=(t||"").match(R)||[""]).length;while(l--)if(d=g=(s=Ee.exec(t[l])||[])[1],h=(s[2]||"").split(".").sort(),d){f=k.event.special[d]||{},p=u[d=(r?f.delegateType:f.bindType)||d]||[],s=s[2]&&new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"),a=o=p.length;while(o--)c=p[o],!i&&g!==c.origType||n&&n.guid!==c.guid||s&&!s.test(c.namespace)||r&&r!==c.selector&&("**"!==r||!c.selector)||(p.splice(o,1),c.selector&&p.delegateCount--,f.remove&&f.remove.call(e,c));a&&!p.length&&(f.teardown&&!1!==f.teardown.call(e,h,v.handle)||k.removeEvent(e,d,v.handle),delete u[d])}else for(d in u)k.event.remove(e,d+t[l],n,r,!0);k.isEmptyObject(u)&&Q.remove(e,"handle events")}},dispatch:function(e){var t,n,r,i,o,a,s=k.event.fix(e),u=new Array(arguments.length),l=(Q.get(this,"events")||{})[s.type]||[],c=k.event.special[s.type]||{};for(u[0]=s,t=1;t\x20\t\r\n\f]*)[^>]*)\/>/gi,qe=/\s*$/g;function Oe(e,t){return A(e,"table")&&A(11!==t.nodeType?t:t.firstChild,"tr")&&k(e).children("tbody")[0]||e}function Pe(e){return e.type=(null!==e.getAttribute("type"))+"/"+e.type,e}function Re(e){return"true/"===(e.type||"").slice(0,5)?e.type=e.type.slice(5):e.removeAttribute("type"),e}function Me(e,t){var n,r,i,o,a,s,u,l;if(1===t.nodeType){if(Q.hasData(e)&&(o=Q.access(e),a=Q.set(t,o),l=o.events))for(i in delete a.handle,a.events={},l)for(n=0,r=l[i].length;n")},clone:function(e,t,n){var r,i,o,a,s,u,l,c=e.cloneNode(!0),f=oe(e);if(!(y.noCloneChecked||1!==e.nodeType&&11!==e.nodeType||k.isXMLDoc(e)))for(a=ve(c),r=0,i=(o=ve(e)).length;r").attr(n.scriptAttrs||{}).prop({charset:n.scriptCharset,src:n.url}).on("load error",i=function(e){r.remove(),i=null,e&&t("error"===e.type?404:200,e.type)}),E.head.appendChild(r[0])},abort:function(){i&&i()}}});var Vt,Gt=[],Yt=/(=)\?(?=&|$)|\?\?/;k.ajaxSetup({jsonp:"callback",jsonpCallback:function(){var e=Gt.pop()||k.expando+"_"+kt++;return this[e]=!0,e}}),k.ajaxPrefilter("json jsonp",function(e,t,n){var r,i,o,a=!1!==e.jsonp&&(Yt.test(e.url)?"url":"string"==typeof e.data&&0===(e.contentType||"").indexOf("application/x-www-form-urlencoded")&&Yt.test(e.data)&&"data");if(a||"jsonp"===e.dataTypes[0])return r=e.jsonpCallback=m(e.jsonpCallback)?e.jsonpCallback():e.jsonpCallback,a?e[a]=e[a].replace(Yt,"$1"+r):!1!==e.jsonp&&(e.url+=(St.test(e.url)?"&":"?")+e.jsonp+"="+r),e.converters["script json"]=function(){return o||k.error(r+" was not called"),o[0]},e.dataTypes[0]="json",i=C[r],C[r]=function(){o=arguments},n.always(function(){void 0===i?k(C).removeProp(r):C[r]=i,e[r]&&(e.jsonpCallback=t.jsonpCallback,Gt.push(r)),o&&m(i)&&i(o[0]),o=i=void 0}),"script"}),y.createHTMLDocument=((Vt=E.implementation.createHTMLDocument("").body).innerHTML="
",2===Vt.childNodes.length),k.parseHTML=function(e,t,n){return"string"!=typeof e?[]:("boolean"==typeof t&&(n=t,t=!1),t||(y.createHTMLDocument?((r=(t=E.implementation.createHTMLDocument("")).createElement("base")).href=E.location.href,t.head.appendChild(r)):t=E),o=!n&&[],(i=D.exec(e))?[t.createElement(i[1])]:(i=we([e],t,o),o&&o.length&&k(o).remove(),k.merge([],i.childNodes)));var r,i,o},k.fn.load=function(e,t,n){var r,i,o,a=this,s=e.indexOf(" ");return-1").append(k.parseHTML(e)).find(r):e)}).always(n&&function(e,t){a.each(function(){n.apply(this,o||[e.responseText,t,e])})}),this},k.each(["ajaxStart","ajaxStop","ajaxComplete","ajaxError","ajaxSuccess","ajaxSend"],function(e,t){k.fn[t]=function(e){return this.on(t,e)}}),k.expr.pseudos.animated=function(t){return k.grep(k.timers,function(e){return t===e.elem}).length},k.offset={setOffset:function(e,t,n){var r,i,o,a,s,u,l=k.css(e,"position"),c=k(e),f={};"static"===l&&(e.style.position="relative"),s=c.offset(),o=k.css(e,"top"),u=k.css(e,"left"),("absolute"===l||"fixed"===l)&&-1<(o+u).indexOf("auto")?(a=(r=c.position()).top,i=r.left):(a=parseFloat(o)||0,i=parseFloat(u)||0),m(t)&&(t=t.call(e,n,k.extend({},s))),null!=t.top&&(f.top=t.top-s.top+a),null!=t.left&&(f.left=t.left-s.left+i),"using"in t?t.using.call(e,f):c.css(f)}},k.fn.extend({offset:function(t){if(arguments.length)return void 0===t?this:this.each(function(e){k.offset.setOffset(this,t,e)});var e,n,r=this[0];return r?r.getClientRects().length?(e=r.getBoundingClientRect(),n=r.ownerDocument.defaultView,{top:e.top+n.pageYOffset,left:e.left+n.pageXOffset}):{top:0,left:0}:void 0},position:function(){if(this[0]){var e,t,n,r=this[0],i={top:0,left:0};if("fixed"===k.css(r,"position"))t=r.getBoundingClientRect();else{t=this.offset(),n=r.ownerDocument,e=r.offsetParent||n.documentElement;while(e&&(e===n.body||e===n.documentElement)&&"static"===k.css(e,"position"))e=e.parentNode;e&&e!==r&&1===e.nodeType&&((i=k(e).offset()).top+=k.css(e,"borderTopWidth",!0),i.left+=k.css(e,"borderLeftWidth",!0))}return{top:t.top-i.top-k.css(r,"marginTop",!0),left:t.left-i.left-k.css(r,"marginLeft",!0)}}},offsetParent:function(){return this.map(function(){var e=this.offsetParent;while(e&&"static"===k.css(e,"position"))e=e.offsetParent;return e||ie})}}),k.each({scrollLeft:"pageXOffset",scrollTop:"pageYOffset"},function(t,i){var o="pageYOffset"===i;k.fn[t]=function(e){return _(this,function(e,t,n){var r;if(x(e)?r=e:9===e.nodeType&&(r=e.defaultView),void 0===n)return r?r[i]:e[t];r?r.scrollTo(o?r.pageXOffset:n,o?n:r.pageYOffset):e[t]=n},t,e,arguments.length)}}),k.each(["top","left"],function(e,n){k.cssHooks[n]=ze(y.pixelPosition,function(e,t){if(t)return t=_e(e,n),$e.test(t)?k(e).position()[n]+"px":t})}),k.each({Height:"height",Width:"width"},function(a,s){k.each({padding:"inner"+a,content:s,"":"outer"+a},function(r,o){k.fn[o]=function(e,t){var n=arguments.length&&(r||"boolean"!=typeof e),i=r||(!0===e||!0===t?"margin":"border");return _(this,function(e,t,n){var r;return x(e)?0===o.indexOf("outer")?e["inner"+a]:e.document.documentElement["client"+a]:9===e.nodeType?(r=e.documentElement,Math.max(e.body["scroll"+a],r["scroll"+a],e.body["offset"+a],r["offset"+a],r["client"+a])):void 0===n?k.css(e,t,i):k.style(e,t,n,i)},s,n?e:void 0,n)}})}),k.each("blur focus focusin focusout resize scroll click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup contextmenu".split(" "),function(e,n){k.fn[n]=function(e,t){return 0a;a++)for(i in o[a])n=o[a][i],o[a].hasOwnProperty(i)&&void 0!==n&&(e[i]=t.isPlainObject(n)?t.isPlainObject(e[i])?t.widget.extend({},e[i],n):t.widget.extend({},n):n);return e},t.widget.bridge=function(e,i){var n=i.prototype.widgetFullName||e;t.fn[e]=function(o){var a="string"==typeof o,r=s.call(arguments,1),h=this;return a?this.length||"instance"!==o?this.each(function(){var i,s=t.data(this,n);return"instance"===o?(h=s,!1):s?t.isFunction(s[o])&&"_"!==o.charAt(0)?(i=s[o].apply(s,r),i!==s&&void 0!==i?(h=i&&i.jquery?h.pushStack(i.get()):i,!1):void 0):t.error("no such method '"+o+"' for "+e+" widget instance"):t.error("cannot call methods on "+e+" prior to initialization; "+"attempted to call method '"+o+"'")}):h=void 0:(r.length&&(o=t.widget.extend.apply(null,[o].concat(r))),this.each(function(){var e=t.data(this,n);e?(e.option(o||{}),e._init&&e._init()):t.data(this,n,new i(o,this))})),h}},t.Widget=function(){},t.Widget._childConstructors=[],t.Widget.prototype={widgetName:"widget",widgetEventPrefix:"",defaultElement:"
",options:{classes:{},disabled:!1,create:null},_createWidget:function(e,s){s=t(s||this.defaultElement||this)[0],this.element=t(s),this.uuid=i++,this.eventNamespace="."+this.widgetName+this.uuid,this.bindings=t(),this.hoverable=t(),this.focusable=t(),this.classesElementLookup={},s!==this&&(t.data(s,this.widgetFullName,this),this._on(!0,this.element,{remove:function(t){t.target===s&&this.destroy()}}),this.document=t(s.style?s.ownerDocument:s.document||s),this.window=t(this.document[0].defaultView||this.document[0].parentWindow)),this.options=t.widget.extend({},this.options,this._getCreateOptions(),e),this._create(),this.options.disabled&&this._setOptionDisabled(this.options.disabled),this._trigger("create",null,this._getCreateEventData()),this._init()},_getCreateOptions:function(){return{}},_getCreateEventData:t.noop,_create:t.noop,_init:t.noop,destroy:function(){var e=this;this._destroy(),t.each(this.classesElementLookup,function(t,i){e._removeClass(i,t)}),this.element.off(this.eventNamespace).removeData(this.widgetFullName),this.widget().off(this.eventNamespace).removeAttr("aria-disabled"),this.bindings.off(this.eventNamespace)},_destroy:t.noop,widget:function(){return this.element},option:function(e,i){var s,n,o,a=e;if(0===arguments.length)return t.widget.extend({},this.options);if("string"==typeof e)if(a={},s=e.split("."),e=s.shift(),s.length){for(n=a[e]=t.widget.extend({},this.options[e]),o=0;s.length-1>o;o++)n[s[o]]=n[s[o]]||{},n=n[s[o]];if(e=s.pop(),1===arguments.length)return void 0===n[e]?null:n[e];n[e]=i}else{if(1===arguments.length)return void 0===this.options[e]?null:this.options[e];a[e]=i}return this._setOptions(a),this},_setOptions:function(t){var e;for(e in t)this._setOption(e,t[e]);return this},_setOption:function(t,e){return"classes"===t&&this._setOptionClasses(e),this.options[t]=e,"disabled"===t&&this._setOptionDisabled(e),this},_setOptionClasses:function(e){var i,s,n;for(i in e)n=this.classesElementLookup[i],e[i]!==this.options.classes[i]&&n&&n.length&&(s=t(n.get()),this._removeClass(n,i),s.addClass(this._classes({element:s,keys:i,classes:e,add:!0})))},_setOptionDisabled:function(t){this._toggleClass(this.widget(),this.widgetFullName+"-disabled",null,!!t),t&&(this._removeClass(this.hoverable,null,"ui-state-hover"),this._removeClass(this.focusable,null,"ui-state-focus"))},enable:function(){return this._setOptions({disabled:!1})},disable:function(){return this._setOptions({disabled:!0})},_classes:function(e){function i(i,o){var a,r;for(r=0;i.length>r;r++)a=n.classesElementLookup[i[r]]||t(),a=e.add?t(t.unique(a.get().concat(e.element.get()))):t(a.not(e.element).get()),n.classesElementLookup[i[r]]=a,s.push(i[r]),o&&e.classes[i[r]]&&s.push(e.classes[i[r]])}var s=[],n=this;return e=t.extend({element:this.element,classes:this.options.classes||{}},e),this._on(e.element,{remove:"_untrackClassesElement"}),e.keys&&i(e.keys.match(/\S+/g)||[],!0),e.extra&&i(e.extra.match(/\S+/g)||[]),s.join(" ")},_untrackClassesElement:function(e){var i=this;t.each(i.classesElementLookup,function(s,n){-1!==t.inArray(e.target,n)&&(i.classesElementLookup[s]=t(n.not(e.target).get()))})},_removeClass:function(t,e,i){return this._toggleClass(t,e,i,!1)},_addClass:function(t,e,i){return this._toggleClass(t,e,i,!0)},_toggleClass:function(t,e,i,s){s="boolean"==typeof s?s:i;var n="string"==typeof t||null===t,o={extra:n?e:i,keys:n?t:e,element:n?this.element:t,add:s};return o.element.toggleClass(this._classes(o),s),this},_on:function(e,i,s){var n,o=this;"boolean"!=typeof e&&(s=i,i=e,e=!1),s?(i=n=t(i),this.bindings=this.bindings.add(i)):(s=i,i=this.element,n=this.widget()),t.each(s,function(s,a){function r(){return e||o.options.disabled!==!0&&!t(this).hasClass("ui-state-disabled")?("string"==typeof a?o[a]:a).apply(o,arguments):void 0}"string"!=typeof a&&(r.guid=a.guid=a.guid||r.guid||t.guid++);var h=s.match(/^([\w:-]*)\s*(.*)$/),l=h[1]+o.eventNamespace,c=h[2];c?n.on(l,c,r):i.on(l,r)})},_off:function(e,i){i=(i||"").split(" ").join(this.eventNamespace+" ")+this.eventNamespace,e.off(i).off(i),this.bindings=t(this.bindings.not(e).get()),this.focusable=t(this.focusable.not(e).get()),this.hoverable=t(this.hoverable.not(e).get())},_delay:function(t,e){function i(){return("string"==typeof t?s[t]:t).apply(s,arguments)}var s=this;return setTimeout(i,e||0)},_hoverable:function(e){this.hoverable=this.hoverable.add(e),this._on(e,{mouseenter:function(e){this._addClass(t(e.currentTarget),null,"ui-state-hover")},mouseleave:function(e){this._removeClass(t(e.currentTarget),null,"ui-state-hover")}})},_focusable:function(e){this.focusable=this.focusable.add(e),this._on(e,{focusin:function(e){this._addClass(t(e.currentTarget),null,"ui-state-focus")},focusout:function(e){this._removeClass(t(e.currentTarget),null,"ui-state-focus")}})},_trigger:function(e,i,s){var n,o,a=this.options[e];if(s=s||{},i=t.Event(i),i.type=(e===this.widgetEventPrefix?e:this.widgetEventPrefix+e).toLowerCase(),i.target=this.element[0],o=i.originalEvent)for(n in o)n in i||(i[n]=o[n]);return this.element.trigger(i,s),!(t.isFunction(a)&&a.apply(this.element[0],[i].concat(s))===!1||i.isDefaultPrevented())}},t.each({show:"fadeIn",hide:"fadeOut"},function(e,i){t.Widget.prototype["_"+e]=function(s,n,o){"string"==typeof n&&(n={effect:n});var a,r=n?n===!0||"number"==typeof n?i:n.effect||i:e;n=n||{},"number"==typeof n&&(n={duration:n}),a=!t.isEmptyObject(n),n.complete=o,n.delay&&s.delay(n.delay),a&&t.effects&&t.effects.effect[r]?s[e](n):r!==e&&s[r]?s[r](n.duration,n.easing,o):s.queue(function(i){t(this)[e](),o&&o.call(s[0]),i()})}}),t.widget,function(){function e(t,e,i){return[parseFloat(t[0])*(u.test(t[0])?e/100:1),parseFloat(t[1])*(u.test(t[1])?i/100:1)]}function i(e,i){return parseInt(t.css(e,i),10)||0}function s(e){var i=e[0];return 9===i.nodeType?{width:e.width(),height:e.height(),offset:{top:0,left:0}}:t.isWindow(i)?{width:e.width(),height:e.height(),offset:{top:e.scrollTop(),left:e.scrollLeft()}}:i.preventDefault?{width:0,height:0,offset:{top:i.pageY,left:i.pageX}}:{width:e.outerWidth(),height:e.outerHeight(),offset:e.offset()}}var n,o=Math.max,a=Math.abs,r=/left|center|right/,h=/top|center|bottom/,l=/[\+\-]\d+(\.[\d]+)?%?/,c=/^\w+/,u=/%$/,d=t.fn.position;t.position={scrollbarWidth:function(){if(void 0!==n)return n;var e,i,s=t("
"),o=s.children()[0];return t("body").append(s),e=o.offsetWidth,s.css("overflow","scroll"),i=o.offsetWidth,e===i&&(i=s[0].clientWidth),s.remove(),n=e-i},getScrollInfo:function(e){var i=e.isWindow||e.isDocument?"":e.element.css("overflow-x"),s=e.isWindow||e.isDocument?"":e.element.css("overflow-y"),n="scroll"===i||"auto"===i&&e.widthi?"left":e>0?"right":"center",vertical:0>r?"top":s>0?"bottom":"middle"};l>p&&p>a(e+i)&&(u.horizontal="center"),c>f&&f>a(s+r)&&(u.vertical="middle"),u.important=o(a(e),a(i))>o(a(s),a(r))?"horizontal":"vertical",n.using.call(this,t,u)}),h.offset(t.extend(D,{using:r}))})},t.ui.position={fit:{left:function(t,e){var i,s=e.within,n=s.isWindow?s.scrollLeft:s.offset.left,a=s.width,r=t.left-e.collisionPosition.marginLeft,h=n-r,l=r+e.collisionWidth-a-n;e.collisionWidth>a?h>0&&0>=l?(i=t.left+h+e.collisionWidth-a-n,t.left+=h-i):t.left=l>0&&0>=h?n:h>l?n+a-e.collisionWidth:n:h>0?t.left+=h:l>0?t.left-=l:t.left=o(t.left-r,t.left)},top:function(t,e){var i,s=e.within,n=s.isWindow?s.scrollTop:s.offset.top,a=e.within.height,r=t.top-e.collisionPosition.marginTop,h=n-r,l=r+e.collisionHeight-a-n;e.collisionHeight>a?h>0&&0>=l?(i=t.top+h+e.collisionHeight-a-n,t.top+=h-i):t.top=l>0&&0>=h?n:h>l?n+a-e.collisionHeight:n:h>0?t.top+=h:l>0?t.top-=l:t.top=o(t.top-r,t.top)}},flip:{left:function(t,e){var i,s,n=e.within,o=n.offset.left+n.scrollLeft,r=n.width,h=n.isWindow?n.scrollLeft:n.offset.left,l=t.left-e.collisionPosition.marginLeft,c=l-h,u=l+e.collisionWidth-r-h,d="left"===e.my[0]?-e.elemWidth:"right"===e.my[0]?e.elemWidth:0,p="left"===e.at[0]?e.targetWidth:"right"===e.at[0]?-e.targetWidth:0,f=-2*e.offset[0];0>c?(i=t.left+d+p+f+e.collisionWidth-r-o,(0>i||a(c)>i)&&(t.left+=d+p+f)):u>0&&(s=t.left-e.collisionPosition.marginLeft+d+p+f-h,(s>0||u>a(s))&&(t.left+=d+p+f))},top:function(t,e){var i,s,n=e.within,o=n.offset.top+n.scrollTop,r=n.height,h=n.isWindow?n.scrollTop:n.offset.top,l=t.top-e.collisionPosition.marginTop,c=l-h,u=l+e.collisionHeight-r-h,d="top"===e.my[1],p=d?-e.elemHeight:"bottom"===e.my[1]?e.elemHeight:0,f="top"===e.at[1]?e.targetHeight:"bottom"===e.at[1]?-e.targetHeight:0,m=-2*e.offset[1];0>c?(s=t.top+p+f+m+e.collisionHeight-r-o,(0>s||a(c)>s)&&(t.top+=p+f+m)):u>0&&(i=t.top-e.collisionPosition.marginTop+p+f+m-h,(i>0||u>a(i))&&(t.top+=p+f+m))}},flipfit:{left:function(){t.ui.position.flip.left.apply(this,arguments),t.ui.position.fit.left.apply(this,arguments)},top:function(){t.ui.position.flip.top.apply(this,arguments),t.ui.position.fit.top.apply(this,arguments)}}}}(),t.ui.position,t.extend(t.expr[":"],{data:t.expr.createPseudo?t.expr.createPseudo(function(e){return function(i){return!!t.data(i,e)}}):function(e,i,s){return!!t.data(e,s[3])}}),t.fn.extend({disableSelection:function(){var t="onselectstart"in document.createElement("div")?"selectstart":"mousedown";return function(){return this.on(t+".ui-disableSelection",function(t){t.preventDefault()})}}(),enableSelection:function(){return this.off(".ui-disableSelection")}}),t.ui.focusable=function(i,s){var n,o,a,r,h,l=i.nodeName.toLowerCase();return"area"===l?(n=i.parentNode,o=n.name,i.href&&o&&"map"===n.nodeName.toLowerCase()?(a=t("img[usemap='#"+o+"']"),a.length>0&&a.is(":visible")):!1):(/^(input|select|textarea|button|object)$/.test(l)?(r=!i.disabled,r&&(h=t(i).closest("fieldset")[0],h&&(r=!h.disabled))):r="a"===l?i.href||s:s,r&&t(i).is(":visible")&&e(t(i)))},t.extend(t.expr[":"],{focusable:function(e){return t.ui.focusable(e,null!=t.attr(e,"tabindex"))}}),t.ui.focusable,t.fn.form=function(){return"string"==typeof this[0].form?this.closest("form"):t(this[0].form)},t.ui.formResetMixin={_formResetHandler:function(){var e=t(this);setTimeout(function(){var i=e.data("ui-form-reset-instances");t.each(i,function(){this.refresh()})})},_bindFormResetHandler:function(){if(this.form=this.element.form(),this.form.length){var t=this.form.data("ui-form-reset-instances")||[];t.length||this.form.on("reset.ui-form-reset",this._formResetHandler),t.push(this),this.form.data("ui-form-reset-instances",t)}},_unbindFormResetHandler:function(){if(this.form.length){var e=this.form.data("ui-form-reset-instances");e.splice(t.inArray(this,e),1),e.length?this.form.data("ui-form-reset-instances",e):this.form.removeData("ui-form-reset-instances").off("reset.ui-form-reset")}}},"1.7"===t.fn.jquery.substring(0,3)&&(t.each(["Width","Height"],function(e,i){function s(e,i,s,o){return t.each(n,function(){i-=parseFloat(t.css(e,"padding"+this))||0,s&&(i-=parseFloat(t.css(e,"border"+this+"Width"))||0),o&&(i-=parseFloat(t.css(e,"margin"+this))||0)}),i}var n="Width"===i?["Left","Right"]:["Top","Bottom"],o=i.toLowerCase(),a={innerWidth:t.fn.innerWidth,innerHeight:t.fn.innerHeight,outerWidth:t.fn.outerWidth,outerHeight:t.fn.outerHeight};t.fn["inner"+i]=function(e){return void 0===e?a["inner"+i].call(this):this.each(function(){t(this).css(o,s(this,e)+"px")})},t.fn["outer"+i]=function(e,n){return"number"!=typeof e?a["outer"+i].call(this,e):this.each(function(){t(this).css(o,s(this,e,!0,n)+"px")})}}),t.fn.addBack=function(t){return this.add(null==t?this.prevObject:this.prevObject.filter(t))}),t.ui.keyCode={BACKSPACE:8,COMMA:188,DELETE:46,DOWN:40,END:35,ENTER:13,ESCAPE:27,HOME:36,LEFT:37,PAGE_DOWN:34,PAGE_UP:33,PERIOD:190,RIGHT:39,SPACE:32,TAB:9,UP:38},t.ui.escapeSelector=function(){var t=/([!"#$%&'()*+,./:;<=>?@[\]^`{|}~])/g;return function(e){return e.replace(t,"\\$1")}}(),t.fn.labels=function(){var e,i,s,n,o;return this[0].labels&&this[0].labels.length?this.pushStack(this[0].labels):(n=this.eq(0).parents("label"),s=this.attr("id"),s&&(e=this.eq(0).parents().last(),o=e.add(e.length?e.siblings():this.siblings()),i="label[for='"+t.ui.escapeSelector(s)+"']",n=n.add(o.find(i).addBack(i))),this.pushStack(n))},t.fn.scrollParent=function(e){var i=this.css("position"),s="absolute"===i,n=e?/(auto|scroll|hidden)/:/(auto|scroll)/,o=this.parents().filter(function(){var e=t(this);return s&&"static"===e.css("position")?!1:n.test(e.css("overflow")+e.css("overflow-y")+e.css("overflow-x"))}).eq(0);return"fixed"!==i&&o.length?o:t(this[0].ownerDocument||document)},t.extend(t.expr[":"],{tabbable:function(e){var i=t.attr(e,"tabindex"),s=null!=i;return(!s||i>=0)&&t.ui.focusable(e,s)}}),t.fn.extend({uniqueId:function(){var t=0;return function(){return this.each(function(){this.id||(this.id="ui-id-"+ ++t)})}}(),removeUniqueId:function(){return this.each(function(){/^ui-id-\d+$/.test(this.id)&&t(this).removeAttr("id")})}}),t.ui.ie=!!/msie [\w.]+/.exec(navigator.userAgent.toLowerCase());var n=!1;t(document).on("mouseup",function(){n=!1}),t.widget("ui.mouse",{version:"1.12.1",options:{cancel:"input, textarea, button, select, option",distance:1,delay:0},_mouseInit:function(){var e=this;this.element.on("mousedown."+this.widgetName,function(t){return e._mouseDown(t)}).on("click."+this.widgetName,function(i){return!0===t.data(i.target,e.widgetName+".preventClickEvent")?(t.removeData(i.target,e.widgetName+".preventClickEvent"),i.stopImmediatePropagation(),!1):void 0}),this.started=!1},_mouseDestroy:function(){this.element.off("."+this.widgetName),this._mouseMoveDelegate&&this.document.off("mousemove."+this.widgetName,this._mouseMoveDelegate).off("mouseup."+this.widgetName,this._mouseUpDelegate)},_mouseDown:function(e){if(!n){this._mouseMoved=!1,this._mouseStarted&&this._mouseUp(e),this._mouseDownEvent=e;var i=this,s=1===e.which,o="string"==typeof this.options.cancel&&e.target.nodeName?t(e.target).closest(this.options.cancel).length:!1;return s&&!o&&this._mouseCapture(e)?(this.mouseDelayMet=!this.options.delay,this.mouseDelayMet||(this._mouseDelayTimer=setTimeout(function(){i.mouseDelayMet=!0},this.options.delay)),this._mouseDistanceMet(e)&&this._mouseDelayMet(e)&&(this._mouseStarted=this._mouseStart(e)!==!1,!this._mouseStarted)?(e.preventDefault(),!0):(!0===t.data(e.target,this.widgetName+".preventClickEvent")&&t.removeData(e.target,this.widgetName+".preventClickEvent"),this._mouseMoveDelegate=function(t){return i._mouseMove(t)},this._mouseUpDelegate=function(t){return i._mouseUp(t)},this.document.on("mousemove."+this.widgetName,this._mouseMoveDelegate).on("mouseup."+this.widgetName,this._mouseUpDelegate),e.preventDefault(),n=!0,!0)):!0}},_mouseMove:function(e){if(this._mouseMoved){if(t.ui.ie&&(!document.documentMode||9>document.documentMode)&&!e.button)return this._mouseUp(e);if(!e.which)if(e.originalEvent.altKey||e.originalEvent.ctrlKey||e.originalEvent.metaKey||e.originalEvent.shiftKey)this.ignoreMissingWhich=!0;else if(!this.ignoreMissingWhich)return this._mouseUp(e)}return(e.which||e.button)&&(this._mouseMoved=!0),this._mouseStarted?(this._mouseDrag(e),e.preventDefault()):(this._mouseDistanceMet(e)&&this._mouseDelayMet(e)&&(this._mouseStarted=this._mouseStart(this._mouseDownEvent,e)!==!1,this._mouseStarted?this._mouseDrag(e):this._mouseUp(e)),!this._mouseStarted)},_mouseUp:function(e){this.document.off("mousemove."+this.widgetName,this._mouseMoveDelegate).off("mouseup."+this.widgetName,this._mouseUpDelegate),this._mouseStarted&&(this._mouseStarted=!1,e.target===this._mouseDownEvent.target&&t.data(e.target,this.widgetName+".preventClickEvent",!0),this._mouseStop(e)),this._mouseDelayTimer&&(clearTimeout(this._mouseDelayTimer),delete this._mouseDelayTimer),this.ignoreMissingWhich=!1,n=!1,e.preventDefault()},_mouseDistanceMet:function(t){return Math.max(Math.abs(this._mouseDownEvent.pageX-t.pageX),Math.abs(this._mouseDownEvent.pageY-t.pageY))>=this.options.distance},_mouseDelayMet:function(){return this.mouseDelayMet},_mouseStart:function(){},_mouseDrag:function(){},_mouseStop:function(){},_mouseCapture:function(){return!0}}),t.ui.plugin={add:function(e,i,s){var n,o=t.ui[e].prototype;for(n in s)o.plugins[n]=o.plugins[n]||[],o.plugins[n].push([i,s[n]])},call:function(t,e,i,s){var n,o=t.plugins[e];if(o&&(s||t.element[0].parentNode&&11!==t.element[0].parentNode.nodeType))for(n=0;o.length>n;n++)t.options[o[n][0]]&&o[n][1].apply(t.element,i)}},t.widget("ui.resizable",t.ui.mouse,{version:"1.12.1",widgetEventPrefix:"resize",options:{alsoResize:!1,animate:!1,animateDuration:"slow",animateEasing:"swing",aspectRatio:!1,autoHide:!1,classes:{"ui-resizable-se":"ui-icon ui-icon-gripsmall-diagonal-se"},containment:!1,ghost:!1,grid:!1,handles:"e,s,se",helper:!1,maxHeight:null,maxWidth:null,minHeight:10,minWidth:10,zIndex:90,resize:null,start:null,stop:null},_num:function(t){return parseFloat(t)||0},_isNumber:function(t){return!isNaN(parseFloat(t))},_hasScroll:function(e,i){if("hidden"===t(e).css("overflow"))return!1;var s=i&&"left"===i?"scrollLeft":"scrollTop",n=!1;return e[s]>0?!0:(e[s]=1,n=e[s]>0,e[s]=0,n)},_create:function(){var e,i=this.options,s=this;this._addClass("ui-resizable"),t.extend(this,{_aspectRatio:!!i.aspectRatio,aspectRatio:i.aspectRatio,originalElement:this.element,_proportionallyResizeElements:[],_helper:i.helper||i.ghost||i.animate?i.helper||"ui-resizable-helper":null}),this.element[0].nodeName.match(/^(canvas|textarea|input|select|button|img)$/i)&&(this.element.wrap(t("
").css({position:this.element.css("position"),width:this.element.outerWidth(),height:this.element.outerHeight(),top:this.element.css("top"),left:this.element.css("left")})),this.element=this.element.parent().data("ui-resizable",this.element.resizable("instance")),this.elementIsWrapper=!0,e={marginTop:this.originalElement.css("marginTop"),marginRight:this.originalElement.css("marginRight"),marginBottom:this.originalElement.css("marginBottom"),marginLeft:this.originalElement.css("marginLeft")},this.element.css(e),this.originalElement.css("margin",0),this.originalResizeStyle=this.originalElement.css("resize"),this.originalElement.css("resize","none"),this._proportionallyResizeElements.push(this.originalElement.css({position:"static",zoom:1,display:"block"})),this.originalElement.css(e),this._proportionallyResize()),this._setupHandles(),i.autoHide&&t(this.element).on("mouseenter",function(){i.disabled||(s._removeClass("ui-resizable-autohide"),s._handles.show())}).on("mouseleave",function(){i.disabled||s.resizing||(s._addClass("ui-resizable-autohide"),s._handles.hide())}),this._mouseInit()},_destroy:function(){this._mouseDestroy();var e,i=function(e){t(e).removeData("resizable").removeData("ui-resizable").off(".resizable").find(".ui-resizable-handle").remove()};return this.elementIsWrapper&&(i(this.element),e=this.element,this.originalElement.css({position:e.css("position"),width:e.outerWidth(),height:e.outerHeight(),top:e.css("top"),left:e.css("left")}).insertAfter(e),e.remove()),this.originalElement.css("resize",this.originalResizeStyle),i(this.originalElement),this},_setOption:function(t,e){switch(this._super(t,e),t){case"handles":this._removeHandles(),this._setupHandles();break;default:}},_setupHandles:function(){var e,i,s,n,o,a=this.options,r=this;if(this.handles=a.handles||(t(".ui-resizable-handle",this.element).length?{n:".ui-resizable-n",e:".ui-resizable-e",s:".ui-resizable-s",w:".ui-resizable-w",se:".ui-resizable-se",sw:".ui-resizable-sw",ne:".ui-resizable-ne",nw:".ui-resizable-nw"}:"e,s,se"),this._handles=t(),this.handles.constructor===String)for("all"===this.handles&&(this.handles="n,e,s,w,se,sw,ne,nw"),s=this.handles.split(","),this.handles={},i=0;s.length>i;i++)e=t.trim(s[i]),n="ui-resizable-"+e,o=t("
"),this._addClass(o,"ui-resizable-handle "+n),o.css({zIndex:a.zIndex}),this.handles[e]=".ui-resizable-"+e,this.element.append(o);this._renderAxis=function(e){var i,s,n,o;e=e||this.element;for(i in this.handles)this.handles[i].constructor===String?this.handles[i]=this.element.children(this.handles[i]).first().show():(this.handles[i].jquery||this.handles[i].nodeType)&&(this.handles[i]=t(this.handles[i]),this._on(this.handles[i],{mousedown:r._mouseDown})),this.elementIsWrapper&&this.originalElement[0].nodeName.match(/^(textarea|input|select|button)$/i)&&(s=t(this.handles[i],this.element),o=/sw|ne|nw|se|n|s/.test(i)?s.outerHeight():s.outerWidth(),n=["padding",/ne|nw|n/.test(i)?"Top":/se|sw|s/.test(i)?"Bottom":/^e$/.test(i)?"Right":"Left"].join(""),e.css(n,o),this._proportionallyResize()),this._handles=this._handles.add(this.handles[i])},this._renderAxis(this.element),this._handles=this._handles.add(this.element.find(".ui-resizable-handle")),this._handles.disableSelection(),this._handles.on("mouseover",function(){r.resizing||(this.className&&(o=this.className.match(/ui-resizable-(se|sw|ne|nw|n|e|s|w)/i)),r.axis=o&&o[1]?o[1]:"se")}),a.autoHide&&(this._handles.hide(),this._addClass("ui-resizable-autohide"))},_removeHandles:function(){this._handles.remove()},_mouseCapture:function(e){var i,s,n=!1;for(i in this.handles)s=t(this.handles[i])[0],(s===e.target||t.contains(s,e.target))&&(n=!0);return!this.options.disabled&&n},_mouseStart:function(e){var i,s,n,o=this.options,a=this.element;return this.resizing=!0,this._renderProxy(),i=this._num(this.helper.css("left")),s=this._num(this.helper.css("top")),o.containment&&(i+=t(o.containment).scrollLeft()||0,s+=t(o.containment).scrollTop()||0),this.offset=this.helper.offset(),this.position={left:i,top:s},this.size=this._helper?{width:this.helper.width(),height:this.helper.height()}:{width:a.width(),height:a.height()},this.originalSize=this._helper?{width:a.outerWidth(),height:a.outerHeight()}:{width:a.width(),height:a.height()},this.sizeDiff={width:a.outerWidth()-a.width(),height:a.outerHeight()-a.height()},this.originalPosition={left:i,top:s},this.originalMousePosition={left:e.pageX,top:e.pageY},this.aspectRatio="number"==typeof o.aspectRatio?o.aspectRatio:this.originalSize.width/this.originalSize.height||1,n=t(".ui-resizable-"+this.axis).css("cursor"),t("body").css("cursor","auto"===n?this.axis+"-resize":n),this._addClass("ui-resizable-resizing"),this._propagate("start",e),!0},_mouseDrag:function(e){var i,s,n=this.originalMousePosition,o=this.axis,a=e.pageX-n.left||0,r=e.pageY-n.top||0,h=this._change[o];return this._updatePrevProperties(),h?(i=h.apply(this,[e,a,r]),this._updateVirtualBoundaries(e.shiftKey),(this._aspectRatio||e.shiftKey)&&(i=this._updateRatio(i,e)),i=this._respectSize(i,e),this._updateCache(i),this._propagate("resize",e),s=this._applyChanges(),!this._helper&&this._proportionallyResizeElements.length&&this._proportionallyResize(),t.isEmptyObject(s)||(this._updatePrevProperties(),this._trigger("resize",e,this.ui()),this._applyChanges()),!1):!1},_mouseStop:function(e){this.resizing=!1;var i,s,n,o,a,r,h,l=this.options,c=this;return this._helper&&(i=this._proportionallyResizeElements,s=i.length&&/textarea/i.test(i[0].nodeName),n=s&&this._hasScroll(i[0],"left")?0:c.sizeDiff.height,o=s?0:c.sizeDiff.width,a={width:c.helper.width()-o,height:c.helper.height()-n},r=parseFloat(c.element.css("left"))+(c.position.left-c.originalPosition.left)||null,h=parseFloat(c.element.css("top"))+(c.position.top-c.originalPosition.top)||null,l.animate||this.element.css(t.extend(a,{top:h,left:r})),c.helper.height(c.size.height),c.helper.width(c.size.width),this._helper&&!l.animate&&this._proportionallyResize()),t("body").css("cursor","auto"),this._removeClass("ui-resizable-resizing"),this._propagate("stop",e),this._helper&&this.helper.remove(),!1},_updatePrevProperties:function(){this.prevPosition={top:this.position.top,left:this.position.left},this.prevSize={width:this.size.width,height:this.size.height}},_applyChanges:function(){var t={};return this.position.top!==this.prevPosition.top&&(t.top=this.position.top+"px"),this.position.left!==this.prevPosition.left&&(t.left=this.position.left+"px"),this.size.width!==this.prevSize.width&&(t.width=this.size.width+"px"),this.size.height!==this.prevSize.height&&(t.height=this.size.height+"px"),this.helper.css(t),t},_updateVirtualBoundaries:function(t){var e,i,s,n,o,a=this.options;o={minWidth:this._isNumber(a.minWidth)?a.minWidth:0,maxWidth:this._isNumber(a.maxWidth)?a.maxWidth:1/0,minHeight:this._isNumber(a.minHeight)?a.minHeight:0,maxHeight:this._isNumber(a.maxHeight)?a.maxHeight:1/0},(this._aspectRatio||t)&&(e=o.minHeight*this.aspectRatio,s=o.minWidth/this.aspectRatio,i=o.maxHeight*this.aspectRatio,n=o.maxWidth/this.aspectRatio,e>o.minWidth&&(o.minWidth=e),s>o.minHeight&&(o.minHeight=s),o.maxWidth>i&&(o.maxWidth=i),o.maxHeight>n&&(o.maxHeight=n)),this._vBoundaries=o},_updateCache:function(t){this.offset=this.helper.offset(),this._isNumber(t.left)&&(this.position.left=t.left),this._isNumber(t.top)&&(this.position.top=t.top),this._isNumber(t.height)&&(this.size.height=t.height),this._isNumber(t.width)&&(this.size.width=t.width)},_updateRatio:function(t){var e=this.position,i=this.size,s=this.axis;return this._isNumber(t.height)?t.width=t.height*this.aspectRatio:this._isNumber(t.width)&&(t.height=t.width/this.aspectRatio),"sw"===s&&(t.left=e.left+(i.width-t.width),t.top=null),"nw"===s&&(t.top=e.top+(i.height-t.height),t.left=e.left+(i.width-t.width)),t},_respectSize:function(t){var e=this._vBoundaries,i=this.axis,s=this._isNumber(t.width)&&e.maxWidth&&e.maxWidtht.width,a=this._isNumber(t.height)&&e.minHeight&&e.minHeight>t.height,r=this.originalPosition.left+this.originalSize.width,h=this.originalPosition.top+this.originalSize.height,l=/sw|nw|w/.test(i),c=/nw|ne|n/.test(i);return o&&(t.width=e.minWidth),a&&(t.height=e.minHeight),s&&(t.width=e.maxWidth),n&&(t.height=e.maxHeight),o&&l&&(t.left=r-e.minWidth),s&&l&&(t.left=r-e.maxWidth),a&&c&&(t.top=h-e.minHeight),n&&c&&(t.top=h-e.maxHeight),t.width||t.height||t.left||!t.top?t.width||t.height||t.top||!t.left||(t.left=null):t.top=null,t},_getPaddingPlusBorderDimensions:function(t){for(var e=0,i=[],s=[t.css("borderTopWidth"),t.css("borderRightWidth"),t.css("borderBottomWidth"),t.css("borderLeftWidth")],n=[t.css("paddingTop"),t.css("paddingRight"),t.css("paddingBottom"),t.css("paddingLeft")];4>e;e++)i[e]=parseFloat(s[e])||0,i[e]+=parseFloat(n[e])||0;return{height:i[0]+i[2],width:i[1]+i[3]}},_proportionallyResize:function(){if(this._proportionallyResizeElements.length)for(var t,e=0,i=this.helper||this.element;this._proportionallyResizeElements.length>e;e++)t=this._proportionallyResizeElements[e],this.outerDimensions||(this.outerDimensions=this._getPaddingPlusBorderDimensions(t)),t.css({height:i.height()-this.outerDimensions.height||0,width:i.width()-this.outerDimensions.width||0})},_renderProxy:function(){var e=this.element,i=this.options;this.elementOffset=e.offset(),this._helper?(this.helper=this.helper||t("
"),this._addClass(this.helper,this._helper),this.helper.css({width:this.element.outerWidth(),height:this.element.outerHeight(),position:"absolute",left:this.elementOffset.left+"px",top:this.elementOffset.top+"px",zIndex:++i.zIndex}),this.helper.appendTo("body").disableSelection()):this.helper=this.element +},_change:{e:function(t,e){return{width:this.originalSize.width+e}},w:function(t,e){var i=this.originalSize,s=this.originalPosition;return{left:s.left+e,width:i.width-e}},n:function(t,e,i){var s=this.originalSize,n=this.originalPosition;return{top:n.top+i,height:s.height-i}},s:function(t,e,i){return{height:this.originalSize.height+i}},se:function(e,i,s){return t.extend(this._change.s.apply(this,arguments),this._change.e.apply(this,[e,i,s]))},sw:function(e,i,s){return t.extend(this._change.s.apply(this,arguments),this._change.w.apply(this,[e,i,s]))},ne:function(e,i,s){return t.extend(this._change.n.apply(this,arguments),this._change.e.apply(this,[e,i,s]))},nw:function(e,i,s){return t.extend(this._change.n.apply(this,arguments),this._change.w.apply(this,[e,i,s]))}},_propagate:function(e,i){t.ui.plugin.call(this,e,[i,this.ui()]),"resize"!==e&&this._trigger(e,i,this.ui())},plugins:{},ui:function(){return{originalElement:this.originalElement,element:this.element,helper:this.helper,position:this.position,size:this.size,originalSize:this.originalSize,originalPosition:this.originalPosition}}}),t.ui.plugin.add("resizable","animate",{stop:function(e){var i=t(this).resizable("instance"),s=i.options,n=i._proportionallyResizeElements,o=n.length&&/textarea/i.test(n[0].nodeName),a=o&&i._hasScroll(n[0],"left")?0:i.sizeDiff.height,r=o?0:i.sizeDiff.width,h={width:i.size.width-r,height:i.size.height-a},l=parseFloat(i.element.css("left"))+(i.position.left-i.originalPosition.left)||null,c=parseFloat(i.element.css("top"))+(i.position.top-i.originalPosition.top)||null;i.element.animate(t.extend(h,c&&l?{top:c,left:l}:{}),{duration:s.animateDuration,easing:s.animateEasing,step:function(){var s={width:parseFloat(i.element.css("width")),height:parseFloat(i.element.css("height")),top:parseFloat(i.element.css("top")),left:parseFloat(i.element.css("left"))};n&&n.length&&t(n[0]).css({width:s.width,height:s.height}),i._updateCache(s),i._propagate("resize",e)}})}}),t.ui.plugin.add("resizable","containment",{start:function(){var e,i,s,n,o,a,r,h=t(this).resizable("instance"),l=h.options,c=h.element,u=l.containment,d=u instanceof t?u.get(0):/parent/.test(u)?c.parent().get(0):u;d&&(h.containerElement=t(d),/document/.test(u)||u===document?(h.containerOffset={left:0,top:0},h.containerPosition={left:0,top:0},h.parentData={element:t(document),left:0,top:0,width:t(document).width(),height:t(document).height()||document.body.parentNode.scrollHeight}):(e=t(d),i=[],t(["Top","Right","Left","Bottom"]).each(function(t,s){i[t]=h._num(e.css("padding"+s))}),h.containerOffset=e.offset(),h.containerPosition=e.position(),h.containerSize={height:e.innerHeight()-i[3],width:e.innerWidth()-i[1]},s=h.containerOffset,n=h.containerSize.height,o=h.containerSize.width,a=h._hasScroll(d,"left")?d.scrollWidth:o,r=h._hasScroll(d)?d.scrollHeight:n,h.parentData={element:d,left:s.left,top:s.top,width:a,height:r}))},resize:function(e){var i,s,n,o,a=t(this).resizable("instance"),r=a.options,h=a.containerOffset,l=a.position,c=a._aspectRatio||e.shiftKey,u={top:0,left:0},d=a.containerElement,p=!0;d[0]!==document&&/static/.test(d.css("position"))&&(u=h),l.left<(a._helper?h.left:0)&&(a.size.width=a.size.width+(a._helper?a.position.left-h.left:a.position.left-u.left),c&&(a.size.height=a.size.width/a.aspectRatio,p=!1),a.position.left=r.helper?h.left:0),l.top<(a._helper?h.top:0)&&(a.size.height=a.size.height+(a._helper?a.position.top-h.top:a.position.top),c&&(a.size.width=a.size.height*a.aspectRatio,p=!1),a.position.top=a._helper?h.top:0),n=a.containerElement.get(0)===a.element.parent().get(0),o=/relative|absolute/.test(a.containerElement.css("position")),n&&o?(a.offset.left=a.parentData.left+a.position.left,a.offset.top=a.parentData.top+a.position.top):(a.offset.left=a.element.offset().left,a.offset.top=a.element.offset().top),i=Math.abs(a.sizeDiff.width+(a._helper?a.offset.left-u.left:a.offset.left-h.left)),s=Math.abs(a.sizeDiff.height+(a._helper?a.offset.top-u.top:a.offset.top-h.top)),i+a.size.width>=a.parentData.width&&(a.size.width=a.parentData.width-i,c&&(a.size.height=a.size.width/a.aspectRatio,p=!1)),s+a.size.height>=a.parentData.height&&(a.size.height=a.parentData.height-s,c&&(a.size.width=a.size.height*a.aspectRatio,p=!1)),p||(a.position.left=a.prevPosition.left,a.position.top=a.prevPosition.top,a.size.width=a.prevSize.width,a.size.height=a.prevSize.height)},stop:function(){var e=t(this).resizable("instance"),i=e.options,s=e.containerOffset,n=e.containerPosition,o=e.containerElement,a=t(e.helper),r=a.offset(),h=a.outerWidth()-e.sizeDiff.width,l=a.outerHeight()-e.sizeDiff.height;e._helper&&!i.animate&&/relative/.test(o.css("position"))&&t(this).css({left:r.left-n.left-s.left,width:h,height:l}),e._helper&&!i.animate&&/static/.test(o.css("position"))&&t(this).css({left:r.left-n.left-s.left,width:h,height:l})}}),t.ui.plugin.add("resizable","alsoResize",{start:function(){var e=t(this).resizable("instance"),i=e.options;t(i.alsoResize).each(function(){var e=t(this);e.data("ui-resizable-alsoresize",{width:parseFloat(e.width()),height:parseFloat(e.height()),left:parseFloat(e.css("left")),top:parseFloat(e.css("top"))})})},resize:function(e,i){var s=t(this).resizable("instance"),n=s.options,o=s.originalSize,a=s.originalPosition,r={height:s.size.height-o.height||0,width:s.size.width-o.width||0,top:s.position.top-a.top||0,left:s.position.left-a.left||0};t(n.alsoResize).each(function(){var e=t(this),s=t(this).data("ui-resizable-alsoresize"),n={},o=e.parents(i.originalElement[0]).length?["width","height"]:["width","height","top","left"];t.each(o,function(t,e){var i=(s[e]||0)+(r[e]||0);i&&i>=0&&(n[e]=i||null)}),e.css(n)})},stop:function(){t(this).removeData("ui-resizable-alsoresize")}}),t.ui.plugin.add("resizable","ghost",{start:function(){var e=t(this).resizable("instance"),i=e.size;e.ghost=e.originalElement.clone(),e.ghost.css({opacity:.25,display:"block",position:"relative",height:i.height,width:i.width,margin:0,left:0,top:0}),e._addClass(e.ghost,"ui-resizable-ghost"),t.uiBackCompat!==!1&&"string"==typeof e.options.ghost&&e.ghost.addClass(this.options.ghost),e.ghost.appendTo(e.helper)},resize:function(){var e=t(this).resizable("instance");e.ghost&&e.ghost.css({position:"relative",height:e.size.height,width:e.size.width})},stop:function(){var e=t(this).resizable("instance");e.ghost&&e.helper&&e.helper.get(0).removeChild(e.ghost.get(0))}}),t.ui.plugin.add("resizable","grid",{resize:function(){var e,i=t(this).resizable("instance"),s=i.options,n=i.size,o=i.originalSize,a=i.originalPosition,r=i.axis,h="number"==typeof s.grid?[s.grid,s.grid]:s.grid,l=h[0]||1,c=h[1]||1,u=Math.round((n.width-o.width)/l)*l,d=Math.round((n.height-o.height)/c)*c,p=o.width+u,f=o.height+d,m=s.maxWidth&&p>s.maxWidth,g=s.maxHeight&&f>s.maxHeight,_=s.minWidth&&s.minWidth>p,v=s.minHeight&&s.minHeight>f;s.grid=h,_&&(p+=l),v&&(f+=c),m&&(p-=l),g&&(f-=c),/^(se|s|e)$/.test(r)?(i.size.width=p,i.size.height=f):/^(ne)$/.test(r)?(i.size.width=p,i.size.height=f,i.position.top=a.top-d):/^(sw)$/.test(r)?(i.size.width=p,i.size.height=f,i.position.left=a.left-u):((0>=f-c||0>=p-l)&&(e=i._getPaddingPlusBorderDimensions(this)),f-c>0?(i.size.height=f,i.position.top=a.top-d):(f=c-e.height,i.size.height=f,i.position.top=a.top+o.height-f),p-l>0?(i.size.width=p,i.position.left=a.left-u):(p=l-e.width,i.size.width=p,i.position.left=a.left+o.width-p))}}),t.ui.resizable});/** + * Copyright (c) 2007 Ariel Flesler - aflesler ○ gmail • com | https://github.com/flesler + * Licensed under MIT + * @author Ariel Flesler + * @version 2.1.2 + */ +;(function(f){"use strict";"function"===typeof define&&define.amd?define(["jquery"],f):"undefined"!==typeof module&&module.exports?module.exports=f(require("jquery")):f(jQuery)})(function($){"use strict";function n(a){return!a.nodeName||-1!==$.inArray(a.nodeName.toLowerCase(),["iframe","#document","html","body"])}function h(a){return $.isFunction(a)||$.isPlainObject(a)?a:{top:a,left:a}}var p=$.scrollTo=function(a,d,b){return $(window).scrollTo(a,d,b)};p.defaults={axis:"xy",duration:0,limit:!0};$.fn.scrollTo=function(a,d,b){"object"=== typeof d&&(b=d,d=0);"function"===typeof b&&(b={onAfter:b});"max"===a&&(a=9E9);b=$.extend({},p.defaults,b);d=d||b.duration;var u=b.queue&&1=f[g]?0:Math.min(f[g],n));!a&&1-1){targetElements.on(evt+EVENT_NAMESPACE,function elementToggle(event){$.powerTip.toggle(this,event)})}else{targetElements.on(evt+EVENT_NAMESPACE,function elementOpen(event){$.powerTip.show(this,event)})}});$.each(options.closeEvents,function(idx,evt){if($.inArray(evt,options.openEvents)<0){targetElements.on(evt+EVENT_NAMESPACE,function elementClose(event){$.powerTip.hide(this,!isMouseEvent(event))})}});targetElements.on("keydown"+EVENT_NAMESPACE,function elementKeyDown(event){if(event.keyCode===27){$.powerTip.hide(this,true)}})}return targetElements};$.fn.powerTip.defaults={fadeInTime:200,fadeOutTime:100,followMouse:false,popupId:"powerTip",popupClass:null,intentSensitivity:7,intentPollInterval:100,closeDelay:100,placement:"n",smartPlacement:false,offset:10,mouseOnToPopup:false,manual:false,openEvents:["mouseenter","focus"],closeEvents:["mouseleave","blur"]};$.fn.powerTip.smartPlacementLists={n:["n","ne","nw","s"],e:["e","ne","se","w","nw","sw","n","s","e"],s:["s","se","sw","n"],w:["w","nw","sw","e","ne","se","n","s","w"],nw:["nw","w","sw","n","s","se","nw"],ne:["ne","e","se","n","s","sw","ne"],sw:["sw","w","nw","s","n","ne","sw"],se:["se","e","ne","s","n","nw","se"],"nw-alt":["nw-alt","n","ne-alt","sw-alt","s","se-alt","w","e"],"ne-alt":["ne-alt","n","nw-alt","se-alt","s","sw-alt","e","w"],"sw-alt":["sw-alt","s","se-alt","nw-alt","n","ne-alt","w","e"],"se-alt":["se-alt","s","sw-alt","ne-alt","n","nw-alt","e","w"]};$.powerTip={show:function apiShowTip(element,event){if(isMouseEvent(event)){trackMouse(event);session.previousX=event.pageX;session.previousY=event.pageY;$(element).data(DATA_DISPLAYCONTROLLER).show()}else{$(element).first().data(DATA_DISPLAYCONTROLLER).show(true,true)}return element},reposition:function apiResetPosition(element){$(element).first().data(DATA_DISPLAYCONTROLLER).resetPosition();return element},hide:function apiCloseTip(element,immediate){var displayController;immediate=element?immediate:true;if(element){displayController=$(element).first().data(DATA_DISPLAYCONTROLLER)}else if(session.activeHover){displayController=session.activeHover.data(DATA_DISPLAYCONTROLLER)}if(displayController){displayController.hide(immediate)}return element},toggle:function apiToggle(element,event){if(session.activeHover&&session.activeHover.is(element)){$.powerTip.hide(element,!isMouseEvent(event))}else{$.powerTip.show(element,event)}return element}};$.powerTip.showTip=$.powerTip.show;$.powerTip.closeTip=$.powerTip.hide;function CSSCoordinates(){var me=this;me.top="auto";me.left="auto";me.right="auto";me.bottom="auto";me.set=function(property,value){if($.isNumeric(value)){me[property]=Math.round(value)}}}function DisplayController(element,options,tipController){var hoverTimer=null,myCloseDelay=null;function openTooltip(immediate,forceOpen){cancelTimer();if(!element.data(DATA_HASACTIVEHOVER)){if(!immediate){session.tipOpenImminent=true;hoverTimer=setTimeout(function intentDelay(){hoverTimer=null;checkForIntent()},options.intentPollInterval)}else{if(forceOpen){element.data(DATA_FORCEDOPEN,true)}closeAnyDelayed();tipController.showTip(element)}}else{cancelClose()}}function closeTooltip(disableDelay){if(myCloseDelay){myCloseDelay=session.closeDelayTimeout=clearTimeout(myCloseDelay);session.delayInProgress=false}cancelTimer();session.tipOpenImminent=false;if(element.data(DATA_HASACTIVEHOVER)){element.data(DATA_FORCEDOPEN,false);if(!disableDelay){session.delayInProgress=true;session.closeDelayTimeout=setTimeout(function closeDelay(){session.closeDelayTimeout=null;tipController.hideTip(element);session.delayInProgress=false;myCloseDelay=null},options.closeDelay);myCloseDelay=session.closeDelayTimeout}else{tipController.hideTip(element)}}}function checkForIntent(){var xDifference=Math.abs(session.previousX-session.currentX),yDifference=Math.abs(session.previousY-session.currentY),totalDifference=xDifference+yDifference;if(totalDifference",{id:options.popupId});if($body.length===0){$body=$("body")}$body.append(tipElement);session.tooltips=session.tooltips?session.tooltips.add(tipElement):tipElement}if(options.followMouse){if(!tipElement.data(DATA_HASMOUSEMOVE)){$document.on("mousemove"+EVENT_NAMESPACE,positionTipOnCursor);$window.on("scroll"+EVENT_NAMESPACE,positionTipOnCursor);tipElement.data(DATA_HASMOUSEMOVE,true)}}function beginShowTip(element){element.data(DATA_HASACTIVEHOVER,true);tipElement.queue(function queueTipInit(next){showTip(element);next()})}function showTip(element){var tipContent;if(!element.data(DATA_HASACTIVEHOVER)){return}if(session.isTipOpen){if(!session.isClosing){hideTip(session.activeHover)}tipElement.delay(100).queue(function queueTipAgain(next){showTip(element);next()});return}element.trigger("powerTipPreRender");tipContent=getTooltipContent(element);if(tipContent){tipElement.empty().append(tipContent)}else{return}element.trigger("powerTipRender");session.activeHover=element;session.isTipOpen=true;tipElement.data(DATA_MOUSEONTOTIP,options.mouseOnToPopup);tipElement.addClass(options.popupClass);if(!options.followMouse||element.data(DATA_FORCEDOPEN)){positionTipOnElement(element);session.isFixedTipOpen=true}else{positionTipOnCursor()}if(!element.data(DATA_FORCEDOPEN)&&!options.followMouse){$document.on("click"+EVENT_NAMESPACE,function documentClick(event){var target=event.target;if(target!==element[0]){if(options.mouseOnToPopup){if(target!==tipElement[0]&&!$.contains(tipElement[0],target)){$.powerTip.hide()}}else{$.powerTip.hide()}}})}if(options.mouseOnToPopup&&!options.manual){tipElement.on("mouseenter"+EVENT_NAMESPACE,function tipMouseEnter(){if(session.activeHover){session.activeHover.data(DATA_DISPLAYCONTROLLER).cancel()}});tipElement.on("mouseleave"+EVENT_NAMESPACE,function tipMouseLeave(){if(session.activeHover){session.activeHover.data(DATA_DISPLAYCONTROLLER).hide()}})}tipElement.fadeIn(options.fadeInTime,function fadeInCallback(){if(!session.desyncTimeout){session.desyncTimeout=setInterval(closeDesyncedTip,500)}element.trigger("powerTipOpen")})}function hideTip(element){session.isClosing=true;session.isTipOpen=false;session.desyncTimeout=clearInterval(session.desyncTimeout);element.data(DATA_HASACTIVEHOVER,false);element.data(DATA_FORCEDOPEN,false);$document.off("click"+EVENT_NAMESPACE);tipElement.off(EVENT_NAMESPACE);tipElement.fadeOut(options.fadeOutTime,function fadeOutCallback(){var coords=new CSSCoordinates;session.activeHover=null;session.isClosing=false;session.isFixedTipOpen=false;tipElement.removeClass();coords.set("top",session.currentY+options.offset);coords.set("left",session.currentX+options.offset);tipElement.css(coords);element.trigger("powerTipClose")})}function positionTipOnCursor(){var tipWidth,tipHeight,coords,collisions,collisionCount;if(!session.isFixedTipOpen&&(session.isTipOpen||session.tipOpenImminent&&tipElement.data(DATA_HASMOUSEMOVE))){tipWidth=tipElement.outerWidth();tipHeight=tipElement.outerHeight();coords=new CSSCoordinates;coords.set("top",session.currentY+options.offset);coords.set("left",session.currentX+options.offset);collisions=getViewportCollisions(coords,tipWidth,tipHeight);if(collisions!==Collision.none){collisionCount=countFlags(collisions);if(collisionCount===1){if(collisions===Collision.right){coords.set("left",session.scrollLeft+session.windowWidth-tipWidth)}else if(collisions===Collision.bottom){coords.set("top",session.scrollTop+session.windowHeight-tipHeight)}}else{coords.set("left",session.currentX-tipWidth-options.offset);coords.set("top",session.currentY-tipHeight-options.offset)}}tipElement.css(coords)}}function positionTipOnElement(element){var priorityList,finalPlacement;if(options.smartPlacement||options.followMouse&&element.data(DATA_FORCEDOPEN)){priorityList=$.fn.powerTip.smartPlacementLists[options.placement];$.each(priorityList,function(idx,pos){var collisions=getViewportCollisions(placeTooltip(element,pos),tipElement.outerWidth(),tipElement.outerHeight());finalPlacement=pos;return collisions!==Collision.none})}else{placeTooltip(element,options.placement);finalPlacement=options.placement}tipElement.removeClass("w nw sw e ne se n s w se-alt sw-alt ne-alt nw-alt");tipElement.addClass(finalPlacement)}function placeTooltip(element,placement){var iterationCount=0,tipWidth,tipHeight,coords=new CSSCoordinates;coords.set("top",0);coords.set("left",0);tipElement.css(coords);do{tipWidth=tipElement.outerWidth();tipHeight=tipElement.outerHeight();coords=placementCalculator.compute(element,placement,tipWidth,tipHeight,options.offset);tipElement.css(coords)}while(++iterationCount<=5&&(tipWidth!==tipElement.outerWidth()||tipHeight!==tipElement.outerHeight()));return coords}function closeDesyncedTip(){var isDesynced=false,hasDesyncableCloseEvent=$.grep(["mouseleave","mouseout","blur","focusout"],function(eventType){return $.inArray(eventType,options.closeEvents)!==-1}).length>0;if(session.isTipOpen&&!session.isClosing&&!session.delayInProgress&&hasDesyncableCloseEvent){if(session.activeHover.data(DATA_HASACTIVEHOVER)===false||session.activeHover.is(":disabled")){isDesynced=true}else if(!isMouseOver(session.activeHover)&&!session.activeHover.is(":focus")&&!session.activeHover.data(DATA_FORCEDOPEN)){if(tipElement.data(DATA_MOUSEONTOTIP)){if(!isMouseOver(tipElement)){isDesynced=true}}else{isDesynced=true}}if(isDesynced){hideTip(session.activeHover)}}}this.showTip=beginShowTip;this.hideTip=hideTip;this.resetPosition=positionTipOnElement}function isSvgElement(element){return Boolean(window.SVGElement&&element[0]instanceof SVGElement)}function isMouseEvent(event){return Boolean(event&&$.inArray(event.type,MOUSE_EVENTS)>-1&&typeof event.pageX==="number")}function initTracking(){if(!session.mouseTrackingActive){session.mouseTrackingActive=true;getViewportDimensions();$(getViewportDimensions);$document.on("mousemove"+EVENT_NAMESPACE,trackMouse);$window.on("resize"+EVENT_NAMESPACE,trackResize);$window.on("scroll"+EVENT_NAMESPACE,trackScroll)}}function getViewportDimensions(){session.scrollLeft=$window.scrollLeft();session.scrollTop=$window.scrollTop();session.windowWidth=$window.width();session.windowHeight=$window.height()}function trackResize(){session.windowWidth=$window.width();session.windowHeight=$window.height()}function trackScroll(){var x=$window.scrollLeft(),y=$window.scrollTop();if(x!==session.scrollLeft){session.currentX+=x-session.scrollLeft;session.scrollLeft=x}if(y!==session.scrollTop){session.currentY+=y-session.scrollTop;session.scrollTop=y}}function trackMouse(event){session.currentX=event.pageX;session.currentY=event.pageY}function isMouseOver(element){var elementPosition=element.offset(),elementBox=element[0].getBoundingClientRect(),elementWidth=elementBox.right-elementBox.left,elementHeight=elementBox.bottom-elementBox.top;return session.currentX>=elementPosition.left&&session.currentX<=elementPosition.left+elementWidth&&session.currentY>=elementPosition.top&&session.currentY<=elementPosition.top+elementHeight}function getTooltipContent(element){var tipText=element.data(DATA_POWERTIP),tipObject=element.data(DATA_POWERTIPJQ),tipTarget=element.data(DATA_POWERTIPTARGET),targetElement,content;if(tipText){if($.isFunction(tipText)){tipText=tipText.call(element[0])}content=tipText}else if(tipObject){if($.isFunction(tipObject)){tipObject=tipObject.call(element[0])}if(tipObject.length>0){content=tipObject.clone(true,true)}}else if(tipTarget){targetElement=$("#"+tipTarget);if(targetElement.length>0){content=targetElement.html()}}return content}function getViewportCollisions(coords,elementWidth,elementHeight){var viewportTop=session.scrollTop,viewportLeft=session.scrollLeft,viewportBottom=viewportTop+session.windowHeight,viewportRight=viewportLeft+session.windowWidth,collisions=Collision.none;if(coords.topviewportBottom||Math.abs(coords.bottom-session.windowHeight)>viewportBottom){collisions|=Collision.bottom}if(coords.leftviewportRight){collisions|=Collision.left}if(coords.left+elementWidth>viewportRight||coords.right1)){a.preventDefault();var c=a.originalEvent.changedTouches[0],d=document.createEvent("MouseEvents");d.initMouseEvent(b,!0,!0,window,1,c.screenX,c.screenY,c.clientX,c.clientY,!1,!1,!1,!1,0,null),a.target.dispatchEvent(d)}}if(a.support.touch="ontouchend"in document,a.support.touch){var e,b=a.ui.mouse.prototype,c=b._mouseInit,d=b._mouseDestroy;b._touchStart=function(a){var b=this;!e&&b._mouseCapture(a.originalEvent.changedTouches[0])&&(e=!0,b._touchMoved=!1,f(a,"mouseover"),f(a,"mousemove"),f(a,"mousedown"))},b._touchMove=function(a){e&&(this._touchMoved=!0,f(a,"mousemove"))},b._touchEnd=function(a){e&&(f(a,"mouseup"),f(a,"mouseout"),this._touchMoved||f(a,"click"),e=!1)},b._mouseInit=function(){var b=this;b.element.bind({touchstart:a.proxy(b,"_touchStart"),touchmove:a.proxy(b,"_touchMove"),touchend:a.proxy(b,"_touchEnd")}),c.call(b)},b._mouseDestroy=function(){var b=this;b.element.unbind({touchstart:a.proxy(b,"_touchStart"),touchmove:a.proxy(b,"_touchMove"),touchend:a.proxy(b,"_touchEnd")}),d.call(b)}}}(jQuery);/*! SmartMenus jQuery Plugin - v1.1.0 - September 17, 2017 + * http://www.smartmenus.org/ + * Copyright Vasil Dinkov, Vadikom Web Ltd. http://vadikom.com; Licensed MIT */(function(t){"function"==typeof define&&define.amd?define(["jquery"],t):"object"==typeof module&&"object"==typeof module.exports?module.exports=t(require("jquery")):t(jQuery)})(function($){function initMouseDetection(t){var e=".smartmenus_mouse";if(mouseDetectionEnabled||t)mouseDetectionEnabled&&t&&($(document).off(e),mouseDetectionEnabled=!1);else{var i=!0,s=null,o={mousemove:function(t){var e={x:t.pageX,y:t.pageY,timeStamp:(new Date).getTime()};if(s){var o=Math.abs(s.x-e.x),a=Math.abs(s.y-e.y);if((o>0||a>0)&&2>=o&&2>=a&&300>=e.timeStamp-s.timeStamp&&(mouse=!0,i)){var n=$(t.target).closest("a");n.is("a")&&$.each(menuTrees,function(){return $.contains(this.$root[0],n[0])?(this.itemEnter({currentTarget:n[0]}),!1):void 0}),i=!1}}s=e}};o[touchEvents?"touchstart":"pointerover pointermove pointerout MSPointerOver MSPointerMove MSPointerOut"]=function(t){isTouchEvent(t.originalEvent)&&(mouse=!1)},$(document).on(getEventsNS(o,e)),mouseDetectionEnabled=!0}}function isTouchEvent(t){return!/^(4|mouse)$/.test(t.pointerType)}function getEventsNS(t,e){e||(e="");var i={};for(var s in t)i[s.split(" ").join(e+" ")+e]=t[s];return i}var menuTrees=[],mouse=!1,touchEvents="ontouchstart"in window,mouseDetectionEnabled=!1,requestAnimationFrame=window.requestAnimationFrame||function(t){return setTimeout(t,1e3/60)},cancelAnimationFrame=window.cancelAnimationFrame||function(t){clearTimeout(t)},canAnimate=!!$.fn.animate;return $.SmartMenus=function(t,e){this.$root=$(t),this.opts=e,this.rootId="",this.accessIdPrefix="",this.$subArrow=null,this.activatedItems=[],this.visibleSubMenus=[],this.showTimeout=0,this.hideTimeout=0,this.scrollTimeout=0,this.clickActivated=!1,this.focusActivated=!1,this.zIndexInc=0,this.idInc=0,this.$firstLink=null,this.$firstSub=null,this.disabled=!1,this.$disableOverlay=null,this.$touchScrollingSub=null,this.cssTransforms3d="perspective"in t.style||"webkitPerspective"in t.style,this.wasCollapsible=!1,this.init()},$.extend($.SmartMenus,{hideAll:function(){$.each(menuTrees,function(){this.menuHideAll()})},destroy:function(){for(;menuTrees.length;)menuTrees[0].destroy();initMouseDetection(!0)},prototype:{init:function(t){var e=this;if(!t){menuTrees.push(this),this.rootId=((new Date).getTime()+Math.random()+"").replace(/\D/g,""),this.accessIdPrefix="sm-"+this.rootId+"-",this.$root.hasClass("sm-rtl")&&(this.opts.rightToLeftSubMenus=!0);var i=".smartmenus";this.$root.data("smartmenus",this).attr("data-smartmenus-id",this.rootId).dataSM("level",1).on(getEventsNS({"mouseover focusin":$.proxy(this.rootOver,this),"mouseout focusout":$.proxy(this.rootOut,this),keydown:$.proxy(this.rootKeyDown,this)},i)).on(getEventsNS({mouseenter:$.proxy(this.itemEnter,this),mouseleave:$.proxy(this.itemLeave,this),mousedown:$.proxy(this.itemDown,this),focus:$.proxy(this.itemFocus,this),blur:$.proxy(this.itemBlur,this),click:$.proxy(this.itemClick,this)},i),"a"),i+=this.rootId,this.opts.hideOnClick&&$(document).on(getEventsNS({touchstart:$.proxy(this.docTouchStart,this),touchmove:$.proxy(this.docTouchMove,this),touchend:$.proxy(this.docTouchEnd,this),click:$.proxy(this.docClick,this)},i)),$(window).on(getEventsNS({"resize orientationchange":$.proxy(this.winResize,this)},i)),this.opts.subIndicators&&(this.$subArrow=$("").addClass("sub-arrow"),this.opts.subIndicatorsText&&this.$subArrow.html(this.opts.subIndicatorsText)),initMouseDetection()}if(this.$firstSub=this.$root.find("ul").each(function(){e.menuInit($(this))}).eq(0),this.$firstLink=this.$root.find("a").eq(0),this.opts.markCurrentItem){var s=/(index|default)\.[^#\?\/]*/i,o=/#.*/,a=window.location.href.replace(s,""),n=a.replace(o,"");this.$root.find("a").each(function(){var t=this.href.replace(s,""),i=$(this);(t==a||t==n)&&(i.addClass("current"),e.opts.markCurrentTree&&i.parentsUntil("[data-smartmenus-id]","ul").each(function(){$(this).dataSM("parent-a").addClass("current")}))})}this.wasCollapsible=this.isCollapsible()},destroy:function(t){if(!t){var e=".smartmenus";this.$root.removeData("smartmenus").removeAttr("data-smartmenus-id").removeDataSM("level").off(e),e+=this.rootId,$(document).off(e),$(window).off(e),this.opts.subIndicators&&(this.$subArrow=null)}this.menuHideAll();var i=this;this.$root.find("ul").each(function(){var t=$(this);t.dataSM("scroll-arrows")&&t.dataSM("scroll-arrows").remove(),t.dataSM("shown-before")&&((i.opts.subMenusMinWidth||i.opts.subMenusMaxWidth)&&t.css({width:"",minWidth:"",maxWidth:""}).removeClass("sm-nowrap"),t.dataSM("scroll-arrows")&&t.dataSM("scroll-arrows").remove(),t.css({zIndex:"",top:"",left:"",marginLeft:"",marginTop:"",display:""})),0==(t.attr("id")||"").indexOf(i.accessIdPrefix)&&t.removeAttr("id")}).removeDataSM("in-mega").removeDataSM("shown-before").removeDataSM("scroll-arrows").removeDataSM("parent-a").removeDataSM("level").removeDataSM("beforefirstshowfired").removeAttr("role").removeAttr("aria-hidden").removeAttr("aria-labelledby").removeAttr("aria-expanded"),this.$root.find("a.has-submenu").each(function(){var t=$(this);0==t.attr("id").indexOf(i.accessIdPrefix)&&t.removeAttr("id")}).removeClass("has-submenu").removeDataSM("sub").removeAttr("aria-haspopup").removeAttr("aria-controls").removeAttr("aria-expanded").closest("li").removeDataSM("sub"),this.opts.subIndicators&&this.$root.find("span.sub-arrow").remove(),this.opts.markCurrentItem&&this.$root.find("a.current").removeClass("current"),t||(this.$root=null,this.$firstLink=null,this.$firstSub=null,this.$disableOverlay&&(this.$disableOverlay.remove(),this.$disableOverlay=null),menuTrees.splice($.inArray(this,menuTrees),1))},disable:function(t){if(!this.disabled){if(this.menuHideAll(),!t&&!this.opts.isPopup&&this.$root.is(":visible")){var e=this.$root.offset();this.$disableOverlay=$('
').css({position:"absolute",top:e.top,left:e.left,width:this.$root.outerWidth(),height:this.$root.outerHeight(),zIndex:this.getStartZIndex(!0),opacity:0}).appendTo(document.body)}this.disabled=!0}},docClick:function(t){return this.$touchScrollingSub?(this.$touchScrollingSub=null,void 0):((this.visibleSubMenus.length&&!$.contains(this.$root[0],t.target)||$(t.target).closest("a").length)&&this.menuHideAll(),void 0)},docTouchEnd:function(){if(this.lastTouch){if(!(!this.visibleSubMenus.length||void 0!==this.lastTouch.x2&&this.lastTouch.x1!=this.lastTouch.x2||void 0!==this.lastTouch.y2&&this.lastTouch.y1!=this.lastTouch.y2||this.lastTouch.target&&$.contains(this.$root[0],this.lastTouch.target))){this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0);var t=this;this.hideTimeout=setTimeout(function(){t.menuHideAll()},350)}this.lastTouch=null}},docTouchMove:function(t){if(this.lastTouch){var e=t.originalEvent.touches[0];this.lastTouch.x2=e.pageX,this.lastTouch.y2=e.pageY}},docTouchStart:function(t){var e=t.originalEvent.touches[0];this.lastTouch={x1:e.pageX,y1:e.pageY,target:e.target}},enable:function(){this.disabled&&(this.$disableOverlay&&(this.$disableOverlay.remove(),this.$disableOverlay=null),this.disabled=!1)},getClosestMenu:function(t){for(var e=$(t).closest("ul");e.dataSM("in-mega");)e=e.parent().closest("ul");return e[0]||null},getHeight:function(t){return this.getOffset(t,!0)},getOffset:function(t,e){var i;"none"==t.css("display")&&(i={position:t[0].style.position,visibility:t[0].style.visibility},t.css({position:"absolute",visibility:"hidden"}).show());var s=t[0].getBoundingClientRect&&t[0].getBoundingClientRect(),o=s&&(e?s.height||s.bottom-s.top:s.width||s.right-s.left);return o||0===o||(o=e?t[0].offsetHeight:t[0].offsetWidth),i&&t.hide().css(i),o},getStartZIndex:function(t){var e=parseInt(this[t?"$root":"$firstSub"].css("z-index"));return!t&&isNaN(e)&&(e=parseInt(this.$root.css("z-index"))),isNaN(e)?1:e},getTouchPoint:function(t){return t.touches&&t.touches[0]||t.changedTouches&&t.changedTouches[0]||t},getViewport:function(t){var e=t?"Height":"Width",i=document.documentElement["client"+e],s=window["inner"+e];return s&&(i=Math.min(i,s)),i},getViewportHeight:function(){return this.getViewport(!0)},getViewportWidth:function(){return this.getViewport()},getWidth:function(t){return this.getOffset(t)},handleEvents:function(){return!this.disabled&&this.isCSSOn()},handleItemEvents:function(t){return this.handleEvents()&&!this.isLinkInMegaMenu(t)},isCollapsible:function(){return"static"==this.$firstSub.css("position")},isCSSOn:function(){return"inline"!=this.$firstLink.css("display")},isFixed:function(){var t="fixed"==this.$root.css("position");return t||this.$root.parentsUntil("body").each(function(){return"fixed"==$(this).css("position")?(t=!0,!1):void 0}),t},isLinkInMegaMenu:function(t){return $(this.getClosestMenu(t[0])).hasClass("mega-menu")},isTouchMode:function(){return!mouse||this.opts.noMouseOver||this.isCollapsible()},itemActivate:function(t,e){var i=t.closest("ul"),s=i.dataSM("level");if(s>1&&(!this.activatedItems[s-2]||this.activatedItems[s-2][0]!=i.dataSM("parent-a")[0])){var o=this;$(i.parentsUntil("[data-smartmenus-id]","ul").get().reverse()).add(i).each(function(){o.itemActivate($(this).dataSM("parent-a"))})}if((!this.isCollapsible()||e)&&this.menuHideSubMenus(this.activatedItems[s-1]&&this.activatedItems[s-1][0]==t[0]?s:s-1),this.activatedItems[s-1]=t,this.$root.triggerHandler("activate.smapi",t[0])!==!1){var a=t.dataSM("sub");a&&(this.isTouchMode()||!this.opts.showOnClick||this.clickActivated)&&this.menuShow(a)}},itemBlur:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&this.$root.triggerHandler("blur.smapi",e[0])},itemClick:function(t){var e=$(t.currentTarget);if(this.handleItemEvents(e)){if(this.$touchScrollingSub&&this.$touchScrollingSub[0]==e.closest("ul")[0])return this.$touchScrollingSub=null,t.stopPropagation(),!1;if(this.$root.triggerHandler("click.smapi",e[0])===!1)return!1;var i=$(t.target).is(".sub-arrow"),s=e.dataSM("sub"),o=s?2==s.dataSM("level"):!1,a=this.isCollapsible(),n=/toggle$/.test(this.opts.collapsibleBehavior),r=/link$/.test(this.opts.collapsibleBehavior),h=/^accordion/.test(this.opts.collapsibleBehavior);if(s&&!s.is(":visible")){if((!r||!a||i)&&(this.opts.showOnClick&&o&&(this.clickActivated=!0),this.itemActivate(e,h),s.is(":visible")))return this.focusActivated=!0,!1}else if(a&&(n||i))return this.itemActivate(e,h),this.menuHide(s),n&&(this.focusActivated=!1),!1;return this.opts.showOnClick&&o||e.hasClass("disabled")||this.$root.triggerHandler("select.smapi",e[0])===!1?!1:void 0}},itemDown:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&e.dataSM("mousedown",!0)},itemEnter:function(t){var e=$(t.currentTarget);if(this.handleItemEvents(e)){if(!this.isTouchMode()){this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0);var i=this;this.showTimeout=setTimeout(function(){i.itemActivate(e)},this.opts.showOnClick&&1==e.closest("ul").dataSM("level")?1:this.opts.showTimeout)}this.$root.triggerHandler("mouseenter.smapi",e[0])}},itemFocus:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&(!this.focusActivated||this.isTouchMode()&&e.dataSM("mousedown")||this.activatedItems.length&&this.activatedItems[this.activatedItems.length-1][0]==e[0]||this.itemActivate(e,!0),this.$root.triggerHandler("focus.smapi",e[0]))},itemLeave:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&(this.isTouchMode()||(e[0].blur(),this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0)),e.removeDataSM("mousedown"),this.$root.triggerHandler("mouseleave.smapi",e[0]))},menuHide:function(t){if(this.$root.triggerHandler("beforehide.smapi",t[0])!==!1&&(canAnimate&&t.stop(!0,!0),"none"!=t.css("display"))){var e=function(){t.css("z-index","")};this.isCollapsible()?canAnimate&&this.opts.collapsibleHideFunction?this.opts.collapsibleHideFunction.call(this,t,e):t.hide(this.opts.collapsibleHideDuration,e):canAnimate&&this.opts.hideFunction?this.opts.hideFunction.call(this,t,e):t.hide(this.opts.hideDuration,e),t.dataSM("scroll")&&(this.menuScrollStop(t),t.css({"touch-action":"","-ms-touch-action":"","-webkit-transform":"",transform:""}).off(".smartmenus_scroll").removeDataSM("scroll").dataSM("scroll-arrows").hide()),t.dataSM("parent-a").removeClass("highlighted").attr("aria-expanded","false"),t.attr({"aria-expanded":"false","aria-hidden":"true"});var i=t.dataSM("level");this.activatedItems.splice(i-1,1),this.visibleSubMenus.splice($.inArray(t,this.visibleSubMenus),1),this.$root.triggerHandler("hide.smapi",t[0])}},menuHideAll:function(){this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0);for(var t=this.opts.isPopup?1:0,e=this.visibleSubMenus.length-1;e>=t;e--)this.menuHide(this.visibleSubMenus[e]);this.opts.isPopup&&(canAnimate&&this.$root.stop(!0,!0),this.$root.is(":visible")&&(canAnimate&&this.opts.hideFunction?this.opts.hideFunction.call(this,this.$root):this.$root.hide(this.opts.hideDuration))),this.activatedItems=[],this.visibleSubMenus=[],this.clickActivated=!1,this.focusActivated=!1,this.zIndexInc=0,this.$root.triggerHandler("hideAll.smapi")},menuHideSubMenus:function(t){for(var e=this.activatedItems.length-1;e>=t;e--){var i=this.activatedItems[e].dataSM("sub");i&&this.menuHide(i)}},menuInit:function(t){if(!t.dataSM("in-mega")){t.hasClass("mega-menu")&&t.find("ul").dataSM("in-mega",!0);for(var e=2,i=t[0];(i=i.parentNode.parentNode)!=this.$root[0];)e++;var s=t.prevAll("a").eq(-1);s.length||(s=t.prevAll().find("a").eq(-1)),s.addClass("has-submenu").dataSM("sub",t),t.dataSM("parent-a",s).dataSM("level",e).parent().dataSM("sub",t);var o=s.attr("id")||this.accessIdPrefix+ ++this.idInc,a=t.attr("id")||this.accessIdPrefix+ ++this.idInc;s.attr({id:o,"aria-haspopup":"true","aria-controls":a,"aria-expanded":"false"}),t.attr({id:a,role:"group","aria-hidden":"true","aria-labelledby":o,"aria-expanded":"false"}),this.opts.subIndicators&&s[this.opts.subIndicatorsPos](this.$subArrow.clone())}},menuPosition:function(t){var e,i,s=t.dataSM("parent-a"),o=s.closest("li"),a=o.parent(),n=t.dataSM("level"),r=this.getWidth(t),h=this.getHeight(t),u=s.offset(),l=u.left,c=u.top,d=this.getWidth(s),m=this.getHeight(s),p=$(window),f=p.scrollLeft(),v=p.scrollTop(),b=this.getViewportWidth(),S=this.getViewportHeight(),g=a.parent().is("[data-sm-horizontal-sub]")||2==n&&!a.hasClass("sm-vertical"),M=this.opts.rightToLeftSubMenus&&!o.is("[data-sm-reverse]")||!this.opts.rightToLeftSubMenus&&o.is("[data-sm-reverse]"),w=2==n?this.opts.mainMenuSubOffsetX:this.opts.subMenusSubOffsetX,T=2==n?this.opts.mainMenuSubOffsetY:this.opts.subMenusSubOffsetY;if(g?(e=M?d-r-w:w,i=this.opts.bottomToTopSubMenus?-h-T:m+T):(e=M?w-r:d-w,i=this.opts.bottomToTopSubMenus?m-T-h:T),this.opts.keepInViewport){var y=l+e,I=c+i;if(M&&f>y?e=g?f-y+e:d-w:!M&&y+r>f+b&&(e=g?f+b-r-y+e:w-r),g||(S>h&&I+h>v+S?i+=v+S-h-I:(h>=S||v>I)&&(i+=v-I)),g&&(I+h>v+S+.49||v>I)||!g&&h>S+.49){var x=this;t.dataSM("scroll-arrows")||t.dataSM("scroll-arrows",$([$('')[0],$('')[0]]).on({mouseenter:function(){t.dataSM("scroll").up=$(this).hasClass("scroll-up"),x.menuScroll(t)},mouseleave:function(e){x.menuScrollStop(t),x.menuScrollOut(t,e)},"mousewheel DOMMouseScroll":function(t){t.preventDefault()}}).insertAfter(t));var A=".smartmenus_scroll";if(t.dataSM("scroll",{y:this.cssTransforms3d?0:i-m,step:1,itemH:m,subH:h,arrowDownH:this.getHeight(t.dataSM("scroll-arrows").eq(1))}).on(getEventsNS({mouseover:function(e){x.menuScrollOver(t,e)},mouseout:function(e){x.menuScrollOut(t,e)},"mousewheel DOMMouseScroll":function(e){x.menuScrollMousewheel(t,e)}},A)).dataSM("scroll-arrows").css({top:"auto",left:"0",marginLeft:e+(parseInt(t.css("border-left-width"))||0),width:r-(parseInt(t.css("border-left-width"))||0)-(parseInt(t.css("border-right-width"))||0),zIndex:t.css("z-index")}).eq(g&&this.opts.bottomToTopSubMenus?0:1).show(),this.isFixed()){var C={};C[touchEvents?"touchstart touchmove touchend":"pointerdown pointermove pointerup MSPointerDown MSPointerMove MSPointerUp"]=function(e){x.menuScrollTouch(t,e)},t.css({"touch-action":"none","-ms-touch-action":"none"}).on(getEventsNS(C,A))}}}t.css({top:"auto",left:"0",marginLeft:e,marginTop:i-m})},menuScroll:function(t,e,i){var s,o=t.dataSM("scroll"),a=t.dataSM("scroll-arrows"),n=o.up?o.upEnd:o.downEnd;if(!e&&o.momentum){if(o.momentum*=.92,s=o.momentum,.5>s)return this.menuScrollStop(t),void 0}else s=i||(e||!this.opts.scrollAccelerate?this.opts.scrollStep:Math.floor(o.step));var r=t.dataSM("level");if(this.activatedItems[r-1]&&this.activatedItems[r-1].dataSM("sub")&&this.activatedItems[r-1].dataSM("sub").is(":visible")&&this.menuHideSubMenus(r-1),o.y=o.up&&o.y>=n||!o.up&&n>=o.y?o.y:Math.abs(n-o.y)>s?o.y+(o.up?s:-s):n,t.css(this.cssTransforms3d?{"-webkit-transform":"translate3d(0, "+o.y+"px, 0)",transform:"translate3d(0, "+o.y+"px, 0)"}:{marginTop:o.y}),mouse&&(o.up&&o.y>o.downEnd||!o.up&&o.y0;t.dataSM("scroll-arrows").eq(i?0:1).is(":visible")&&(t.dataSM("scroll").up=i,this.menuScroll(t,!0))}e.preventDefault()},menuScrollOut:function(t,e){mouse&&(/^scroll-(up|down)/.test((e.relatedTarget||"").className)||(t[0]==e.relatedTarget||$.contains(t[0],e.relatedTarget))&&this.getClosestMenu(e.relatedTarget)==t[0]||t.dataSM("scroll-arrows").css("visibility","hidden"))},menuScrollOver:function(t,e){if(mouse&&!/^scroll-(up|down)/.test(e.target.className)&&this.getClosestMenu(e.target)==t[0]){this.menuScrollRefreshData(t);var i=t.dataSM("scroll"),s=$(window).scrollTop()-t.dataSM("parent-a").offset().top-i.itemH;t.dataSM("scroll-arrows").eq(0).css("margin-top",s).end().eq(1).css("margin-top",s+this.getViewportHeight()-i.arrowDownH).end().css("visibility","visible")}},menuScrollRefreshData:function(t){var e=t.dataSM("scroll"),i=$(window).scrollTop()-t.dataSM("parent-a").offset().top-e.itemH;this.cssTransforms3d&&(i=-(parseFloat(t.css("margin-top"))-i)),$.extend(e,{upEnd:i,downEnd:i+this.getViewportHeight()-e.subH})},menuScrollStop:function(t){return this.scrollTimeout?(cancelAnimationFrame(this.scrollTimeout),this.scrollTimeout=0,t.dataSM("scroll").step=1,!0):void 0},menuScrollTouch:function(t,e){if(e=e.originalEvent,isTouchEvent(e)){var i=this.getTouchPoint(e);if(this.getClosestMenu(i.target)==t[0]){var s=t.dataSM("scroll");if(/(start|down)$/i.test(e.type))this.menuScrollStop(t)?(e.preventDefault(),this.$touchScrollingSub=t):this.$touchScrollingSub=null,this.menuScrollRefreshData(t),$.extend(s,{touchStartY:i.pageY,touchStartTime:e.timeStamp});else if(/move$/i.test(e.type)){var o=void 0!==s.touchY?s.touchY:s.touchStartY;if(void 0!==o&&o!=i.pageY){this.$touchScrollingSub=t;var a=i.pageY>o;void 0!==s.up&&s.up!=a&&$.extend(s,{touchStartY:i.pageY,touchStartTime:e.timeStamp}),$.extend(s,{up:a,touchY:i.pageY}),this.menuScroll(t,!0,Math.abs(i.pageY-o))}e.preventDefault()}else void 0!==s.touchY&&((s.momentum=15*Math.pow(Math.abs(i.pageY-s.touchStartY)/(e.timeStamp-s.touchStartTime),2))&&(this.menuScrollStop(t),this.menuScroll(t),e.preventDefault()),delete s.touchY)}}},menuShow:function(t){if((t.dataSM("beforefirstshowfired")||(t.dataSM("beforefirstshowfired",!0),this.$root.triggerHandler("beforefirstshow.smapi",t[0])!==!1))&&this.$root.triggerHandler("beforeshow.smapi",t[0])!==!1&&(t.dataSM("shown-before",!0),canAnimate&&t.stop(!0,!0),!t.is(":visible"))){var e=t.dataSM("parent-a"),i=this.isCollapsible();if((this.opts.keepHighlighted||i)&&e.addClass("highlighted"),i)t.removeClass("sm-nowrap").css({zIndex:"",width:"auto",minWidth:"",maxWidth:"",top:"",left:"",marginLeft:"",marginTop:""});else{if(t.css("z-index",this.zIndexInc=(this.zIndexInc||this.getStartZIndex())+1),(this.opts.subMenusMinWidth||this.opts.subMenusMaxWidth)&&(t.css({width:"auto",minWidth:"",maxWidth:""}).addClass("sm-nowrap"),this.opts.subMenusMinWidth&&t.css("min-width",this.opts.subMenusMinWidth),this.opts.subMenusMaxWidth)){var s=this.getWidth(t);t.css("max-width",this.opts.subMenusMaxWidth),s>this.getWidth(t)&&t.removeClass("sm-nowrap").css("width",this.opts.subMenusMaxWidth)}this.menuPosition(t)}var o=function(){t.css("overflow","")};i?canAnimate&&this.opts.collapsibleShowFunction?this.opts.collapsibleShowFunction.call(this,t,o):t.show(this.opts.collapsibleShowDuration,o):canAnimate&&this.opts.showFunction?this.opts.showFunction.call(this,t,o):t.show(this.opts.showDuration,o),e.attr("aria-expanded","true"),t.attr({"aria-expanded":"true","aria-hidden":"false"}),this.visibleSubMenus.push(t),this.$root.triggerHandler("show.smapi",t[0])}},popupHide:function(t){this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0);var e=this;this.hideTimeout=setTimeout(function(){e.menuHideAll()},t?1:this.opts.hideTimeout)},popupShow:function(t,e){if(!this.opts.isPopup)return alert('SmartMenus jQuery Error:\n\nIf you want to show this menu via the "popupShow" method, set the isPopup:true option.'),void 0;if(this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0),this.$root.dataSM("shown-before",!0),canAnimate&&this.$root.stop(!0,!0),!this.$root.is(":visible")){this.$root.css({left:t,top:e});var i=this,s=function(){i.$root.css("overflow","")};canAnimate&&this.opts.showFunction?this.opts.showFunction.call(this,this.$root,s):this.$root.show(this.opts.showDuration,s),this.visibleSubMenus[0]=this.$root}},refresh:function(){this.destroy(!0),this.init(!0)},rootKeyDown:function(t){if(this.handleEvents())switch(t.keyCode){case 27:var e=this.activatedItems[0];if(e){this.menuHideAll(),e[0].focus();var i=e.dataSM("sub");i&&this.menuHide(i)}break;case 32:var s=$(t.target);if(s.is("a")&&this.handleItemEvents(s)){var i=s.dataSM("sub");i&&!i.is(":visible")&&(this.itemClick({currentTarget:t.target}),t.preventDefault())}}},rootOut:function(t){if(this.handleEvents()&&!this.isTouchMode()&&t.target!=this.$root[0]&&(this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0),!this.opts.showOnClick||!this.opts.hideOnClick)){var e=this;this.hideTimeout=setTimeout(function(){e.menuHideAll()},this.opts.hideTimeout)}},rootOver:function(t){this.handleEvents()&&!this.isTouchMode()&&t.target!=this.$root[0]&&this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0)},winResize:function(t){if(this.handleEvents()){if(!("onorientationchange"in window)||"orientationchange"==t.type){var e=this.isCollapsible();this.wasCollapsible&&e||(this.activatedItems.length&&this.activatedItems[this.activatedItems.length-1][0].blur(),this.menuHideAll()),this.wasCollapsible=e}}else if(this.$disableOverlay){var i=this.$root.offset();this.$disableOverlay.css({top:i.top,left:i.left,width:this.$root.outerWidth(),height:this.$root.outerHeight()})}}}}),$.fn.dataSM=function(t,e){return e?this.data(t+"_smartmenus",e):this.data(t+"_smartmenus")},$.fn.removeDataSM=function(t){return this.removeData(t+"_smartmenus")},$.fn.smartmenus=function(options){if("string"==typeof options){var args=arguments,method=options;return Array.prototype.shift.call(args),this.each(function(){var t=$(this).data("smartmenus");t&&t[method]&&t[method].apply(t,args)})}return this.each(function(){var dataOpts=$(this).data("sm-options")||null;if(dataOpts)try{dataOpts=eval("("+dataOpts+")")}catch(e){dataOpts=null,alert('ERROR\n\nSmartMenus jQuery init:\nInvalid "data-sm-options" attribute value syntax.')}new $.SmartMenus(this,$.extend({},$.fn.smartmenus.defaults,options,dataOpts))})},$.fn.smartmenus.defaults={isPopup:!1,mainMenuSubOffsetX:0,mainMenuSubOffsetY:0,subMenusSubOffsetX:0,subMenusSubOffsetY:0,subMenusMinWidth:"10em",subMenusMaxWidth:"20em",subIndicators:!0,subIndicatorsPos:"append",subIndicatorsText:"",scrollStep:30,scrollAccelerate:!0,showTimeout:250,hideTimeout:500,showDuration:0,showFunction:null,hideDuration:0,hideFunction:function(t,e){t.fadeOut(200,e)},collapsibleShowDuration:0,collapsibleShowFunction:function(t,e){t.slideDown(200,e)},collapsibleHideDuration:0,collapsibleHideFunction:function(t,e){t.slideUp(200,e)},showOnClick:!1,hideOnClick:!0,noMouseOver:!1,keepInViewport:!0,keepHighlighted:!0,markCurrentItem:!1,markCurrentTree:!0,rightToLeftSubMenus:!1,bottomToTopSubMenus:!1,collapsibleBehavior:"default"},$}); \ No newline at end of file diff --git a/Doxygen/0.94/menu.js b/Doxygen/0.94/menu.js new file mode 100644 index 0000000..433c15b --- /dev/null +++ b/Doxygen/0.94/menu.js @@ -0,0 +1,50 @@ +/* + @licstart The following is the entire license notice for the + JavaScript code in this file. + + Copyright (C) 1997-2017 by Dimitri van Heesch + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License along + with this program; if not, write to the Free Software Foundation, Inc., + 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. + + @licend The above is the entire license notice + for the JavaScript code in this file + */ +function initMenu(relPath,searchEnabled,serverSide,searchPage,search) { + function makeTree(data,relPath) { + var result=''; + if ('children' in data) { + result+=''; + } + return result; + } + + $('#main-nav').append(makeTree(menudata,relPath)); + $('#main-nav').children(':first').addClass('sm sm-dox').attr('id','main-menu'); + if (searchEnabled) { + if (serverSide) { + $('#main-menu').append('
    • '); + } else { + $('#main-menu').append('
    • '); + } + } + $('#main-menu').smartmenus(); +} +/* @license-end */ diff --git a/Doxygen/0.94/menudata.js b/Doxygen/0.94/menudata.js new file mode 100644 index 0000000..da30bc5 --- /dev/null +++ b/Doxygen/0.94/menudata.js @@ -0,0 +1,164 @@ +/* +@licstart The following is the entire license notice for the +JavaScript code in this file. + +Copyright (C) 1997-2019 by Dimitri van Heesch + +This program is free software; you can redistribute it and/or modify +it under the terms of version 2 of the GNU General Public License as published by +the Free Software Foundation + +This program is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +GNU General Public License for more details. + +You should have received a copy of the GNU General Public License along +with this program; if not, write to the Free Software Foundation, Inc., +51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. + +@licend The above is the entire license notice +for the JavaScript code in this file +*/ +var menudata={children:[ +{text:"Main Page",url:"index.html"}, +{text:"Classes",url:"annotated.html",children:[ +{text:"Class List",url:"annotated.html"}, +{text:"Class Index",url:"classes.html"}, +{text:"Class Hierarchy",url:"inherits.html"}, +{text:"Class Members",url:"functions.html",children:[ +{text:"All",url:"functions.html",children:[ +{text:"a",url:"functions.html#index_a"}, +{text:"b",url:"functions_b.html#index_b"}, +{text:"c",url:"functions_c.html#index_c"}, +{text:"d",url:"functions_d.html#index_d"}, +{text:"e",url:"functions_e.html#index_e"}, +{text:"f",url:"functions_f.html#index_f"}, +{text:"g",url:"functions_g.html#index_g"}, +{text:"h",url:"functions_h.html#index_h"}, +{text:"i",url:"functions_i.html#index_i"}, +{text:"l",url:"functions_l.html#index_l"}, +{text:"m",url:"functions_m.html#index_m"}, +{text:"n",url:"functions_n.html#index_n"}, +{text:"o",url:"functions_o.html#index_o"}, +{text:"p",url:"functions_p.html#index_p"}, +{text:"q",url:"functions_q.html#index_q"}, +{text:"r",url:"functions_r.html#index_r"}, +{text:"s",url:"functions_s.html#index_s"}, +{text:"t",url:"functions_t.html#index_t"}, +{text:"u",url:"functions_u.html#index_u"}, +{text:"v",url:"functions_v.html#index_v"}, +{text:"w",url:"functions_w.html#index_w"}, +{text:"~",url:"functions_~.html#index__7E"}]}, +{text:"Functions",url:"functions_func.html",children:[ +{text:"a",url:"functions_func.html#index_a"}, +{text:"b",url:"functions_func_b.html#index_b"}, +{text:"c",url:"functions_func_c.html#index_c"}, +{text:"d",url:"functions_func_d.html#index_d"}, +{text:"e",url:"functions_func_e.html#index_e"}, +{text:"f",url:"functions_func_f.html#index_f"}, +{text:"g",url:"functions_func_g.html#index_g"}, +{text:"h",url:"functions_func_h.html#index_h"}, +{text:"i",url:"functions_func_i.html#index_i"}, +{text:"m",url:"functions_func_m.html#index_m"}, +{text:"n",url:"functions_func_n.html#index_n"}, +{text:"o",url:"functions_func_o.html#index_o"}, +{text:"p",url:"functions_func_p.html#index_p"}, +{text:"r",url:"functions_func_r.html#index_r"}, +{text:"s",url:"functions_func_s.html#index_s"}, +{text:"t",url:"functions_func_t.html#index_t"}, +{text:"u",url:"functions_func_u.html#index_u"}, +{text:"v",url:"functions_func_v.html#index_v"}, +{text:"w",url:"functions_func_w.html#index_w"}, +{text:"~",url:"functions_func_~.html#index__7E"}]}, +{text:"Variables",url:"functions_vars.html",children:[ +{text:"a",url:"functions_vars.html#index_a"}, +{text:"b",url:"functions_vars_b.html#index_b"}, +{text:"c",url:"functions_vars_c.html#index_c"}, +{text:"d",url:"functions_vars_d.html#index_d"}, +{text:"e",url:"functions_vars_e.html#index_e"}, +{text:"f",url:"functions_vars_f.html#index_f"}, +{text:"g",url:"functions_vars_g.html#index_g"}, +{text:"h",url:"functions_vars_h.html#index_h"}, +{text:"i",url:"functions_vars_i.html#index_i"}, +{text:"l",url:"functions_vars_l.html#index_l"}, +{text:"m",url:"functions_vars_m.html#index_m"}, +{text:"n",url:"functions_vars_n.html#index_n"}, +{text:"o",url:"functions_vars_o.html#index_o"}, +{text:"p",url:"functions_vars_p.html#index_p"}, +{text:"r",url:"functions_vars_r.html#index_r"}, +{text:"s",url:"functions_vars_s.html#index_s"}, +{text:"t",url:"functions_vars_t.html#index_t"}, +{text:"u",url:"functions_vars_u.html#index_u"}, +{text:"v",url:"functions_vars_v.html#index_v"}, +{text:"w",url:"functions_vars_w.html#index_w"}]}, +{text:"Enumerations",url:"functions_enum.html"}, +{text:"Enumerator",url:"functions_eval.html",children:[ +{text:"b",url:"functions_eval.html#index_b"}, +{text:"c",url:"functions_eval.html#index_c"}, +{text:"d",url:"functions_eval.html#index_d"}, +{text:"e",url:"functions_eval.html#index_e"}, +{text:"g",url:"functions_eval.html#index_g"}, +{text:"h",url:"functions_eval.html#index_h"}, +{text:"i",url:"functions_eval.html#index_i"}, +{text:"l",url:"functions_eval.html#index_l"}, +{text:"m",url:"functions_eval.html#index_m"}, +{text:"n",url:"functions_eval.html#index_n"}, +{text:"o",url:"functions_eval.html#index_o"}, +{text:"p",url:"functions_eval.html#index_p"}, +{text:"q",url:"functions_eval.html#index_q"}, +{text:"s",url:"functions_eval.html#index_s"}, +{text:"t",url:"functions_eval.html#index_t"}, +{text:"v",url:"functions_eval.html#index_v"}, +{text:"w",url:"functions_eval.html#index_w"}]}, +{text:"Related Functions",url:"functions_rela.html"}]}]}, +{text:"Files",url:"files.html",children:[ +{text:"File List",url:"files.html"}, +{text:"File Members",url:"globals.html",children:[ +{text:"All",url:"globals.html",children:[ +{text:"_",url:"globals.html#index__5F"}, +{text:"a",url:"globals_a.html#index_a"}, +{text:"b",url:"globals_b.html#index_b"}, +{text:"c",url:"globals_c.html#index_c"}, +{text:"d",url:"globals_d.html#index_d"}, +{text:"e",url:"globals_e.html#index_e"}, +{text:"f",url:"globals_f.html#index_f"}, +{text:"g",url:"globals_g.html#index_g"}, +{text:"h",url:"globals_h.html#index_h"}, +{text:"i",url:"globals_i.html#index_i"}, +{text:"k",url:"globals_k.html#index_k"}, +{text:"l",url:"globals_l.html#index_l"}, +{text:"m",url:"globals_m.html#index_m"}, +{text:"n",url:"globals_n.html#index_n"}, +{text:"o",url:"globals_o.html#index_o"}, +{text:"p",url:"globals_p.html#index_p"}, +{text:"r",url:"globals_r.html#index_r"}, +{text:"s",url:"globals_s.html#index_s"}, +{text:"t",url:"globals_t.html#index_t"}, +{text:"v",url:"globals_v.html#index_v"}]}, +{text:"Functions",url:"globals_func.html"}, +{text:"Typedefs",url:"globals_type.html"}, +{text:"Enumerations",url:"globals_enum.html"}, +{text:"Enumerator",url:"globals_eval.html",children:[ +{text:"b",url:"globals_eval.html#index_b"}]}, +{text:"Macros",url:"globals_defs.html",children:[ +{text:"_",url:"globals_defs.html#index__5F"}, +{text:"a",url:"globals_defs.html#index_a"}, +{text:"b",url:"globals_defs.html#index_b"}, +{text:"c",url:"globals_defs.html#index_c"}, +{text:"d",url:"globals_defs.html#index_d"}, +{text:"e",url:"globals_defs.html#index_e"}, +{text:"f",url:"globals_defs.html#index_f"}, +{text:"g",url:"globals_defs.html#index_g"}, +{text:"h",url:"globals_defs.html#index_h"}, +{text:"i",url:"globals_defs.html#index_i"}, +{text:"k",url:"globals_defs.html#index_k"}, +{text:"l",url:"globals_defs.html#index_l"}, +{text:"m",url:"globals_defs.html#index_m"}, +{text:"n",url:"globals_defs.html#index_n"}, +{text:"o",url:"globals_defs.html#index_o"}, +{text:"p",url:"globals_defs.html#index_p"}, +{text:"r",url:"globals_defs.html#index_r"}, +{text:"s",url:"globals_defs.html#index_s"}, +{text:"t",url:"globals_defs.html#index_t"}, +{text:"v",url:"globals_defs.html#index_v"}]}]}]}]} diff --git a/Doxygen/0.94/nav_f.png b/Doxygen/0.94/nav_f.png new file mode 100644 index 0000000..72a58a5 Binary files /dev/null and b/Doxygen/0.94/nav_f.png differ diff --git a/Doxygen/0.94/nav_g.png b/Doxygen/0.94/nav_g.png new file mode 100644 index 0000000..2093a23 Binary files /dev/null and b/Doxygen/0.94/nav_g.png differ diff --git a/Doxygen/0.94/nav_h.png b/Doxygen/0.94/nav_h.png new file mode 100644 index 0000000..33389b1 Binary files /dev/null and b/Doxygen/0.94/nav_h.png differ diff --git a/Doxygen/0.94/open.png b/Doxygen/0.94/open.png new file mode 100644 index 0000000..30f75c7 Binary files /dev/null and b/Doxygen/0.94/open.png differ diff --git a/Doxygen/0.94/search/all_0.html b/Doxygen/0.94/search/all_0.html new file mode 100644 index 0000000..26dd244 --- /dev/null +++ b/Doxygen/0.94/search/all_0.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_0.js b/Doxygen/0.94/search/all_0.js new file mode 100644 index 0000000..9c68623 --- /dev/null +++ b/Doxygen/0.94/search/all_0.js @@ -0,0 +1,14 @@ +var searchData= +[ + ['_5fatt_0',['_ATT',['../VrpConstants_8h.html#a17f28de590722ee5fe0e80c0476e5a1a',1,'VrpConstants.h']]], + ['_5fceil_5f2d_1',['_CEIL_2D',['../VrpConstants_8h.html#a8ea93f62f824c258d5b19be991f6a01d',1,'VrpConstants.h']]], + ['_5feuc_5f2d_2',['_EUC_2D',['../VrpConstants_8h.html#ace67206831a8a8f7be0657e4a186ef08',1,'VrpConstants.h']]], + ['_5feuc_5f3d_3',['_EUC_3D',['../VrpConstants_8h.html#aa3f3882e7ed6d35a790827fbbdf4e4dc',1,'VrpConstants.h']]], + ['_5fexplicit_4',['_EXPLICIT',['../VrpConstants_8h.html#a70517d5166901cf0e71cbb2ac60551f3',1,'VrpConstants.h']]], + ['_5fgeo_5',['_GEO',['../VrpConstants_8h.html#a66aa6d999584bd77c60f983d132a0bb2',1,'VrpConstants.h']]], + ['_5fman_5f2d_6',['_MAN_2D',['../VrpConstants_8h.html#a8798d9626475ccc6055aadf6763c6ef8',1,'VrpConstants.h']]], + ['_5fman_5f3d_7',['_MAN_3D',['../VrpConstants_8h.html#a063f0e75f1d62b5b7dd5222d8712ab9c',1,'VrpConstants.h']]], + ['_5fmax_5f2d_8',['_MAX_2D',['../VrpConstants_8h.html#aeca2142012f5e10264298e2fadd5ce33',1,'VrpConstants.h']]], + ['_5fmax_5f3d_9',['_MAX_3D',['../VrpConstants_8h.html#a3fe53d9f5b18c305d2ed8ef43eddcde0',1,'VrpConstants.h']]], + ['_5fnode_10',['_NODE',['../struct__NODE.html',1,'_NODE'],['../VrpCommonTypes_8h.html#a8d7378456dff30f651f0c7453623e90f',1,'_node(): VrpCommonTypes.h']]] +]; diff --git a/Doxygen/0.94/search/all_1.html b/Doxygen/0.94/search/all_1.html new file mode 100644 index 0000000..8eb215b --- /dev/null +++ b/Doxygen/0.94/search/all_1.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_1.js b/Doxygen/0.94/search/all_1.js new file mode 100644 index 0000000..25a9118 --- /dev/null +++ b/Doxygen/0.94/search/all_1.js @@ -0,0 +1,30 @@ +var searchData= +[ + ['active_5fnode_5flist_5fblock_5fsize_11',['ACTIVE_NODE_LIST_BLOCK_SIZE',['../VrpConstants_8h.html#af59c49262d0a771e45e4f9ef2239fa28',1,'VrpConstants.h']]], + ['activenode_5f_12',['activeNode_',['../classBlisModel.html#ade2ba7da0c681234b67a6499c1c3e0fc',1,'BlisModel']]], + ['addcalls_13',['addCalls',['../classBlisConGenerator.html#ae1f8453204bc9158e6d759ae2282a989',1,'BlisConGenerator::addCalls()'],['../classBlisHeuristic.html#a2066e9e5850b36d939a273ccacd3f1b2',1,'BlisHeuristic::addCalls()']]], + ['addcutgenerator_14',['addCutGenerator',['../classBlisModel.html#af8149e8ddc9b0998b18e563905da4cbc',1,'BlisModel::addCutGenerator(BlisConGenerator *generator)'],['../classBlisModel.html#a5faa6c0b1c98b6c9a430b91f09b3758b',1,'BlisModel::addCutGenerator(CglCutGenerator *generator, const char *name=NULL, BlisCutStrategy strategy=BlisCutStrategyAuto, int cutGenerationFrequency=1, bool normal=true, bool atSolution=false, bool whenInfeasible=false)']]], + ['addfeaschecktime_15',['addFeasCheckTime',['../classBlisModel.html#abbd973e26fb65e0737949f2bd2f6158b',1,'BlisModel']]], + ['addheuristic_16',['addHeuristic',['../classBlisModel.html#acda80b8343f331523b8772540194a781',1,'BlisModel']]], + ['addnoconscalls_17',['addNoConsCalls',['../classBlisConGenerator.html#a36f578c586f09e841a76aea124b2de49',1,'BlisConGenerator']]], + ['addnosolcalls_18',['addNoSolCalls',['../classBlisHeuristic.html#a786bb8ed70e70ec1d7e12280980eea88',1,'BlisHeuristic']]], + ['addnumconsgenerated_19',['addNumConsGenerated',['../classBlisConGenerator.html#a8b801d64c5b7a16780c30be5167af5e8',1,'BlisConGenerator']]], + ['addnumconsused_20',['addNumConsUsed',['../classBlisConGenerator.html#a5d01f5563397c6699ae631d86150881a',1,'BlisConGenerator']]], + ['addnumiterations_21',['addNumIterations',['../classBlisModel.html#a592208cb46b4c3a09dcd4b3046a95ca5',1,'BlisModel']]], + ['addnumnodes_22',['addNumNodes',['../classBlisModel.html#aed2d4d613490555434cfafb97917f7e6',1,'BlisModel']]], + ['addnumsolutions_23',['addNumSolutions',['../classBlisHeuristic.html#adff9c21859ffcf1c64eb2f588e244ca9',1,'BlisHeuristic']]], + ['addnumstrong_24',['addNumStrong',['../classBlisModel.html#a456373f200a2a1526bd2a5bba5acf2e4',1,'BlisModel']]], + ['addobjects_25',['addObjects',['../classBlisModel.html#a3177b18aed4cd51d2df87e9de6359454',1,'BlisModel']]], + ['addtime_26',['addTime',['../classBlisConGenerator.html#a27424f19de1b26837d4f4b9a140da668',1,'BlisConGenerator::addTime()'],['../classBlisHeuristic.html#a9c0da80d253907e06072bb9a8b53b3ed',1,'BlisHeuristic::addTime()']]], + ['addtobranchingset_27',['addToBranchingSet',['../classBlisBranchObjectBilevel.html#aa930cb39edf1294f3dc59857cbfc35bb',1,'BlisBranchObjectBilevel']]], + ['addvrpcut_28',['addVrpCut',['../classVrpCutGenerator.html#ac99d45901c04b2ec289377c88bd556a5',1,'VrpCutGenerator']]], + ['adjlist_5f_29',['adjList_',['../classVrpHeurTSP.html#a9d161f05588fc965ea2fdff649794f4c',1,'VrpHeurTSP::adjList_()'],['../classVrpNetwork.html#a8be247b3d20943ea379523088f3a4a98',1,'VrpNetwork::adjList_()']]], + ['algorithm_30',['algorithm',['../structBEST__TOURS.html#a00d08dc9db7f2e3299e74d0d70b3a5ab',1,'BEST_TOURS']]], + ['all_5ftsp_5fcuts_31',['ALL_TSP_CUTS',['../VrpConstants_8h.html#a7a78075b44637c73356f5156dfdbcdc7',1,'VrpConstants.h']]], + ['allocated_5fedgenum_32',['allocated_edgenum',['../structSMALL__GRAPH.html#a695d3da55d071f69d7b041a449e3e241',1,'SMALL_GRAPH']]], + ['analyzeobjective_33',['analyzeObjective',['../classBlisModel.html#a2fa9cbfb5bfbc55231bfb92d1765592e',1,'BlisModel']]], + ['applyconstraints_34',['applyConstraints',['../classBlisTreeNode.html#abd9492f73a2ece055601448b317bb9ad',1,'BlisTreeNode']]], + ['atsolution_35',['atSolution',['../classBlisConGenerator.html#ac18b5aabe418441cafef0046a42f7f41',1,'BlisConGenerator']]], + ['atsolution_5f_36',['atSolution_',['../classBlisConGenerator.html#a67bd218c7290aca555d0b2c4634b1a39',1,'BlisConGenerator']]], + ['aveiterations_5f_37',['aveIterations_',['../classBlisModel.html#ad5705638120dc7c9083d97bda2fd67d3',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/all_10.html b/Doxygen/0.94/search/all_10.html new file mode 100644 index 0000000..6fd3a4a --- /dev/null +++ b/Doxygen/0.94/search/all_10.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_10.js b/Doxygen/0.94/search/all_10.js new file mode 100644 index 0000000..0df289e --- /dev/null +++ b/Doxygen/0.94/search/all_10.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['quickcutpass_613',['quickCutPass',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39baece0c48f6774eeff3c84422533f6d1b4',1,'BlisParams']]] +]; diff --git a/Doxygen/0.94/search/all_11.html b/Doxygen/0.94/search/all_11.html new file mode 100644 index 0000000..f78343b --- /dev/null +++ b/Doxygen/0.94/search/all_11.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_11.js b/Doxygen/0.94/search/all_11.js new file mode 100644 index 0000000..4c258f8 --- /dev/null +++ b/Doxygen/0.94/search/all_11.js @@ -0,0 +1,28 @@ +var searchData= +[ + ['rampupbranchstrategy_614',['rampUpBranchStrategy',['../classBlisModel.html#ad757abe619510e73644cca4883902098',1,'BlisModel']]], + ['rampupbranchstrategy_5f_615',['rampUpBranchStrategy_',['../classBlisModel.html#a8b3fe24d68d9060116f210acc728bf75',1,'BlisModel']]], + ['random_616',['RANDOM',['../VrpMacros_8h.html#a69f1bba01cab6b4ca24a6f755e9a1980',1,'VrpMacros.h']]], + ['readinstance_617',['readInstance',['../classVrpModel.html#aa2758857bb1cd1a22efb59ef0fb86be0',1,'VrpModel::readInstance()'],['../classBlisModel.html#afbbdd6fec7d5527b6fd490f3f14fb0c8',1,'BlisModel::readInstance()']]], + ['readparameters_618',['readParameters',['../classVrpModel.html#a3b138bc3784e34f2618f68285339388e',1,'VrpModel::readParameters()'],['../classBlisModel.html#a9a13000fefc222e94b9d6cd52e188b48',1,'BlisModel::readParameters()']]], + ['reduce_5fgraph_619',['reduce_graph',['../classVrpNetwork.html#a3f11fbc6f3c6867750b24b785149d1c4',1,'VrpNetwork']]], + ['reducedcostfix_620',['reducedCostFix',['../classBlisTreeNode.html#a6c561cad9f54569f55b3785232270da4',1,'BlisTreeNode']]], + ['ref_5f_621',['ref_',['../classVrpCutGenerator.html#a09886849586d19a5c110493fca7f0abc',1,'VrpCutGenerator']]], + ['refreshmodel_622',['refreshModel',['../classBlisConGenerator.html#ab84a390b52712250f48f2a57004db32c',1,'BlisConGenerator']]], + ['registerknowledge_623',['registerKnowledge',['../classVrpModel.html#a29a9c520ad865b8b47bdd1179e8c0ce5',1,'VrpModel::registerKnowledge()'],['../classBlisModel.html#a47d8386226bb183019f2de76a3a1c3f3',1,'BlisModel::registerKnowledge()']]], + ['relibility_5f_624',['relibility_',['../classBlisBranchStrategyPseudo.html#aeed2feec856b41e391329d0a4de91d7e',1,'BlisBranchStrategyPseudo::relibility_()'],['../classBlisBranchStrategyRel.html#ae6e9ed798426322a4794b91d8dc539a1',1,'BlisBranchStrategyRel::relibility_()']]], + ['remaining_5fedges_625',['REMAINING_EDGES',['../VrpConstants_8h.html#a26b771dda140bc6f5ab2f9ffd1c2f770',1,'VrpConstants.h']]], + ['resetbounds_626',['resetBounds',['../classBlisObjectInt.html#ae09216d6f8f7749c94027156fc2caf17',1,'BlisObjectInt']]], + ['resolve_627',['resolve',['../classBlisModel.html#ab56b56c9ea8f3a8c52f45bd6e7f1d5e3',1,'BlisModel']]], + ['rhs_628',['RHS',['../VrpMacros_8h.html#a95637851a772741c3d74e507bb0e6b1d',1,'VrpMacros.h']]], + ['route_629',['route',['../struct__NODE.html#af38cedb8786cffa0f6eb065b1287d4c6',1,'_NODE']]], + ['route_5fdata_630',['ROUTE_DATA',['../structROUTE__DATA.html',1,'ROUTE_DATA'],['../VrpCommonTypes_8h.html#af857749e2f6df34ecf513e968136a739',1,'route_data(): VrpCommonTypes.h']]], + ['route_5ffins_5fstart_5frule_631',['ROUTE_FINS_START_RULE',['../VrpConstants_8h.html#a7d175450a11e4b936a20001e240abcc8',1,'VrpConstants.h']]], + ['route_5ffins_5fvrp_5fdata_632',['ROUTE_FINS_VRP_DATA',['../VrpConstants_8h.html#a65914f985268b9039ddb72a4ba2e4f09',1,'VrpConstants.h']]], + ['route_5ffnins_5fstart_5frule_633',['ROUTE_FNINS_START_RULE',['../VrpConstants_8h.html#acf767d72d39c214f132d990318902892',1,'VrpConstants.h']]], + ['route_5ffnins_5fvrp_5fdata_634',['ROUTE_FNINS_VRP_DATA',['../VrpConstants_8h.html#accf0e84aea7d8329a31312dff17a514f',1,'VrpConstants.h']]], + ['route_5finfo_635',['route_info',['../structBEST__TOURS.html#a4c6ab11dbee650bcda97ef6db372791b',1,'BEST_TOURS']]], + ['route_5fnins_5fstart_5frule_636',['ROUTE_NINS_START_RULE',['../VrpConstants_8h.html#a1656cb01458776ec019779d14330e6c2',1,'VrpConstants.h']]], + ['route_5fnins_5fvrp_5fdata_637',['ROUTE_NINS_VRP_DATA',['../VrpConstants_8h.html#a24284046e94226eb084ab1b16984807e',1,'VrpConstants.h']]], + ['rrr_638',['RRR',['../VrpConstants_8h.html#ad6bfdff0b1311699c311726cf75092a5',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/all_12.html b/Doxygen/0.94/search/all_12.html new file mode 100644 index 0000000..dd9ff1d --- /dev/null +++ b/Doxygen/0.94/search/all_12.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_12.js b/Doxygen/0.94/search/all_12.js new file mode 100644 index 0000000..27092fa --- /dev/null +++ b/Doxygen/0.94/search/all_12.js @@ -0,0 +1,120 @@ +var searchData= +[ + ['s3_5fnumroutes_639',['S3_NUMROUTES',['../VrpConstants_8h.html#a96d88c06434f314225ece4d4790ddb8f',1,'VrpConstants.h']]], + ['s_5fexchange_640',['S_EXCHANGE',['../VrpConstants_8h.html#a2e7f4534c119670f07da6092529602a9',1,'VrpConstants.h']]], + ['s_5fexchange2_641',['S_EXCHANGE2',['../VrpConstants_8h.html#a1134361f3543d0d384247990b8f993fe',1,'VrpConstants.h']]], + ['s_5ffarnear_5fins_642',['S_FARNEAR_INS',['../VrpConstants_8h.html#abd3eb99194a5ffd85ff407747c0143f1',1,'VrpConstants.h']]], + ['s_5ffarthest_5fins_643',['S_FARTHEST_INS',['../VrpConstants_8h.html#a7eb205cb2b359f1738424973d2f977e9',1,'VrpConstants.h']]], + ['s_5fmst_644',['S_MST',['../VrpConstants_8h.html#ad735a04b2567abdc7c41c23821b96ae6',1,'VrpConstants.h']]], + ['s_5fnear_5fcluster_645',['S_NEAR_CLUSTER',['../VrpConstants_8h.html#a020f45d22de1ff4f701fa50d093db38b',1,'VrpConstants.h']]], + ['s_5fnearest_5fins_646',['S_NEAREST_INS',['../VrpConstants_8h.html#a09f6a11392171af76b08192e74e9001c',1,'VrpConstants.h']]], + ['s_5fsavings_647',['S_SAVINGS',['../VrpConstants_8h.html#a190f0cf669122d2cea727a9cd94bcf36',1,'VrpConstants.h']]], + ['s_5fsavings2_648',['S_SAVINGS2',['../VrpConstants_8h.html#a327dc229415e0e60da5e0d31a4f5c41b',1,'VrpConstants.h']]], + ['s_5fsavings3_649',['S_SAVINGS3',['../VrpConstants_8h.html#a8603b0142cf6b8dc5f500cdc030390f5',1,'VrpConstants.h']]], + ['s_5fsweep_650',['S_SWEEP',['../VrpConstants_8h.html#a32bb1d28558e7d992a42e32f47b3f86b',1,'VrpConstants.h']]], + ['s_5ftsp_5ffi_651',['S_TSP_FI',['../VrpConstants_8h.html#a85cb04d1bad1f7a268b3d850103ac5ba',1,'VrpConstants.h']]], + ['s_5ftsp_5ffini_652',['S_TSP_FINI',['../VrpConstants_8h.html#a4cf80afeaa7d0c7afaf8b0c03d1bafcd',1,'VrpConstants.h']]], + ['s_5ftsp_5fni_653',['S_TSP_NI',['../VrpConstants_8h.html#a3f817ddbef6c19ff7c0a25f725da71fc',1,'VrpConstants.h']]], + ['save_5fsmall_5fgraph_654',['SAVE_SMALL_GRAPH',['../VrpConstants_8h.html#a624740cfe63efe9e3c0cb5628483541c',1,'VrpConstants.h']]], + ['savings_655',['SAVINGS',['../VrpConstants_8h.html#acde516df548b4e09c2cd9b3b966b08db',1,'VrpConstants.h']]], + ['savings2_656',['SAVINGS2',['../VrpConstants_8h.html#ac61e998a74c2226d117256005c43dbad',1,'VrpConstants.h']]], + ['savings2_5fdata_657',['SAVINGS2_DATA',['../VrpConstants_8h.html#a617262ed2af1bef6fbb2ad07180576bc',1,'VrpConstants.h']]], + ['savings3_658',['SAVINGS3',['../VrpConstants_8h.html#a1a29f7eac48e66483e61e2584e13a2b3',1,'VrpConstants.h']]], + ['savings3_5fdata_659',['SAVINGS3_DATA',['../VrpConstants_8h.html#a46f8e1c037aae85380ff40d2f6d64eaf',1,'VrpConstants.h']]], + ['savings_5fdata_660',['SAVINGS_DATA',['../VrpConstants_8h.html#a6d09f4cc18dedac6f5986a6929c9d8fa',1,'VrpConstants.h']]], + ['scaleconfactor_661',['scaleConFactor',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271ab468258112758894e7bc99d616418110',1,'BlisParams']]], + ['scanned_662',['scanned',['../structEDGE.html#a44236ec93acbb222f04d86010e4ba2bb',1,'EDGE::scanned()'],['../structVERTEX.html#a9585afaa08582675719aaa5976b0d81e',1,'VERTEX::scanned()']]], + ['score_5f_663',['score_',['../classBlisPseudocost.html#a280b29b689bd643ea5bbd319addf7857',1,'BlisPseudocost']]], + ['searchsolution_664',['searchSolution',['../classVrpHeurTSP.html#a86b6ee9c5e23279ef51c8d5336dd3209',1,'VrpHeurTSP::searchSolution()'],['../classBlisHeuristic.html#aad991067cc2960e54cf368c8b37f3ad1',1,'BlisHeuristic::searchSolution(double &objectiveValue, double *newSolution)=0'],['../classBlisHeuristic.html#a931100b6e1b0b0b44da2198f97b27840',1,'BlisHeuristic::searchSolution(double &objectiveValue, double *newSolution, OsiCuts &cs)'],['../classBlisHeurRound.html#aeb93dfaf0bbce26d0d1c2cf633dfdc94',1,'BlisHeurRound::searchSolution()']]], + ['second_5fset_665',['SECOND_SET',['../VrpConstants_8h.html#af43e13a1127ca2859c15024209006b0e',1,'VrpConstants.h']]], + ['seed_5f_666',['seed_',['../classBlisHeurRound.html#a5b76c8b4df40f1907bdcdce1656b8c41',1,'BlisHeurRound']]], + ['selectbranchobject_667',['selectBranchObject',['../classBlisTreeNode.html#a429feb43d814427630ba8d87070005d9',1,'BlisTreeNode']]], + ['setactivenode_668',['setActiveNode',['../classBlisModel.html#a3565215d0eb4ce8eb43019a9c08e5bb1',1,'BlisModel']]], + ['setatsolution_669',['setAtSolution',['../classBlisConGenerator.html#a28e192ecef94c6b2194ff57141a00ad2',1,'BlisConGenerator']]], + ['setbasis_670',['setBasis',['../classBlisNodeDesc.html#aee69623bb3af860387f0a15d86afb932',1,'BlisNodeDesc']]], + ['setbrancheddir_671',['setBranchedDir',['../classBlisNodeDesc.html#a52ec29f7cedffe5364b8e4b8c501c378',1,'BlisNodeDesc']]], + ['setbranchedind_672',['setBranchedInd',['../classBlisNodeDesc.html#a437ffb54e8308ca9049f5a80c605efa7',1,'BlisNodeDesc']]], + ['setbranchedval_673',['setBranchedVal',['../classBlisNodeDesc.html#aff3c9a177f75e863123507ddc177fd44',1,'BlisNodeDesc']]], + ['setbranchingmethod_674',['setBranchingMethod',['../classBlisModel.html#ad9fcfbe69e72e81b5eda8e409763c03f',1,'BlisModel::setBranchingMethod(BcpsBranchStrategy *method)'],['../classBlisModel.html#ae759dc7d11c64aaf738e3eb270bd5ed1',1,'BlisModel::setBranchingMethod(BcpsBranchStrategy &method)']]], + ['setbreakeven_675',['setBreakEven',['../classBlisObjectInt.html#ad5eeadae726cba87e3c4717337bcc840',1,'BlisObjectInt']]], + ['setcolmatrix_676',['setColMatrix',['../classBlisModel.html#a997edb6021933c6640dc8c3098384371',1,'BlisModel']]], + ['setcoltype_677',['setColType',['../classBlisModel.html#aa92f15ac2e30d265fa00cdef41188b05',1,'BlisModel']]], + ['setconlb_678',['setConLb',['../classBlisModel.html#a85c36dbca361b05def118b47b9cb185e',1,'BlisModel']]], + ['setconub_679',['setConUb',['../classBlisModel.html#aeb6b7c1ba33943584ec23b7af0a89717',1,'BlisModel']]], + ['setcutgenerationfreq_680',['setCutGenerationFreq',['../classBlisConGenerator.html#a795a1b76bb0c0e30b7e1c5c455b458ad',1,'BlisConGenerator']]], + ['setcutoff_681',['setCutoff',['../classBlisModel.html#a7f993ddaa21c23e76c68c36738e925c9',1,'BlisModel']]], + ['setcutstrategy_682',['setCutStrategy',['../classBlisModel.html#a58c919927ae9534f12ca6a27b7be5fd7',1,'BlisModel::setCutStrategy(BlisCutStrategy u)'],['../classBlisModel.html#a6d9359ec5ee235ea66194196f9fb7db3',1,'BlisModel::setCutStrategy(int f)']]], + ['setdata_683',['setData',['../classBlisConstraint.html#aa3ca0c050967c81d9af697a862ed21cf',1,'BlisConstraint::setData()'],['../classBlisVariable.html#ac217f6ab0321a27c85fe7f4e494a0d62',1,'BlisVariable::setData()']]], + ['setdefaultentries_684',['setDefaultEntries',['../classVrpParams.html#a78bae785b4f7a336276e58eac16c4ae4',1,'VrpParams::setDefaultEntries()'],['../classBlisParams.html#a0b74d4d0c01299f346e298ad2827e949',1,'BlisParams::setDefaultEntries()']]], + ['setdenseconcutoff_685',['setDenseConCutoff',['../classBlisModel.html#a11a84366048a8e573ef7ee31605af5bc',1,'BlisModel']]], + ['setentry_686',['setEntry',['../classVrpParams.html#ab79c0c640ef196f457fdcaa7741be20a',1,'VrpParams::setEntry(const boolParams key, const char *val)'],['../classVrpParams.html#aa99fd48132142afeaef714efe88cf532',1,'VrpParams::setEntry(const boolParams key, const char val)'],['../classVrpParams.html#aebcadbe3ad9d32d257c140c7a97ed5db',1,'VrpParams::setEntry(const boolParams key, const bool val)'],['../classVrpParams.html#aa54a23a016f023f603ced73117ab82f9',1,'VrpParams::setEntry(const intParams key, const char *val)'],['../classVrpParams.html#a13f41126eb97293cb7d19075ad5503cb',1,'VrpParams::setEntry(const intParams key, const int val)'],['../classVrpParams.html#a12fa9fde1ef0161f6029f92a179bc9b3',1,'VrpParams::setEntry(const dblParams key, const char *val)'],['../classVrpParams.html#ab88fd16147040843bf15a4c068a3381f',1,'VrpParams::setEntry(const dblParams key, const double val)'],['../classVrpParams.html#a991a0dd51884ec38678e491a9ff4e2df',1,'VrpParams::setEntry(const strParams key, const char *val)'],['../classVrpParams.html#a92cf0f51302375cc0b8dbd8f2747b9f3',1,'VrpParams::setEntry(const strArrayParams key, const char *val)'],['../classBlisParams.html#a63101fab39d983622ffc42e00c39fe0e',1,'BlisParams::setEntry(const chrParams key, const char *val)'],['../classBlisParams.html#adaa82db282ae0fbdb9cea9cba412bf72',1,'BlisParams::setEntry(const chrParams key, const char val)'],['../classBlisParams.html#a3b5ef5a1307c592ebc14c063786c3c2a',1,'BlisParams::setEntry(const chrParams key, const bool val)'],['../classBlisParams.html#a5a73c36fdd42217ef713d8865ecfacd5',1,'BlisParams::setEntry(const intParams key, const char *val)'],['../classBlisParams.html#a13441b5da9ab32bc77884d89e9ead6e2',1,'BlisParams::setEntry(const intParams key, const int val)'],['../classBlisParams.html#a0639e6970b88d01dc989eac30833a8db',1,'BlisParams::setEntry(const dblParams key, const char *val)'],['../classBlisParams.html#a656e5b68431cf0be47a28b09ffa5bb9c',1,'BlisParams::setEntry(const dblParams key, const double val)'],['../classBlisParams.html#aba681db817941116e8fdbcd9079a76c3',1,'BlisParams::setEntry(const strParams key, const char *val)'],['../classBlisParams.html#a18cb41be462e0fbca332b622c33f8431',1,'BlisParams::setEntry(const strArrayParams key, const char *val)']]], + ['setfeaschecktime_687',['setFeasCheckTime',['../classBlisModel.html#aae4b0058c70c45df989956a7222fe2fb',1,'BlisModel']]], + ['setheurcallfrequency_688',['setHeurCallFrequency',['../classBlisHeuristic.html#a40b25fa04df1fd781926c2db38fa0de2',1,'BlisHeuristic']]], + ['setmaxnumcons_689',['setMaxNumCons',['../classBlisModel.html#a2a838d6224f446ba6238fa4f38d0f60c',1,'BlisModel']]], + ['setmodel_690',['setModel',['../classVrpCutGenerator.html#a8b5b2668691218a50fee019f84851163',1,'VrpCutGenerator::setModel()'],['../classBlisConGenerator.html#a5a48ba7579df55687a3c8519f0dbf32e',1,'BlisConGenerator::setModel()'],['../classBlisHeuristic.html#a328186d0eed0d4698dd9de2214d9b304',1,'BlisHeuristic::setModel()'],['../classBlisHeurRound.html#a6e3f4aac3a56ed6f4f65da7052cdc42b',1,'BlisHeurRound::setModel()']]], + ['setmodeldata_691',['setModelData',['../classVrpModel.html#a6dcf606109ed2755533fb48cee8a5f92',1,'VrpModel']]], + ['setname_692',['setName',['../classBlisConGenerator.html#a24525af8118e28febc48047de3749911',1,'BlisConGenerator']]], + ['setnodeweight_693',['setNodeWeight',['../classBlisModel.html#a08d6728452492af2d43d057e55fba983',1,'BlisModel']]], + ['setnormal_694',['setNormal',['../classBlisConGenerator.html#a89e6a452b6eb94b42e5b9a03502126d5',1,'BlisConGenerator']]], + ['setnumbranchresolve_695',['setNumBranchResolve',['../classBlisModel.html#a2803ddedb519f6388f68b96580ff488b',1,'BlisModel']]], + ['setnumcons_696',['setNumCons',['../classBlisModel.html#a8e45801ca281f84ca27e98948dee4355',1,'BlisModel']]], + ['setnumelems_697',['setNumElems',['../classBlisModel.html#ae3727a9bc4210f98fbe2f66ae638b418',1,'BlisModel']]], + ['setnumobjects_698',['setNumObjects',['../classBlisModel.html#ab3751523fd7d3a18283e40b9007d99fc',1,'BlisModel']]], + ['setnumoldconstraints_699',['setNumOldConstraints',['../classBlisModel.html#a5559a42700e63d1cbf8135f42a8521e8',1,'BlisModel']]], + ['setnumvars_700',['setNumVars',['../classBlisModel.html#acd8743d23a5c27184a9e8c6800f93f1c',1,'BlisModel']]], + ['setobjcoef_701',['setObjCoef',['../classBlisModel.html#a94ece180a41d1a92cfe8da48d23e38d6',1,'BlisModel::setObjCoef()'],['../classBlisVariable.html#ada296a6becd54748bf566866ab2ae318',1,'BlisVariable::setObjCoef()']]], + ['setoldconstraints_702',['setOldConstraints',['../classBlisModel.html#a719d9926f26191178c6fdf2fcdde3f88',1,'BlisModel']]], + ['setoldconstraintssize_703',['setOldConstraintsSize',['../classBlisModel.html#a4fdb8fce40ea3034077f0e51ed584372',1,'BlisModel']]], + ['setopt_704',['setOpt',['../classVrpSolution.html#a728698b050d81a09cb7d0c021dcbdde1',1,'VrpSolution']]], + ['setoriginallowerbound_705',['setOriginalLowerBound',['../classBlisObjectInt.html#ac02b8b1c946e313e829c5c74a81904f9',1,'BlisObjectInt']]], + ['setoriginalupperbound_706',['setOriginalUpperBound',['../classBlisObjectInt.html#a0f185ef614d7f91377f026ff2206a145',1,'BlisObjectInt']]], + ['setrelibility_707',['setRelibility',['../classBlisBranchStrategyPseudo.html#ac57d5c12647876adc9b06cdde464727f',1,'BlisBranchStrategyPseudo::setRelibility()'],['../classBlisBranchStrategyRel.html#af819fb9262f55d941951542be5a6cd22',1,'BlisBranchStrategyRel::setRelibility()']]], + ['setscore_708',['setScore',['../classBlisPseudocost.html#a116624a2727a16eabe5024029829eb09',1,'BlisPseudocost']]], + ['setseed_709',['setSeed',['../classBlisHeurRound.html#add990aa1a11c9436da411f553d52dba7',1,'BlisHeurRound']]], + ['setsharedobjectmark_710',['setSharedObjectMark',['../classBlisModel.html#aa31af3242486797cb89d18570bf70fab',1,'BlisModel']]], + ['setsolestimate_711',['setSolEstimate',['../classBlisModel.html#a156652850f994af4cb0c419d9f2e886e',1,'BlisModel']]], + ['setsolver_712',['setSolver',['../classBlisModel.html#a45e5f95913d5dc3130bbf127636ec6b2',1,'BlisModel']]], + ['setstrategy_713',['setStrategy',['../classBlisConGenerator.html#aea1a9de15919321b684080d25dde185b',1,'BlisConGenerator::setStrategy()'],['../classBlisHeuristic.html#a38a694e2259238a81d6245cedd52bd49',1,'BlisHeuristic::setStrategy()']]], + ['setupself_714',['setupSelf',['../classBlisModel.html#a203680c43f1b7f936572e3648c8cdcb9',1,'BlisModel']]], + ['setvarlb_715',['setVarLb',['../classBlisModel.html#afe8f5e6e2ea3da28f66e99335c8da5af',1,'BlisModel']]], + ['setvarub_716',['setVarUb',['../classBlisModel.html#aa83dff4cab916fb6c4951a52152f8832',1,'BlisModel']]], + ['setweight_717',['setWeight',['../classBlisPseudocost.html#af817650f68bf243943b65de3260091b3',1,'BlisPseudocost']]], + ['setwheninfeasible_718',['setWhenInfeasible',['../classBlisConGenerator.html#a0e4b0a2beb2070cb3eaaa0cc1b7c8f73',1,'BlisConGenerator']]], + ['shareconstraints_719',['shareConstraints',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4a39e8bb0536a93b977dbc2aa72c7f03b1',1,'BlisParams']]], + ['sharedobjectmark_5f_720',['sharedObjectMark_',['../classBlisModel.html#aa39a7195c0ebf0341bd65d73244a3518',1,'BlisModel']]], + ['sharepcostdepth_721',['sharePcostDepth',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39bab6c8619f2de33f5a99f794919fda13b7',1,'BlisParams']]], + ['sharepcostfrequency_722',['sharePcostFrequency',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba7032378b14d1aebc994e22631c005e2a',1,'BlisParams']]], + ['sharepseudocostrampup_723',['sharePseudocostRampUp',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4a234cd490c0a597b2a3d46bfeeaaa7e59',1,'BlisParams']]], + ['sharepseudocostsearch_724',['sharePseudocostSearch',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4aa04a70fc661f956ef58224e787b0c4a1',1,'BlisParams']]], + ['sharevariables_725',['shareVariables',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4affadca81088f66d7826ddc4413121d8c',1,'BlisParams']]], + ['size_5f_726',['size_',['../classBlisConstraint.html#a0db44a303800dfd3b335b5ac58438d53',1,'BlisConstraint::size_()'],['../classBlisVariable.html#ab866901ddff8af0744de941c73508a79',1,'BlisVariable::size_()']]], + ['small_5fgraph_727',['SMALL_GRAPH',['../structSMALL__GRAPH.html',1,'SMALL_GRAPH'],['../VrpCommonTypes_8h.html#ace055152032f06b0e61c15459fa56d24',1,'small_graph(): VrpCommonTypes.h']]], + ['solve_5ftime_728',['solve_time',['../structBEST__TOURS.html#a5df8fedcc23adac844e40aaade11ddfb',1,'BEST_TOURS']]], + ['solver_729',['solver',['../classBlisModel.html#af530e8edf6feb506ecb991e4e0e27656',1,'BlisModel']]], + ['some_5fare_5fbase_730',['SOME_ARE_BASE',['../VrpConstants_8h.html#afb5f1001a7ffcd2f3e0fec481ded244a',1,'VrpConstants.h']]], + ['srandom_731',['SRANDOM',['../VrpMacros_8h.html#a9dc5d6203c04c019797e4200ed33ac28',1,'VrpMacros.h']]], + ['startconlb_732',['startConLB',['../classBlisModel.html#a23c03537e103e506264be2b6eb6666c8',1,'BlisModel']]], + ['startconlb_5f_733',['startConLB_',['../classBlisModel.html#af29b13925d7f408f8c34451c3576edee',1,'BlisModel']]], + ['startconub_734',['startConUB',['../classBlisModel.html#a116d379f73ae836d19bb5ea48c66c0b5',1,'BlisModel']]], + ['startconub_5f_735',['startConUB_',['../classBlisModel.html#a6a9da9a98376b839fe1f98f0b2e6fedd',1,'BlisModel']]], + ['startvarlb_736',['startVarLB',['../classBlisModel.html#a1d90655e7ffb2a41124d1ab3e11a5f41',1,'BlisModel']]], + ['startvarlb_5f_737',['startVarLB_',['../classBlisModel.html#a34836753a16340e046c6d5ed6bd63407',1,'BlisModel']]], + ['startvarub_738',['startVarUB',['../classBlisModel.html#adfbcb19620db1d2a61d2753fd26b8107',1,'BlisModel']]], + ['startvarub_5f_739',['startVarUB_',['../classBlisModel.html#ada4a5c0c2c47e94780bde8174d88ae36',1,'BlisModel']]], + ['stdc_5fheaders_740',['STDC_HEADERS',['../config_8h.html#a550e5c272cc3cf3814651721167dcd23',1,'config.h']]], + ['stop_741',['STOP',['../VrpConstants_8h.html#ae19b6bb2940d2fbe0a79852b070eeafd',1,'VrpConstants.h']]], + ['storesolution_742',['storeSolution',['../classBlisModel.html#a30d430fbcecf522277cdcb41990de07b',1,'BlisModel']]], + ['strarraydummy_743',['strArrayDummy',['../classVrpParams.html#a2b9941906895258be908386a7be043aea5e8a4b7e7eccc31cebb75a35b902d105',1,'VrpParams::strArrayDummy()'],['../classBlisParams.html#a50235e57390e794f0cc2420b0383dc6da598145647a8862701d3f29756bebb2cf',1,'BlisParams::strArrayDummy()']]], + ['strarrayparams_744',['strArrayParams',['../classVrpParams.html#a2b9941906895258be908386a7be043ae',1,'VrpParams::strArrayParams()'],['../classBlisParams.html#a50235e57390e794f0cc2420b0383dc6d',1,'BlisParams::strArrayParams()']]], + ['strategy_745',['strategy',['../classBlisConGenerator.html#a5d74c1794c5b12369882e2c98807b80d',1,'BlisConGenerator::strategy()'],['../classBlisHeuristic.html#afb69a1929db9439c638a7f64b8ee79e0',1,'BlisHeuristic::strategy()']]], + ['strategy_5f_746',['strategy_',['../classBlisConGenerator.html#adc29afb8836d1cf8c910bb54dbc0868f',1,'BlisConGenerator::strategy_()'],['../classBlisHeuristic.html#addbfe4f7ba7ac5f0ab450790c397ccf3',1,'BlisHeuristic::strategy_()']]], + ['strdummy_747',['strDummy',['../classVrpParams.html#ae81aaae2cdbe79b5e2081d2284f46448aa8defde451e9bd2eab77f71cb18c559d',1,'VrpParams::strDummy()'],['../classBlisParams.html#ad6e0e869ed765edc2ebee19032d1384aad95aa64f6efa38ce1b0667ae8e025ba7',1,'BlisParams::strDummy()']]], + ['strongcandsize_748',['strongCandSize',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba7befcd12dc8d583b224c293db38c3f57',1,'BlisParams']]], + ['strparams_749',['strParams',['../classVrpParams.html#ae81aaae2cdbe79b5e2081d2284f46448',1,'VrpParams::strParams()'],['../classBlisParams.html#ad6e0e869ed765edc2ebee19032d1384a',1,'BlisParams::strParams()']]], + ['subtour_750',['SUBTOUR',['../VrpConstants_8h.html#a46e30fcd6bfdf68c85e2933e00782a3b',1,'VrpConstants.h']]], + ['subtour_5felim_751',['SUBTOUR_ELIM',['../VrpConstants_8h.html#ae14bac8a678cb9541182e8d321268b7b',1,'VrpConstants.h']]], + ['subtour_5felim_5facross_752',['SUBTOUR_ELIM_ACROSS',['../VrpConstants_8h.html#a34621a941fcd35cea57c36ee11d20625',1,'VrpConstants.h']]], + ['subtour_5felim_5fside_753',['SUBTOUR_ELIM_SIDE',['../VrpConstants_8h.html#ab86dcf73424a19a9526d0c6b3b12b4c7',1,'VrpConstants.h']]], + ['sweep_754',['SWEEP',['../VrpConstants_8h.html#a2d6fe1ca06dd58594b3504b03588b38b',1,'VrpConstants.h']]], + ['sweep_5ftrials_755',['SWEEP_TRIALS',['../VrpConstants_8h.html#aaa2985c30eb9679a74baf8618568cffd',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/all_13.html b/Doxygen/0.94/search/all_13.html new file mode 100644 index 0000000..2611a10 --- /dev/null +++ b/Doxygen/0.94/search/all_13.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_13.js b/Doxygen/0.94/search/all_13.js new file mode 100644 index 0000000..38e5283 --- /dev/null +++ b/Doxygen/0.94/search/all_13.js @@ -0,0 +1,26 @@ +var searchData= +[ + ['tailoff_756',['tailOff',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271a83b3a4311083557b0ee6016ecf2e1c2e',1,'BlisParams']]], + ['tempconlbpos_757',['tempConLBPos',['../classBlisModel.html#a9f108e4a2d884de594ce897c61cfdd2c',1,'BlisModel']]], + ['tempconlbpos_5f_758',['tempConLBPos_',['../classBlisModel.html#a0049233c3e1c47873b653e1e108eda9a',1,'BlisModel']]], + ['tempconubpos_759',['tempConUBPos',['../classBlisModel.html#a6726710149ff64eaa884d5f0c3f5d54e',1,'BlisModel']]], + ['tempconubpos_5f_760',['tempConUBPos_',['../classBlisModel.html#a68d71683e0ec33c1b3c07e389c0a7a9e',1,'BlisModel']]], + ['tempvarlbpos_761',['tempVarLBPos',['../classBlisModel.html#a3b21293e37075e3b5b5f9b6bc1b81bda',1,'BlisModel']]], + ['tempvarlbpos_5f_762',['tempVarLBPos_',['../classBlisModel.html#a4d62967129662d0c7701cabed9cc9172',1,'BlisModel']]], + ['tempvarubpos_763',['tempVarUBPos',['../classBlisModel.html#a886e4a837fc11648763a673a84fcbc99',1,'BlisModel']]], + ['tempvarubpos_5f_764',['tempVarUBPos_',['../classBlisModel.html#a6b2c1f28c2f354b3d5159fd2020598f8',1,'BlisModel']]], + ['time_765',['time',['../classBlisConGenerator.html#af2cfc62c91c06763c6b2449de76177dc',1,'BlisConGenerator::time()'],['../classBlisHeuristic.html#aac390687b9ac40a61603608a93b7ce90',1,'BlisHeuristic::time()']]], + ['time_5f_766',['time_',['../classBlisConGenerator.html#a7fbe9338611af3a37ba936800dfc7fc2',1,'BlisConGenerator::time_()'],['../classBlisHeuristic.html#a3499608c5868833574737149042e6eb2',1,'BlisHeuristic::time_()']]], + ['tour_767',['tour',['../structBEST__TOURS.html#af24de94fb555e7ffdd664c20918735d3',1,'BEST_TOURS']]], + ['tour_5f_768',['tour_',['../classVrpHeurTSP.html#ac159dcd8ddc392e876a536b65b2e3621',1,'VrpHeurTSP']]], + ['tree_5fedge_769',['tree_edge',['../structEDGE.html#a3cb28e96f9ee3017338b25d003ea89ec',1,'EDGE']]], + ['tsp_5ffi_770',['TSP_FI',['../VrpConstants_8h.html#ab17f64bb31fe95eeea4c7f563c3fd04a',1,'VrpConstants.h']]], + ['tsp_5ffi_5ftrials_771',['TSP_FI_TRIALS',['../VrpConstants_8h.html#afb5179c25c94168e389d0ba19e7108dd',1,'VrpConstants.h']]], + ['tsp_5ffini_772',['TSP_FINI',['../VrpConstants_8h.html#a761fe151adb1e91d1afad484a8c2ba7a',1,'VrpConstants.h']]], + ['tsp_5ffini_5fratio_773',['TSP_FINI_RATIO',['../VrpConstants_8h.html#ab137dae9c6537e18817b92a3d52250a2',1,'VrpConstants.h']]], + ['tsp_5ffini_5ftrials_774',['TSP_FINI_TRIALS',['../VrpConstants_8h.html#a6592c258de1bc550cf0e9cc35f42881f',1,'VrpConstants.h']]], + ['tsp_5fni_775',['TSP_NI',['../VrpConstants_8h.html#af7745a4f2243b0a746593f9d9fdc4e33',1,'VrpConstants.h']]], + ['tsp_5fni_5ftrials_776',['TSP_NI_TRIALS',['../VrpConstants_8h.html#adfc5f2ecb628d1159f412f34b1af59b8',1,'VrpConstants.h']]], + ['tsp_5fstart_5fpoint_777',['TSP_START_POINT',['../VrpConstants_8h.html#a23c040ad123a65032ec7470ab25056b2',1,'VrpConstants.h']]], + ['tspprob_778',['tspProb',['../classVrpParams.html#a9dd5e6691626b6b8f7cbb3cbc74bfe14a15aaa01bcbb3a40222757f80d131f42f',1,'VrpParams']]] +]; diff --git a/Doxygen/0.94/search/all_14.html b/Doxygen/0.94/search/all_14.html new file mode 100644 index 0000000..72d12e9 --- /dev/null +++ b/Doxygen/0.94/search/all_14.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_14.js b/Doxygen/0.94/search/all_14.js new file mode 100644 index 0000000..b30433d --- /dev/null +++ b/Doxygen/0.94/search/all_14.js @@ -0,0 +1,14 @@ +var searchData= +[ + ['uind_5f_779',['uind_',['../classVrpVariable.html#a6e554fc2afdd581a529e012cdc55f9e4',1,'VrpVariable']]], + ['unpack_780',['unpack',['../classVrpParams.html#ab5ff48ed973f2fe9e3aebf7a52796871',1,'VrpParams::unpack()'],['../classBlisParams.html#ac1712eed0f94e6eec64d0e4ca795148f',1,'BlisParams::unpack()']]], + ['unpacksharedconstraints_781',['unpackSharedConstraints',['../classBlisModel.html#af2d7d44dd78f66dc5bfaed064d7fa4dc',1,'BlisModel']]], + ['unpacksharedknowledge_782',['unpackSharedKnowledge',['../classBlisModel.html#adc70fd860678229c1a91cede3bafe207',1,'BlisModel']]], + ['unpacksharedpseudocost_783',['unpackSharedPseudocost',['../classBlisModel.html#a8c574bba3b6145b7b5eef4cfca0557c3',1,'BlisModel']]], + ['unpacksharedvariables_784',['unpackSharedVariables',['../classBlisModel.html#a41c46d51ed5714fc0f2cf1a38175cdcc',1,'BlisModel']]], + ['up_5f_785',['up_',['../classBlisBranchObjectInt.html#aacf59cf0399ce95c1d3e1587d283d96f',1,'BlisBranchObjectInt']]], + ['upcost_5f_786',['upCost_',['../classBlisPseudocost.html#aa80dca73a4ab867d5313b552efaa1e3e',1,'BlisPseudocost']]], + ['upcount_5f_787',['upCount_',['../classBlisPseudocost.html#af54ea6a1cefded36fd510cb96e518ffd',1,'BlisPseudocost']]], + ['update_788',['update',['../classBlisPseudocost.html#a53616b15bb57c05fc2dd1366f866b0fc',1,'BlisPseudocost::update(const int dir, const double parentObjValue, const double objValue, const double solValue)'],['../classBlisPseudocost.html#a8c45e42b2c8babb8a7e95510281fe0a8',1,'BlisPseudocost::update(const int dir, const double objDiff, const double solValue)'],['../classBlisPseudocost.html#addea77c2fc8dabf5d549e6f08676ae48',1,'BlisPseudocost::update(double upCost, int upCount, double downCost, int downCount)']]], + ['userfeasiblesolution_789',['userFeasibleSolution',['../classVrpModel.html#a4a4030b814b1ef2df4171dc402fb4698',1,'VrpModel::userFeasibleSolution()'],['../classBlisModel.html#a1f1e47b57c6652dc59224c8a0b48efb6',1,'BlisModel::userFeasibleSolution()']]] +]; diff --git a/Doxygen/0.94/search/all_15.html b/Doxygen/0.94/search/all_15.html new file mode 100644 index 0000000..767aec3 --- /dev/null +++ b/Doxygen/0.94/search/all_15.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_15.js b/Doxygen/0.94/search/all_15.js new file mode 100644 index 0000000..4b2cde8 --- /dev/null +++ b/Doxygen/0.94/search/all_15.js @@ -0,0 +1,40 @@ +var searchData= +[ + ['v0_790',['v0',['../structEDGE__DATA.html#a20c0970716761104d6bd6e698005e41c',1,'EDGE_DATA::v0()'],['../structEDGE.html#abfdee23eba1abdf6103babc1ca426a80',1,'EDGE::v0()']]], + ['v1_791',['v1',['../structEDGE__DATA.html#abe4a7d05006c85318537e62666563211',1,'EDGE_DATA::v1()'],['../structEDGE.html#ac9030f1ea3c44b8cebb192c0c10ea955',1,'EDGE::v1()']]], + ['values_5f_792',['values_',['../classBlisConstraint.html#abcfeac67b724d248ddb88e47acaa81f4',1,'BlisConstraint::values_()'],['../classBlisVariable.html#aca8d4234ecd53a5a44adca68b4ed8d52',1,'BlisVariable::values_()']]], + ['varlb_793',['varLB',['../classBlisModel.html#a40c7365368b2669aafa4959983af97e6',1,'BlisModel']]], + ['varlb_5f_794',['varLB_',['../classBlisModel.html#aee002f4447d372004d8e60c7f037ab69',1,'BlisModel']]], + ['varub_795',['varUB',['../classBlisModel.html#a9f47c10cc8005f256ae5ee2fb3c205eb',1,'BlisModel']]], + ['varub_5f_796',['varUB_',['../classBlisModel.html#ad85baace4d574edce40a830f31708e82',1,'BlisModel']]], + ['verbosity_797',['verbosity',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3eaf2a7b266ed580b7a2664f82a69bc3cc3',1,'VrpParams']]], + ['version_798',['VERSION',['../config_8h.html#a1c6d5de492ac61ad29aec7aa9a436bbf',1,'config.h']]], + ['vertex_799',['VERTEX',['../structVERTEX.html',1,'VERTEX'],['../VrpNetwork_8h.html#a7229316a0bc1f3dcd0bd839e9433d4b9',1,'vertex(): VrpNetwork.h']]], + ['vertnum_800',['vertnum',['../structSMALL__GRAPH.html#a7eabb05ab72c4506e2cf354b3ac7b434',1,'SMALL_GRAPH']]], + ['vertnum_5f_801',['vertnum_',['../classVrpModel.html#af84b4e633ed77adc9700c78e5d9eb118',1,'VrpModel::vertnum_()'],['../classVrpNetwork.html#ac15f7ad5829c3107466e6b18f00b8e23',1,'VrpNetwork::vertnum_()']]], + ['verts_5f_802',['verts_',['../classVrpNetwork.html#a408b689857077f6053e1d7b4803632d2',1,'VrpNetwork']]], + ['violation_803',['violation',['../classBlisConstraint.html#a4b628197a0aec5fe68e8dd96f1eb1f02',1,'BlisConstraint']]], + ['visited_5f_804',['visited_',['../classVrpHeurTSP.html#afbe512fdb880330bf6ecf5bf6f10e9dd',1,'VrpHeurTSP']]], + ['vrp_5fbroadcast_5fdata_805',['VRP_BROADCAST_DATA',['../VrpConstants_8h.html#a76c5f9be943260ff56efd13c39578f0b',1,'VrpConstants.h']]], + ['vrp_5flb_5fdata_806',['VRP_LB_DATA',['../VrpConstants_8h.html#ac658d1344da5abac9cc0180f391f0c25',1,'VrpConstants.h']]], + ['vrp_5flb_5fdata2_807',['VRP_LB_DATA2',['../VrpConstants_8h.html#a31a03399746198bfe88166c8937528cc',1,'VrpConstants.h']]], + ['vrp_5fnot_5fset_808',['VRP_NOT_SET',['../VrpConstants_8h.html#a2c20ca63022ab82568b0cc925c782f78',1,'VrpConstants.h']]], + ['vrpcommontypes_2eh_809',['VrpCommonTypes.h',['../VrpCommonTypes_8h.html',1,'']]], + ['vrpconstants_2eh_810',['VrpConstants.h',['../VrpConstants_8h.html',1,'']]], + ['vrpcutgenerator_811',['VrpCutGenerator',['../classVrpCutGenerator.html',1,'VrpCutGenerator'],['../classVrpModel.html#ae227b3961232601fdbb8462c9c92fbc2',1,'VrpModel::VrpCutGenerator()'],['../classVrpNetwork.html#ae227b3961232601fdbb8462c9c92fbc2',1,'VrpNetwork::VrpCutGenerator()'],['../classVrpCutGenerator.html#a4746e74d2294ea697d43b2ba891f20d0',1,'VrpCutGenerator::VrpCutGenerator()']]], + ['vrpcutgenerator_2eh_812',['VrpCutGenerator.h',['../VrpCutGenerator_8h.html',1,'']]], + ['vrpheurtsp_813',['VrpHeurTSP',['../classVrpHeurTSP.html',1,'VrpHeurTSP'],['../classVrpHeurTSP.html#aedbfe629d0e7229037bb38ee91cc7adf',1,'VrpHeurTSP::VrpHeurTSP()'],['../classVrpHeurTSP.html#a7782925e206bbd7ceff7fc739dad02dd',1,'VrpHeurTSP::VrpHeurTSP(VrpModel *model, const char *name, BlisHeurStrategy strategy, int freq)']]], + ['vrpheurtsp_2eh_814',['VrpHeurTSP.h',['../VrpHeurTSP_8h.html',1,'']]], + ['vrpmacros_2eh_815',['VrpMacros.h',['../VrpMacros_8h.html',1,'']]], + ['vrpmodel_816',['VrpModel',['../classVrpModel.html',1,'VrpModel'],['../classVrpNetwork.html#aa08ae18b96f04f1ab4be32fa5bf0aa8d',1,'VrpNetwork::VrpModel()'],['../classVrpModel.html#a4fac9cfceeda8d538a54c12695b6348f',1,'VrpModel::VrpModel()']]], + ['vrpmodel_2eh_817',['VrpModel.h',['../VrpModel_8h.html',1,'']]], + ['vrpnetwork_818',['VrpNetwork',['../classVrpNetwork.html',1,'VrpNetwork'],['../classVrpNetwork.html#ab756a0d0e3013955259ef95a146764ef',1,'VrpNetwork::VrpNetwork()'],['../classVrpNetwork.html#ae06bdd5b1f8fbf32862f71c324093ddc',1,'VrpNetwork::VrpNetwork(int edgenum, int vertnum)']]], + ['vrpnetwork_2eh_819',['VrpNetwork.h',['../VrpNetwork_8h.html',1,'']]], + ['vrppar_5f_820',['VrpPar_',['../classVrpModel.html#abf21aaba2906d9c2b1d6c00fa281334d',1,'VrpModel']]], + ['vrpparams_821',['VrpParams',['../classVrpParams.html',1,'VrpParams'],['../classVrpParams.html#a4137a42b26f6916591c9ddeca4893abe',1,'VrpParams::VrpParams()']]], + ['vrpparams_2eh_822',['VrpParams.h',['../VrpParams_8h.html',1,'']]], + ['vrpsolution_823',['VrpSolution',['../classVrpSolution.html',1,'VrpSolution'],['../classVrpModel.html#a3061c74c35ecb99a70446dd8fef8c63b',1,'VrpModel::VrpSolution()'],['../classVrpNetwork.html#a3061c74c35ecb99a70446dd8fef8c63b',1,'VrpNetwork::VrpSolution()'],['../classVrpSolution.html#a32871cc34020f4414877b92c8b3bc3c0',1,'VrpSolution::VrpSolution()'],['../classVrpSolution.html#abc0da5718793c707be9432b099e24148',1,'VrpSolution::VrpSolution(int s, const double *values, double objValue, VrpModel *vrp=0)']]], + ['vrpsolution_2eh_824',['VrpSolution.h',['../VrpSolution_8h.html',1,'']]], + ['vrpvariable_825',['VrpVariable',['../classVrpVariable.html',1,'VrpVariable'],['../classVrpVariable.html#a2548cb023ad3c4c678ff42565fda401b',1,'VrpVariable::VrpVariable()'],['../classVrpVariable.html#aa8ac5be4bd9d4e6aa99937cd52014447',1,'VrpVariable::VrpVariable(int v1, int v2, int cost, int ub)']]], + ['vrpvariable_2eh_826',['VrpVariable.h',['../VrpVariable_8h.html',1,'']]] +]; diff --git a/Doxygen/0.94/search/all_16.html b/Doxygen/0.94/search/all_16.html new file mode 100644 index 0000000..7bd7afe --- /dev/null +++ b/Doxygen/0.94/search/all_16.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_16.js b/Doxygen/0.94/search/all_16.js new file mode 100644 index 0000000..981454d --- /dev/null +++ b/Doxygen/0.94/search/all_16.js @@ -0,0 +1,11 @@ +var searchData= +[ + ['weight_827',['weight',['../structROUTE__DATA.html#a3cdfb46485922ddc1161bb35865b944a',1,'ROUTE_DATA::weight()'],['../structEDGE.html#a11432fab8fcdb74beef9b5711c6037b4',1,'EDGE::weight()']]], + ['weight_5f_828',['weight_',['../classBlisPseudocost.html#adc727ace5c0e8c53b34fd258c46a0bb7',1,'BlisPseudocost']]], + ['wheninfeasible_829',['whenInfeasible',['../classBlisConGenerator.html#af1811855b297140e23734c1bb78a2aad',1,'BlisConGenerator']]], + ['wheninfeasible_5f_830',['whenInfeasible_',['../classBlisConGenerator.html#a07fc99d8a9c02f9a7c2f2ed895abfcbb',1,'BlisConGenerator']]], + ['whichconnectedroutine_831',['whichConnectedRoutine',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3eaefe67f16c3d3aa589e1118addc2cd07e',1,'VrpParams']]], + ['whichtspcuts_832',['whichTspCuts',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3eaad85a46c8ab4eb15cfd027898a6d5b6d',1,'VrpParams']]], + ['writeparameters_833',['writeParameters',['../classBlisModel.html#a5f882bee715a8313e137c00c38eb5549',1,'BlisModel']]], + ['wtype_5f_834',['wtype_',['../classVrpModel.html#a02a582ac4a77e441ac85c21c5397460e',1,'VrpModel']]] +]; diff --git a/Doxygen/0.94/search/all_17.html b/Doxygen/0.94/search/all_17.html new file mode 100644 index 0000000..35702ec --- /dev/null +++ b/Doxygen/0.94/search/all_17.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_17.js b/Doxygen/0.94/search/all_17.js new file mode 100644 index 0000000..e4e96f1 --- /dev/null +++ b/Doxygen/0.94/search/all_17.js @@ -0,0 +1,27 @@ +var searchData= +[ + ['_7eblisbranchobjectbilevel_835',['~BlisBranchObjectBilevel',['../classBlisBranchObjectBilevel.html#a9d10139e78f519d7ade18e432f1d940e',1,'BlisBranchObjectBilevel']]], + ['_7eblisbranchobjectint_836',['~BlisBranchObjectInt',['../classBlisBranchObjectInt.html#ad74fc1a008e6c60a45925851b72f2a88',1,'BlisBranchObjectInt']]], + ['_7eblisbranchstrategybilevel_837',['~BlisBranchStrategyBilevel',['../classBlisBranchStrategyBilevel.html#a8739b4dcea8c81854d44621722bebef5',1,'BlisBranchStrategyBilevel']]], + ['_7eblisbranchstrategymaxinf_838',['~BlisBranchStrategyMaxInf',['../classBlisBranchStrategyMaxInf.html#a41ce53a68e957cfa31efae0770369170',1,'BlisBranchStrategyMaxInf']]], + ['_7eblisbranchstrategypseudo_839',['~BlisBranchStrategyPseudo',['../classBlisBranchStrategyPseudo.html#a27b9e007de5aa2891bfc0566444752c1',1,'BlisBranchStrategyPseudo']]], + ['_7eblisbranchstrategyrel_840',['~BlisBranchStrategyRel',['../classBlisBranchStrategyRel.html#aacaeec391f9e26d8b2c3ec567296b90b',1,'BlisBranchStrategyRel']]], + ['_7eblisbranchstrategystrong_841',['~BlisBranchStrategyStrong',['../classBlisBranchStrategyStrong.html#a15e9ebbdc4d199d9511efbf356a9cffb',1,'BlisBranchStrategyStrong']]], + ['_7ebliscongenerator_842',['~BlisConGenerator',['../classBlisConGenerator.html#aa5a1cbafff04c7b4e53cdf97fedcb6fb',1,'BlisConGenerator']]], + ['_7eblisconstraint_843',['~BlisConstraint',['../classBlisConstraint.html#a72083df7ab042fb07db58b3b56b8e78d',1,'BlisConstraint']]], + ['_7eblisheuristic_844',['~BlisHeuristic',['../classBlisHeuristic.html#a6df179036cc7eb095b81b364b28aa8de',1,'BlisHeuristic']]], + ['_7eblisheurround_845',['~BlisHeurRound',['../classBlisHeurRound.html#a96ef3a370f9f73ca93440bf3cdf7e9bb',1,'BlisHeurRound']]], + ['_7eblismodel_846',['~BlisModel',['../classBlisModel.html#a22c1a64b360633ddf011a51176e407a9',1,'BlisModel']]], + ['_7eblisnodedesc_847',['~BlisNodeDesc',['../classBlisNodeDesc.html#a1dae8f94bcdf202241ea74f9f6521d63',1,'BlisNodeDesc']]], + ['_7eblisobjectint_848',['~BlisObjectInt',['../classBlisObjectInt.html#aabb6f4b0e120eb64da7e6eb6107287ff',1,'BlisObjectInt']]], + ['_7eblispresolve_849',['~BlisPresolve',['../classBlisPresolve.html#a7e8366523f0afd1746ba5dea3b6774ec',1,'BlisPresolve']]], + ['_7eblissolution_850',['~BlisSolution',['../classBlisSolution.html#a61b46203a05e5da53d95ff91c4773fa8',1,'BlisSolution']]], + ['_7eblistreenode_851',['~BlisTreeNode',['../classBlisTreeNode.html#a988a27c2ad6c53d81b1db2016533cfee',1,'BlisTreeNode']]], + ['_7eblisvariable_852',['~BlisVariable',['../classBlisVariable.html#a8d1179b4118501d24b19d965dd0e170c',1,'BlisVariable']]], + ['_7evrpcutgenerator_853',['~VrpCutGenerator',['../classVrpCutGenerator.html#a0318302554cd442ae1a2969b8639e5ce',1,'VrpCutGenerator']]], + ['_7evrpheurtsp_854',['~VrpHeurTSP',['../classVrpHeurTSP.html#a7e703c555ac4a73ec7b8033f0bff6d70',1,'VrpHeurTSP']]], + ['_7evrpmodel_855',['~VrpModel',['../classVrpModel.html#afa39413ca28dba8fef266dbb56c483d5',1,'VrpModel']]], + ['_7evrpnetwork_856',['~VrpNetwork',['../classVrpNetwork.html#af43f6f001756d9d74b838d0a9b9f8c4f',1,'VrpNetwork']]], + ['_7evrpsolution_857',['~VrpSolution',['../classVrpSolution.html#a63c1dec6a6efcdc043b34d49b8baed75',1,'VrpSolution']]], + ['_7evrpvariable_858',['~VrpVariable',['../classVrpVariable.html#ae81c09d2ea59eddf508c42e3f39dd041',1,'VrpVariable']]] +]; diff --git a/Doxygen/0.94/search/all_2.html b/Doxygen/0.94/search/all_2.html new file mode 100644 index 0000000..b26d916 --- /dev/null +++ b/Doxygen/0.94/search/all_2.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_2.js b/Doxygen/0.94/search/all_2.js new file mode 100644 index 0000000..c1df2f3 --- /dev/null +++ b/Doxygen/0.94/search/all_2.js @@ -0,0 +1,158 @@ +var searchData= +[ + ['basis_5f_38',['basis_',['../classBlisNodeDesc.html#a0731e512cd008931dcf58a16c2213b62',1,'BlisNodeDesc']]], + ['best_5ftours_39',['BEST_TOURS',['../structBEST__TOURS.html',1,'BEST_TOURS'],['../VrpCommonTypes_8h.html#ad7f47a7cff701a1f1dd9835149b4891a',1,'best_tours(): VrpCommonTypes.h']]], + ['betterbranchobject_40',['betterBranchObject',['../classBlisBranchStrategyBilevel.html#a7312971ad4af8a34041f9b49b3530d96',1,'BlisBranchStrategyBilevel::betterBranchObject()'],['../classBlisBranchStrategyMaxInf.html#ae5b7370e5c528cf671691afc8a1c1a4a',1,'BlisBranchStrategyMaxInf::betterBranchObject()'],['../classBlisBranchStrategyPseudo.html#aa5de3c810d6d728f5421f91e823ca1f5',1,'BlisBranchStrategyPseudo::betterBranchObject()'],['../classBlisBranchStrategyRel.html#ab9d1642fbb540a18e1b789020704e39c',1,'BlisBranchStrategyRel::betterBranchObject()'],['../classBlisBranchStrategyStrong.html#a21b0bd1ea5a150a43ce29c4a93cd3092',1,'BlisBranchStrategyStrong::betterBranchObject()']]], + ['biconnected_41',['biconnected',['../classVrpNetwork.html#a7baa983838a4643f9159b4c77b8fcc81',1,'VrpNetwork::biconnected()'],['../VrpConstants_8h.html#a8525356181ae0ccab3ccad101dd97a36',1,'BICONNECTED(): VrpConstants.h']]], + ['bins_42',['BINS',['../VrpMacros_8h.html#a2b3c5d1f031312cf3827be5d9814c865',1,'VrpMacros.h']]], + ['blis_2eh_43',['Blis.h',['../Blis_8h.html',1,'']]], + ['blis_5fcut_5fdisable_44',['BLIS_CUT_DISABLE',['../Blis_8h.html#ac132ee8e02c4fb123f78ee555b2fbbf5',1,'Blis.h']]], + ['blis_5fcut_5fstat_5ffinal_45',['BLIS_CUT_STAT_FINAL',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca3fb6cef65c12576fd52b125a56f5f357',1,'BlisMessage.h']]], + ['blis_5fcut_5fstat_5fnode_46',['BLIS_CUT_STAT_NODE',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca5aea464d28ffae31ab3575947fd34862',1,'BlisMessage.h']]], + ['blis_5fcutoff_5finc_47',['BLIS_CUTOFF_INC',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7caea1274138f4e4feeed6faf327d7ab6c0',1,'BlisMessage.h']]], + ['blis_5fdummy_5fend_48',['BLIS_DUMMY_END',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7cadf48bcb376d32a23c1496309b0fa3339',1,'BlisMessage.h']]], + ['blis_5ffeas_5fcheck_5ftime_49',['BLIS_FEAS_CHECK_TIME',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca285cb5bc88589409d86aad79545b80ea',1,'BlisMessage.h']]], + ['blis_5fgap_5fno_50',['BLIS_GAP_NO',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca0e3c89116570cbdb34af9ee7574fc8a2',1,'BlisMessage.h']]], + ['blis_5fgap_5fyes_51',['BLIS_GAP_YES',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca674e03cf572ebcce609b3bbd9146e000',1,'BlisMessage.h']]], + ['blis_5fheur_5fbefore_5froot_52',['BLIS_HEUR_BEFORE_ROOT',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7cab1bf25ac3cef314ed29a1feb5c29b2eb',1,'BlisMessage.h']]], + ['blis_5fheur_5fround_5fdisable_53',['BLIS_HEUR_ROUND_DISABLE',['../Blis_8h.html#a74f942d292ddd1d02e10165ceb95c041',1,'Blis.h']]], + ['blis_5fheur_5fstat_5ffinal_54',['BLIS_HEUR_STAT_FINAL',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7cad31c0d556e5c69a6679ea7a7d71c2e15',1,'BlisMessage.h']]], + ['blis_5fheur_5fstat_5fnode_55',['BLIS_HEUR_STAT_NODE',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca2d1d97ffbd5758cd80b8ae541a909951',1,'BlisMessage.h']]], + ['blis_5fmessage_56',['BLIS_Message',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7c',1,'BlisMessage.h']]], + ['blis_5fpseudo_57',['BLIS_PSEUDO',['../Blis_8h.html#ace83b5fd1f267082ce313fef8a4c92bd',1,'Blis.h']]], + ['blis_5froot_5fprocess_58',['BLIS_ROOT_PROCESS',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca2ec73241be5e09dfa5e2e68696507450',1,'BlisMessage.h']]], + ['blis_5froot_5ftime_59',['BLIS_ROOT_TIME',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca3d738226ef67c2c2913e7123f05e197f',1,'BlisMessage.h']]], + ['blis_5fversion_60',['BLIS_VERSION',['../config__blis__default_8h.html#ace8dfb19d653a0fec2c87dec3ed3f041',1,'BLIS_VERSION(): config_blis_default.h'],['../config_8h.html#ace8dfb19d653a0fec2c87dec3ed3f041',1,'BLIS_VERSION(): config.h'],['../config__blis_8h.html#ace8dfb19d653a0fec2c87dec3ed3f041',1,'BLIS_VERSION(): config_blis.h']]], + ['blis_5fversion_5fmajor_61',['BLIS_VERSION_MAJOR',['../config__blis__default_8h.html#ab8c8dffb1d60e178f82766a2b37438e1',1,'BLIS_VERSION_MAJOR(): config_blis_default.h'],['../config_8h.html#ab8c8dffb1d60e178f82766a2b37438e1',1,'BLIS_VERSION_MAJOR(): config.h'],['../config__blis_8h.html#ab8c8dffb1d60e178f82766a2b37438e1',1,'BLIS_VERSION_MAJOR(): config_blis.h']]], + ['blis_5fversion_5fminor_62',['BLIS_VERSION_MINOR',['../config__blis__default_8h.html#afb7d98cbd467d6c9f72fb4b62d565a15',1,'BLIS_VERSION_MINOR(): config_blis_default.h'],['../config_8h.html#afb7d98cbd467d6c9f72fb4b62d565a15',1,'BLIS_VERSION_MINOR(): config.h'],['../config__blis_8h.html#afb7d98cbd467d6c9f72fb4b62d565a15',1,'BLIS_VERSION_MINOR(): config_blis.h']]], + ['blis_5fversion_5frelease_63',['BLIS_VERSION_RELEASE',['../config__blis__default_8h.html#a2872f59f881e1a13ba2c6369a348104a',1,'BLIS_VERSION_RELEASE(): config_blis_default.h'],['../config_8h.html#a2872f59f881e1a13ba2c6369a348104a',1,'BLIS_VERSION_RELEASE(): config.h'],['../config__blis_8h.html#a2872f59f881e1a13ba2c6369a348104a',1,'BLIS_VERSION_RELEASE(): config_blis.h']]], + ['blis_5fw_5flp_64',['BLIS_W_LP',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca8058fac847fba954cb5e0423fbf3b9ed',1,'BlisMessage.h']]], + ['blisbranchingobjecttype_65',['BlisBranchingObjectType',['../Blis_8h.html#af7a46d2369687c03e9be63deb28d1d22',1,'Blis.h']]], + ['blisbranchingobjecttypebilevel_66',['BlisBranchingObjectTypeBilevel',['../Blis_8h.html#af7a46d2369687c03e9be63deb28d1d22a1287258308e765601799ba250178f37a',1,'Blis.h']]], + ['blisbranchingobjecttypeint_67',['BlisBranchingObjectTypeInt',['../Blis_8h.html#af7a46d2369687c03e9be63deb28d1d22abb85e3fce9067e4002a760b1deb2b4a0',1,'Blis.h']]], + ['blisbranchingobjecttypenone_68',['BlisBranchingObjectTypeNone',['../Blis_8h.html#af7a46d2369687c03e9be63deb28d1d22acf93f7d1ef9a137e98b9ebd2fd5183d9',1,'Blis.h']]], + ['blisbranchingobjecttypesos_69',['BlisBranchingObjectTypeSos',['../Blis_8h.html#af7a46d2369687c03e9be63deb28d1d22a89311b926e8c722598fab6cb8f34fce6',1,'Blis.h']]], + ['blisbranchingstrategy_70',['BlisBranchingStrategy',['../Blis_8h.html#a71f5d3b84fc877d267bb12dea9732543',1,'Blis.h']]], + ['blisbranchingstrategybilevel_71',['BlisBranchingStrategyBilevel',['../Blis_8h.html#a71f5d3b84fc877d267bb12dea9732543ab70eed1849e5ab78944b3d42130df453',1,'Blis.h']]], + ['blisbranchingstrategymaxinfeasibility_72',['BlisBranchingStrategyMaxInfeasibility',['../Blis_8h.html#a71f5d3b84fc877d267bb12dea9732543a401846d0b131c919e81b8eae7d5c3a34',1,'Blis.h']]], + ['blisbranchingstrategypseudocost_73',['BlisBranchingStrategyPseudoCost',['../Blis_8h.html#a71f5d3b84fc877d267bb12dea9732543a39bcb7f266952fcf89d95f6aa2c41337',1,'Blis.h']]], + ['blisbranchingstrategyreliability_74',['BlisBranchingStrategyReliability',['../Blis_8h.html#a71f5d3b84fc877d267bb12dea9732543aa53fb0292017e37d267dcbf2d141a078',1,'Blis.h']]], + ['blisbranchingstrategystrong_75',['BlisBranchingStrategyStrong',['../Blis_8h.html#a71f5d3b84fc877d267bb12dea9732543a9f83d4d4fc187b87866ab4e028ad19c2',1,'Blis.h']]], + ['blisbranchobjectbilevel_76',['BlisBranchObjectBilevel',['../classBlisBranchObjectBilevel.html',1,'BlisBranchObjectBilevel'],['../classBlisBranchObjectBilevel.html#a01a57a64e47351d45b1b842082c954cc',1,'BlisBranchObjectBilevel::BlisBranchObjectBilevel()'],['../classBlisBranchObjectBilevel.html#ad4a26abf1e36f673748c810d6fdb4b5f',1,'BlisBranchObjectBilevel::BlisBranchObjectBilevel(BcpsModel *model)'],['../classBlisBranchObjectBilevel.html#a9f0848e204126aa3ad320267791f314c',1,'BlisBranchObjectBilevel::BlisBranchObjectBilevel(const BlisBranchObjectBilevel &rhs)']]], + ['blisbranchobjectbilevel_2eh_77',['BlisBranchObjectBilevel.h',['../BlisBranchObjectBilevel_8h.html',1,'']]], + ['blisbranchobjectint_78',['BlisBranchObjectInt',['../classBlisBranchObjectInt.html',1,'BlisBranchObjectInt'],['../classBlisBranchObjectInt.html#a88dd1394b00b43660bc912b0a9ae6df7',1,'BlisBranchObjectInt::BlisBranchObjectInt()'],['../classBlisBranchObjectInt.html#a68221cd849e2bf7345e13bee3633db60',1,'BlisBranchObjectInt::BlisBranchObjectInt(BlisModel *model, int varInd, int direction, double value)'],['../classBlisBranchObjectInt.html#a7464529d60f5bea04ef81069974631d3',1,'BlisBranchObjectInt::BlisBranchObjectInt(BlisModel *model, int varInd, int intScore, double dblScore, int direction, double value)'],['../classBlisBranchObjectInt.html#a22b2d82d12190067ef7b925f950d619a',1,'BlisBranchObjectInt::BlisBranchObjectInt(BlisModel *model, int varInd, int direction, double lowerValue, double upperValue)'],['../classBlisBranchObjectInt.html#af2d02a34cc36573310b8b34f724cb8b5',1,'BlisBranchObjectInt::BlisBranchObjectInt(const BlisBranchObjectInt &)']]], + ['blisbranchobjectint_2eh_79',['BlisBranchObjectInt.h',['../BlisBranchObjectInt_8h.html',1,'']]], + ['blisbranchstrategybilevel_80',['BlisBranchStrategyBilevel',['../classBlisBranchStrategyBilevel.html',1,'BlisBranchStrategyBilevel'],['../classBlisBranchStrategyBilevel.html#a85025ac7a6c59acacb942405278c0514',1,'BlisBranchStrategyBilevel::BlisBranchStrategyBilevel()'],['../classBlisBranchStrategyBilevel.html#a44f0ce29e4c4226091012ea392e54f62',1,'BlisBranchStrategyBilevel::BlisBranchStrategyBilevel(BlisModel *model)'],['../classBlisBranchStrategyBilevel.html#aff5e2f37666aecaabfb3abcee16dc361',1,'BlisBranchStrategyBilevel::BlisBranchStrategyBilevel(const BlisBranchStrategyBilevel &)']]], + ['blisbranchstrategybilevel_2eh_81',['BlisBranchStrategyBilevel.h',['../BlisBranchStrategyBilevel_8h.html',1,'']]], + ['blisbranchstrategymaxinf_82',['BlisBranchStrategyMaxInf',['../classBlisBranchStrategyMaxInf.html',1,'BlisBranchStrategyMaxInf'],['../classBlisBranchStrategyMaxInf.html#af1aa2b5e6bdf0849f3b81863965ebbb9',1,'BlisBranchStrategyMaxInf::BlisBranchStrategyMaxInf()'],['../classBlisBranchStrategyMaxInf.html#a43991baa0e8dfb6aecc236b834fca1bd',1,'BlisBranchStrategyMaxInf::BlisBranchStrategyMaxInf(BlisModel *model)'],['../classBlisBranchStrategyMaxInf.html#aab7c0c288c7c9b8778be06c35716fdaf',1,'BlisBranchStrategyMaxInf::BlisBranchStrategyMaxInf(const BlisBranchStrategyMaxInf &)']]], + ['blisbranchstrategymaxinf_2eh_83',['BlisBranchStrategyMaxInf.h',['../BlisBranchStrategyMaxInf_8h.html',1,'']]], + ['blisbranchstrategypseudo_84',['BlisBranchStrategyPseudo',['../classBlisBranchStrategyPseudo.html',1,'BlisBranchStrategyPseudo'],['../classBlisBranchStrategyPseudo.html#a57dbbd2127c8848d4f640a378b104dca',1,'BlisBranchStrategyPseudo::BlisBranchStrategyPseudo()'],['../classBlisBranchStrategyPseudo.html#a54d19c7df578565c97be396ea50b61d7',1,'BlisBranchStrategyPseudo::BlisBranchStrategyPseudo(BlisModel *model, int rel)'],['../classBlisBranchStrategyPseudo.html#a83718bea819425be3dedcd1e1fd35b4b',1,'BlisBranchStrategyPseudo::BlisBranchStrategyPseudo(const BlisBranchStrategyPseudo &)']]], + ['blisbranchstrategypseudo_2eh_85',['BlisBranchStrategyPseudo.h',['../BlisBranchStrategyPseudo_8h.html',1,'']]], + ['blisbranchstrategyrel_86',['BlisBranchStrategyRel',['../classBlisBranchStrategyRel.html',1,'BlisBranchStrategyRel'],['../classBlisBranchStrategyRel.html#a81c30de8598bc03940d9c830380fce70',1,'BlisBranchStrategyRel::BlisBranchStrategyRel()'],['../classBlisBranchStrategyRel.html#a7531543174247b6a8c7257d023e0728a',1,'BlisBranchStrategyRel::BlisBranchStrategyRel(BlisModel *model, int rel)'],['../classBlisBranchStrategyRel.html#a9b4337f461249e213af0413ebb25ed22',1,'BlisBranchStrategyRel::BlisBranchStrategyRel(const BlisBranchStrategyRel &)']]], + ['blisbranchstrategyrel_2eh_87',['BlisBranchStrategyRel.h',['../BlisBranchStrategyRel_8h.html',1,'']]], + ['blisbranchstrategystrong_88',['BlisBranchStrategyStrong',['../classBlisBranchStrategyStrong.html',1,'BlisBranchStrategyStrong'],['../classBlisBranchStrategyStrong.html#a766bd30c1c24da0907bd49b4a835d086',1,'BlisBranchStrategyStrong::BlisBranchStrategyStrong()'],['../classBlisBranchStrategyStrong.html#ae298480a40584773936e6e49c1b20615',1,'BlisBranchStrategyStrong::BlisBranchStrategyStrong(BlisModel *model)'],['../classBlisBranchStrategyStrong.html#ab7b25f7b3cdfb5c21c81e4a4569d49b2',1,'BlisBranchStrategyStrong::BlisBranchStrategyStrong(const BlisBranchStrategyStrong &)']]], + ['blisbranchstrategystrong_2eh_89',['BlisBranchStrategyStrong.h',['../BlisBranchStrategyStrong_8h.html',1,'']]], + ['blisconfig_2eh_90',['BlisConfig.h',['../BlisConfig_8h.html',1,'']]], + ['bliscongenerator_91',['BlisConGenerator',['../classBlisConGenerator.html',1,'BlisConGenerator'],['../classBlisConGenerator.html#ab4e4322c28c4d4df53098b1439f31989',1,'BlisConGenerator::BlisConGenerator()'],['../classBlisConGenerator.html#a5dffd1b6fada781c7f137c72f4f7835c',1,'BlisConGenerator::BlisConGenerator(BlisModel *model, CglCutGenerator *generator, const char *name=NULL, BlisCutStrategy strategy=BlisCutStrategyAuto, int cutGenerationFrequency_=1, bool normal=true, bool atSolution=false, bool infeasible=false)'],['../classBlisConGenerator.html#a2c6b4c0a64dfca758f084d81823b0355',1,'BlisConGenerator::BlisConGenerator(const BlisConGenerator &)']]], + ['bliscongenerator_2eh_92',['BlisConGenerator.h',['../BlisConGenerator_8h.html',1,'']]], + ['blisconstraint_93',['BlisConstraint',['../classBlisConstraint.html',1,'BlisConstraint'],['../classBlisConstraint.html#a413baed4f9c24fb815858b881a23c703',1,'BlisConstraint::BlisConstraint()'],['../classBlisConstraint.html#ac5341a6718b808b57d03cd2197f5a094',1,'BlisConstraint::BlisConstraint(int s, const int *ind, const double *val)'],['../classBlisConstraint.html#a3585da418f2b0ab5db1ba340985936f7',1,'BlisConstraint::BlisConstraint(double lbh, double ubh, double lbs, double ubs)'],['../classBlisConstraint.html#a910c921afe12b97614e34061bdcea34c',1,'BlisConstraint::BlisConstraint(double lbh, double ubh, double lbs, double ubs, int size, const int *ind, const double *val)'],['../classBlisConstraint.html#a92af9f1425542b68cd981d6721290d87',1,'BlisConstraint::BlisConstraint(const BlisConstraint &rhs)']]], + ['blisconstraint_2eh_94',['BlisConstraint.h',['../BlisConstraint_8h.html',1,'']]], + ['bliscutstrategy_95',['BlisCutStrategy',['../Blis_8h.html#ab237650b9e9875aaae5ff5570be91bd7',1,'Blis.h']]], + ['bliscutstrategyauto_96',['BlisCutStrategyAuto',['../Blis_8h.html#ab237650b9e9875aaae5ff5570be91bd7aa3c59a77cebe821f169a59ade57a6502',1,'Blis.h']]], + ['bliscutstrategynone_97',['BlisCutStrategyNone',['../Blis_8h.html#ab237650b9e9875aaae5ff5570be91bd7a42681a911e58770ab2e5f108da22790a',1,'Blis.h']]], + ['bliscutstrategynotset_98',['BlisCutStrategyNotSet',['../Blis_8h.html#ab237650b9e9875aaae5ff5570be91bd7a17927e85aeb370fef7e1417e31409233',1,'Blis.h']]], + ['bliscutstrategyperiodic_99',['BlisCutStrategyPeriodic',['../Blis_8h.html#ab237650b9e9875aaae5ff5570be91bd7a3223b15986c1f186776e81eff1a4e9d1',1,'Blis.h']]], + ['bliscutstrategyroot_100',['BlisCutStrategyRoot',['../Blis_8h.html#ab237650b9e9875aaae5ff5570be91bd7aae905699eeb2e5429ac4c003160b6e94',1,'Blis.h']]], + ['blisdecodewarmstart_101',['BlisDecodeWarmStart',['../BlisHelp_8h.html#a641371271a265fac1bd54c5614aabd1f',1,'BlisHelp.h']]], + ['blisencodewarmstart_102',['BlisEncodeWarmStart',['../BlisHelp_8h.html#a79344b8cc43a385b35ce8b5f0b4c14ff',1,'BlisHelp.h']]], + ['blishashingosirowcut_103',['BlisHashingOsiRowCut',['../BlisHelp_8h.html#a684e1a0bb0699f9e4942582eb014e315',1,'BlisHelp.h']]], + ['blishelp_2eh_104',['BlisHelp.h',['../BlisHelp_8h.html',1,'']]], + ['blisheuristic_105',['BlisHeuristic',['../classBlisHeuristic.html',1,'BlisHeuristic'],['../classBlisHeuristic.html#aa237520af076a39377fab09d1966079e',1,'BlisHeuristic::BlisHeuristic()'],['../classBlisHeuristic.html#a615cbd16829a5c546a40311480fa20ef',1,'BlisHeuristic::BlisHeuristic(BlisModel *model, const char *name, BlisHeurStrategy strategy, int heurCallFrequency)'],['../classBlisHeuristic.html#a8e0bbdb1fb1acdc035f59afe2562af11',1,'BlisHeuristic::BlisHeuristic(const BlisHeuristic &rhs)']]], + ['blisheuristic_2eh_106',['BlisHeuristic.h',['../BlisHeuristic_8h.html',1,'']]], + ['blisheurround_107',['BlisHeurRound',['../classBlisHeurRound.html',1,'BlisHeurRound'],['../classBlisHeurRound.html#af9cefbb202c3bc36b027d7368c803f40',1,'BlisHeurRound::BlisHeurRound()'],['../classBlisHeurRound.html#ab032d71838fc02241aaf43c6ab39eb34',1,'BlisHeurRound::BlisHeurRound(BlisModel *model, const char *name, BlisHeurStrategy strategy, int freq)'],['../classBlisHeurRound.html#a90d958753a8814bc5c29e2873e781d3a',1,'BlisHeurRound::BlisHeurRound(const BlisHeurRound &)']]], + ['blisheurround_2eh_108',['BlisHeurRound.h',['../BlisHeurRound_8h.html',1,'']]], + ['blisheurstrategy_109',['BlisHeurStrategy',['../Blis_8h.html#aa5d1dbfb306adc30641ee6bfa592c26a',1,'Blis.h']]], + ['blisheurstrategyauto_110',['BlisHeurStrategyAuto',['../Blis_8h.html#aa5d1dbfb306adc30641ee6bfa592c26aacc772a97a6604e1ee8e0f5db5ca58d7a',1,'Blis.h']]], + ['blisheurstrategybeforeroot_111',['BlisHeurStrategyBeforeRoot',['../Blis_8h.html#aa5d1dbfb306adc30641ee6bfa592c26aa0c22945d8e5501f95a52a330066ea343',1,'Blis.h']]], + ['blisheurstrategynone_112',['BlisHeurStrategyNone',['../Blis_8h.html#aa5d1dbfb306adc30641ee6bfa592c26aac45b2a719be8a58793f84e6626dc7973',1,'Blis.h']]], + ['blisheurstrategynotset_113',['BlisHeurStrategyNotSet',['../Blis_8h.html#aa5d1dbfb306adc30641ee6bfa592c26aa0107d0c18a5deb3e9a4d04a963e89be2',1,'Blis.h']]], + ['blisheurstrategyperiodic_114',['BlisHeurStrategyPeriodic',['../Blis_8h.html#aa5d1dbfb306adc30641ee6bfa592c26aa91180339658dfdfb1d5886dca6db2d2b',1,'Blis.h']]], + ['blisheurstrategyroot_115',['BlisHeurStrategyRoot',['../Blis_8h.html#aa5d1dbfb306adc30641ee6bfa592c26aabe3f1eaa21439c2e991af84350f85dfa',1,'Blis.h']]], + ['blishotstartbranchcorrect_116',['BlisHotStartBranchCorrect',['../Blis_8h.html#a3c78345448a83711e017d7fa6ec339cfac02d6f2cb1c86d3960cbb68c83148fdb',1,'Blis.h']]], + ['blishotstartbranchincorrect_117',['BlisHotStartBranchIncorrect',['../Blis_8h.html#a3c78345448a83711e017d7fa6ec339cfadd1b0e92ab9dc6793252bd37c2322b7b',1,'Blis.h']]], + ['blishotstartstrategy_118',['BlisHotStartStrategy',['../Blis_8h.html#a3c78345448a83711e017d7fa6ec339cf',1,'Blis.h']]], + ['blislicense_2eh_119',['BlisLicense.h',['../BlisLicense_8h.html',1,'']]], + ['blislpstatus_120',['BlisLpStatus',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2ce',1,'Blis.h']]], + ['blislpstatusabandoned_121',['BlisLpStatusAbandoned',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2cea1ffeb36b5483639a3da50c6d91507d7c',1,'Blis.h']]], + ['blislpstatusdualinfeasible_122',['BlisLpStatusDualInfeasible',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2cea5183808da27abb0bb19d63c7f784ca48',1,'Blis.h']]], + ['blislpstatusdualobjlim_123',['BlisLpStatusDualObjLim',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2ceabd804434c984eab6df57153c0e9e087d',1,'Blis.h']]], + ['blislpstatusiterlim_124',['BlisLpStatusIterLim',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2ceab0f1203b22257b6abc8f3472843f27b1',1,'Blis.h']]], + ['blislpstatusoptimal_125',['BlisLpStatusOptimal',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2ceaa567f835dca46d2e76171eae397fe89a',1,'Blis.h']]], + ['blislpstatusprimalinfeasible_126',['BlisLpStatusPrimalInfeasible',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2cea4298eb588aaad5d73a2b90cfc6d53bb3',1,'Blis.h']]], + ['blislpstatusprimalobjlim_127',['BlisLpStatusPrimalObjLim',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2cea39151f41e6feec411dab4eec158a9a28',1,'Blis.h']]], + ['blislpstatusunknown_128',['BlisLpStatusUnknown',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2ceadaadd066401d5812e40f5c2381b7852c',1,'Blis.h']]], + ['blismessage_129',['BlisMessage',['../classBlisMessage.html',1,'BlisMessage'],['../classBlisMessage.html#af412c24a47e7705486c56858b59f579f',1,'BlisMessage::BlisMessage()']]], + ['blismessage_2eh_130',['BlisMessage.h',['../BlisMessage_8h.html',1,'']]], + ['blismessagehandler_131',['blisMessageHandler',['../classBlisModel.html#ac859456755a09471eda699f9378aa88c',1,'BlisModel']]], + ['blismessagehandler_5f_132',['blisMessageHandler_',['../classBlisModel.html#a2c222ab12dce0ab86d7c7e3e0e67eba7',1,'BlisModel']]], + ['blismessages_133',['blisMessages',['../classBlisModel.html#afc209bd417b1edd96caacf19459a975e',1,'BlisModel']]], + ['blismessages_5f_134',['blisMessages_',['../classBlisModel.html#a7c38d7795993ae2b30f84abec3717db3',1,'BlisModel']]], + ['blismodel_135',['BlisModel',['../classBlisModel.html',1,'BlisModel'],['../classBlisModel.html#aecf8cfb5f97e0e5aa8cd152b61a66464',1,'BlisModel::BlisModel()']]], + ['blismodel_2eh_136',['BlisModel.h',['../BlisModel_8h.html',1,'']]], + ['blisnodedesc_137',['BlisNodeDesc',['../classBlisNodeDesc.html',1,'BlisNodeDesc'],['../classBlisNodeDesc.html#a2d8e09a3684862696ad91e29eb12b175',1,'BlisNodeDesc::BlisNodeDesc()'],['../classBlisNodeDesc.html#adc2ed2d0193d46d5c625acdeefb86eca',1,'BlisNodeDesc::BlisNodeDesc(BlisModel *m)']]], + ['blisnodedesc_2eh_138',['BlisNodeDesc.h',['../BlisNodeDesc_8h.html',1,'']]], + ['blisobjectint_139',['BlisObjectInt',['../classBlisObjectInt.html',1,'BlisObjectInt'],['../classBlisObjectInt.html#aa403fbec6f8ebb541203bc2df2baef9d',1,'BlisObjectInt::BlisObjectInt()'],['../classBlisObjectInt.html#ab1fe2f573e59fd6a37331a64c0fe6e09',1,'BlisObjectInt::BlisObjectInt(int objectIndex, int iColumn, double lb, double ub, double breakEven=0.5)'],['../classBlisObjectInt.html#ad4ef7a72dcbedf0234ed8448f632bc0c',1,'BlisObjectInt::BlisObjectInt(const BlisObjectInt &)']]], + ['blisobjectint_2eh_140',['BlisObjectInt.h',['../BlisObjectInt_8h.html',1,'']]], + ['blisosicuttoconstraint_141',['BlisOsiCutToConstraint',['../BlisHelp_8h.html#a1944adba70687fcd9d4c84677454450a',1,'BlisHelp.h']]], + ['blispar_142',['BlisPar',['../classBlisModel.html#a7dd85907cb8240b900c090d8ca26652a',1,'BlisModel']]], + ['blispar_5f_143',['BlisPar_',['../classBlisModel.html#a8db7d533e942d54bc354147aac25ebd5',1,'BlisModel']]], + ['blisparallelconcon_144',['BlisParallelConCon',['../BlisHelp_8h.html#adb093d92d595e1947037eb80709b1eac',1,'BlisHelp.h']]], + ['blisparallelcutcon_145',['BlisParallelCutCon',['../BlisHelp_8h.html#a129fb19e079b0e5d1b9c124a8fe7b003',1,'BlisHelp.h']]], + ['blisparallelcutcut_146',['BlisParallelCutCut',['../BlisHelp_8h.html#a0b87efcaa1a6c49f1ec787d30a73730b',1,'BlisHelp.h']]], + ['blisparams_147',['BlisParams',['../classBlisParams.html',1,'BlisParams'],['../classBlisParams.html#aac92b645a6d1c82ecc2d03957f905ece',1,'BlisParams::BlisParams()']]], + ['blisparams_2eh_148',['BlisParams.h',['../BlisParams_8h.html',1,'']]], + ['blispresolve_149',['BlisPresolve',['../classBlisPresolve.html',1,'BlisPresolve'],['../classBlisPresolve.html#ab30462c1c74306eaa1e4c0771b03f7e3',1,'BlisPresolve::BlisPresolve()']]], + ['blispresolve_2eh_150',['BlisPresolve.h',['../BlisPresolve_8h.html',1,'']]], + ['blispseudo_2eh_151',['BlisPseudo.h',['../BlisPseudo_8h.html',1,'']]], + ['blispseudocost_152',['BlisPseudocost',['../classBlisPseudocost.html',1,'BlisPseudocost'],['../classBlisPseudocost.html#a647596a081096c1f359d2536850ab39d',1,'BlisPseudocost::BlisPseudocost()'],['../classBlisPseudocost.html#a88b3f12a51e59e58a76f0140a2956e1d',1,'BlisPseudocost::BlisPseudocost(double uc, int un, double dc, int dn, double s)'],['../classBlisPseudocost.html#ad0a76791ac81ad4583560a265adfb8ba',1,'BlisPseudocost::BlisPseudocost(const BlisPseudocost &cost)']]], + ['blisreturnstatus_153',['BlisReturnStatus',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95b',1,'Blis.h']]], + ['blisreturnstatusbranch_154',['BlisReturnStatusBranch',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95baddcfcbb88ede4a0ba91b26517847ad3e',1,'Blis.h']]], + ['blisreturnstatuserrlp_155',['BlisReturnStatusErrLp',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95bab402f9fe8c114fb12fe646c715da8822',1,'Blis.h']]], + ['blisreturnstatusfeasible_156',['BlisReturnStatusFeasible',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95baefb5c64c1cedc01d35237e5da2322632',1,'Blis.h']]], + ['blisreturnstatusinfeasible_157',['BlisReturnStatusInfeasible',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95ba94cc9a0302b967622cffb14409d2808f',1,'Blis.h']]], + ['blisreturnstatusok_158',['BlisReturnStatusOk',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95bae8e01076b9b8ee64ccefc96dbad71333',1,'Blis.h']]], + ['blisreturnstatusoverobjlim_159',['BlisReturnStatusOverObjLim',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95ba89c1f4b0bf4d119eca820c51f72d9c86',1,'Blis.h']]], + ['blisreturnstatusunbounded_160',['BlisReturnStatusUnbounded',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95ba441b79d7c77950f789cacf366b2a3007',1,'Blis.h']]], + ['blisreturnstatusunknown_161',['BlisReturnStatusUnknown',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95baafd85acb4ae08d6aaafeac5d25be4f95',1,'Blis.h']]], + ['blissolution_162',['BlisSolution',['../classBlisSolution.html',1,'BlisSolution'],['../classBlisSolution.html#aba7393898200688d6d59bdd36006c5b9',1,'BlisSolution::BlisSolution()'],['../classBlisSolution.html#ae6b56ce68a08ab6bbfe44ec1caff3798',1,'BlisSolution::BlisSolution(int s, const double *values, double objValue)']]], + ['blissolution_2eh_163',['BlisSolution.h',['../BlisSolution_8h.html',1,'']]], + ['blissolutiontype_164',['BlisSolutionType',['../Blis_8h.html#a3196633ad467bf2c04f97f13c36ba5c7',1,'Blis.h']]], + ['blissolutiontypebounding_165',['BlisSolutionTypeBounding',['../Blis_8h.html#a3196633ad467bf2c04f97f13c36ba5c7a0df44c0253d88522bcba2b91890fd04e',1,'Blis.h']]], + ['blissolutiontypebranching_166',['BlisSolutionTypeBranching',['../Blis_8h.html#a3196633ad467bf2c04f97f13c36ba5c7aa6079e9ed39650a1e28066d0c6ef96c4',1,'Blis.h']]], + ['blissolutiontypediving_167',['BlisSolutionTypeDiving',['../Blis_8h.html#a3196633ad467bf2c04f97f13c36ba5c7af28e9801450fdc5ec6af5126a8987f55',1,'Blis.h']]], + ['blissolutiontypeheuristic_168',['BlisSolutionTypeHeuristic',['../Blis_8h.html#a3196633ad467bf2c04f97f13c36ba5c7a15c4f4b452c2ca8f35203cb41d0795f6',1,'Blis.h']]], + ['blissolutiontypestrong_169',['BlisSolutionTypeStrong',['../Blis_8h.html#a3196633ad467bf2c04f97f13c36ba5c7a5a6e390c90bc14171c55c2d92942e774',1,'Blis.h']]], + ['blisstrong_170',['BlisStrong',['../structBlisStrong.html',1,'']]], + ['blisstrongbranch_171',['BlisStrongBranch',['../BlisHelp_8h.html#a54941b0ba67fc4898da14360fe9a6b32',1,'BlisHelp.h']]], + ['blissubtree_2eh_172',['BlisSubTree.h',['../BlisSubTree_8h.html',1,'']]], + ['blistreenode_173',['BlisTreeNode',['../classBlisTreeNode.html',1,'BlisTreeNode'],['../classBlisTreeNode.html#a7497f027959d209520ebee50aecda51f',1,'BlisTreeNode::BlisTreeNode(const BlisTreeNode &)'],['../classBlisTreeNode.html#ab5681cfe586806ba962f2aa59d331408',1,'BlisTreeNode::BlisTreeNode()'],['../classBlisTreeNode.html#ab6783e182916a69811cf799edef84522',1,'BlisTreeNode::BlisTreeNode(BlisModel *m)'],['../classBlisTreeNode.html#a4720f1b15654d0b3cb6781a7cf7f2165',1,'BlisTreeNode::BlisTreeNode(AlpsNodeDesc *&desc)']]], + ['blistreenode_2eh_174',['BlisTreeNode.h',['../BlisTreeNode_8h.html',1,'']]], + ['blisvariable_175',['BlisVariable',['../classBlisVariable.html',1,'BlisVariable'],['../classBlisVariable.html#ae18cc9aa86f234b322ae630eb57406dd',1,'BlisVariable::BlisVariable()'],['../classBlisVariable.html#a26541ecac26bb2e1eb2214641f1042ff',1,'BlisVariable::BlisVariable(double obj, int s, const int *ind, const double *val)'],['../classBlisVariable.html#a761b630c3399ca239d6bdc2394b7c91b',1,'BlisVariable::BlisVariable(double lbh, double ubh, double lbs, double ubs)'],['../classBlisVariable.html#a87ea1a3a674de9ef732bb24a5f3e01d1',1,'BlisVariable::BlisVariable(double lbh, double ubh, double lbs, double ubs, double obj, int s, const int *ind, const double *val)']]], + ['blisvariable_2eh_176',['BlisVariable.h',['../BlisVariable_8h.html',1,'']]], + ['blossom_177',['BLOSSOM',['../VrpConstants_8h.html#acb9ff0884eab7d22349beaa04a7fb1c8',1,'VrpConstants.h']]], + ['bobject_178',['bObject',['../structBlisStrong.html#a4388efe213c37cda5489fe5a72f3f455',1,'BlisStrong']]], + ['boolparams_179',['boolParams',['../classVrpParams.html#a9dd5e6691626b6b8f7cbb3cbc74bfe14',1,'VrpParams']]], + ['both_180',['BOTH',['../VrpConstants_8h.html#a85ddca800985505ab1036cf0d1be748b',1,'VrpConstants.h']]], + ['bound_181',['bound',['../classBlisTreeNode.html#a191b47443d6c266510c3088d524a8321',1,'BlisTreeNode']]], + ['boundingpass_5f_182',['boundingPass_',['../classBlisModel.html#a38161698f3a048f7d9c0432176584685',1,'BlisModel']]], + ['branch_183',['branch',['../classBlisBranchObjectBilevel.html#ad9bb1aaeb60ebd4e9b155c97a1bc3425',1,'BlisBranchObjectBilevel::branch()'],['../classBlisBranchObjectInt.html#acc7daf3351d9334df9843d28daec54d7',1,'BlisBranchObjectInt::branch()'],['../classBlisTreeNode.html#a91db94a2f86858f8bc4d6375b3b4183d',1,'BlisTreeNode::branch(AlpsTreeNode &explicitNode)'],['../classBlisTreeNode.html#a6ea34b12df708917755aed699daed063',1,'BlisTreeNode::branch()']]], + ['brancheddir_5f_184',['branchedDir_',['../classBlisNodeDesc.html#ad7359675ad2b12c28332d22d441caf53',1,'BlisNodeDesc']]], + ['branchedind_5f_185',['branchedInd_',['../classBlisNodeDesc.html#a9cd75ed8745ef6efb0726b4ac984c96f',1,'BlisNodeDesc']]], + ['branchedval_5f_186',['branchedVal_',['../classBlisNodeDesc.html#ab6ff99fc0449d17a14918edb28e4be41',1,'BlisNodeDesc']]], + ['branchingset_5f_187',['branchingSet_',['../classBlisBranchObjectBilevel.html#ad44354bcb1e5cba56da4f964a1825f35',1,'BlisBranchObjectBilevel']]], + ['branchstrategy_188',['branchStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba051ec502bd9f968c04bba84c4bf33c3d',1,'BlisParams::branchStrategy()'],['../classBlisModel.html#ab767bb888c82a53f8435742637dec168',1,'BlisModel::branchStrategy()']]], + ['branchstrategy_5f_189',['branchStrategy_',['../classBlisModel.html#a9655b257da44af62280a8079527fa64f',1,'BlisModel']]], + ['branchstrategyrampup_190',['branchStrategyRampUp',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39bad9b1ecd8ef8ee7371ca3e0aad90c83a1',1,'BlisParams']]], + ['breakeven_191',['breakEven',['../classBlisObjectInt.html#a8e7caeca3326a4acb41dab0fd15bf433',1,'BlisObjectInt']]], + ['breakeven_5f_192',['breakEven_',['../classBlisObjectInt.html#a6450fe693f2973d3f779eeecd0e9265f',1,'BlisObjectInt']]] +]; diff --git a/Doxygen/0.94/search/all_3.html b/Doxygen/0.94/search/all_3.html new file mode 100644 index 0000000..b61b96f --- /dev/null +++ b/Doxygen/0.94/search/all_3.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_3.js b/Doxygen/0.94/search/all_3.js new file mode 100644 index 0000000..1cad24d --- /dev/null +++ b/Doxygen/0.94/search/all_3.js @@ -0,0 +1,102 @@ +var searchData= +[ + ['callheuristics_193',['callHeuristics',['../classBlisTreeNode.html#adb4e9bf61a5b8f5c9bc289c0a40c26e5',1,'BlisTreeNode']]], + ['calls_194',['calls',['../classBlisConGenerator.html#a01446c88bbb3f6e3691da1e9ce039c3d',1,'BlisConGenerator::calls()'],['../classBlisHeuristic.html#ac19e802404f2b675be44db2a26e4a9fc',1,'BlisHeuristic::calls()']]], + ['calls_5f_195',['calls_',['../classBlisConGenerator.html#a4bc08f4aa36d6a7e57a451597cbc2c6a',1,'BlisConGenerator::calls_()'],['../classBlisHeuristic.html#af86e7190f22a8e71415474a73e0b58a9',1,'BlisHeuristic::calls_()']]], + ['capacity_5f_196',['capacity_',['../classVrpModel.html#ac9e75d0aebf98e922e2c667b9f15e9ba',1,'VrpModel']]], + ['cheap_5fedges_197',['CHEAP_EDGES',['../VrpConstants_8h.html#a98031116ef6837420734db4c6f0f1b0d',1,'VrpConstants.h']]], + ['checkinteger_198',['checkInteger',['../classBlisModel.html#a1b6e001901ae369407076b8f92872f5c',1,'BlisModel']]], + ['choosebranchingobject_199',['chooseBranchingObject',['../classBlisTreeNode.html#a5ab668d3f0376f9904a88ec7e5f37911',1,'BlisTreeNode']]], + ['chrparams_200',['chrParams',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4',1,'BlisParams']]], + ['clearsharedobjectmark_201',['clearSharedObjectMark',['../classBlisModel.html#a5f9e6a3951a0ebede72513629338b797',1,'BlisModel']]], + ['clique_202',['CLIQUE',['../VrpConstants_8h.html#a784fe545d9837968740969cc7b1e5a1e',1,'VrpConstants.h']]], + ['clone_203',['clone',['../classBlisBranchObjectBilevel.html#af0b47591c90cb2862ad5cbbf75643234',1,'BlisBranchObjectBilevel::clone()'],['../classBlisBranchObjectInt.html#aae647f199376a9625c1eb1386aa121f2',1,'BlisBranchObjectInt::clone()'],['../classBlisBranchStrategyBilevel.html#aee2add16c1894c1dd734108849faf8c8',1,'BlisBranchStrategyBilevel::clone()'],['../classBlisBranchStrategyMaxInf.html#af43cdd92aa018de15712b0b061541a8c',1,'BlisBranchStrategyMaxInf::clone()'],['../classBlisBranchStrategyPseudo.html#a344e41a34409aa4bb2dbd6cf7310ab39',1,'BlisBranchStrategyPseudo::clone()'],['../classBlisBranchStrategyRel.html#a7886ac8238db81f4567aa43e62e181ff',1,'BlisBranchStrategyRel::clone()'],['../classBlisBranchStrategyStrong.html#a55da718034d1e6571d2f30a078c11f67',1,'BlisBranchStrategyStrong::clone()'],['../classBlisHeuristic.html#a69317c98229c29248906e29c7015ec7e',1,'BlisHeuristic::clone()'],['../classBlisHeurRound.html#a75301ce53c463ad012c497759c0c3862',1,'BlisHeurRound::clone()'],['../classBlisObjectInt.html#a60bb97371f767a1d7f78281ff00397af',1,'BlisObjectInt::clone()']]], + ['coef_5flist_204',['coef_list',['../classVrpCutGenerator.html#a19bfe8e685a5983fd0c6d95ed2e6a3de',1,'VrpCutGenerator']]], + ['coin_5fblis_5fchecklevel_205',['COIN_BLIS_CHECKLEVEL',['../config__default_8h.html#aa2f519ca1070fc682ffbe0daabf3c90d',1,'COIN_BLIS_CHECKLEVEL(): config_default.h'],['../config_8h.html#aa2f519ca1070fc682ffbe0daabf3c90d',1,'COIN_BLIS_CHECKLEVEL(): config.h']]], + ['coin_5fblis_5fverbosity_206',['COIN_BLIS_VERBOSITY',['../config__default_8h.html#a6f29ffe227c86c51d7d06a3da67a09bd',1,'COIN_BLIS_VERBOSITY(): config_default.h'],['../config_8h.html#a6f29ffe227c86c51d7d06a3da67a09bd',1,'COIN_BLIS_VERBOSITY(): config.h']]], + ['coin_5fhas_5falps_207',['COIN_HAS_ALPS',['../config__default_8h.html#a95079b28a7d9ab31501d19e15d21c640',1,'config_default.h']]], + ['coin_5fhas_5fbcps_208',['COIN_HAS_BCPS',['../config__default_8h.html#a3fd1a3d3fe5794c73b8e94ede5504178',1,'config_default.h']]], + ['coin_5fhas_5fblis_209',['COIN_HAS_BLIS',['../config__default_8h.html#aa52f74a7bd72031f9c30074b5b1ebf21',1,'config_default.h']]], + ['coin_5fhas_5fclp_210',['COIN_HAS_CLP',['../config__default_8h.html#aa647ba0f32c1ba872d2c4d45cf9cc096',1,'config_default.h']]], + ['coin_5fhas_5fcoindepend_211',['COIN_HAS_COINDEPEND',['../config_8h.html#a9fb63efede1bfb172445da014a0a92bf',1,'config.h']]], + ['coin_5fhas_5fcoinutils_212',['COIN_HAS_COINUTILS',['../config__default_8h.html#a3d2273b012898f0612a5de41b8d20ebb',1,'config_default.h']]], + ['coin_5fhas_5fsample_213',['COIN_HAS_SAMPLE',['../config_8h.html#a8ea44e87e1d5c8c821de2055bb250662',1,'config.h']]], + ['colmatrix_5f_214',['colMatrix_',['../classBlisModel.html#a4d484f2ff1f20ee1d8fd93bf2ea95b2a',1,'BlisModel']]], + ['coltype_5f_215',['colType_',['../classBlisModel.html#ae2e579a6fcabbb3f34cc5eb02512f709',1,'BlisModel']]], + ['columnindex_216',['columnIndex',['../classBlisObjectInt.html#a9b1a01c7513c64fd2612ff8121b62fb4',1,'BlisObjectInt']]], + ['columnindex_5f_217',['columnIndex_',['../classBlisObjectInt.html#af52c5dff0680028232e04921a26e0524',1,'BlisObjectInt']]], + ['comb_218',['COMB',['../VrpConstants_8h.html#a44cdd9118918dc1dd6d15c05465ba2fd',1,'VrpConstants.h']]], + ['comp_219',['comp',['../structVERTEX.html#a350acd472ed647c46f508a85854ca748',1,'VERTEX']]], + ['compcuts_5f_220',['compCuts_',['../classVrpNetwork.html#a6cf405d9121977a6327076fd3d2525a3',1,'VrpNetwork']]], + ['compdemands_5f_221',['compDemands_',['../classVrpNetwork.html#a8d49ffff83cbde8652811f03981a0a59',1,'VrpNetwork']]], + ['compmembers_5f_222',['compMembers_',['../classVrpNetwork.html#ac5d4a77b99add20ab18cc95f924f4ab6',1,'VrpNetwork']]], + ['compnodes_5f_223',['compNodes_',['../classVrpNetwork.html#a7f1b186a8e401bc93dd1a0751950cb04',1,'VrpNetwork']]], + ['computecompnums_224',['computeCompNums',['../classVrpNetwork.html#a90902e0f7fe888722e4b2456445ee287',1,'VrpNetwork']]], + ['computecost_225',['computeCost',['../classVrpModel.html#acb762e5dec499955ea21ffe9ecbd239c',1,'VrpModel']]], + ['config_2eh_226',['config.h',['../config_8h.html',1,'']]], + ['config_5fblis_2eh_227',['config_blis.h',['../config__blis_8h.html',1,'']]], + ['config_5fblis_5fdefault_2eh_228',['config_blis_default.h',['../config__blis__default_8h.html',1,'']]], + ['config_5fdefault_2eh_229',['config_default.h',['../config__default_8h.html',1,'']]], + ['conlb_230',['conLB',['../classBlisModel.html#ad60922b4632ed4a0c3788f7ec086e3c9',1,'BlisModel']]], + ['conlb_5f_231',['conLB_',['../classBlisModel.html#a83af2a8261c9053991924efb91bb8fa1',1,'BlisModel']]], + ['connected_232',['connected',['../classVrpNetwork.html#a2c42198552aab3efc174913e53800fb1',1,'VrpNetwork::connected()'],['../VrpConstants_8h.html#af6202935c026af12978d46a765dafb90',1,'CONNECTED(): VrpConstants.h']]], + ['connectivitycuts_233',['connectivityCuts',['../classVrpCutGenerator.html#a375334752cd0ed4eef7e116f9166790f',1,'VrpCutGenerator']]], + ['conrandoms_5f_234',['conRandoms_',['../classBlisModel.html#a56328a9081738fda77dc2fd597d85f0e',1,'BlisModel']]], + ['constraintpool_235',['constraintPool',['../classBlisModel.html#a0a223f7df2d2e08f38b2dbd7879f6af9',1,'BlisModel']]], + ['constraintpool_5f_236',['constraintPool_',['../classBlisModel.html#afeccd0210e20452f8b6ae2d17372bcff',1,'BlisModel']]], + ['constraintpoolreceive_237',['constraintPoolReceive',['../classBlisModel.html#ad6dbfdc54ac9e99606893fae2b5fa215',1,'BlisModel']]], + ['constraintpoolreceive_5f_238',['constraintPoolReceive_',['../classBlisModel.html#a93165526f79f2ae1b34a4c5fa7a5c7e7',1,'BlisModel']]], + ['constraintpoolsend_239',['constraintPoolSend',['../classBlisModel.html#a80f370e8a76a1baed42e13163a1343e9',1,'BlisModel']]], + ['constraintpoolsend_5f_240',['constraintPoolSend_',['../classBlisModel.html#acdb0fc5b594f398b8d9f43f4c84ace92',1,'BlisModel']]], + ['conub_241',['conUB',['../classBlisModel.html#af08cca862bdd7048c6cefe5862d6860f',1,'BlisModel']]], + ['conub_5f_242',['conUB_',['../classBlisModel.html#ae3b4e24670d5481a949dbef2095d0c26',1,'BlisModel']]], + ['converttoexplicit_243',['convertToExplicit',['../classBlisTreeNode.html#ad638cc75118d58d3e2fd216a05191a8c',1,'BlisTreeNode']]], + ['converttorelative_244',['convertToRelative',['../classBlisTreeNode.html#a098c6b544096ac7d0b2d5a38a9e704c7',1,'BlisTreeNode']]], + ['coordx_5f_245',['coordx_',['../classVrpModel.html#ae58a817d94bf639964ea4ed61dbc5088',1,'VrpModel']]], + ['coordy_5f_246',['coordy_',['../classVrpModel.html#af046272edb6dac5a021391888e0a3571',1,'VrpModel']]], + ['coordz_5f_247',['coordz_',['../classVrpModel.html#a7eb762d403974ef00f89c35c72ca2ecf',1,'VrpModel']]], + ['cost_248',['cost',['../structROUTE__DATA.html#af7f58b48e8dc9e68b145da298ca7ff1f',1,'ROUTE_DATA::cost()'],['../structBEST__TOURS.html#a97916f3e3aaeab3968da2b1c5c6f6c6b',1,'BEST_TOURS::cost()'],['../structEDGE__DATA.html#acfa3bfcdb4e477b8e3392ec41eaf2463',1,'EDGE_DATA::cost()'],['../structEDGE.html#a14b73ce303514fbb2aab2141f7bfadfa',1,'EDGE::cost()']]], + ['createadjlist_249',['createAdjList',['../classVrpHeurTSP.html#a09b210c13a3a2e03069808fb215178db',1,'VrpHeurTSP']]], + ['createbranchobject_250',['createBranchObject',['../classBlisObjectInt.html#aa9d35ebde86cc42203312516e3d3dc05',1,'BlisObjectInt']]], + ['createcandbranchobjects_251',['createCandBranchObjects',['../classBlisBranchStrategyBilevel.html#aad896ce5047233cbb36614d129fbf8c0',1,'BlisBranchStrategyBilevel::createCandBranchObjects()'],['../classBlisBranchStrategyMaxInf.html#acaddcf01d9015a70e50cce9a610e852f',1,'BlisBranchStrategyMaxInf::createCandBranchObjects()'],['../classBlisBranchStrategyPseudo.html#a820addbd3a432ce902c60a0bbfb7a235',1,'BlisBranchStrategyPseudo::createCandBranchObjects()'],['../classBlisBranchStrategyRel.html#a5cd0c38e453609dc60e0e9b30b2c5f19',1,'BlisBranchStrategyRel::createCandBranchObjects()'],['../classBlisBranchStrategyStrong.html#a418a63c061beb6730eba77ebceb1e4db',1,'BlisBranchStrategyStrong::createCandBranchObjects()']]], + ['createintgerobjects_252',['createIntgerObjects',['../classBlisModel.html#af24135d10b535cdb39ad3c814edb5f96',1,'BlisModel']]], + ['createkeywordlist_253',['createKeywordList',['../classVrpParams.html#a4db04bf3dff6f5761b03f1aa63b98655',1,'VrpParams::createKeywordList()'],['../classBlisParams.html#a32474a6065f10a229d1d466883815bac',1,'BlisParams::createKeywordList()']]], + ['createnet_254',['createNet',['../classVrpModel.html#abf0b47d9804470811f986f23e1f3bafb',1,'VrpModel::createNet()'],['../classVrpNetwork.html#aaefabce90a76b5e6b4cfcedc5f46252e',1,'VrpNetwork::createNet()']]], + ['createnewtreenode_255',['createNewTreeNode',['../classBlisTreeNode.html#a1424b02415188154020fca933b11f508',1,'BlisTreeNode']]], + ['createobjects_256',['createObjects',['../classBlisModel.html#a0b397deb3e5c6185b098a4612f560fbc',1,'BlisModel']]], + ['createosirowcut_257',['createOsiRowCut',['../classBlisConstraint.html#a1ae67954b53bab487b2dfaf31f9f2723',1,'BlisConstraint']]], + ['createroot_258',['createRoot',['../classBlisModel.html#aa06c197451ebf7ca9ebf97c620903e91',1,'BlisModel']]], + ['currabsgap_5f_259',['currAbsGap_',['../classBlisModel.html#a9b657906913b688b3658aac3e2f15c49',1,'BlisModel']]], + ['currrelgap_5f_260',['currRelGap_',['../classBlisModel.html#a9494ad50b310de5b8d6831672b7c84c7',1,'BlisModel']]], + ['cutcliquefreq_261',['cutCliqueFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39baf859df4eeda27456c717776ed29c7377',1,'BlisParams']]], + ['cutcliquestrategy_262',['cutCliqueStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba7688621f5800ed30e1ee1a110a5e2d7f',1,'BlisParams']]], + ['cutfactor_263',['cutFactor',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271a02b8c313b21534bc753c37de7bf5f446',1,'BlisParams']]], + ['cutflowcoverfreq_264',['cutFlowCoverFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39bad3f2839467dc0ee17d62e43682f59f3d',1,'BlisParams']]], + ['cutflowcoverstrategy_265',['cutFlowCoverStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba0ea34cb530c1745ac74b917832337186',1,'BlisParams']]], + ['cutgenerationfreq_266',['cutGenerationFreq',['../classBlisConGenerator.html#a3fe556af32fdc462c174f0a8f7c477e0',1,'BlisConGenerator']]], + ['cutgenerationfrequency_267',['cutGenerationFrequency',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39baa2c8add616eeb74d75c7c41c8fe87285',1,'BlisParams']]], + ['cutgenerationfrequency_5f_268',['cutGenerationFrequency_',['../classBlisConGenerator.html#ad3601b437e212de0ffba3e0345f6edc9',1,'BlisConGenerator::cutGenerationFrequency_()'],['../classBlisModel.html#a10a3441c898d1712aa5c1f06c6815262',1,'BlisModel::cutGenerationFrequency_()']]], + ['cutgenerators_269',['cutGenerators',['../classBlisModel.html#a9c3f748eaa747d3d224699d96550f2e3',1,'BlisModel']]], + ['cutgomoryfreq_270',['cutGomoryFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39baffb1f883e94f2e15124e94b143608f64',1,'BlisParams']]], + ['cutgomorystrategy_271',['cutGomoryStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39badd98285708b0ef3709afd73c64c4732e',1,'BlisParams']]], + ['cutknapsackfreq_272',['cutKnapsackFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39babd2b2e9036852a332eb3c7be1275107f',1,'BlisParams']]], + ['cutknapsackstrategy_273',['cutKnapsackStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39badb4a4e02dc9edd3c1847ff6af381a126',1,'BlisParams']]], + ['cutlist_5f_274',['cutList_',['../classVrpCutGenerator.html#af5ea47cc7e91943480a63ea8d36bd965',1,'VrpCutGenerator']]], + ['cutmirfreq_275',['cutMirFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba5866dc3f9887600a6c169bcf0b4dc15c',1,'BlisParams']]], + ['cutmirstrategy_276',['cutMirStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba427a5167c8e93148d727a2e752a11bee',1,'BlisParams']]], + ['cutoddholefreq_277',['cutOddHoleFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39baab4f37ac2a6cc179ab3be8942b3e38cc',1,'BlisParams']]], + ['cutoddholestrategy_278',['cutOddHoleStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39baae13cf74149fcaaac172269a2b4fcf07',1,'BlisParams']]], + ['cutoff_279',['cutoff',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271ad9c51a79f1d70ad005ebc944d69cd946',1,'BlisParams']]], + ['cutoff_5f_280',['cutoff_',['../classBlisModel.html#a7466cb4d6fafc464f762e59eb7e18ce6',1,'BlisModel']]], + ['cutoffinc_281',['cutoffInc',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271a167cfc85150502fdefd6cefbd56402ae',1,'BlisParams']]], + ['cutoffinc_5f_282',['cutoffInc_',['../classBlisModel.html#ae30764dc0fe1adcd4fc167c69d7c1879',1,'BlisModel']]], + ['cutpass_283',['cutPass',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39baba8fffce01f3b1da6273c863cab0f818',1,'BlisParams']]], + ['cutprobingfreq_284',['cutProbingFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba3bd96e01f5ed09b6db3364c52c9cc775',1,'BlisParams']]], + ['cutprobingstrategy_285',['cutProbingStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba30b06b635d1f0fbfceca81a8b8441f17',1,'BlisParams']]], + ['cutrampup_286',['cutRampUp',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4a6291c0fe6248c9c96059cdcca67789ba',1,'BlisParams']]], + ['cutstrategy_287',['cutStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba609de0f06a99b5a1b14d7f23afbb7b20',1,'BlisParams']]], + ['cutstrategy_5f_288',['cutStrategy_',['../classBlisModel.html#a28da2231361be50f5547ec96ca22b64a',1,'BlisModel']]], + ['cuttwomirfreq_289',['cutTwoMirFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba7fb27f66d4f3f85755de925c4d01fb2e',1,'BlisParams']]], + ['cuttwomirstrategy_290',['cutTwoMirStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba50158579b3a6ed6ff94cc59ff0247381',1,'BlisParams']]], + ['cutval_5f_291',['cutVal_',['../classVrpCutGenerator.html#a1bfe959afd9b715aed22685b04728ff4',1,'VrpCutGenerator']]] +]; diff --git a/Doxygen/0.94/search/all_4.html b/Doxygen/0.94/search/all_4.html new file mode 100644 index 0000000..06de155 --- /dev/null +++ b/Doxygen/0.94/search/all_4.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_4.js b/Doxygen/0.94/search/all_4.js new file mode 100644 index 0000000..8106476 --- /dev/null +++ b/Doxygen/0.94/search/all_4.js @@ -0,0 +1,33 @@ +var searchData= +[ + ['data_292',['data',['../structELIST.html#a5c001c5da03be92145ff8c0667d5b662',1,'ELIST']]], + ['dblparams_293',['dblParams',['../classVrpParams.html#a85f3836b3d058d1e521594f81023ab1f',1,'VrpParams::dblParams()'],['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271',1,'BlisParams::dblParams()']]], + ['dead_294',['DEAD',['../VrpConstants_8h.html#a3c8793c7acb4598d2ebcd8288f29ee69',1,'VrpConstants.h']]], + ['decode_295',['decode',['../classVrpSolution.html#a692f07f58fe2ee59d70df0fed8ff7f36',1,'VrpSolution::decode()'],['../classVrpVariable.html#ace77fe9d210c78007041b797154b3883',1,'VrpVariable::decode()'],['../classBlisBranchObjectBilevel.html#a0c8291362bcdefe7abcd9a48b80bb0b4',1,'BlisBranchObjectBilevel::decode()'],['../classBlisBranchObjectInt.html#af1c724af5ca3b4b34b6806fb860b4080',1,'BlisBranchObjectInt::decode()'],['../classBlisConstraint.html#a7a0201445e5f12a2af8ac380689d76f5',1,'BlisConstraint::decode()'],['../classBlisNodeDesc.html#a46d6f8161adb0e841e6685b7ed5c41f8',1,'BlisNodeDesc::decode()'],['../classBlisPseudocost.html#a3e66aa0a6004338f3d0d07b98a7c3077',1,'BlisPseudocost::decode()'],['../classBlisSolution.html#afeb6bcb9c5e93bb2eb257fa7564976af',1,'BlisSolution::decode()'],['../classBlisTreeNode.html#a34defb4ea9b5f0ae6114a50e65128a44',1,'BlisTreeNode::decode()'],['../classBlisVariable.html#a90264ddd0119c3e1ac3c22d83c96bd47',1,'BlisVariable::decode()']]], + ['decodeblis_296',['decodeBlis',['../classBlisBranchObjectBilevel.html#aaa4c4ed5cce8605fbd6885edbfe4536f',1,'BlisBranchObjectBilevel::decodeBlis()'],['../classBlisBranchObjectInt.html#a2304fc0e0a9cce30453ca0415f8d8ae1',1,'BlisBranchObjectInt::decodeBlis()'],['../classBlisConstraint.html#a59d9cfbb0e604345073435d79e2df273',1,'BlisConstraint::decodeBlis()'],['../classBlisModel.html#ae9c77ad991165335e43e9d369c27e88e',1,'BlisModel::decodeBlis()'],['../classBlisNodeDesc.html#a20e9819cf1d6bef4651e105fdc1db975',1,'BlisNodeDesc::decodeBlis()'],['../classBlisVariable.html#ab000d52c504c87e953b465f8129a0d0f',1,'BlisVariable::decodeBlis()']]], + ['decodefrom_297',['decodeFrom',['../classBlisPseudocost.html#a9342410d9a9e61f56ffa2bbde00f12ab',1,'BlisPseudocost']]], + ['decodetoself_298',['decodeToSelf',['../classVrpModel.html#a82507812bc16a3776bead63b4361bcda',1,'VrpModel::decodeToSelf()'],['../classBlisModel.html#af414d2dd65b47bacb503eed9bbaf0edd',1,'BlisModel::decodeToSelf()']]], + ['decodevrp_299',['decodeVrp',['../classVrpModel.html#a1dabf5ddb9dd94f525b7cb21bc19d55b',1,'VrpModel::decodeVrp()'],['../classVrpVariable.html#aa2020aebe9fd0e898a5fedf670639a3f',1,'VrpVariable::decodeVrp()']]], + ['degree_300',['degree',['../structVERTEX.html#a9398df0d3e010f46e0139f55afb9d35e',1,'VERTEX']]], + ['del_5fedgenum_301',['del_edgenum',['../structSMALL__GRAPH.html#a9067213cf0c90800984adad2ad70f8e4',1,'SMALL_GRAPH']]], + ['delete_5fand_302',['DELETE_AND',['../VrpConstants_8h.html#a721fb40162f2c6c5ace387dc38bcbf95',1,'VrpConstants.h']]], + ['delete_5fpower_303',['DELETE_POWER',['../VrpConstants_8h.html#ac24f9c530dd23db15fed2fa3ae1a911f',1,'VrpConstants.h']]], + ['deleted_304',['deleted',['../structEDGE.html#ade771f19c4612b9037a2a135ec880447',1,'EDGE::deleted()'],['../structVERTEX.html#a3f786cd698a056f3191822b8a8f1eeaa',1,'VERTEX::deleted()']]], + ['deleteobjects_305',['deleteObjects',['../classBlisModel.html#a1f2205b2d62158e48daa6297a62af618',1,'BlisModel']]], + ['deloldconstraints_306',['delOldConstraints',['../classBlisModel.html#a0af20550e0c6c09b6815a689a3ca5306',1,'BlisModel']]], + ['demand_307',['demand',['../structVERTEX.html#aacfeb5f6ffc4832aeb0d4ce329ebe1d8',1,'VERTEX']]], + ['demand_5f_308',['demand_',['../classVrpModel.html#a4c3e624760c633993f83978c128484af',1,'VrpModel']]], + ['denseconcutoff_5f_309',['denseConCutoff_',['../classBlisModel.html#a447fcedf0c893166b43a92d32f473b59',1,'BlisModel']]], + ['denseconfactor_310',['denseConFactor',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271aa7818d1987fda42ff43ab80d34bbdc4d',1,'BlisParams']]], + ['depot_5f_311',['depot_',['../classVrpModel.html#afc29f794b221bf61c18ee1d30941dcfb',1,'VrpModel']]], + ['depot_5fpenalty_312',['DEPOT_PENALTY',['../VrpConstants_8h.html#a48adfcc42f80804fc216c95b51b1ce45',1,'VrpConstants.h']]], + ['depthfirstsearch_313',['depthFirstSearch',['../classVrpNetwork.html#a2102b7b9dfaa32ffcb1539fe7a661678',1,'VrpNetwork']]], + ['dfnumber_314',['dfnumber',['../structVERTEX.html#a8390cefd5ac74126e371fe4338e1a80d',1,'VERTEX']]], + ['difference_315',['difference',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba8fa2a0221527e06bbefee2d5f3695784',1,'BlisParams']]], + ['display_5fdata_316',['DISPLAY_DATA',['../VrpConstants_8h.html#a51e58eb1cf6de3f615a728727baccce6',1,'VrpConstants.h']]], + ['doextrainroot_317',['doExtraInRoot',['../classVrpParams.html#a9dd5e6691626b6b8f7cbb3cbc74bfe14ad720c75a74c837049dc5d2a4c099abf8',1,'VrpParams']]], + ['dogreedy_318',['doGreedy',['../classVrpParams.html#a9dd5e6691626b6b8f7cbb3cbc74bfe14a39cc24a560ee2dfbfba575c38171aef4',1,'VrpParams']]], + ['down_5f_319',['down_',['../classBlisBranchObjectInt.html#ad9dfe5ab6ae2b6c37dca61010b53a622',1,'BlisBranchObjectInt']]], + ['downcost_5f_320',['downCost_',['../classBlisPseudocost.html#a96efd371c9c626c8d88446de86566eb1',1,'BlisPseudocost']]], + ['downcount_5f_321',['downCount_',['../classBlisPseudocost.html#a8dd92e42b645fa540ee9b24b1dd06797',1,'BlisPseudocost']]] +]; diff --git a/Doxygen/0.94/search/all_5.html b/Doxygen/0.94/search/all_5.html new file mode 100644 index 0000000..2544c4e --- /dev/null +++ b/Doxygen/0.94/search/all_5.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_5.js b/Doxygen/0.94/search/all_5.js new file mode 100644 index 0000000..9ad56cb --- /dev/null +++ b/Doxygen/0.94/search/all_5.js @@ -0,0 +1,31 @@ +var searchData= +[ + ['edge_322',['EDGE',['../structEDGE.html',1,'EDGE'],['../VrpNetwork_8h.html#aa7318ad4bf57dc8a6975ba747c2b3082',1,'edge(): VrpNetwork.h']]], + ['edge_5fdata_323',['EDGE_DATA',['../structEDGE__DATA.html',1,'EDGE_DATA'],['../VrpCommonTypes_8h.html#a6e47de6b8c9af95be6aaaf64a6bd632f',1,'edge_data(): VrpCommonTypes.h']]], + ['edgecolmatch_5f_324',['edgeColMatch_',['../classVrpHeurTSP.html#a2f122a3a0e59d35adb2ef8b007beddcb',1,'VrpHeurTSP']]], + ['edgenum_325',['edgenum',['../structSMALL__GRAPH.html#ae4ff16180eee38306abbaf00ece309c6',1,'SMALL_GRAPH']]], + ['edgenum_5f_326',['edgenum_',['../classVrpModel.html#a42c0678d07f257009402ab57f1f1af4d',1,'VrpModel::edgenum_()'],['../classVrpNetwork.html#a7be4ad3f923f6627c6e74afc4e95d141',1,'VrpNetwork::edgenum_()']]], + ['edges_327',['edges',['../structSMALL__GRAPH.html#af757402b0c84740cc812d62ce90dfa63',1,'SMALL_GRAPH']]], + ['edges_5f_328',['edges_',['../classVrpModel.html#a288805532e2dc9d4c31297768c8c5e1f',1,'VrpModel::edges_()'],['../classVrpNetwork.html#a7fc48b1db05672e69fb43b9347e7e0ef',1,'VrpNetwork::edges_()']]], + ['elist_329',['ELIST',['../structELIST.html',1,'ELIST'],['../VrpNetwork_8h.html#ad44645af1ee482355dff890ea0f80aa9',1,'elist(): VrpNetwork.h']]], + ['encode_330',['encode',['../classVrpModel.html#acb1af174fc6aff89bb40244f39819a3f',1,'VrpModel::encode()'],['../classVrpSolution.html#a473080e4f3e12f4980e0ec693571d565',1,'VrpSolution::encode()'],['../classVrpVariable.html#a47e26b64489a565c3088c530d271d79d',1,'VrpVariable::encode()'],['../classBlisBranchObjectBilevel.html#af1ed1620dbeead0d8c4494b6c69d254f',1,'BlisBranchObjectBilevel::encode()'],['../classBlisBranchObjectInt.html#a10d23ac34a084b642f916df0bd240937',1,'BlisBranchObjectInt::encode()'],['../classBlisConstraint.html#abb5dc36f65915b4ef9c7bd188a576ce6',1,'BlisConstraint::encode()'],['../classBlisModel.html#a8f410c8c49d7ecb0890165deeede60a2',1,'BlisModel::encode()'],['../classBlisNodeDesc.html#ac55c292c4b5da1af7273e5bc09eb713c',1,'BlisNodeDesc::encode()'],['../classBlisPseudocost.html#a182283af05a8b029e74f2bda33afc58d',1,'BlisPseudocost::encode()'],['../classBlisSolution.html#a253040cf88d3ab2e93d4300aaaf373de',1,'BlisSolution::encode()'],['../classBlisTreeNode.html#af69d5140ee5b731957338a5b60f050b4',1,'BlisTreeNode::encode()'],['../classBlisVariable.html#ad5230860d87135e663fef5b4e33bf949',1,'BlisVariable::encode()']]], + ['encodeblis_331',['encodeBlis',['../classBlisBranchObjectBilevel.html#aaa1632928e5b0e6554349e7bfa9e3664',1,'BlisBranchObjectBilevel::encodeBlis()'],['../classBlisBranchObjectInt.html#a75eea283f6514c7e2fd44104ab7cafc1',1,'BlisBranchObjectInt::encodeBlis()'],['../classBlisConstraint.html#ad0bc07cb2b9180d4bc0f5c12b8d80a5b',1,'BlisConstraint::encodeBlis()'],['../classBlisModel.html#a904d4146b9f172a7b4774d2690177d02',1,'BlisModel::encodeBlis()'],['../classBlisNodeDesc.html#ab5e426ef6239acf66db89159b5c23e9d',1,'BlisNodeDesc::encodeBlis()'],['../classBlisVariable.html#af8f9659fcdd9d26a08ab1dc77206029c',1,'BlisVariable::encodeBlis()']]], + ['encodeto_332',['encodeTo',['../classBlisPseudocost.html#ad9d520583d96a29df0dc6a312664bf35',1,'BlisPseudocost']]], + ['encodevrp_333',['encodeVrp',['../classVrpModel.html#ac94f13a6e224d40f643388c3dbc11303',1,'VrpModel::encodeVrp()'],['../classVrpVariable.html#ab5c3c47340a13720a1091980cdd05805',1,'VrpVariable::encodeVrp()']]], + ['endofboolparams_334',['endOfBoolParams',['../classVrpParams.html#a9dd5e6691626b6b8f7cbb3cbc74bfe14aa9607bec43e52d7b4d6ce4cd73700d27',1,'VrpParams']]], + ['endofchrparams_335',['endOfChrParams',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4a12be3e65e17dd8ee1f84d820afd7e1b1',1,'BlisParams']]], + ['endofdblparams_336',['endOfDblParams',['../classVrpParams.html#a85f3836b3d058d1e521594f81023ab1fa6a3625f55b1ea3229f58f6577caf094d',1,'VrpParams::endOfDblParams()'],['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271a7ba9aedfe7d66e5156a7c15e4cb43500',1,'BlisParams::endOfDblParams()']]], + ['endofintparams_337',['endOfIntParams',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3eaf801b5ba896f4d86cf86e712a43c8da2',1,'VrpParams::endOfIntParams()'],['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba0086d3b3ae29993b1d3d4f3f3e4e41da',1,'BlisParams::endOfIntParams()']]], + ['endofstrarrayparams_338',['endOfStrArrayParams',['../classVrpParams.html#a2b9941906895258be908386a7be043aea4a6e52c0a422e8c38bee906c4dabe915',1,'VrpParams::endOfStrArrayParams()'],['../classBlisParams.html#a50235e57390e794f0cc2420b0383dc6daf59577820eea3cbea7d2205e65ee26a9',1,'BlisParams::endOfStrArrayParams()']]], + ['endofstrparams_339',['endOfStrParams',['../classVrpParams.html#ae81aaae2cdbe79b5e2081d2284f46448ae68c8f62256dc6f0ecbef61f9ed82cd9',1,'VrpParams::endOfStrParams()'],['../classBlisParams.html#ad6e0e869ed765edc2ebee19032d1384aa3c57599dce755f21b087c67c4af74d14',1,'BlisParams::endOfStrParams()']]], + ['ends_5f_340',['ends_',['../classVrpVariable.html#a587b44219cacec920bbef9b588993284',1,'VrpVariable']]], + ['enodenum_341',['enodenum',['../structVERTEX.html#a34e35fa4a0bf442cf88d1a845a3e19a5',1,'VERTEX']]], + ['entry_342',['entry',['../classVrpParams.html#a5d1e6c1edbc844d0e2d502f5ada2d45b',1,'VrpParams::entry(const boolParams key) const'],['../classVrpParams.html#af13ae5b571ed9afc9c8d0f74d0c3adeb',1,'VrpParams::entry(const intParams key) const'],['../classVrpParams.html#ab268135ebac022d6dbf57fa5cf8a6032',1,'VrpParams::entry(const dblParams key) const'],['../classVrpParams.html#ace279bf97295d07ed3a31ac31fa35c06',1,'VrpParams::entry(const strParams key) const'],['../classVrpParams.html#aecf03d80e56e0f69c95997c3cbb9f6fb',1,'VrpParams::entry(const strArrayParams key) const'],['../classBlisParams.html#a9e9cc7d966810c100d0d9c76f62b85df',1,'BlisParams::entry(const chrParams key) const'],['../classBlisParams.html#ac1c581de649f4c809dd4a233c12a167c',1,'BlisParams::entry(const intParams key) const'],['../classBlisParams.html#a57e8f6e79febf19711d017843e1b7132',1,'BlisParams::entry(const dblParams key) const'],['../classBlisParams.html#a88dac9582910af5b14d179eda0269ad3',1,'BlisParams::entry(const strParams key) const'],['../classBlisParams.html#aa82257357cf9af6360813b93eee7abaf',1,'BlisParams::entry(const strArrayParams key) const']]], + ['estimatesolution_343',['estimateSolution',['../classBlisTreeNode.html#a04554b18f39b512b90b02cb25f39ee78',1,'BlisTreeNode']]], + ['etol_5f_344',['etol_',['../classVrpModel.html#a824cbee748d6e77838a252319e0c490c',1,'VrpModel']]], + ['everything_5fis_5fbase_345',['EVERYTHING_IS_BASE',['../VrpConstants_8h.html#aaa913c01ff8dfdd2e6f3b15cc6c2bd62',1,'VrpConstants.h']]], + ['everything_5fis_5fextra_346',['EVERYTHING_IS_EXTRA',['../VrpConstants_8h.html#ab7f22278c29d26012d7dc050e3c4a279',1,'VrpConstants.h']]], + ['exchange_347',['EXCHANGE',['../VrpConstants_8h.html#a190fa10f4f5535daadec3efea51f5aea',1,'VrpConstants.h']]], + ['exchange2_348',['EXCHANGE2',['../VrpConstants_8h.html#a15cdbcf1375b04e4f9688eca0fed9559',1,'VrpConstants.h']]], + ['exchange_5fheur_5ftour_349',['EXCHANGE_HEUR_TOUR',['../VrpConstants_8h.html#a6f8b04c827c9c50b8515f14d397d7e0d',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/all_6.html b/Doxygen/0.94/search/all_6.html new file mode 100644 index 0000000..43f14ea --- /dev/null +++ b/Doxygen/0.94/search/all_6.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_6.js b/Doxygen/0.94/search/all_6.js new file mode 100644 index 0000000..4384d97 --- /dev/null +++ b/Doxygen/0.94/search/all_6.js @@ -0,0 +1,19 @@ +var searchData= +[ + ['far_5fins_350',['FAR_INS',['../VrpConstants_8h.html#aae8fe9fc5294303304fa4065ef6b5d0b',1,'VrpConstants.h']]], + ['farkas_351',['FARKAS',['../VrpConstants_8h.html#a743821d1ebad579342b52ca326e5ebc7',1,'VrpConstants.h']]], + ['farnear_5fins_352',['FARNEAR_INS',['../VrpConstants_8h.html#aaaa0095d63588546dcf98689f0506abf',1,'VrpConstants.h']]], + ['farthest_5fins_353',['FARTHEST_INS',['../VrpConstants_8h.html#a5a0427424714113e6b934d1dbcecb239',1,'VrpConstants.h']]], + ['fathom_354',['fathom',['../classBlisTreeNode.html#ab077379eab5eb849d7ee2767a8d29557',1,'BlisTreeNode']]], + ['fathomallnodes_355',['fathomAllNodes',['../classBlisModel.html#aad8ebadfe513b09a229b804a360f5a2d',1,'BlisModel']]], + ['feaschecktime_5f_356',['feasCheckTime_',['../classBlisModel.html#a4dd498d8022a2276b4cd90cfa4f9ff2c',1,'BlisModel']]], + ['feasibleregion_357',['feasibleRegion',['../classBlisObjectInt.html#afa0cc09d01fb3643fde308a2850a8e32',1,'BlisObjectInt']]], + ['feasiblesolution_358',['feasibleSolution',['../classBlisModel.html#a6e88699fda7cef4dae11b05dddd68652',1,'BlisModel']]], + ['feasiblesolutionheur_359',['feasibleSolutionHeur',['../classBlisModel.html#afcb6c2b7b6496363edb533815e2dd47d',1,'BlisModel']]], + ['fini_5fratio_360',['FINI_RATIO',['../VrpConstants_8h.html#abd6b45390dff855ddad295cb05a51696',1,'VrpConstants.h']]], + ['finisheddown_361',['finishedDown',['../structBlisStrong.html#a49f917e74d9fa49b458243b3d8288285',1,'BlisStrong']]], + ['finishedup_362',['finishedUp',['../structBlisStrong.html#a6fa69cf2a838abc9c75802f2ec7ff1db',1,'BlisStrong']]], + ['first_363',['first',['../structROUTE__DATA.html#abcf4195370754b4fd4e61d31af716e9c',1,'ROUTE_DATA::first()'],['../structVERTEX.html#adfbfdf5c32690a942a5866365784d064',1,'VERTEX::first()']]], + ['first_5fset_364',['FIRST_SET',['../VrpConstants_8h.html#ada9b10fa57fb93a227cf3faccdd058c6',1,'VrpConstants.h']]], + ['freeguts_365',['freeGuts',['../classVrpHeurTSP.html#ab159ae82ace4576fa0680f1536744d4b',1,'VrpHeurTSP']]] +]; diff --git a/Doxygen/0.94/search/all_7.html b/Doxygen/0.94/search/all_7.html new file mode 100644 index 0000000..af52f82 --- /dev/null +++ b/Doxygen/0.94/search/all_7.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_7.js b/Doxygen/0.94/search/all_7.js new file mode 100644 index 0000000..efcb82c --- /dev/null +++ b/Doxygen/0.94/search/all_7.js @@ -0,0 +1,67 @@ +var searchData= +[ + ['general_5fnonzeros_366',['GENERAL_NONZEROS',['../VrpConstants_8h.html#a96f90a6e02e9f18b689f2c1ab72f0215',1,'VrpConstants.h']]], + ['generateconstraints_367',['generateConstraints',['../classVrpCutGenerator.html#a7373fd29453273770b5aca5cf0b6eb61',1,'VrpCutGenerator::generateConstraints()'],['../classBlisConGenerator.html#ad5b539938155aed495a7e486b8d1ad65',1,'BlisConGenerator::generateConstraints()'],['../classBlisTreeNode.html#a323e2a4fb10b4a887f33475bdb4ca088',1,'BlisTreeNode::generateConstraints()']]], + ['generator_368',['generator',['../classBlisConGenerator.html#a37f8fd75f69dcf50608cddb2b0fb9a0e',1,'BlisConGenerator']]], + ['generator_5f_369',['generator_',['../classBlisConGenerator.html#aaad1548651e42b145b96703e66338cae',1,'BlisConGenerator']]], + ['generators_5f_370',['generators_',['../classBlisModel.html#aa92fc0eb1191680fb61f1c2ebf0bb784',1,'BlisModel']]], + ['getaveiterations_371',['getAveIterations',['../classBlisModel.html#a7ccfad6c660054ff6565a4594320a1fd',1,'BlisModel']]], + ['getbasis_372',['getBasis',['../classBlisNodeDesc.html#a6613cd0d00a7d91c73ba9eef5806c657',1,'BlisNodeDesc']]], + ['getbrancheddir_373',['getBranchedDir',['../classBlisNodeDesc.html#abbd9a4a940a86a11fb1d6571f6563e9f',1,'BlisNodeDesc']]], + ['getbranchedind_374',['getBranchedInd',['../classBlisNodeDesc.html#a79db112832d3ab4be6ce387f08d8a376',1,'BlisNodeDesc']]], + ['getbranchedval_375',['getBranchedVal',['../classBlisNodeDesc.html#aa78115d2823630894d558c28520179fc',1,'BlisNodeDesc']]], + ['getbranchingset_376',['getBranchingSet',['../classBlisBranchObjectBilevel.html#af74d9417787c90a2c75a798d3d66d87f',1,'BlisBranchObjectBilevel']]], + ['getcollower_377',['getColLower',['../classBlisModel.html#a1ace379f79a8b46d704fc0df27c1f3db',1,'BlisModel']]], + ['getcolupper_378',['getColUpper',['../classBlisModel.html#a3457a4d51bd82e992074d98155e18c32',1,'BlisModel']]], + ['getconrandoms_379',['getConRandoms',['../classBlisModel.html#ac00649c6df26aea000b02880f5acb554',1,'BlisModel']]], + ['getcutgenerationfrequency_380',['getCutGenerationFrequency',['../classBlisModel.html#a5f676e2ec0ad1f03fc7d3c746631f0a4',1,'BlisModel']]], + ['getcutoff_381',['getCutoff',['../classBlisModel.html#ab6f58f37d4934bca6f21938b257dbb0f',1,'BlisModel']]], + ['getcutstrategy_382',['getCutStrategy',['../classBlisModel.html#a3737eaf783b5f0a1f378e2e6a25e439c',1,'BlisModel']]], + ['getdenseconcutoff_383',['getDenseConCutoff',['../classBlisModel.html#ab5b551cccea28e83e31f53cfbba1b0b9',1,'BlisModel']]], + ['getdown_384',['getDown',['../classBlisBranchObjectInt.html#aecdb099fd5873b13e7e551ab2eae7476',1,'BlisBranchObjectInt']]], + ['getdowncost_385',['getDownCost',['../classBlisPseudocost.html#a7174c388a0adc01cb1cf57f17e778b17',1,'BlisPseudocost']]], + ['getdowncount_386',['getDownCount',['../classBlisPseudocost.html#ad0001d6d6caaaebb2c5d67db2c1f9594',1,'BlisPseudocost']]], + ['getedgelist_387',['getEdgeList',['../classVrpModel.html#a4d08b81c648ab7b32d0784bc6d4c3535',1,'VrpModel']]], + ['getfeaschecktime_388',['getFeasCheckTime',['../classBlisModel.html#a0539537a2186a127544f339538fbfe77',1,'BlisModel']]], + ['getindex_389',['getIndex',['../classVrpVariable.html#a8f3971cb639f20008db518d005b19b5f',1,'VrpVariable']]], + ['getindices_390',['getIndices',['../classBlisConstraint.html#a00e7ebb783c80ec57820225f8417febf',1,'BlisConstraint::getIndices()'],['../classBlisVariable.html#a8af5315613fe05b14d871d734a6fb53b',1,'BlisVariable::getIndices()']]], + ['getintcolindices_391',['getIntColIndices',['../classBlisModel.html#abfcf34fa8497b27c95b373089fdc7fbd',1,'BlisModel']]], + ['getintobjindices_392',['getIntObjIndices',['../classBlisModel.html#a4da830ddd2bbee203271ac26b067c4a5',1,'BlisModel']]], + ['getlpobjvalue_393',['getLpObjValue',['../classBlisModel.html#a565a4a47c24dbb93c05d3e9a4e3a1092',1,'BlisModel']]], + ['getlpsolution_394',['getLpSolution',['../classBlisModel.html#a0613b402519b1636690f2cde50166279',1,'BlisModel']]], + ['getmaxnumcons_395',['getMaxNumCons',['../classBlisModel.html#a258532882b2e55234dfdc7da4143eaf0',1,'BlisModel']]], + ['getmodel_396',['getModel',['../classBlisConGenerator.html#a7e3adaf759186cc2cc5b62e68b83419c',1,'BlisConGenerator']]], + ['getnodeweight_397',['getNodeWeight',['../classBlisModel.html#ade5169dff480abde6ceb1b853526e19f',1,'BlisModel']]], + ['getnumbranchresolve_398',['getNumBranchResolve',['../classBlisModel.html#aa02ed965b4633f61cdabdcf370e5156c',1,'BlisModel']]], + ['getnumcols_399',['getNumCols',['../classBlisModel.html#aeaa6efe45eb0150e2200e6c92bdd3d4e',1,'BlisModel']]], + ['getnumedges_400',['getNumEdges',['../classVrpModel.html#afd26e057fff79d32288c3e9fbbf255b3',1,'VrpModel']]], + ['getnumheursolutions_401',['getNumHeurSolutions',['../classBlisModel.html#ad22b235fe68b954eb4b4c0b9d8e6459a',1,'BlisModel']]], + ['getnumintobjects_402',['getNumIntObjects',['../classBlisModel.html#af0a261c810d4af1e4eab6c05dca7b00d',1,'BlisModel']]], + ['getnumiterations_403',['getNumIterations',['../classBlisModel.html#a798e9defd9c0b9ff897067a24342aa78',1,'BlisModel']]], + ['getnumnodes_404',['getNumNodes',['../classBlisModel.html#abb15324201704d788a4c2a8c08d433a6',1,'BlisModel']]], + ['getnumoldconstraints_405',['getNumOldConstraints',['../classBlisModel.html#a6e959fd3c751b927fb34f23e01a6eaa3',1,'BlisModel']]], + ['getnumrows_406',['getNumRows',['../classBlisModel.html#ac25e488c49806d81edd7caddb536c834',1,'BlisModel']]], + ['getnumsolutions_407',['getNumSolutions',['../classBlisModel.html#ae23a39469021a42d87ac8be779077fcf',1,'BlisModel']]], + ['getnumstrong_408',['getNumStrong',['../classBlisModel.html#a73ac5a9ff81d91371b46caa40ac6d7c5',1,'BlisModel']]], + ['getnumvertices_409',['getNumVertices',['../classVrpModel.html#ab9eca9f48ed9e27405cdff8b580a1256',1,'VrpModel']]], + ['getobjcoef_410',['getObjCoef',['../classBlisModel.html#a2bd62be09340fc888a46f7ad258f725f',1,'BlisModel::getObjCoef()'],['../classBlisVariable.html#a3339b546a9b72e8c99c671ccf358f2a3',1,'BlisVariable::getObjCoef()']]], + ['getoldconstraintssize_411',['getOldConstraintsSize',['../classBlisModel.html#a91bee7a54d09e09d7c55c1b0cf06ba99',1,'BlisModel']]], + ['getscore_412',['getScore',['../classBlisPseudocost.html#a9bda51fa03ab711cedba2ec86e447d36',1,'BlisPseudocost']]], + ['getsize_413',['getSize',['../classBlisConstraint.html#aee67cc1356d1b97a9a80c72b1fc93c92',1,'BlisConstraint::getSize()'],['../classBlisVariable.html#a251fc92ec97dc799fdab3cdde8f2a15a',1,'BlisVariable::getSize()']]], + ['getsolution_414',['getSolution',['../classVrpModel.html#a1814085e81466edc93d3bed257868cea',1,'VrpModel']]], + ['getsolver_415',['getSolver',['../classBlisModel.html#a7a8342c01e850a846e9f3bcd449a0edb',1,'BlisModel']]], + ['getup_416',['getUp',['../classBlisBranchObjectInt.html#a7555650332bd009140a882927d0afdf2',1,'BlisBranchObjectInt']]], + ['getupcost_417',['getUpCost',['../classBlisPseudocost.html#a8188376260755860ac9b84f341e6fdb8',1,'BlisPseudocost']]], + ['getupcount_418',['getUpCount',['../classBlisPseudocost.html#a8a84d5efe7b615515db6ab81c18768ba',1,'BlisPseudocost']]], + ['getv0_419',['getv0',['../classVrpVariable.html#a301feb5d30a68834aa3310584c559ee8',1,'VrpVariable']]], + ['getv1_420',['getv1',['../classVrpVariable.html#a51d94fbe5a04e1f7826058f5f870993f',1,'VrpVariable']]], + ['getvalues_421',['getValues',['../classBlisConstraint.html#a76c46e83d58a7e1714406d5221dbfe7b',1,'BlisConstraint::getValues()'],['../classBlisVariable.html#abb92abfb4f98242e7ce3fa24854fae0a',1,'BlisVariable::getValues()']]], + ['getviolatedconstraints_422',['getViolatedConstraints',['../classBlisTreeNode.html#aa41bf5a9b3bf07cff3244033acb0242c',1,'BlisTreeNode']]], + ['greedynumtrials_423',['greedyNumTrials',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3ea618292753f21ea4fabdba95d54dc1a3f',1,'VrpParams']]], + ['greedyshrinking1_424',['greedyShrinking1',['../classVrpCutGenerator.html#a4cf3a92a7485e8b9f8b8e897fcf2ba13',1,'VrpCutGenerator']]], + ['greedyshrinking1one_425',['greedyShrinking1One',['../classVrpCutGenerator.html#a8d4e29706ab694241a6504a444f8650e',1,'VrpCutGenerator']]], + ['greedyshrinking2one_426',['greedyShrinking2One',['../classVrpCutGenerator.html#a81745a4c5b545d4c73f13cad9093ba98',1,'VrpCutGenerator']]], + ['greedyshrinking6_427',['greedyShrinking6',['../classVrpCutGenerator.html#a9e9989d4919df0c5f61272ad4f5db10a',1,'VrpCutGenerator']]], + ['greedyshrinking6one_428',['greedyShrinking6One',['../classVrpCutGenerator.html#ab609be1eb4941d1530ee53b7780bc901',1,'VrpCutGenerator']]], + ['gutsofdestructor_429',['gutsOfDestructor',['../classVrpNetwork.html#a415febacff5b1204e2b834fc59af65e2',1,'VrpNetwork::gutsOfDestructor()'],['../classBlisModel.html#ae1d3a84daec42ae06fff778362a631d4',1,'BlisModel::gutsOfDestructor()']]] +]; diff --git a/Doxygen/0.94/search/all_8.html b/Doxygen/0.94/search/all_8.html new file mode 100644 index 0000000..cf2b5df --- /dev/null +++ b/Doxygen/0.94/search/all_8.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_8.js b/Doxygen/0.94/search/all_8.js new file mode 100644 index 0000000..4a67153 --- /dev/null +++ b/Doxygen/0.94/search/all_8.js @@ -0,0 +1,25 @@ +var searchData= +[ + ['hashing_430',['hashing',['../classBlisConstraint.html#a3071a4763afbc64582711a2f592a7567',1,'BlisConstraint']]], + ['have_5fdlfcn_5fh_431',['HAVE_DLFCN_H',['../config_8h.html#a0ee1617ff2f6885ef384a3dd46f9b9d7',1,'config.h']]], + ['have_5finttypes_5fh_432',['HAVE_INTTYPES_H',['../config_8h.html#ab90a030ff2790ebdc176660a6dd2a478',1,'config.h']]], + ['have_5fmemory_5fh_433',['HAVE_MEMORY_H',['../config_8h.html#ae93a78f9d076138897af441c9f86f285',1,'config.h']]], + ['have_5fstdint_5fh_434',['HAVE_STDINT_H',['../config_8h.html#ab6cd6d1c63c1e26ea2d4537b77148354',1,'config.h']]], + ['have_5fstdlib_5fh_435',['HAVE_STDLIB_H',['../config_8h.html#a9e0e434ec1a6ddbd97db12b5a32905e0',1,'config.h']]], + ['have_5fstring_5fh_436',['HAVE_STRING_H',['../config_8h.html#ad4c234dd1625255dc626a15886306e7d',1,'config.h']]], + ['have_5fstrings_5fh_437',['HAVE_STRINGS_H',['../config_8h.html#a405d10d46190bcb0320524c54eafc850',1,'config.h']]], + ['have_5fsys_5fstat_5fh_438',['HAVE_SYS_STAT_H',['../config_8h.html#ace156430ba007d19b4348a950d0c692b',1,'config.h']]], + ['have_5fsys_5ftypes_5fh_439',['HAVE_SYS_TYPES_H',['../config_8h.html#a69dc70bea5d1f8bd2be9740e974fa666',1,'config.h']]], + ['have_5funistd_5fh_440',['HAVE_UNISTD_H',['../config_8h.html#a219b06937831d0da94d801ab13987639',1,'config.h']]], + ['heur_5ftour_441',['HEUR_TOUR',['../VrpConstants_8h.html#ace233d76c0809c2f9f15224e1c208a98',1,'VrpConstants.h']]], + ['heur_5ftour_5fwith_5froutes_442',['HEUR_TOUR_WITH_ROUTES',['../VrpConstants_8h.html#a3d4d4346cbbbb10117fe2725e0e20885',1,'VrpConstants.h']]], + ['heurcallfrequency_443',['heurCallFrequency',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba22df26e5380e7aa183ef409dcb125579',1,'BlisParams::heurCallFrequency()'],['../classBlisHeuristic.html#af83bbc9906b81ff7fa9ef4716ae30591',1,'BlisHeuristic::heurCallFrequency()']]], + ['heurcallfrequency_5f_444',['heurCallFrequency_',['../classBlisHeuristic.html#a933b73f8169ed5b7059ff84385ffc5c6',1,'BlisHeuristic::heurCallFrequency_()'],['../classBlisModel.html#afa00d6fcc0cc2c84c5d28914a3b95404',1,'BlisModel::heurCallFrequency_()']]], + ['heuristics_445',['heuristics',['../classBlisModel.html#aa1811e7df4aceb6faad6d6a47baa0643',1,'BlisModel']]], + ['heuristics_5f_446',['heuristics_',['../classBlisModel.html#a52f68e9c77897a875b81d711f18e0ad4',1,'BlisModel']]], + ['heurroundfreq_447',['heurRoundFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba486826c88f81844bcb4dc1779ecfef6d',1,'BlisParams']]], + ['heurroundstrategy_448',['heurRoundStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba545653c366b90d9bbfece12af7ab4888',1,'BlisParams']]], + ['heurstrategy_449',['heurStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba7f0a5a9fa3a3d74da9ea25c5e2fd03ca',1,'BlisParams']]], + ['heurstrategy_5f_450',['heurStrategy_',['../classBlisModel.html#aedb9bfd188c6d25e2d4c16afdcce3496',1,'BlisModel']]], + ['hotstartstrategy_5f_451',['hotstartStrategy_',['../classBlisModel.html#a4a146916da83dcb06710ba3771b6610d',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/all_9.html b/Doxygen/0.94/search/all_9.html new file mode 100644 index 0000000..690785a --- /dev/null +++ b/Doxygen/0.94/search/all_9.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_9.js b/Doxygen/0.94/search/all_9.js new file mode 100644 index 0000000..ebdcf15 --- /dev/null +++ b/Doxygen/0.94/search/all_9.js @@ -0,0 +1,25 @@ +var searchData= +[ + ['importmodel_452',['importModel',['../classBlisModel.html#a44ae2ca3d5d1d9dd1065491d303acf1f',1,'BlisModel']]], + ['in_5ftour_453',['IN_TOUR',['../VrpConstants_8h.html#a5378aa3d688ad948d2e8db4ad92cc8e1',1,'VrpConstants.h']]], + ['in_5ftree_454',['IN_TREE',['../VrpConstants_8h.html#a37120fa5e03a9a9169800b9a6da35bbd',1,'VrpConstants.h']]], + ['incobjvalue_5f_455',['incObjValue_',['../classBlisModel.html#adb8a42f358f40ed40e6e34e4733e0f1b',1,'BlisModel']]], + ['incumbent_456',['incumbent',['../classBlisModel.html#aa32f73ed94be953d11effddb282328f9',1,'BlisModel']]], + ['incumbent_5f_457',['incumbent_',['../classBlisModel.html#a1dcc77aafadeef3eeed569016b02b1af',1,'BlisModel']]], + ['index_458',['index',['../classVrpModel.html#abcc3d28b9791c337c96974845d304f5c',1,'VrpModel']]], + ['indices_5f_459',['indices_',['../classBlisConstraint.html#a985d4fa0eac3cda9b6641e3ae4c1b470',1,'BlisConstraint::indices_()'],['../classBlisVariable.html#ac4dfff37e63ffb42dd9de0d02fe7cbc5',1,'BlisVariable::indices_()']]], + ['infeasibility_460',['infeasibility',['../classBlisObjectInt.html#ae6676fb108212ce74ca7b0d44f054dfb',1,'BlisObjectInt']]], + ['init_461',['init',['../classBlisModel.html#a7dc60be9ec99adcf7ecb19e9ea93e7d1',1,'BlisModel::init()'],['../classBlisTreeNode.html#acad0cbce871534ec4bce6ed72a747c81',1,'BlisTreeNode::init()']]], + ['inputcon_5f_462',['inputCon_',['../classBlisModel.html#a5d19ba1d752081e9a9879c978c3c6037',1,'BlisModel']]], + ['inputvar_5f_463',['inputVar_',['../classBlisModel.html#a68ad762a290b25548efeaafe072d68ec',1,'BlisModel']]], + ['inset_5f_464',['inSet_',['../classVrpCutGenerator.html#ad881ba92788518fbf8a4e6b21bdfece3',1,'VrpCutGenerator']]], + ['installsubproblem_465',['installSubProblem',['../classBlisTreeNode.html#a57f40d7662e90b2daea2cf715bf4bc95',1,'BlisTreeNode']]], + ['intcolindices_5f_466',['intColIndices_',['../classBlisModel.html#a0d83390f3d5803b5a4df75f329e9bd98',1,'BlisModel']]], + ['integertol_467',['integerTol',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271aa2f6d1db37c87e865b2e63801108fcac',1,'BlisParams']]], + ['integertol_5f_468',['integerTol_',['../classBlisModel.html#ae7fd0ce2020174c54729632741da20a2',1,'BlisModel']]], + ['intobjindices_5f_469',['intObjIndices_',['../classBlisModel.html#a608bb424be7d9a4bf2a0dada4cab14b4',1,'BlisModel']]], + ['intparams_470',['intParams',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3e',1,'VrpParams::intParams()'],['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39b',1,'BlisParams::intParams()']]], + ['is_5fart_5fpoint_471',['is_art_point',['../structVERTEX.html#a8ee10d018f75eea535d401f9d6c80174',1,'VERTEX']]], + ['isintegral_5f_472',['isIntegral_',['../classVrpNetwork.html#a84bddc4df3103a1b2059e93e720347d7',1,'VrpNetwork']]], + ['isroot_5f_473',['isRoot_',['../classBlisModel.html#ac4ccb0b7b21b1ce0cd6dcda96249d9f9',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/all_a.html b/Doxygen/0.94/search/all_a.html new file mode 100644 index 0000000..f2f3d3a --- /dev/null +++ b/Doxygen/0.94/search/all_a.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_a.js b/Doxygen/0.94/search/all_a.js new file mode 100644 index 0000000..9bdbe0e --- /dev/null +++ b/Doxygen/0.94/search/all_a.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['key_5fnum_474',['KEY_NUM',['../VrpConstants_8h.html#a6fde2706d0ab2fc4922e71855ae9328f',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/all_b.html b/Doxygen/0.94/search/all_b.html new file mode 100644 index 0000000..14f3403 --- /dev/null +++ b/Doxygen/0.94/search/all_b.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_b.js b/Doxygen/0.94/search/all_b.js new file mode 100644 index 0000000..0a54481 --- /dev/null +++ b/Doxygen/0.94/search/all_b.js @@ -0,0 +1,12 @@ +var searchData= +[ + ['last_475',['last',['../structROUTE__DATA.html#ab5823502ccef74e1ce24cd99ef938ddc',1,'ROUTE_DATA::last()'],['../structVERTEX.html#a2079599a7bfc0c91ff0c567b07c4addc',1,'VERTEX::last()']]], + ['leaftorootpath_476',['leafToRootPath',['../classBlisModel.html#a4773ab41dfe021f8aa8ea6b5b5b8b941',1,'BlisModel']]], + ['length_477',['LENGTH',['../VrpConstants_8h.html#a30362161c93e3f1a4ee4c673f535b5a8',1,'VrpConstants.h']]], + ['line_5flen_478',['LINE_LEN',['../VrpConstants_8h.html#a45db13d622cb21897aa934e5ad411c83',1,'VrpConstants.h']]], + ['load_5fsmall_5fgraph_479',['LOAD_SMALL_GRAPH',['../VrpConstants_8h.html#a2fade6b173bc81b4732f719e8433839c',1,'VrpConstants.h']]], + ['lookahead_480',['lookAhead',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba6c1ea0b2d4058ef8860d9573d0edbb67',1,'BlisParams']]], + ['low_481',['low',['../structVERTEX.html#afbcf2ebac7279aa21edc7c9232b05aee',1,'VERTEX']]], + ['lower_5fbound_482',['LOWER_BOUND',['../VrpConstants_8h.html#a44b4de4784f751e71fad94edd351ff41',1,'VrpConstants.h']]], + ['lpsolver_5f_483',['lpSolver_',['../classBlisModel.html#a77c6ce7be84a7aa9a949fe84a6f61ae4',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/all_c.html b/Doxygen/0.94/search/all_c.html new file mode 100644 index 0000000..da60ab8 --- /dev/null +++ b/Doxygen/0.94/search/all_c.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_c.js b/Doxygen/0.94/search/all_c.js new file mode 100644 index 0000000..6e40039 --- /dev/null +++ b/Doxygen/0.94/search/all_c.js @@ -0,0 +1,15 @@ +var searchData= +[ + ['matrix_5f_484',['matrix_',['../classBlisHeurRound.html#a12df22d273fd5a4bb47dc62e5879330a',1,'BlisHeurRound']]], + ['matrixbyrow_5f_485',['matrixByRow_',['../classBlisHeurRound.html#af34c767f62e3cfc92a86aca29004904b',1,'BlisHeurRound']]], + ['max_486',['MAX',['../VrpNetwork_8h.html#aacc3ee1a7f283f8ef65cea31f4436a95',1,'VrpNetwork.h']]], + ['maxedgenum_5f_487',['maxEdgenum_',['../classVrpNetwork.html#a555f7fb8561d3b0f929193943f9e7628',1,'VrpNetwork']]], + ['maxnumcons_5f_488',['maxNumCons_',['../classBlisModel.html#af7471b431afe6f1a4012437b1c6bcc7f',1,'BlisModel']]], + ['maxnumcutsinshrink_489',['maxNumCutsInShrink',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3ea561164cfc4a64bd9351985a2d6770477',1,'VrpParams']]], + ['min_490',['MIN',['../VrpNetwork_8h.html#a74e75242132eaabbc1c512488a135926',1,'VrpNetwork.h']]], + ['mincut_5f_491',['mincut_',['../classVrpNetwork.html#aa41531d548a79de77f1c7d7d0d6d79c5',1,'VrpNetwork']]], + ['model_5f_492',['model_',['../classVrpCutGenerator.html#ad50b571829adaae7fea39e6c1ea723a4',1,'VrpCutGenerator::model_()'],['../classBlisConGenerator.html#a41487047261a5ba2c9eb4118d9e4770c',1,'BlisConGenerator::model_()'],['../classBlisHeuristic.html#a022a81d07cb404f1b2714fe91afa1b62',1,'BlisHeuristic::model_()']]], + ['modellog_493',['modelLog',['../classBlisModel.html#a242d7f0b648e76512f8eba38c0232541',1,'BlisModel']]], + ['mst_494',['MST',['../VrpConstants_8h.html#af76e42db96312986d18322458c0dbcac',1,'VrpConstants.h']]], + ['my_5fpi_495',['MY_PI',['../VrpConstants_8h.html#acdf314019539248efc2b4f247a1b97ac',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/all_d.html b/Doxygen/0.94/search/all_d.html new file mode 100644 index 0000000..bc376fe --- /dev/null +++ b/Doxygen/0.94/search/all_d.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_d.js b/Doxygen/0.94/search/all_d.js new file mode 100644 index 0000000..94b0840 --- /dev/null +++ b/Doxygen/0.94/search/all_d.js @@ -0,0 +1,59 @@ +var searchData= +[ + ['n_5f_496',['n_',['../classVrpModel.html#a71f7e25b188084de20692188777688f2',1,'VrpModel']]], + ['name_497',['name',['../classBlisConGenerator.html#a4a64826034004c2592d8d5cf1cdf461d',1,'BlisConGenerator::name()'],['../classBlisHeuristic.html#ac36729ddcfafdb9f852301572b1e4275',1,'BlisHeuristic::name()']]], + ['name_5f_498',['name_',['../classVrpModel.html#afb1d7a80430d30af276a2ffe807e7076',1,'VrpModel::name_()'],['../classBlisConGenerator.html#ad2bfac705a3b3fe05f0d9eda28f85b98',1,'BlisConGenerator::name_()'],['../classBlisHeuristic.html#ac482fd341202b1160b8fb87e31313d1c',1,'BlisHeuristic::name_()']]], + ['nc_5fnumroutes_499',['NC_NUMROUTES',['../VrpConstants_8h.html#a4b890e9402596df29b21e0d1010f2f55',1,'VrpConstants.h']]], + ['near_5fcluster_500',['NEAR_CLUSTER',['../VrpConstants_8h.html#ac0ab23031a64eb1524465a4e7273b7cf',1,'VrpConstants.h']]], + ['near_5fins_501',['NEAR_INS',['../VrpConstants_8h.html#a62d622813face483ed3b8d44f1e267c7',1,'VrpConstants.h']]], + ['nearest_5fins_502',['NEAREST_INS',['../VrpConstants_8h.html#ac49a7068706b8288e56776c7e1305469',1,'VrpConstants.h']]], + ['neighbors_5f_503',['neighbors_',['../classVrpHeurTSP.html#a5d8fc8103640dfa1b7a4758820a51a51',1,'VrpHeurTSP']]], + ['newcutpool_5f_504',['newCutPool_',['../classBlisModel.html#ab3c11f894b024b86d5bdb0ae086645a1',1,'BlisModel']]], + ['newdemand_5f_505',['newDemand_',['../classVrpNetwork.html#aa5ad05bf2a0b9aa9eb3425632a8029f5',1,'VrpNetwork']]], + ['next_506',['next',['../struct__NODE.html#a6c6f95eb9986b52268f411d953329b51',1,'_NODE']]], + ['next_5fedge_507',['next_edge',['../structELIST.html#ab6855167d545035cad41181541ba4c82',1,'ELIST']]], + ['no_5fcolumns_508',['NO_COLUMNS',['../VrpConstants_8h.html#a431cff18804da5b8d4d6ce587890d199',1,'VrpConstants.h']]], + ['no_5ftsp_5fcuts_509',['NO_TSP_CUTS',['../VrpConstants_8h.html#a27bb6821cb1ddcfde4315ef102f401af',1,'VrpConstants.h']]], + ['noconscalls_510',['noConsCalls',['../classBlisConGenerator.html#a4e7351b14148ec6644ed700a6be5f577',1,'BlisConGenerator']]], + ['noconscalls_5f_511',['noConsCalls_',['../classBlisConGenerator.html#a751ce6491c653f281f901e3fdd56f022',1,'BlisConGenerator']]], + ['nodecalls_5f_512',['nodeCalls_',['../classVrpHeurTSP.html#a37942d1dcb57b82f9b90ca5b2d55864f',1,'VrpHeurTSP']]], + ['nodelog_513',['nodeLog',['../classBlisModel.html#acc9050c2c46d08f089581c370e80b958',1,'BlisModel']]], + ['nodeweight_5f_514',['nodeWeight_',['../classBlisModel.html#a073c136e2e0c0f0f48656ad7bf186cf3',1,'BlisModel']]], + ['normal_515',['normal',['../classBlisConGenerator.html#a4c935c2cf3c288b901832f632c85fb73',1,'BlisConGenerator']]], + ['normal_5f_516',['normal_',['../classBlisConGenerator.html#a46368781cb77effa8c546f52a16db34d',1,'BlisConGenerator']]], + ['nosolcalls_517',['noSolCalls',['../classBlisHeuristic.html#a1d26701277ec79d1d4fcd01a1482232b',1,'BlisHeuristic']]], + ['nosolscalls_5f_518',['noSolsCalls_',['../classBlisHeuristic.html#af00a7d5df9d56733284aaca07989f1a6',1,'BlisHeuristic']]], + ['not_5fneighbor_519',['NOT_NEIGHBOR',['../VrpConstants_8h.html#ad24a7894925d1cb727387d50b4e527b6',1,'VrpConstants.h']]], + ['notpreferrednewfeasible_520',['notPreferredNewFeasible',['../classBlisObjectInt.html#a487aad5e6caecd8046aa590226b761cc',1,'BlisObjectInt']]], + ['num_5frands_521',['NUM_RANDS',['../VrpConstants_8h.html#a810d42748e53322fb44d77423ab831c6',1,'VrpConstants.h']]], + ['numbranchresolve_5f_522',['numBranchResolve_',['../classBlisModel.html#ac39db5633f328e27020fdd9ca78e6d4a',1,'BlisModel']]], + ['numcols_5f_523',['numCols_',['../classBlisModel.html#a98d8045e54859e3a70b753c02d4b071c',1,'BlisModel']]], + ['numcomps_5f_524',['numComps_',['../classVrpNetwork.html#ac9b5c6a089e8d4183e6d08456dcdd379',1,'VrpNetwork']]], + ['numconsgenerated_525',['numConsGenerated',['../classBlisConGenerator.html#a7c06b67214aff04e74faa9efe1a2729b',1,'BlisConGenerator']]], + ['numconsgenerated_5f_526',['numConsGenerated_',['../classBlisConGenerator.html#a814502804b19d3e3e655821ceb94d85a',1,'BlisConGenerator']]], + ['numconsused_527',['numConsUsed',['../classBlisConGenerator.html#af2f49d178eced4761d0f6da2e480f4b6',1,'BlisConGenerator']]], + ['numconsused_5f_528',['numConsUsed_',['../classBlisConGenerator.html#ad7eae3370172bd48aec9c85ac739eda5',1,'BlisConGenerator']]], + ['numcust_529',['numcust',['../structROUTE__DATA.html#afd107bf2bafa448d7e9fdd5891eda086',1,'ROUTE_DATA']]], + ['numcutgenerators_530',['numCutGenerators',['../classBlisModel.html#a99b6d20fddc576f8708c685b840c608b',1,'BlisModel']]], + ['numcutgenerators_5f_531',['numCutGenerators_',['../classBlisModel.html#ae665c951a382071c264ff536ccb53384',1,'BlisModel']]], + ['numelems_5f_532',['numElems_',['../classBlisModel.html#a299524e0a6cee8c0bba9e8d1573c078b',1,'BlisModel']]], + ['numheuristics_533',['numHeuristics',['../classBlisModel.html#ad6425f71c87b851d8d73d1defae0c036',1,'BlisModel']]], + ['numheuristics_5f_534',['numHeuristics_',['../classBlisModel.html#af6e0d5285d60c8ce762ff3d42958df63',1,'BlisModel']]], + ['numheursolutions_5f_535',['numHeurSolutions_',['../classBlisModel.html#a529cc1702f044f5d2e703bbd6cb766a8',1,'BlisModel']]], + ['numintinfdown_536',['numIntInfDown',['../structBlisStrong.html#a26a18cf59669e0ae18f06f75c455ac62',1,'BlisStrong']]], + ['numintinfup_537',['numIntInfUp',['../structBlisStrong.html#a3abc3ce196022e4c84a31bcafe444fac',1,'BlisStrong']]], + ['numintobjects_5f_538',['numIntObjects_',['../classBlisModel.html#af23ca7595602ec45ed9e29f2fa8a76d3',1,'BlisModel']]], + ['numiterations_5f_539',['numIterations_',['../classBlisModel.html#a4d6f3cd6fa3af3fcedbb7ab04b850226',1,'BlisModel']]], + ['numnodes_5f_540',['numNodes_',['../classBlisModel.html#a28fa05f69e8c33feca167efbe23e7767',1,'BlisModel']]], + ['numobjects_541',['numObjects',['../classBlisModel.html#a4403d68e37aedfae2eb49fc54a249304',1,'BlisModel']]], + ['numobjects_5f_542',['numObjects_',['../classBlisModel.html#aa3f0fd1d5a5f06aeec52426c06d275a7',1,'BlisModel']]], + ['numobjinfdown_543',['numObjInfDown',['../structBlisStrong.html#aef6071b20a29cc97c83871d6d39faf24',1,'BlisStrong']]], + ['numobjinfup_544',['numObjInfUp',['../structBlisStrong.html#a943168810b0e87f53582ebe3849c058a',1,'BlisStrong']]], + ['numoldconstraints_5f_545',['numOldConstraints_',['../classBlisModel.html#aa7f7a5fbc86bc5d92aaef3122bb966c8',1,'BlisModel']]], + ['numroutes_546',['numroutes',['../structBEST__TOURS.html#ac44ad9dab51f5d2e49b635b7be5c9d53',1,'BEST_TOURS::numroutes()'],['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3ea0fc01e4e57f98a6a75918a58f3448fe7',1,'VrpParams::numRoutes()']]], + ['numroutes_5f_547',['numroutes_',['../classVrpModel.html#a142ee3c3f1185c37a417c876be61de36',1,'VrpModel']]], + ['numrows_5f_548',['numRows_',['../classBlisModel.html#a3d143b5f330e1d8284cc1f68066fbcc3',1,'BlisModel']]], + ['numsolutions_549',['numSolutions',['../classBlisHeuristic.html#a9c037a4c40c3a1d4fee89ba533944445',1,'BlisHeuristic']]], + ['numsolutions_5f_550',['numSolutions_',['../classBlisHeuristic.html#a5273fff6cf49d27bd7b9e253843b6479',1,'BlisHeuristic::numSolutions_()'],['../classBlisModel.html#af14d6b32ed394f7bf4dc952f58f87a97',1,'BlisModel::numSolutions_()']]], + ['numstrong_5f_551',['numStrong_',['../classBlisModel.html#a1a3e614a36379b7ba79286b515c828d6',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/all_e.html b/Doxygen/0.94/search/all_e.html new file mode 100644 index 0000000..2e3c74d --- /dev/null +++ b/Doxygen/0.94/search/all_e.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_e.js b/Doxygen/0.94/search/all_e.js new file mode 100644 index 0000000..d3e345a --- /dev/null +++ b/Doxygen/0.94/search/all_e.js @@ -0,0 +1,28 @@ +var searchData= +[ + ['objcoef_5f_552',['objCoef_',['../classBlisModel.html#a07a94e96a609a556f0326319025abf67',1,'BlisModel::objCoef_()'],['../classBlisVariable.html#ab06d75ababe82b4c896d40cd878ee532',1,'BlisVariable::objCoef_()']]], + ['objectindex_553',['objectIndex',['../structBlisStrong.html#ad4518553a024bec8972b8a0e09bf6c7f',1,'BlisStrong']]], + ['objects_554',['objects',['../classBlisModel.html#a5b7c67b4a83b8490e005453809d198ba',1,'BlisModel::objects()'],['../classBlisModel.html#a9d20819cf518f4c6585a27455b2f782d',1,'BlisModel::objects(int which)']]], + ['objects_5f_555',['objects_',['../classBlisModel.html#a814bd2e2690b50329e49fa8367c62296',1,'BlisModel']]], + ['objsense_556',['objSense',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271a9a3e137f7cbd24bf12fa7c7b1ec99774',1,'BlisParams']]], + ['objsense_5f_557',['objSense_',['../classBlisModel.html#aa05801edb841b1518a08c0b1f90c5dd6',1,'BlisModel']]], + ['oldconstraints_558',['oldConstraints',['../classBlisModel.html#a389ac9b40cfb03824032b4dd78988e02',1,'BlisModel']]], + ['oldconstraints_5f_559',['oldConstraints_',['../classBlisModel.html#a2ca9f96f595a3d3c5eda301c6ae21589',1,'BlisModel']]], + ['oldconstraintssize_5f_560',['oldConstraintsSize_',['../classBlisModel.html#a6fd6bebed45214f1532fd91baf1f77c3',1,'BlisModel']]], + ['operator_3d_561',['operator=',['../classVrpHeurTSP.html#a8125ac56036a38c9b04c7fd67c835eee',1,'VrpHeurTSP::operator=()'],['../classBlisBranchObjectBilevel.html#ae405da9f774bafe2488c7453b16f45ad',1,'BlisBranchObjectBilevel::operator=()'],['../classBlisBranchObjectInt.html#a5a596610a9cb7d343b833e311fbff5af',1,'BlisBranchObjectInt::operator=()'],['../classBlisBranchStrategyBilevel.html#aaeb6db26901907a5118a05867789e37b',1,'BlisBranchStrategyBilevel::operator=()'],['../classBlisBranchStrategyMaxInf.html#a5603ef9f39d1cf42bd6942b7ba9b92ba',1,'BlisBranchStrategyMaxInf::operator=()'],['../classBlisBranchStrategyPseudo.html#a717609a96c5be64dfb50b1dab1c8e3d0',1,'BlisBranchStrategyPseudo::operator=()'],['../classBlisBranchStrategyRel.html#a02cb737107b2093513f79160ff5c673f',1,'BlisBranchStrategyRel::operator=()'],['../classBlisBranchStrategyStrong.html#a3166a01aef69104314cde14d50805344',1,'BlisBranchStrategyStrong::operator=()'],['../classBlisConGenerator.html#a101c5cfdea5848b97689e25481102b4b',1,'BlisConGenerator::operator=()'],['../classBlisHeuristic.html#add55f43a1d55161e8e2ebc1b334e5744',1,'BlisHeuristic::operator=()'],['../classBlisHeurRound.html#a185e86bb15895a1e2ef5c04938a7e36d',1,'BlisHeurRound::operator=()'],['../classBlisObjectInt.html#a1b52e912ee84200a66f150572bf442b5',1,'BlisObjectInt::operator=()'],['../classBlisPseudocost.html#aec072628edaf26ee0f1a7d077686dd5a',1,'BlisPseudocost::operator=()'],['../classBlisTreeNode.html#a3a3f9f62c86c60741e639d3abc6810d9',1,'BlisTreeNode::operator=()']]], + ['opt_5f_562',['opt_',['../classVrpSolution.html#a65e55f48f8f2c8535b0c353d2f98a31e',1,'VrpSolution']]], + ['optimalabsgap_563',['optimalAbsGap',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271aa6df5d30df6877598442da950ec21f90',1,'BlisParams']]], + ['optimalabsgap_5f_564',['optimalAbsGap_',['../classBlisModel.html#a07ced1a7abc3a426e15502a5899f3bcb',1,'BlisModel']]], + ['optimalrelgap_565',['optimalRelGap',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271a8c17e942d82f4bdd9b7c6788589820f0',1,'BlisParams']]], + ['optimalrelgap_5f_566',['optimalRelGap_',['../classBlisModel.html#a4546e5de99cc514446418e5dae5b3307',1,'BlisModel']]], + ['orig_5fnode_5flist_567',['orig_node_list',['../structVERTEX.html#a098b234b2b5f8c4f672dce8ffcddee81',1,'VERTEX']]], + ['orig_5fnode_5flist_5fsize_568',['orig_node_list_size',['../structVERTEX.html#a889b34d7a3011c86ee79ef61063adcbe',1,'VERTEX']]], + ['originallower_5f_569',['originalLower_',['../classBlisObjectInt.html#a236f25691735066d302bd32120f4210f',1,'BlisObjectInt']]], + ['originallowerbound_570',['originalLowerBound',['../classBlisObjectInt.html#a5f6bba445210e61881615027dc020bc6',1,'BlisObjectInt']]], + ['originalupper_5f_571',['originalUpper_',['../classBlisObjectInt.html#a447690afd31886ee515f652035501d09',1,'BlisObjectInt']]], + ['originalupperbound_572',['originalUpperBound',['../classBlisObjectInt.html#a29a4c1c9d66259dde6b8b205e2288f11',1,'BlisObjectInt']]], + ['origlpsolver_5f_573',['origLpSolver_',['../classBlisModel.html#a25d80c218c4d227d9b8a4d2a26b7c45d',1,'BlisModel']]], + ['orignodenum_574',['orignodenum',['../structVERTEX.html#aa128bd8ef950d5de68045b222f8f65ef',1,'VERTEX']]], + ['other_575',['other',['../structELIST.html#a071038980f57eaa103babff8e25b748f',1,'ELIST']]], + ['other_5fend_576',['other_end',['../structELIST.html#a5d4258c9d50d037c24c091341c26fd0c',1,'ELIST::other_end()'],['../VrpNetwork_8h.html#af6720cc3678a152524fd7d73f3757be6',1,'OTHER_END(): VrpNetwork.h']]] +]; diff --git a/Doxygen/0.94/search/all_f.html b/Doxygen/0.94/search/all_f.html new file mode 100644 index 0000000..246f8ab --- /dev/null +++ b/Doxygen/0.94/search/all_f.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/all_f.js b/Doxygen/0.94/search/all_f.js new file mode 100644 index 0000000..f063d15 --- /dev/null +++ b/Doxygen/0.94/search/all_f.js @@ -0,0 +1,39 @@ +var searchData= +[ + ['pack_577',['pack',['../classVrpParams.html#a5e4d5b1fe1d410f57e7b26ef4cd0f75e',1,'VrpParams::pack()'],['../classBlisParams.html#ad6e9550506e01e12e45db98678656b88',1,'BlisParams::pack()']]], + ['package_578',['PACKAGE',['../config_8h.html#aca8570fb706c81df371b7f9bc454ae03',1,'config.h']]], + ['package_5fbugreport_579',['PACKAGE_BUGREPORT',['../config_8h.html#a1d1d2d7f8d2f95b376954d649ab03233',1,'config.h']]], + ['package_5fname_580',['PACKAGE_NAME',['../config_8h.html#a1c0439e4355794c09b64274849eb0279',1,'config.h']]], + ['package_5fstring_581',['PACKAGE_STRING',['../config_8h.html#ac73e6f903c16eca7710f92e36e1c6fbf',1,'config.h']]], + ['package_5ftarname_582',['PACKAGE_TARNAME',['../config_8h.html#af415af6bfede0e8d5453708afe68651c',1,'config.h']]], + ['package_5fversion_583',['PACKAGE_VERSION',['../config_8h.html#aa326a05d5e30f9e9a4bb0b4469d5d0c0',1,'config.h']]], + ['packsharedconstraints_584',['packSharedConstraints',['../classBlisModel.html#af0abb5c78c2bc93996879cc4a06e0fe2',1,'BlisModel']]], + ['packsharedknowlege_585',['packSharedKnowlege',['../classBlisModel.html#a0827e92f88980a86ec5816d2dc4304b6',1,'BlisModel']]], + ['packsharedpseudocost_586',['packSharedPseudocost',['../classBlisModel.html#a400701760c99b059015c4bbea5fb42f4',1,'BlisModel']]], + ['packsharedvariables_587',['packSharedVariables',['../classBlisModel.html#aa8722625dbf9490d99a72eda817eb7d1',1,'BlisModel']]], + ['parallel_588',['parallel',['../classBlisTreeNode.html#a5ed681ea5a1eb232ba4fb5e749ad0065',1,'BlisTreeNode']]], + ['passinpriorities_589',['passInPriorities',['../classBlisModel.html#a5cde6e7d88bf194bcc8e28a58b692325',1,'BlisModel']]], + ['postmatrix_5f_590',['postMatrix_',['../classBlisPresolve.html#aabde24f3039bed8d839649566aeaf78e',1,'BlisPresolve']]], + ['postprocess_591',['postprocess',['../classBlisModel.html#ae43419bd44816eba9e1907d4e923a87f',1,'BlisModel::postprocess()'],['../classBlisPresolve.html#a648ef1f102cdf9cce2e65ead504623e7',1,'BlisPresolve::postprocess()']]], + ['posx_5f_592',['posx_',['../classVrpModel.html#a53027aa34c2bf497ddde6db53211958e',1,'VrpModel']]], + ['posy_5f_593',['posy_',['../classVrpModel.html#a52e89633a65dbc0c3b2db8956af2bbe2',1,'VrpModel']]], + ['preferrednewfeasible_594',['preferredNewFeasible',['../classBlisObjectInt.html#a8842eb0f45c2616999a99745caa19394',1,'BlisObjectInt']]], + ['prematrix_5f_595',['preMatrix_',['../classBlisPresolve.html#a68368b99f7140a537211d1686dffdb57',1,'BlisPresolve']]], + ['prenode_5f_596',['preNode_',['../classVrpHeurTSP.html#a5502b8f31ddc1de402338525e3be5c82',1,'VrpHeurTSP']]], + ['preprocess_597',['preprocess',['../classBlisModel.html#af07c6e06a26f164e5c0a7b3f7ba4866b',1,'BlisModel::preprocess()'],['../classBlisPresolve.html#a1c8eb0d12b70eb54e72f6600ae99516a',1,'BlisPresolve::preprocess()']]], + ['presolve_598',['presolve',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4a2d1e6e2601af4072e95726f993d28149',1,'BlisParams']]], + ['presolve_5f_599',['presolve_',['../classBlisModel.html#a7153ce7b58478d38f3c3861eef6d005d',1,'BlisModel']]], + ['presolved_600',['presolved',['../classBlisModel.html#ae7c50e4d8ad58ebb2555e733caa70d93',1,'BlisModel']]], + ['presolvedlpsolver_5f_601',['presolvedLpSolver_',['../classBlisModel.html#ad906fbfef3763db27a38f9957f533160',1,'BlisModel']]], + ['presolveforthewholetree_602',['presolveForTheWholeTree',['../classBlisModel.html#ab6fe5d5751598a61b45dc36793a443b7',1,'BlisModel']]], + ['print_603',['print',['../classVrpSolution.html#aaa1cf0b4c434b5a83d66481b88ad5928',1,'VrpSolution::print()'],['../classBlisBranchObjectBilevel.html#aa51c3df8439724633324343fed07a2ed',1,'BlisBranchObjectBilevel::print()'],['../classBlisBranchObjectInt.html#a04b9c9bb415f3527e0c29dbd2f2b8e96',1,'BlisBranchObjectInt::print()'],['../classBlisSolution.html#a4e18302cedfad4ae67c43e529938f507',1,'BlisSolution::print()']]], + ['printdesc_604',['printDesc',['../classVrpVariable.html#a8041e35ca156638b740d6d4d523c3a6e',1,'VrpVariable']]], + ['priority_605',['priority',['../classBlisModel.html#a70f17a669d5ee77aeb795a8641276197',1,'BlisModel::priority() const'],['../classBlisModel.html#a8cf8a0f82bf9fbe650500ee0a00e08fe',1,'BlisModel::priority(int sequence) const']]], + ['priority_5f_606',['priority_',['../classBlisModel.html#aac4585e76c04ecc8088cda3b293f0139',1,'BlisModel']]], + ['problemsetup_607',['problemSetup',['../classBlisModel.html#a41e2b1fa4f3983591e952548d88c1b28',1,'BlisModel']]], + ['process_608',['process',['../classBlisTreeNode.html#a02075c2c6ed1b15cfd2f47f8d5227845',1,'BlisTreeNode::process()'],['../classBlisTreeNode.html#a4fbacf0eefe80be41406f2b1831f5fed',1,'BlisTreeNode::process(bool isRoot=false, bool rampUp=false)']]], + ['pseudocost_609',['pseudocost',['../classBlisObjectInt.html#a2e7ae7b834cb46919f38454f4b1a4ae8',1,'BlisObjectInt']]], + ['pseudocost_5f_610',['pseudocost_',['../classBlisObjectInt.html#ab949c3591cb5c0b2b3c698023de79add',1,'BlisObjectInt']]], + ['pseudorelibility_611',['pseudoRelibility',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39babe1733f871e8efee817e6bf188f81cfa',1,'BlisParams']]], + ['pseudoweight_612',['pseudoWeight',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271a3f948beed60ba92b55d59261875e84be',1,'BlisParams']]] +]; diff --git a/Doxygen/0.94/search/classes_0.html b/Doxygen/0.94/search/classes_0.html new file mode 100644 index 0000000..f7e4c14 --- /dev/null +++ b/Doxygen/0.94/search/classes_0.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/classes_0.js b/Doxygen/0.94/search/classes_0.js new file mode 100644 index 0000000..c22904b --- /dev/null +++ b/Doxygen/0.94/search/classes_0.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['_5fnode_859',['_NODE',['../struct__NODE.html',1,'']]] +]; diff --git a/Doxygen/0.94/search/classes_1.html b/Doxygen/0.94/search/classes_1.html new file mode 100644 index 0000000..c7ff4b3 --- /dev/null +++ b/Doxygen/0.94/search/classes_1.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/classes_1.js b/Doxygen/0.94/search/classes_1.js new file mode 100644 index 0000000..f63e5c3 --- /dev/null +++ b/Doxygen/0.94/search/classes_1.js @@ -0,0 +1,26 @@ +var searchData= +[ + ['best_5ftours_860',['BEST_TOURS',['../structBEST__TOURS.html',1,'']]], + ['blisbranchobjectbilevel_861',['BlisBranchObjectBilevel',['../classBlisBranchObjectBilevel.html',1,'']]], + ['blisbranchobjectint_862',['BlisBranchObjectInt',['../classBlisBranchObjectInt.html',1,'']]], + ['blisbranchstrategybilevel_863',['BlisBranchStrategyBilevel',['../classBlisBranchStrategyBilevel.html',1,'']]], + ['blisbranchstrategymaxinf_864',['BlisBranchStrategyMaxInf',['../classBlisBranchStrategyMaxInf.html',1,'']]], + ['blisbranchstrategypseudo_865',['BlisBranchStrategyPseudo',['../classBlisBranchStrategyPseudo.html',1,'']]], + ['blisbranchstrategyrel_866',['BlisBranchStrategyRel',['../classBlisBranchStrategyRel.html',1,'']]], + ['blisbranchstrategystrong_867',['BlisBranchStrategyStrong',['../classBlisBranchStrategyStrong.html',1,'']]], + ['bliscongenerator_868',['BlisConGenerator',['../classBlisConGenerator.html',1,'']]], + ['blisconstraint_869',['BlisConstraint',['../classBlisConstraint.html',1,'']]], + ['blisheuristic_870',['BlisHeuristic',['../classBlisHeuristic.html',1,'']]], + ['blisheurround_871',['BlisHeurRound',['../classBlisHeurRound.html',1,'']]], + ['blismessage_872',['BlisMessage',['../classBlisMessage.html',1,'']]], + ['blismodel_873',['BlisModel',['../classBlisModel.html',1,'']]], + ['blisnodedesc_874',['BlisNodeDesc',['../classBlisNodeDesc.html',1,'']]], + ['blisobjectint_875',['BlisObjectInt',['../classBlisObjectInt.html',1,'']]], + ['blisparams_876',['BlisParams',['../classBlisParams.html',1,'']]], + ['blispresolve_877',['BlisPresolve',['../classBlisPresolve.html',1,'']]], + ['blispseudocost_878',['BlisPseudocost',['../classBlisPseudocost.html',1,'']]], + ['blissolution_879',['BlisSolution',['../classBlisSolution.html',1,'']]], + ['blisstrong_880',['BlisStrong',['../structBlisStrong.html',1,'']]], + ['blistreenode_881',['BlisTreeNode',['../classBlisTreeNode.html',1,'']]], + ['blisvariable_882',['BlisVariable',['../classBlisVariable.html',1,'']]] +]; diff --git a/Doxygen/0.94/search/classes_2.html b/Doxygen/0.94/search/classes_2.html new file mode 100644 index 0000000..0d1e8a0 --- /dev/null +++ b/Doxygen/0.94/search/classes_2.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/classes_2.js b/Doxygen/0.94/search/classes_2.js new file mode 100644 index 0000000..cba2e4e --- /dev/null +++ b/Doxygen/0.94/search/classes_2.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['edge_883',['EDGE',['../structEDGE.html',1,'']]], + ['edge_5fdata_884',['EDGE_DATA',['../structEDGE__DATA.html',1,'']]], + ['elist_885',['ELIST',['../structELIST.html',1,'']]] +]; diff --git a/Doxygen/0.94/search/classes_3.html b/Doxygen/0.94/search/classes_3.html new file mode 100644 index 0000000..2102545 --- /dev/null +++ b/Doxygen/0.94/search/classes_3.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/classes_3.js b/Doxygen/0.94/search/classes_3.js new file mode 100644 index 0000000..278ec9d --- /dev/null +++ b/Doxygen/0.94/search/classes_3.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['route_5fdata_886',['ROUTE_DATA',['../structROUTE__DATA.html',1,'']]] +]; diff --git a/Doxygen/0.94/search/classes_4.html b/Doxygen/0.94/search/classes_4.html new file mode 100644 index 0000000..095ab59 --- /dev/null +++ b/Doxygen/0.94/search/classes_4.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/classes_4.js b/Doxygen/0.94/search/classes_4.js new file mode 100644 index 0000000..e550da1 --- /dev/null +++ b/Doxygen/0.94/search/classes_4.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['small_5fgraph_887',['SMALL_GRAPH',['../structSMALL__GRAPH.html',1,'']]] +]; diff --git a/Doxygen/0.94/search/classes_5.html b/Doxygen/0.94/search/classes_5.html new file mode 100644 index 0000000..fc9cdc9 --- /dev/null +++ b/Doxygen/0.94/search/classes_5.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/classes_5.js b/Doxygen/0.94/search/classes_5.js new file mode 100644 index 0000000..f321085 --- /dev/null +++ b/Doxygen/0.94/search/classes_5.js @@ -0,0 +1,11 @@ +var searchData= +[ + ['vertex_888',['VERTEX',['../structVERTEX.html',1,'']]], + ['vrpcutgenerator_889',['VrpCutGenerator',['../classVrpCutGenerator.html',1,'']]], + ['vrpheurtsp_890',['VrpHeurTSP',['../classVrpHeurTSP.html',1,'']]], + ['vrpmodel_891',['VrpModel',['../classVrpModel.html',1,'']]], + ['vrpnetwork_892',['VrpNetwork',['../classVrpNetwork.html',1,'']]], + ['vrpparams_893',['VrpParams',['../classVrpParams.html',1,'']]], + ['vrpsolution_894',['VrpSolution',['../classVrpSolution.html',1,'']]], + ['vrpvariable_895',['VrpVariable',['../classVrpVariable.html',1,'']]] +]; diff --git a/Doxygen/0.94/search/close.png b/Doxygen/0.94/search/close.png new file mode 100644 index 0000000..9342d3d Binary files /dev/null and b/Doxygen/0.94/search/close.png differ diff --git a/Doxygen/0.94/search/defines_0.html b/Doxygen/0.94/search/defines_0.html new file mode 100644 index 0000000..2deb369 --- /dev/null +++ b/Doxygen/0.94/search/defines_0.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_0.js b/Doxygen/0.94/search/defines_0.js new file mode 100644 index 0000000..e84940e --- /dev/null +++ b/Doxygen/0.94/search/defines_0.js @@ -0,0 +1,13 @@ +var searchData= +[ + ['_5fatt_1616',['_ATT',['../VrpConstants_8h.html#a17f28de590722ee5fe0e80c0476e5a1a',1,'VrpConstants.h']]], + ['_5fceil_5f2d_1617',['_CEIL_2D',['../VrpConstants_8h.html#a8ea93f62f824c258d5b19be991f6a01d',1,'VrpConstants.h']]], + ['_5feuc_5f2d_1618',['_EUC_2D',['../VrpConstants_8h.html#ace67206831a8a8f7be0657e4a186ef08',1,'VrpConstants.h']]], + ['_5feuc_5f3d_1619',['_EUC_3D',['../VrpConstants_8h.html#aa3f3882e7ed6d35a790827fbbdf4e4dc',1,'VrpConstants.h']]], + ['_5fexplicit_1620',['_EXPLICIT',['../VrpConstants_8h.html#a70517d5166901cf0e71cbb2ac60551f3',1,'VrpConstants.h']]], + ['_5fgeo_1621',['_GEO',['../VrpConstants_8h.html#a66aa6d999584bd77c60f983d132a0bb2',1,'VrpConstants.h']]], + ['_5fman_5f2d_1622',['_MAN_2D',['../VrpConstants_8h.html#a8798d9626475ccc6055aadf6763c6ef8',1,'VrpConstants.h']]], + ['_5fman_5f3d_1623',['_MAN_3D',['../VrpConstants_8h.html#a063f0e75f1d62b5b7dd5222d8712ab9c',1,'VrpConstants.h']]], + ['_5fmax_5f2d_1624',['_MAX_2D',['../VrpConstants_8h.html#aeca2142012f5e10264298e2fadd5ce33',1,'VrpConstants.h']]], + ['_5fmax_5f3d_1625',['_MAX_3D',['../VrpConstants_8h.html#a3fe53d9f5b18c305d2ed8ef43eddcde0',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_1.html b/Doxygen/0.94/search/defines_1.html new file mode 100644 index 0000000..e0d0b6d --- /dev/null +++ b/Doxygen/0.94/search/defines_1.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_1.js b/Doxygen/0.94/search/defines_1.js new file mode 100644 index 0000000..b11ada1 --- /dev/null +++ b/Doxygen/0.94/search/defines_1.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['active_5fnode_5flist_5fblock_5fsize_1626',['ACTIVE_NODE_LIST_BLOCK_SIZE',['../VrpConstants_8h.html#af59c49262d0a771e45e4f9ef2239fa28',1,'VrpConstants.h']]], + ['all_5ftsp_5fcuts_1627',['ALL_TSP_CUTS',['../VrpConstants_8h.html#a7a78075b44637c73356f5156dfdbcdc7',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_10.html b/Doxygen/0.94/search/defines_10.html new file mode 100644 index 0000000..ad7df08 --- /dev/null +++ b/Doxygen/0.94/search/defines_10.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_10.js b/Doxygen/0.94/search/defines_10.js new file mode 100644 index 0000000..8a03c70 --- /dev/null +++ b/Doxygen/0.94/search/defines_10.js @@ -0,0 +1,13 @@ +var searchData= +[ + ['random_1707',['RANDOM',['../VrpMacros_8h.html#a69f1bba01cab6b4ca24a6f755e9a1980',1,'VrpMacros.h']]], + ['remaining_5fedges_1708',['REMAINING_EDGES',['../VrpConstants_8h.html#a26b771dda140bc6f5ab2f9ffd1c2f770',1,'VrpConstants.h']]], + ['rhs_1709',['RHS',['../VrpMacros_8h.html#a95637851a772741c3d74e507bb0e6b1d',1,'VrpMacros.h']]], + ['route_5ffins_5fstart_5frule_1710',['ROUTE_FINS_START_RULE',['../VrpConstants_8h.html#a7d175450a11e4b936a20001e240abcc8',1,'VrpConstants.h']]], + ['route_5ffins_5fvrp_5fdata_1711',['ROUTE_FINS_VRP_DATA',['../VrpConstants_8h.html#a65914f985268b9039ddb72a4ba2e4f09',1,'VrpConstants.h']]], + ['route_5ffnins_5fstart_5frule_1712',['ROUTE_FNINS_START_RULE',['../VrpConstants_8h.html#acf767d72d39c214f132d990318902892',1,'VrpConstants.h']]], + ['route_5ffnins_5fvrp_5fdata_1713',['ROUTE_FNINS_VRP_DATA',['../VrpConstants_8h.html#accf0e84aea7d8329a31312dff17a514f',1,'VrpConstants.h']]], + ['route_5fnins_5fstart_5frule_1714',['ROUTE_NINS_START_RULE',['../VrpConstants_8h.html#a1656cb01458776ec019779d14330e6c2',1,'VrpConstants.h']]], + ['route_5fnins_5fvrp_5fdata_1715',['ROUTE_NINS_VRP_DATA',['../VrpConstants_8h.html#a24284046e94226eb084ab1b16984807e',1,'VrpConstants.h']]], + ['rrr_1716',['RRR',['../VrpConstants_8h.html#ad6bfdff0b1311699c311726cf75092a5',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_11.html b/Doxygen/0.94/search/defines_11.html new file mode 100644 index 0000000..c888f22 --- /dev/null +++ b/Doxygen/0.94/search/defines_11.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_11.js b/Doxygen/0.94/search/defines_11.js new file mode 100644 index 0000000..e3d3b0e --- /dev/null +++ b/Doxygen/0.94/search/defines_11.js @@ -0,0 +1,36 @@ +var searchData= +[ + ['s3_5fnumroutes_1717',['S3_NUMROUTES',['../VrpConstants_8h.html#a96d88c06434f314225ece4d4790ddb8f',1,'VrpConstants.h']]], + ['s_5fexchange_1718',['S_EXCHANGE',['../VrpConstants_8h.html#a2e7f4534c119670f07da6092529602a9',1,'VrpConstants.h']]], + ['s_5fexchange2_1719',['S_EXCHANGE2',['../VrpConstants_8h.html#a1134361f3543d0d384247990b8f993fe',1,'VrpConstants.h']]], + ['s_5ffarnear_5fins_1720',['S_FARNEAR_INS',['../VrpConstants_8h.html#abd3eb99194a5ffd85ff407747c0143f1',1,'VrpConstants.h']]], + ['s_5ffarthest_5fins_1721',['S_FARTHEST_INS',['../VrpConstants_8h.html#a7eb205cb2b359f1738424973d2f977e9',1,'VrpConstants.h']]], + ['s_5fmst_1722',['S_MST',['../VrpConstants_8h.html#ad735a04b2567abdc7c41c23821b96ae6',1,'VrpConstants.h']]], + ['s_5fnear_5fcluster_1723',['S_NEAR_CLUSTER',['../VrpConstants_8h.html#a020f45d22de1ff4f701fa50d093db38b',1,'VrpConstants.h']]], + ['s_5fnearest_5fins_1724',['S_NEAREST_INS',['../VrpConstants_8h.html#a09f6a11392171af76b08192e74e9001c',1,'VrpConstants.h']]], + ['s_5fsavings_1725',['S_SAVINGS',['../VrpConstants_8h.html#a190f0cf669122d2cea727a9cd94bcf36',1,'VrpConstants.h']]], + ['s_5fsavings2_1726',['S_SAVINGS2',['../VrpConstants_8h.html#a327dc229415e0e60da5e0d31a4f5c41b',1,'VrpConstants.h']]], + ['s_5fsavings3_1727',['S_SAVINGS3',['../VrpConstants_8h.html#a8603b0142cf6b8dc5f500cdc030390f5',1,'VrpConstants.h']]], + ['s_5fsweep_1728',['S_SWEEP',['../VrpConstants_8h.html#a32bb1d28558e7d992a42e32f47b3f86b',1,'VrpConstants.h']]], + ['s_5ftsp_5ffi_1729',['S_TSP_FI',['../VrpConstants_8h.html#a85cb04d1bad1f7a268b3d850103ac5ba',1,'VrpConstants.h']]], + ['s_5ftsp_5ffini_1730',['S_TSP_FINI',['../VrpConstants_8h.html#a4cf80afeaa7d0c7afaf8b0c03d1bafcd',1,'VrpConstants.h']]], + ['s_5ftsp_5fni_1731',['S_TSP_NI',['../VrpConstants_8h.html#a3f817ddbef6c19ff7c0a25f725da71fc',1,'VrpConstants.h']]], + ['save_5fsmall_5fgraph_1732',['SAVE_SMALL_GRAPH',['../VrpConstants_8h.html#a624740cfe63efe9e3c0cb5628483541c',1,'VrpConstants.h']]], + ['savings_1733',['SAVINGS',['../VrpConstants_8h.html#acde516df548b4e09c2cd9b3b966b08db',1,'VrpConstants.h']]], + ['savings2_1734',['SAVINGS2',['../VrpConstants_8h.html#ac61e998a74c2226d117256005c43dbad',1,'VrpConstants.h']]], + ['savings2_5fdata_1735',['SAVINGS2_DATA',['../VrpConstants_8h.html#a617262ed2af1bef6fbb2ad07180576bc',1,'VrpConstants.h']]], + ['savings3_1736',['SAVINGS3',['../VrpConstants_8h.html#a1a29f7eac48e66483e61e2584e13a2b3',1,'VrpConstants.h']]], + ['savings3_5fdata_1737',['SAVINGS3_DATA',['../VrpConstants_8h.html#a46f8e1c037aae85380ff40d2f6d64eaf',1,'VrpConstants.h']]], + ['savings_5fdata_1738',['SAVINGS_DATA',['../VrpConstants_8h.html#a6d09f4cc18dedac6f5986a6929c9d8fa',1,'VrpConstants.h']]], + ['second_5fset_1739',['SECOND_SET',['../VrpConstants_8h.html#af43e13a1127ca2859c15024209006b0e',1,'VrpConstants.h']]], + ['some_5fare_5fbase_1740',['SOME_ARE_BASE',['../VrpConstants_8h.html#afb5f1001a7ffcd2f3e0fec481ded244a',1,'VrpConstants.h']]], + ['srandom_1741',['SRANDOM',['../VrpMacros_8h.html#a9dc5d6203c04c019797e4200ed33ac28',1,'VrpMacros.h']]], + ['stdc_5fheaders_1742',['STDC_HEADERS',['../config_8h.html#a550e5c272cc3cf3814651721167dcd23',1,'config.h']]], + ['stop_1743',['STOP',['../VrpConstants_8h.html#ae19b6bb2940d2fbe0a79852b070eeafd',1,'VrpConstants.h']]], + ['subtour_1744',['SUBTOUR',['../VrpConstants_8h.html#a46e30fcd6bfdf68c85e2933e00782a3b',1,'VrpConstants.h']]], + ['subtour_5felim_1745',['SUBTOUR_ELIM',['../VrpConstants_8h.html#ae14bac8a678cb9541182e8d321268b7b',1,'VrpConstants.h']]], + ['subtour_5felim_5facross_1746',['SUBTOUR_ELIM_ACROSS',['../VrpConstants_8h.html#a34621a941fcd35cea57c36ee11d20625',1,'VrpConstants.h']]], + ['subtour_5felim_5fside_1747',['SUBTOUR_ELIM_SIDE',['../VrpConstants_8h.html#ab86dcf73424a19a9526d0c6b3b12b4c7',1,'VrpConstants.h']]], + ['sweep_1748',['SWEEP',['../VrpConstants_8h.html#a2d6fe1ca06dd58594b3504b03588b38b',1,'VrpConstants.h']]], + ['sweep_5ftrials_1749',['SWEEP_TRIALS',['../VrpConstants_8h.html#aaa2985c30eb9679a74baf8618568cffd',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_12.html b/Doxygen/0.94/search/defines_12.html new file mode 100644 index 0000000..05e32bd --- /dev/null +++ b/Doxygen/0.94/search/defines_12.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_12.js b/Doxygen/0.94/search/defines_12.js new file mode 100644 index 0000000..deb1870 --- /dev/null +++ b/Doxygen/0.94/search/defines_12.js @@ -0,0 +1,11 @@ +var searchData= +[ + ['tsp_5ffi_1750',['TSP_FI',['../VrpConstants_8h.html#ab17f64bb31fe95eeea4c7f563c3fd04a',1,'VrpConstants.h']]], + ['tsp_5ffi_5ftrials_1751',['TSP_FI_TRIALS',['../VrpConstants_8h.html#afb5179c25c94168e389d0ba19e7108dd',1,'VrpConstants.h']]], + ['tsp_5ffini_1752',['TSP_FINI',['../VrpConstants_8h.html#a761fe151adb1e91d1afad484a8c2ba7a',1,'VrpConstants.h']]], + ['tsp_5ffini_5fratio_1753',['TSP_FINI_RATIO',['../VrpConstants_8h.html#ab137dae9c6537e18817b92a3d52250a2',1,'VrpConstants.h']]], + ['tsp_5ffini_5ftrials_1754',['TSP_FINI_TRIALS',['../VrpConstants_8h.html#a6592c258de1bc550cf0e9cc35f42881f',1,'VrpConstants.h']]], + ['tsp_5fni_1755',['TSP_NI',['../VrpConstants_8h.html#af7745a4f2243b0a746593f9d9fdc4e33',1,'VrpConstants.h']]], + ['tsp_5fni_5ftrials_1756',['TSP_NI_TRIALS',['../VrpConstants_8h.html#adfc5f2ecb628d1159f412f34b1af59b8',1,'VrpConstants.h']]], + ['tsp_5fstart_5fpoint_1757',['TSP_START_POINT',['../VrpConstants_8h.html#a23c040ad123a65032ec7470ab25056b2',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_13.html b/Doxygen/0.94/search/defines_13.html new file mode 100644 index 0000000..42fb6c3 --- /dev/null +++ b/Doxygen/0.94/search/defines_13.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_13.js b/Doxygen/0.94/search/defines_13.js new file mode 100644 index 0000000..7598f0b --- /dev/null +++ b/Doxygen/0.94/search/defines_13.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['version_1758',['VERSION',['../config_8h.html#a1c6d5de492ac61ad29aec7aa9a436bbf',1,'config.h']]], + ['vrp_5fbroadcast_5fdata_1759',['VRP_BROADCAST_DATA',['../VrpConstants_8h.html#a76c5f9be943260ff56efd13c39578f0b',1,'VrpConstants.h']]], + ['vrp_5flb_5fdata_1760',['VRP_LB_DATA',['../VrpConstants_8h.html#ac658d1344da5abac9cc0180f391f0c25',1,'VrpConstants.h']]], + ['vrp_5flb_5fdata2_1761',['VRP_LB_DATA2',['../VrpConstants_8h.html#a31a03399746198bfe88166c8937528cc',1,'VrpConstants.h']]], + ['vrp_5fnot_5fset_1762',['VRP_NOT_SET',['../VrpConstants_8h.html#a2c20ca63022ab82568b0cc925c782f78',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_2.html b/Doxygen/0.94/search/defines_2.html new file mode 100644 index 0000000..707f942 --- /dev/null +++ b/Doxygen/0.94/search/defines_2.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_2.js b/Doxygen/0.94/search/defines_2.js new file mode 100644 index 0000000..85f90d4 --- /dev/null +++ b/Doxygen/0.94/search/defines_2.js @@ -0,0 +1,14 @@ +var searchData= +[ + ['biconnected_1628',['BICONNECTED',['../VrpConstants_8h.html#a8525356181ae0ccab3ccad101dd97a36',1,'VrpConstants.h']]], + ['bins_1629',['BINS',['../VrpMacros_8h.html#a2b3c5d1f031312cf3827be5d9814c865',1,'VrpMacros.h']]], + ['blis_5fcut_5fdisable_1630',['BLIS_CUT_DISABLE',['../Blis_8h.html#ac132ee8e02c4fb123f78ee555b2fbbf5',1,'Blis.h']]], + ['blis_5fheur_5fround_5fdisable_1631',['BLIS_HEUR_ROUND_DISABLE',['../Blis_8h.html#a74f942d292ddd1d02e10165ceb95c041',1,'Blis.h']]], + ['blis_5fpseudo_1632',['BLIS_PSEUDO',['../Blis_8h.html#ace83b5fd1f267082ce313fef8a4c92bd',1,'Blis.h']]], + ['blis_5fversion_1633',['BLIS_VERSION',['../config__blis__default_8h.html#ace8dfb19d653a0fec2c87dec3ed3f041',1,'BLIS_VERSION(): config_blis_default.h'],['../config_8h.html#ace8dfb19d653a0fec2c87dec3ed3f041',1,'BLIS_VERSION(): config.h'],['../config__blis_8h.html#ace8dfb19d653a0fec2c87dec3ed3f041',1,'BLIS_VERSION(): config_blis.h']]], + ['blis_5fversion_5fmajor_1634',['BLIS_VERSION_MAJOR',['../config__blis__default_8h.html#ab8c8dffb1d60e178f82766a2b37438e1',1,'BLIS_VERSION_MAJOR(): config_blis_default.h'],['../config_8h.html#ab8c8dffb1d60e178f82766a2b37438e1',1,'BLIS_VERSION_MAJOR(): config.h'],['../config__blis_8h.html#ab8c8dffb1d60e178f82766a2b37438e1',1,'BLIS_VERSION_MAJOR(): config_blis.h']]], + ['blis_5fversion_5fminor_1635',['BLIS_VERSION_MINOR',['../config__blis__default_8h.html#afb7d98cbd467d6c9f72fb4b62d565a15',1,'BLIS_VERSION_MINOR(): config_blis_default.h'],['../config_8h.html#afb7d98cbd467d6c9f72fb4b62d565a15',1,'BLIS_VERSION_MINOR(): config.h'],['../config__blis_8h.html#afb7d98cbd467d6c9f72fb4b62d565a15',1,'BLIS_VERSION_MINOR(): config_blis.h']]], + ['blis_5fversion_5frelease_1636',['BLIS_VERSION_RELEASE',['../config__blis__default_8h.html#a2872f59f881e1a13ba2c6369a348104a',1,'BLIS_VERSION_RELEASE(): config_blis_default.h'],['../config_8h.html#a2872f59f881e1a13ba2c6369a348104a',1,'BLIS_VERSION_RELEASE(): config.h'],['../config__blis_8h.html#a2872f59f881e1a13ba2c6369a348104a',1,'BLIS_VERSION_RELEASE(): config_blis.h']]], + ['blossom_1637',['BLOSSOM',['../VrpConstants_8h.html#acb9ff0884eab7d22349beaa04a7fb1c8',1,'VrpConstants.h']]], + ['both_1638',['BOTH',['../VrpConstants_8h.html#a85ddca800985505ab1036cf0d1be748b',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_3.html b/Doxygen/0.94/search/defines_3.html new file mode 100644 index 0000000..f30be10 --- /dev/null +++ b/Doxygen/0.94/search/defines_3.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_3.js b/Doxygen/0.94/search/defines_3.js new file mode 100644 index 0000000..9ce0d86 --- /dev/null +++ b/Doxygen/0.94/search/defines_3.js @@ -0,0 +1,16 @@ +var searchData= +[ + ['cheap_5fedges_1639',['CHEAP_EDGES',['../VrpConstants_8h.html#a98031116ef6837420734db4c6f0f1b0d',1,'VrpConstants.h']]], + ['clique_1640',['CLIQUE',['../VrpConstants_8h.html#a784fe545d9837968740969cc7b1e5a1e',1,'VrpConstants.h']]], + ['coin_5fblis_5fchecklevel_1641',['COIN_BLIS_CHECKLEVEL',['../config__default_8h.html#aa2f519ca1070fc682ffbe0daabf3c90d',1,'COIN_BLIS_CHECKLEVEL(): config_default.h'],['../config_8h.html#aa2f519ca1070fc682ffbe0daabf3c90d',1,'COIN_BLIS_CHECKLEVEL(): config.h']]], + ['coin_5fblis_5fverbosity_1642',['COIN_BLIS_VERBOSITY',['../config__default_8h.html#a6f29ffe227c86c51d7d06a3da67a09bd',1,'COIN_BLIS_VERBOSITY(): config_default.h'],['../config_8h.html#a6f29ffe227c86c51d7d06a3da67a09bd',1,'COIN_BLIS_VERBOSITY(): config.h']]], + ['coin_5fhas_5falps_1643',['COIN_HAS_ALPS',['../config__default_8h.html#a95079b28a7d9ab31501d19e15d21c640',1,'config_default.h']]], + ['coin_5fhas_5fbcps_1644',['COIN_HAS_BCPS',['../config__default_8h.html#a3fd1a3d3fe5794c73b8e94ede5504178',1,'config_default.h']]], + ['coin_5fhas_5fblis_1645',['COIN_HAS_BLIS',['../config__default_8h.html#aa52f74a7bd72031f9c30074b5b1ebf21',1,'config_default.h']]], + ['coin_5fhas_5fclp_1646',['COIN_HAS_CLP',['../config__default_8h.html#aa647ba0f32c1ba872d2c4d45cf9cc096',1,'config_default.h']]], + ['coin_5fhas_5fcoindepend_1647',['COIN_HAS_COINDEPEND',['../config_8h.html#a9fb63efede1bfb172445da014a0a92bf',1,'config.h']]], + ['coin_5fhas_5fcoinutils_1648',['COIN_HAS_COINUTILS',['../config__default_8h.html#a3d2273b012898f0612a5de41b8d20ebb',1,'config_default.h']]], + ['coin_5fhas_5fsample_1649',['COIN_HAS_SAMPLE',['../config_8h.html#a8ea44e87e1d5c8c821de2055bb250662',1,'config.h']]], + ['comb_1650',['COMB',['../VrpConstants_8h.html#a44cdd9118918dc1dd6d15c05465ba2fd',1,'VrpConstants.h']]], + ['connected_1651',['CONNECTED',['../VrpConstants_8h.html#af6202935c026af12978d46a765dafb90',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_4.html b/Doxygen/0.94/search/defines_4.html new file mode 100644 index 0000000..046ad4a --- /dev/null +++ b/Doxygen/0.94/search/defines_4.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_4.js b/Doxygen/0.94/search/defines_4.js new file mode 100644 index 0000000..2af24b1 --- /dev/null +++ b/Doxygen/0.94/search/defines_4.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['dead_1652',['DEAD',['../VrpConstants_8h.html#a3c8793c7acb4598d2ebcd8288f29ee69',1,'VrpConstants.h']]], + ['delete_5fand_1653',['DELETE_AND',['../VrpConstants_8h.html#a721fb40162f2c6c5ace387dc38bcbf95',1,'VrpConstants.h']]], + ['delete_5fpower_1654',['DELETE_POWER',['../VrpConstants_8h.html#ac24f9c530dd23db15fed2fa3ae1a911f',1,'VrpConstants.h']]], + ['depot_5fpenalty_1655',['DEPOT_PENALTY',['../VrpConstants_8h.html#a48adfcc42f80804fc216c95b51b1ce45',1,'VrpConstants.h']]], + ['display_5fdata_1656',['DISPLAY_DATA',['../VrpConstants_8h.html#a51e58eb1cf6de3f615a728727baccce6',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_5.html b/Doxygen/0.94/search/defines_5.html new file mode 100644 index 0000000..61ce555 --- /dev/null +++ b/Doxygen/0.94/search/defines_5.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_5.js b/Doxygen/0.94/search/defines_5.js new file mode 100644 index 0000000..ea73b88 --- /dev/null +++ b/Doxygen/0.94/search/defines_5.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['everything_5fis_5fbase_1657',['EVERYTHING_IS_BASE',['../VrpConstants_8h.html#aaa913c01ff8dfdd2e6f3b15cc6c2bd62',1,'VrpConstants.h']]], + ['everything_5fis_5fextra_1658',['EVERYTHING_IS_EXTRA',['../VrpConstants_8h.html#ab7f22278c29d26012d7dc050e3c4a279',1,'VrpConstants.h']]], + ['exchange_1659',['EXCHANGE',['../VrpConstants_8h.html#a190fa10f4f5535daadec3efea51f5aea',1,'VrpConstants.h']]], + ['exchange2_1660',['EXCHANGE2',['../VrpConstants_8h.html#a15cdbcf1375b04e4f9688eca0fed9559',1,'VrpConstants.h']]], + ['exchange_5fheur_5ftour_1661',['EXCHANGE_HEUR_TOUR',['../VrpConstants_8h.html#a6f8b04c827c9c50b8515f14d397d7e0d',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_6.html b/Doxygen/0.94/search/defines_6.html new file mode 100644 index 0000000..7496307 --- /dev/null +++ b/Doxygen/0.94/search/defines_6.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_6.js b/Doxygen/0.94/search/defines_6.js new file mode 100644 index 0000000..6691d46 --- /dev/null +++ b/Doxygen/0.94/search/defines_6.js @@ -0,0 +1,9 @@ +var searchData= +[ + ['far_5fins_1662',['FAR_INS',['../VrpConstants_8h.html#aae8fe9fc5294303304fa4065ef6b5d0b',1,'VrpConstants.h']]], + ['farkas_1663',['FARKAS',['../VrpConstants_8h.html#a743821d1ebad579342b52ca326e5ebc7',1,'VrpConstants.h']]], + ['farnear_5fins_1664',['FARNEAR_INS',['../VrpConstants_8h.html#aaaa0095d63588546dcf98689f0506abf',1,'VrpConstants.h']]], + ['farthest_5fins_1665',['FARTHEST_INS',['../VrpConstants_8h.html#a5a0427424714113e6b934d1dbcecb239',1,'VrpConstants.h']]], + ['fini_5fratio_1666',['FINI_RATIO',['../VrpConstants_8h.html#abd6b45390dff855ddad295cb05a51696',1,'VrpConstants.h']]], + ['first_5fset_1667',['FIRST_SET',['../VrpConstants_8h.html#ada9b10fa57fb93a227cf3faccdd058c6',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_7.html b/Doxygen/0.94/search/defines_7.html new file mode 100644 index 0000000..049c0cf --- /dev/null +++ b/Doxygen/0.94/search/defines_7.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_7.js b/Doxygen/0.94/search/defines_7.js new file mode 100644 index 0000000..712ef3e --- /dev/null +++ b/Doxygen/0.94/search/defines_7.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['general_5fnonzeros_1668',['GENERAL_NONZEROS',['../VrpConstants_8h.html#a96f90a6e02e9f18b689f2c1ab72f0215',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_8.html b/Doxygen/0.94/search/defines_8.html new file mode 100644 index 0000000..a952d6c --- /dev/null +++ b/Doxygen/0.94/search/defines_8.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_8.js b/Doxygen/0.94/search/defines_8.js new file mode 100644 index 0000000..3c62931 --- /dev/null +++ b/Doxygen/0.94/search/defines_8.js @@ -0,0 +1,15 @@ +var searchData= +[ + ['have_5fdlfcn_5fh_1669',['HAVE_DLFCN_H',['../config_8h.html#a0ee1617ff2f6885ef384a3dd46f9b9d7',1,'config.h']]], + ['have_5finttypes_5fh_1670',['HAVE_INTTYPES_H',['../config_8h.html#ab90a030ff2790ebdc176660a6dd2a478',1,'config.h']]], + ['have_5fmemory_5fh_1671',['HAVE_MEMORY_H',['../config_8h.html#ae93a78f9d076138897af441c9f86f285',1,'config.h']]], + ['have_5fstdint_5fh_1672',['HAVE_STDINT_H',['../config_8h.html#ab6cd6d1c63c1e26ea2d4537b77148354',1,'config.h']]], + ['have_5fstdlib_5fh_1673',['HAVE_STDLIB_H',['../config_8h.html#a9e0e434ec1a6ddbd97db12b5a32905e0',1,'config.h']]], + ['have_5fstring_5fh_1674',['HAVE_STRING_H',['../config_8h.html#ad4c234dd1625255dc626a15886306e7d',1,'config.h']]], + ['have_5fstrings_5fh_1675',['HAVE_STRINGS_H',['../config_8h.html#a405d10d46190bcb0320524c54eafc850',1,'config.h']]], + ['have_5fsys_5fstat_5fh_1676',['HAVE_SYS_STAT_H',['../config_8h.html#ace156430ba007d19b4348a950d0c692b',1,'config.h']]], + ['have_5fsys_5ftypes_5fh_1677',['HAVE_SYS_TYPES_H',['../config_8h.html#a69dc70bea5d1f8bd2be9740e974fa666',1,'config.h']]], + ['have_5funistd_5fh_1678',['HAVE_UNISTD_H',['../config_8h.html#a219b06937831d0da94d801ab13987639',1,'config.h']]], + ['heur_5ftour_1679',['HEUR_TOUR',['../VrpConstants_8h.html#ace233d76c0809c2f9f15224e1c208a98',1,'VrpConstants.h']]], + ['heur_5ftour_5fwith_5froutes_1680',['HEUR_TOUR_WITH_ROUTES',['../VrpConstants_8h.html#a3d4d4346cbbbb10117fe2725e0e20885',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_9.html b/Doxygen/0.94/search/defines_9.html new file mode 100644 index 0000000..6dd7f69 --- /dev/null +++ b/Doxygen/0.94/search/defines_9.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_9.js b/Doxygen/0.94/search/defines_9.js new file mode 100644 index 0000000..1575220 --- /dev/null +++ b/Doxygen/0.94/search/defines_9.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['in_5ftour_1681',['IN_TOUR',['../VrpConstants_8h.html#a5378aa3d688ad948d2e8db4ad92cc8e1',1,'VrpConstants.h']]], + ['in_5ftree_1682',['IN_TREE',['../VrpConstants_8h.html#a37120fa5e03a9a9169800b9a6da35bbd',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_a.html b/Doxygen/0.94/search/defines_a.html new file mode 100644 index 0000000..415e4ff --- /dev/null +++ b/Doxygen/0.94/search/defines_a.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_a.js b/Doxygen/0.94/search/defines_a.js new file mode 100644 index 0000000..18143a3 --- /dev/null +++ b/Doxygen/0.94/search/defines_a.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['key_5fnum_1683',['KEY_NUM',['../VrpConstants_8h.html#a6fde2706d0ab2fc4922e71855ae9328f',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_b.html b/Doxygen/0.94/search/defines_b.html new file mode 100644 index 0000000..b8ee698 --- /dev/null +++ b/Doxygen/0.94/search/defines_b.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_b.js b/Doxygen/0.94/search/defines_b.js new file mode 100644 index 0000000..c4eeaf1 --- /dev/null +++ b/Doxygen/0.94/search/defines_b.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['length_1684',['LENGTH',['../VrpConstants_8h.html#a30362161c93e3f1a4ee4c673f535b5a8',1,'VrpConstants.h']]], + ['line_5flen_1685',['LINE_LEN',['../VrpConstants_8h.html#a45db13d622cb21897aa934e5ad411c83',1,'VrpConstants.h']]], + ['load_5fsmall_5fgraph_1686',['LOAD_SMALL_GRAPH',['../VrpConstants_8h.html#a2fade6b173bc81b4732f719e8433839c',1,'VrpConstants.h']]], + ['lower_5fbound_1687',['LOWER_BOUND',['../VrpConstants_8h.html#a44b4de4784f751e71fad94edd351ff41',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_c.html b/Doxygen/0.94/search/defines_c.html new file mode 100644 index 0000000..936541d --- /dev/null +++ b/Doxygen/0.94/search/defines_c.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_c.js b/Doxygen/0.94/search/defines_c.js new file mode 100644 index 0000000..0dcf86b --- /dev/null +++ b/Doxygen/0.94/search/defines_c.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['max_1688',['MAX',['../VrpNetwork_8h.html#aacc3ee1a7f283f8ef65cea31f4436a95',1,'VrpNetwork.h']]], + ['min_1689',['MIN',['../VrpNetwork_8h.html#a74e75242132eaabbc1c512488a135926',1,'VrpNetwork.h']]], + ['mst_1690',['MST',['../VrpConstants_8h.html#af76e42db96312986d18322458c0dbcac',1,'VrpConstants.h']]], + ['my_5fpi_1691',['MY_PI',['../VrpConstants_8h.html#acdf314019539248efc2b4f247a1b97ac',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_d.html b/Doxygen/0.94/search/defines_d.html new file mode 100644 index 0000000..6ba81c1 --- /dev/null +++ b/Doxygen/0.94/search/defines_d.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_d.js b/Doxygen/0.94/search/defines_d.js new file mode 100644 index 0000000..477ac90 --- /dev/null +++ b/Doxygen/0.94/search/defines_d.js @@ -0,0 +1,11 @@ +var searchData= +[ + ['nc_5fnumroutes_1692',['NC_NUMROUTES',['../VrpConstants_8h.html#a4b890e9402596df29b21e0d1010f2f55',1,'VrpConstants.h']]], + ['near_5fcluster_1693',['NEAR_CLUSTER',['../VrpConstants_8h.html#ac0ab23031a64eb1524465a4e7273b7cf',1,'VrpConstants.h']]], + ['near_5fins_1694',['NEAR_INS',['../VrpConstants_8h.html#a62d622813face483ed3b8d44f1e267c7',1,'VrpConstants.h']]], + ['nearest_5fins_1695',['NEAREST_INS',['../VrpConstants_8h.html#ac49a7068706b8288e56776c7e1305469',1,'VrpConstants.h']]], + ['no_5fcolumns_1696',['NO_COLUMNS',['../VrpConstants_8h.html#a431cff18804da5b8d4d6ce587890d199',1,'VrpConstants.h']]], + ['no_5ftsp_5fcuts_1697',['NO_TSP_CUTS',['../VrpConstants_8h.html#a27bb6821cb1ddcfde4315ef102f401af',1,'VrpConstants.h']]], + ['not_5fneighbor_1698',['NOT_NEIGHBOR',['../VrpConstants_8h.html#ad24a7894925d1cb727387d50b4e527b6',1,'VrpConstants.h']]], + ['num_5frands_1699',['NUM_RANDS',['../VrpConstants_8h.html#a810d42748e53322fb44d77423ab831c6',1,'VrpConstants.h']]] +]; diff --git a/Doxygen/0.94/search/defines_e.html b/Doxygen/0.94/search/defines_e.html new file mode 100644 index 0000000..10b96b2 --- /dev/null +++ b/Doxygen/0.94/search/defines_e.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_e.js b/Doxygen/0.94/search/defines_e.js new file mode 100644 index 0000000..f9e8b5c --- /dev/null +++ b/Doxygen/0.94/search/defines_e.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['other_5fend_1700',['OTHER_END',['../VrpNetwork_8h.html#af6720cc3678a152524fd7d73f3757be6',1,'VrpNetwork.h']]] +]; diff --git a/Doxygen/0.94/search/defines_f.html b/Doxygen/0.94/search/defines_f.html new file mode 100644 index 0000000..f8818f8 --- /dev/null +++ b/Doxygen/0.94/search/defines_f.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/defines_f.js b/Doxygen/0.94/search/defines_f.js new file mode 100644 index 0000000..16170fb --- /dev/null +++ b/Doxygen/0.94/search/defines_f.js @@ -0,0 +1,9 @@ +var searchData= +[ + ['package_1701',['PACKAGE',['../config_8h.html#aca8570fb706c81df371b7f9bc454ae03',1,'config.h']]], + ['package_5fbugreport_1702',['PACKAGE_BUGREPORT',['../config_8h.html#a1d1d2d7f8d2f95b376954d649ab03233',1,'config.h']]], + ['package_5fname_1703',['PACKAGE_NAME',['../config_8h.html#a1c0439e4355794c09b64274849eb0279',1,'config.h']]], + ['package_5fstring_1704',['PACKAGE_STRING',['../config_8h.html#ac73e6f903c16eca7710f92e36e1c6fbf',1,'config.h']]], + ['package_5ftarname_1705',['PACKAGE_TARNAME',['../config_8h.html#af415af6bfede0e8d5453708afe68651c',1,'config.h']]], + ['package_5fversion_1706',['PACKAGE_VERSION',['../config_8h.html#aa326a05d5e30f9e9a4bb0b4469d5d0c0',1,'config.h']]] +]; diff --git a/Doxygen/0.94/search/enums_0.html b/Doxygen/0.94/search/enums_0.html new file mode 100644 index 0000000..9669700 --- /dev/null +++ b/Doxygen/0.94/search/enums_0.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enums_0.js b/Doxygen/0.94/search/enums_0.js new file mode 100644 index 0000000..5cfe041 --- /dev/null +++ b/Doxygen/0.94/search/enums_0.js @@ -0,0 +1,13 @@ +var searchData= +[ + ['blis_5fmessage_1476',['BLIS_Message',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7c',1,'BlisMessage.h']]], + ['blisbranchingobjecttype_1477',['BlisBranchingObjectType',['../Blis_8h.html#af7a46d2369687c03e9be63deb28d1d22',1,'Blis.h']]], + ['blisbranchingstrategy_1478',['BlisBranchingStrategy',['../Blis_8h.html#a71f5d3b84fc877d267bb12dea9732543',1,'Blis.h']]], + ['bliscutstrategy_1479',['BlisCutStrategy',['../Blis_8h.html#ab237650b9e9875aaae5ff5570be91bd7',1,'Blis.h']]], + ['blisheurstrategy_1480',['BlisHeurStrategy',['../Blis_8h.html#aa5d1dbfb306adc30641ee6bfa592c26a',1,'Blis.h']]], + ['blishotstartstrategy_1481',['BlisHotStartStrategy',['../Blis_8h.html#a3c78345448a83711e017d7fa6ec339cf',1,'Blis.h']]], + ['blislpstatus_1482',['BlisLpStatus',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2ce',1,'Blis.h']]], + ['blisreturnstatus_1483',['BlisReturnStatus',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95b',1,'Blis.h']]], + ['blissolutiontype_1484',['BlisSolutionType',['../Blis_8h.html#a3196633ad467bf2c04f97f13c36ba5c7',1,'Blis.h']]], + ['boolparams_1485',['boolParams',['../classVrpParams.html#a9dd5e6691626b6b8f7cbb3cbc74bfe14',1,'VrpParams']]] +]; diff --git a/Doxygen/0.94/search/enums_1.html b/Doxygen/0.94/search/enums_1.html new file mode 100644 index 0000000..dfec174 --- /dev/null +++ b/Doxygen/0.94/search/enums_1.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enums_1.js b/Doxygen/0.94/search/enums_1.js new file mode 100644 index 0000000..8765342 --- /dev/null +++ b/Doxygen/0.94/search/enums_1.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['chrparams_1486',['chrParams',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4',1,'BlisParams']]] +]; diff --git a/Doxygen/0.94/search/enums_2.html b/Doxygen/0.94/search/enums_2.html new file mode 100644 index 0000000..db70c36 --- /dev/null +++ b/Doxygen/0.94/search/enums_2.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enums_2.js b/Doxygen/0.94/search/enums_2.js new file mode 100644 index 0000000..aa7a2b6 --- /dev/null +++ b/Doxygen/0.94/search/enums_2.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['dblparams_1487',['dblParams',['../classVrpParams.html#a85f3836b3d058d1e521594f81023ab1f',1,'VrpParams::dblParams()'],['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271',1,'BlisParams::dblParams()']]] +]; diff --git a/Doxygen/0.94/search/enums_3.html b/Doxygen/0.94/search/enums_3.html new file mode 100644 index 0000000..fb7ec17 --- /dev/null +++ b/Doxygen/0.94/search/enums_3.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enums_3.js b/Doxygen/0.94/search/enums_3.js new file mode 100644 index 0000000..d0d69fb --- /dev/null +++ b/Doxygen/0.94/search/enums_3.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['intparams_1488',['intParams',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3e',1,'VrpParams::intParams()'],['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39b',1,'BlisParams::intParams()']]] +]; diff --git a/Doxygen/0.94/search/enums_4.html b/Doxygen/0.94/search/enums_4.html new file mode 100644 index 0000000..b8b51ef --- /dev/null +++ b/Doxygen/0.94/search/enums_4.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enums_4.js b/Doxygen/0.94/search/enums_4.js new file mode 100644 index 0000000..7d30d51 --- /dev/null +++ b/Doxygen/0.94/search/enums_4.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['strarrayparams_1489',['strArrayParams',['../classVrpParams.html#a2b9941906895258be908386a7be043ae',1,'VrpParams::strArrayParams()'],['../classBlisParams.html#a50235e57390e794f0cc2420b0383dc6d',1,'BlisParams::strArrayParams()']]], + ['strparams_1490',['strParams',['../classVrpParams.html#ae81aaae2cdbe79b5e2081d2284f46448',1,'VrpParams::strParams()'],['../classBlisParams.html#ad6e0e869ed765edc2ebee19032d1384a',1,'BlisParams::strParams()']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_0.html b/Doxygen/0.94/search/enumvalues_0.html new file mode 100644 index 0000000..9286248 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_0.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_0.js b/Doxygen/0.94/search/enumvalues_0.js new file mode 100644 index 0000000..1f5913a --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_0.js @@ -0,0 +1,61 @@ +var searchData= +[ + ['blis_5fcut_5fstat_5ffinal_1491',['BLIS_CUT_STAT_FINAL',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca3fb6cef65c12576fd52b125a56f5f357',1,'BlisMessage.h']]], + ['blis_5fcut_5fstat_5fnode_1492',['BLIS_CUT_STAT_NODE',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca5aea464d28ffae31ab3575947fd34862',1,'BlisMessage.h']]], + ['blis_5fcutoff_5finc_1493',['BLIS_CUTOFF_INC',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7caea1274138f4e4feeed6faf327d7ab6c0',1,'BlisMessage.h']]], + ['blis_5fdummy_5fend_1494',['BLIS_DUMMY_END',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7cadf48bcb376d32a23c1496309b0fa3339',1,'BlisMessage.h']]], + ['blis_5ffeas_5fcheck_5ftime_1495',['BLIS_FEAS_CHECK_TIME',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca285cb5bc88589409d86aad79545b80ea',1,'BlisMessage.h']]], + ['blis_5fgap_5fno_1496',['BLIS_GAP_NO',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca0e3c89116570cbdb34af9ee7574fc8a2',1,'BlisMessage.h']]], + ['blis_5fgap_5fyes_1497',['BLIS_GAP_YES',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca674e03cf572ebcce609b3bbd9146e000',1,'BlisMessage.h']]], + ['blis_5fheur_5fbefore_5froot_1498',['BLIS_HEUR_BEFORE_ROOT',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7cab1bf25ac3cef314ed29a1feb5c29b2eb',1,'BlisMessage.h']]], + ['blis_5fheur_5fstat_5ffinal_1499',['BLIS_HEUR_STAT_FINAL',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7cad31c0d556e5c69a6679ea7a7d71c2e15',1,'BlisMessage.h']]], + ['blis_5fheur_5fstat_5fnode_1500',['BLIS_HEUR_STAT_NODE',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca2d1d97ffbd5758cd80b8ae541a909951',1,'BlisMessage.h']]], + ['blis_5froot_5fprocess_1501',['BLIS_ROOT_PROCESS',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca2ec73241be5e09dfa5e2e68696507450',1,'BlisMessage.h']]], + ['blis_5froot_5ftime_1502',['BLIS_ROOT_TIME',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca3d738226ef67c2c2913e7123f05e197f',1,'BlisMessage.h']]], + ['blis_5fw_5flp_1503',['BLIS_W_LP',['../BlisMessage_8h.html#a2312a3b7a2d019eaaa4a15a4be2b6f7ca8058fac847fba954cb5e0423fbf3b9ed',1,'BlisMessage.h']]], + ['blisbranchingobjecttypebilevel_1504',['BlisBranchingObjectTypeBilevel',['../Blis_8h.html#af7a46d2369687c03e9be63deb28d1d22a1287258308e765601799ba250178f37a',1,'Blis.h']]], + ['blisbranchingobjecttypeint_1505',['BlisBranchingObjectTypeInt',['../Blis_8h.html#af7a46d2369687c03e9be63deb28d1d22abb85e3fce9067e4002a760b1deb2b4a0',1,'Blis.h']]], + ['blisbranchingobjecttypenone_1506',['BlisBranchingObjectTypeNone',['../Blis_8h.html#af7a46d2369687c03e9be63deb28d1d22acf93f7d1ef9a137e98b9ebd2fd5183d9',1,'Blis.h']]], + ['blisbranchingobjecttypesos_1507',['BlisBranchingObjectTypeSos',['../Blis_8h.html#af7a46d2369687c03e9be63deb28d1d22a89311b926e8c722598fab6cb8f34fce6',1,'Blis.h']]], + ['blisbranchingstrategybilevel_1508',['BlisBranchingStrategyBilevel',['../Blis_8h.html#a71f5d3b84fc877d267bb12dea9732543ab70eed1849e5ab78944b3d42130df453',1,'Blis.h']]], + ['blisbranchingstrategymaxinfeasibility_1509',['BlisBranchingStrategyMaxInfeasibility',['../Blis_8h.html#a71f5d3b84fc877d267bb12dea9732543a401846d0b131c919e81b8eae7d5c3a34',1,'Blis.h']]], + ['blisbranchingstrategypseudocost_1510',['BlisBranchingStrategyPseudoCost',['../Blis_8h.html#a71f5d3b84fc877d267bb12dea9732543a39bcb7f266952fcf89d95f6aa2c41337',1,'Blis.h']]], + ['blisbranchingstrategyreliability_1511',['BlisBranchingStrategyReliability',['../Blis_8h.html#a71f5d3b84fc877d267bb12dea9732543aa53fb0292017e37d267dcbf2d141a078',1,'Blis.h']]], + ['blisbranchingstrategystrong_1512',['BlisBranchingStrategyStrong',['../Blis_8h.html#a71f5d3b84fc877d267bb12dea9732543a9f83d4d4fc187b87866ab4e028ad19c2',1,'Blis.h']]], + ['bliscutstrategyauto_1513',['BlisCutStrategyAuto',['../Blis_8h.html#ab237650b9e9875aaae5ff5570be91bd7aa3c59a77cebe821f169a59ade57a6502',1,'Blis.h']]], + ['bliscutstrategynone_1514',['BlisCutStrategyNone',['../Blis_8h.html#ab237650b9e9875aaae5ff5570be91bd7a42681a911e58770ab2e5f108da22790a',1,'Blis.h']]], + ['bliscutstrategynotset_1515',['BlisCutStrategyNotSet',['../Blis_8h.html#ab237650b9e9875aaae5ff5570be91bd7a17927e85aeb370fef7e1417e31409233',1,'Blis.h']]], + ['bliscutstrategyperiodic_1516',['BlisCutStrategyPeriodic',['../Blis_8h.html#ab237650b9e9875aaae5ff5570be91bd7a3223b15986c1f186776e81eff1a4e9d1',1,'Blis.h']]], + ['bliscutstrategyroot_1517',['BlisCutStrategyRoot',['../Blis_8h.html#ab237650b9e9875aaae5ff5570be91bd7aae905699eeb2e5429ac4c003160b6e94',1,'Blis.h']]], + ['blisheurstrategyauto_1518',['BlisHeurStrategyAuto',['../Blis_8h.html#aa5d1dbfb306adc30641ee6bfa592c26aacc772a97a6604e1ee8e0f5db5ca58d7a',1,'Blis.h']]], + ['blisheurstrategybeforeroot_1519',['BlisHeurStrategyBeforeRoot',['../Blis_8h.html#aa5d1dbfb306adc30641ee6bfa592c26aa0c22945d8e5501f95a52a330066ea343',1,'Blis.h']]], + ['blisheurstrategynone_1520',['BlisHeurStrategyNone',['../Blis_8h.html#aa5d1dbfb306adc30641ee6bfa592c26aac45b2a719be8a58793f84e6626dc7973',1,'Blis.h']]], + ['blisheurstrategynotset_1521',['BlisHeurStrategyNotSet',['../Blis_8h.html#aa5d1dbfb306adc30641ee6bfa592c26aa0107d0c18a5deb3e9a4d04a963e89be2',1,'Blis.h']]], + ['blisheurstrategyperiodic_1522',['BlisHeurStrategyPeriodic',['../Blis_8h.html#aa5d1dbfb306adc30641ee6bfa592c26aa91180339658dfdfb1d5886dca6db2d2b',1,'Blis.h']]], + ['blisheurstrategyroot_1523',['BlisHeurStrategyRoot',['../Blis_8h.html#aa5d1dbfb306adc30641ee6bfa592c26aabe3f1eaa21439c2e991af84350f85dfa',1,'Blis.h']]], + ['blishotstartbranchcorrect_1524',['BlisHotStartBranchCorrect',['../Blis_8h.html#a3c78345448a83711e017d7fa6ec339cfac02d6f2cb1c86d3960cbb68c83148fdb',1,'Blis.h']]], + ['blishotstartbranchincorrect_1525',['BlisHotStartBranchIncorrect',['../Blis_8h.html#a3c78345448a83711e017d7fa6ec339cfadd1b0e92ab9dc6793252bd37c2322b7b',1,'Blis.h']]], + ['blislpstatusabandoned_1526',['BlisLpStatusAbandoned',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2cea1ffeb36b5483639a3da50c6d91507d7c',1,'Blis.h']]], + ['blislpstatusdualinfeasible_1527',['BlisLpStatusDualInfeasible',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2cea5183808da27abb0bb19d63c7f784ca48',1,'Blis.h']]], + ['blislpstatusdualobjlim_1528',['BlisLpStatusDualObjLim',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2ceabd804434c984eab6df57153c0e9e087d',1,'Blis.h']]], + ['blislpstatusiterlim_1529',['BlisLpStatusIterLim',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2ceab0f1203b22257b6abc8f3472843f27b1',1,'Blis.h']]], + ['blislpstatusoptimal_1530',['BlisLpStatusOptimal',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2ceaa567f835dca46d2e76171eae397fe89a',1,'Blis.h']]], + ['blislpstatusprimalinfeasible_1531',['BlisLpStatusPrimalInfeasible',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2cea4298eb588aaad5d73a2b90cfc6d53bb3',1,'Blis.h']]], + ['blislpstatusprimalobjlim_1532',['BlisLpStatusPrimalObjLim',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2cea39151f41e6feec411dab4eec158a9a28',1,'Blis.h']]], + ['blislpstatusunknown_1533',['BlisLpStatusUnknown',['../Blis_8h.html#a25dfccb773b412cf97cadae9e118b2ceadaadd066401d5812e40f5c2381b7852c',1,'Blis.h']]], + ['blisreturnstatusbranch_1534',['BlisReturnStatusBranch',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95baddcfcbb88ede4a0ba91b26517847ad3e',1,'Blis.h']]], + ['blisreturnstatuserrlp_1535',['BlisReturnStatusErrLp',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95bab402f9fe8c114fb12fe646c715da8822',1,'Blis.h']]], + ['blisreturnstatusfeasible_1536',['BlisReturnStatusFeasible',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95baefb5c64c1cedc01d35237e5da2322632',1,'Blis.h']]], + ['blisreturnstatusinfeasible_1537',['BlisReturnStatusInfeasible',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95ba94cc9a0302b967622cffb14409d2808f',1,'Blis.h']]], + ['blisreturnstatusok_1538',['BlisReturnStatusOk',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95bae8e01076b9b8ee64ccefc96dbad71333',1,'Blis.h']]], + ['blisreturnstatusoverobjlim_1539',['BlisReturnStatusOverObjLim',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95ba89c1f4b0bf4d119eca820c51f72d9c86',1,'Blis.h']]], + ['blisreturnstatusunbounded_1540',['BlisReturnStatusUnbounded',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95ba441b79d7c77950f789cacf366b2a3007',1,'Blis.h']]], + ['blisreturnstatusunknown_1541',['BlisReturnStatusUnknown',['../Blis_8h.html#a32c63a501180411403d7aa8ad9dbc95baafd85acb4ae08d6aaafeac5d25be4f95',1,'Blis.h']]], + ['blissolutiontypebounding_1542',['BlisSolutionTypeBounding',['../Blis_8h.html#a3196633ad467bf2c04f97f13c36ba5c7a0df44c0253d88522bcba2b91890fd04e',1,'Blis.h']]], + ['blissolutiontypebranching_1543',['BlisSolutionTypeBranching',['../Blis_8h.html#a3196633ad467bf2c04f97f13c36ba5c7aa6079e9ed39650a1e28066d0c6ef96c4',1,'Blis.h']]], + ['blissolutiontypediving_1544',['BlisSolutionTypeDiving',['../Blis_8h.html#a3196633ad467bf2c04f97f13c36ba5c7af28e9801450fdc5ec6af5126a8987f55',1,'Blis.h']]], + ['blissolutiontypeheuristic_1545',['BlisSolutionTypeHeuristic',['../Blis_8h.html#a3196633ad467bf2c04f97f13c36ba5c7a15c4f4b452c2ca8f35203cb41d0795f6',1,'Blis.h']]], + ['blissolutiontypestrong_1546',['BlisSolutionTypeStrong',['../Blis_8h.html#a3196633ad467bf2c04f97f13c36ba5c7a5a6e390c90bc14171c55c2d92942e774',1,'Blis.h']]], + ['branchstrategy_1547',['branchStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba051ec502bd9f968c04bba84c4bf33c3d',1,'BlisParams']]], + ['branchstrategyrampup_1548',['branchStrategyRampUp',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39bad9b1ecd8ef8ee7371ca3e0aad90c83a1',1,'BlisParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_1.html b/Doxygen/0.94/search/enumvalues_1.html new file mode 100644 index 0000000..e22a79f --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_1.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_1.js b/Doxygen/0.94/search/enumvalues_1.js new file mode 100644 index 0000000..bff390e --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_1.js @@ -0,0 +1,26 @@ +var searchData= +[ + ['cutcliquefreq_1549',['cutCliqueFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39baf859df4eeda27456c717776ed29c7377',1,'BlisParams']]], + ['cutcliquestrategy_1550',['cutCliqueStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba7688621f5800ed30e1ee1a110a5e2d7f',1,'BlisParams']]], + ['cutfactor_1551',['cutFactor',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271a02b8c313b21534bc753c37de7bf5f446',1,'BlisParams']]], + ['cutflowcoverfreq_1552',['cutFlowCoverFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39bad3f2839467dc0ee17d62e43682f59f3d',1,'BlisParams']]], + ['cutflowcoverstrategy_1553',['cutFlowCoverStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba0ea34cb530c1745ac74b917832337186',1,'BlisParams']]], + ['cutgenerationfrequency_1554',['cutGenerationFrequency',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39baa2c8add616eeb74d75c7c41c8fe87285',1,'BlisParams']]], + ['cutgomoryfreq_1555',['cutGomoryFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39baffb1f883e94f2e15124e94b143608f64',1,'BlisParams']]], + ['cutgomorystrategy_1556',['cutGomoryStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39badd98285708b0ef3709afd73c64c4732e',1,'BlisParams']]], + ['cutknapsackfreq_1557',['cutKnapsackFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39babd2b2e9036852a332eb3c7be1275107f',1,'BlisParams']]], + ['cutknapsackstrategy_1558',['cutKnapsackStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39badb4a4e02dc9edd3c1847ff6af381a126',1,'BlisParams']]], + ['cutmirfreq_1559',['cutMirFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba5866dc3f9887600a6c169bcf0b4dc15c',1,'BlisParams']]], + ['cutmirstrategy_1560',['cutMirStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba427a5167c8e93148d727a2e752a11bee',1,'BlisParams']]], + ['cutoddholefreq_1561',['cutOddHoleFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39baab4f37ac2a6cc179ab3be8942b3e38cc',1,'BlisParams']]], + ['cutoddholestrategy_1562',['cutOddHoleStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39baae13cf74149fcaaac172269a2b4fcf07',1,'BlisParams']]], + ['cutoff_1563',['cutoff',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271ad9c51a79f1d70ad005ebc944d69cd946',1,'BlisParams']]], + ['cutoffinc_1564',['cutoffInc',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271a167cfc85150502fdefd6cefbd56402ae',1,'BlisParams']]], + ['cutpass_1565',['cutPass',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39baba8fffce01f3b1da6273c863cab0f818',1,'BlisParams']]], + ['cutprobingfreq_1566',['cutProbingFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba3bd96e01f5ed09b6db3364c52c9cc775',1,'BlisParams']]], + ['cutprobingstrategy_1567',['cutProbingStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba30b06b635d1f0fbfceca81a8b8441f17',1,'BlisParams']]], + ['cutrampup_1568',['cutRampUp',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4a6291c0fe6248c9c96059cdcca67789ba',1,'BlisParams']]], + ['cutstrategy_1569',['cutStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba609de0f06a99b5a1b14d7f23afbb7b20',1,'BlisParams']]], + ['cuttwomirfreq_1570',['cutTwoMirFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba7fb27f66d4f3f85755de925c4d01fb2e',1,'BlisParams']]], + ['cuttwomirstrategy_1571',['cutTwoMirStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba50158579b3a6ed6ff94cc59ff0247381',1,'BlisParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_10.html b/Doxygen/0.94/search/enumvalues_10.html new file mode 100644 index 0000000..7107c3d --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_10.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_10.js b/Doxygen/0.94/search/enumvalues_10.js new file mode 100644 index 0000000..e448ec6 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_10.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['whichconnectedroutine_1611',['whichConnectedRoutine',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3eaefe67f16c3d3aa589e1118addc2cd07e',1,'VrpParams']]], + ['whichtspcuts_1612',['whichTspCuts',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3eaad85a46c8ab4eb15cfd027898a6d5b6d',1,'VrpParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_2.html b/Doxygen/0.94/search/enumvalues_2.html new file mode 100644 index 0000000..01a77bf --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_2.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_2.js b/Doxygen/0.94/search/enumvalues_2.js new file mode 100644 index 0000000..d1298d8 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_2.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['denseconfactor_1572',['denseConFactor',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271aa7818d1987fda42ff43ab80d34bbdc4d',1,'BlisParams']]], + ['difference_1573',['difference',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba8fa2a0221527e06bbefee2d5f3695784',1,'BlisParams']]], + ['doextrainroot_1574',['doExtraInRoot',['../classVrpParams.html#a9dd5e6691626b6b8f7cbb3cbc74bfe14ad720c75a74c837049dc5d2a4c099abf8',1,'VrpParams']]], + ['dogreedy_1575',['doGreedy',['../classVrpParams.html#a9dd5e6691626b6b8f7cbb3cbc74bfe14a39cc24a560ee2dfbfba575c38171aef4',1,'VrpParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_3.html b/Doxygen/0.94/search/enumvalues_3.html new file mode 100644 index 0000000..4e761d6 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_3.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_3.js b/Doxygen/0.94/search/enumvalues_3.js new file mode 100644 index 0000000..0cf7c34 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_3.js @@ -0,0 +1,9 @@ +var searchData= +[ + ['endofboolparams_1576',['endOfBoolParams',['../classVrpParams.html#a9dd5e6691626b6b8f7cbb3cbc74bfe14aa9607bec43e52d7b4d6ce4cd73700d27',1,'VrpParams']]], + ['endofchrparams_1577',['endOfChrParams',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4a12be3e65e17dd8ee1f84d820afd7e1b1',1,'BlisParams']]], + ['endofdblparams_1578',['endOfDblParams',['../classVrpParams.html#a85f3836b3d058d1e521594f81023ab1fa6a3625f55b1ea3229f58f6577caf094d',1,'VrpParams::endOfDblParams()'],['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271a7ba9aedfe7d66e5156a7c15e4cb43500',1,'BlisParams::endOfDblParams()']]], + ['endofintparams_1579',['endOfIntParams',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3eaf801b5ba896f4d86cf86e712a43c8da2',1,'VrpParams::endOfIntParams()'],['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba0086d3b3ae29993b1d3d4f3f3e4e41da',1,'BlisParams::endOfIntParams()']]], + ['endofstrarrayparams_1580',['endOfStrArrayParams',['../classVrpParams.html#a2b9941906895258be908386a7be043aea4a6e52c0a422e8c38bee906c4dabe915',1,'VrpParams::endOfStrArrayParams()'],['../classBlisParams.html#a50235e57390e794f0cc2420b0383dc6daf59577820eea3cbea7d2205e65ee26a9',1,'BlisParams::endOfStrArrayParams()']]], + ['endofstrparams_1581',['endOfStrParams',['../classVrpParams.html#ae81aaae2cdbe79b5e2081d2284f46448ae68c8f62256dc6f0ecbef61f9ed82cd9',1,'VrpParams::endOfStrParams()'],['../classBlisParams.html#ad6e0e869ed765edc2ebee19032d1384aa3c57599dce755f21b087c67c4af74d14',1,'BlisParams::endOfStrParams()']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_4.html b/Doxygen/0.94/search/enumvalues_4.html new file mode 100644 index 0000000..e2977a0 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_4.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_4.js b/Doxygen/0.94/search/enumvalues_4.js new file mode 100644 index 0000000..bea3ac1 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_4.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['greedynumtrials_1582',['greedyNumTrials',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3ea618292753f21ea4fabdba95d54dc1a3f',1,'VrpParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_5.html b/Doxygen/0.94/search/enumvalues_5.html new file mode 100644 index 0000000..eabdd4b --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_5.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_5.js b/Doxygen/0.94/search/enumvalues_5.js new file mode 100644 index 0000000..ca47966 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_5.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['heurcallfrequency_1583',['heurCallFrequency',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba22df26e5380e7aa183ef409dcb125579',1,'BlisParams']]], + ['heurroundfreq_1584',['heurRoundFreq',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba486826c88f81844bcb4dc1779ecfef6d',1,'BlisParams']]], + ['heurroundstrategy_1585',['heurRoundStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba545653c366b90d9bbfece12af7ab4888',1,'BlisParams']]], + ['heurstrategy_1586',['heurStrategy',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba7f0a5a9fa3a3d74da9ea25c5e2fd03ca',1,'BlisParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_6.html b/Doxygen/0.94/search/enumvalues_6.html new file mode 100644 index 0000000..2476491 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_6.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_6.js b/Doxygen/0.94/search/enumvalues_6.js new file mode 100644 index 0000000..5a83147 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_6.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['integertol_1587',['integerTol',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271aa2f6d1db37c87e865b2e63801108fcac',1,'BlisParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_7.html b/Doxygen/0.94/search/enumvalues_7.html new file mode 100644 index 0000000..5d5ce7e --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_7.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_7.js b/Doxygen/0.94/search/enumvalues_7.js new file mode 100644 index 0000000..ffbe707 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_7.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['lookahead_1588',['lookAhead',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba6c1ea0b2d4058ef8860d9573d0edbb67',1,'BlisParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_8.html b/Doxygen/0.94/search/enumvalues_8.html new file mode 100644 index 0000000..be088de --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_8.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_8.js b/Doxygen/0.94/search/enumvalues_8.js new file mode 100644 index 0000000..49c6ab6 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_8.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['maxnumcutsinshrink_1589',['maxNumCutsInShrink',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3ea561164cfc4a64bd9351985a2d6770477',1,'VrpParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_9.html b/Doxygen/0.94/search/enumvalues_9.html new file mode 100644 index 0000000..b521e09 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_9.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_9.js b/Doxygen/0.94/search/enumvalues_9.js new file mode 100644 index 0000000..b118fd1 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_9.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['numroutes_1590',['numRoutes',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3ea0fc01e4e57f98a6a75918a58f3448fe7',1,'VrpParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_a.html b/Doxygen/0.94/search/enumvalues_a.html new file mode 100644 index 0000000..ea34216 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_a.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_a.js b/Doxygen/0.94/search/enumvalues_a.js new file mode 100644 index 0000000..8df2fc6 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_a.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['objsense_1591',['objSense',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271a9a3e137f7cbd24bf12fa7c7b1ec99774',1,'BlisParams']]], + ['optimalabsgap_1592',['optimalAbsGap',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271aa6df5d30df6877598442da950ec21f90',1,'BlisParams']]], + ['optimalrelgap_1593',['optimalRelGap',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271a8c17e942d82f4bdd9b7c6788589820f0',1,'BlisParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_b.html b/Doxygen/0.94/search/enumvalues_b.html new file mode 100644 index 0000000..0bb27ce --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_b.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_b.js b/Doxygen/0.94/search/enumvalues_b.js new file mode 100644 index 0000000..2a885ec --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_b.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['presolve_1594',['presolve',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4a2d1e6e2601af4072e95726f993d28149',1,'BlisParams']]], + ['pseudorelibility_1595',['pseudoRelibility',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39babe1733f871e8efee817e6bf188f81cfa',1,'BlisParams']]], + ['pseudoweight_1596',['pseudoWeight',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271a3f948beed60ba92b55d59261875e84be',1,'BlisParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_c.html b/Doxygen/0.94/search/enumvalues_c.html new file mode 100644 index 0000000..1ee90d9 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_c.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_c.js b/Doxygen/0.94/search/enumvalues_c.js new file mode 100644 index 0000000..e1e2679 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_c.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['quickcutpass_1597',['quickCutPass',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39baece0c48f6774eeff3c84422533f6d1b4',1,'BlisParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_d.html b/Doxygen/0.94/search/enumvalues_d.html new file mode 100644 index 0000000..e1b3b48 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_d.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_d.js b/Doxygen/0.94/search/enumvalues_d.js new file mode 100644 index 0000000..5e3572e --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_d.js @@ -0,0 +1,13 @@ +var searchData= +[ + ['scaleconfactor_1598',['scaleConFactor',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271ab468258112758894e7bc99d616418110',1,'BlisParams']]], + ['shareconstraints_1599',['shareConstraints',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4a39e8bb0536a93b977dbc2aa72c7f03b1',1,'BlisParams']]], + ['sharepcostdepth_1600',['sharePcostDepth',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39bab6c8619f2de33f5a99f794919fda13b7',1,'BlisParams']]], + ['sharepcostfrequency_1601',['sharePcostFrequency',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba7032378b14d1aebc994e22631c005e2a',1,'BlisParams']]], + ['sharepseudocostrampup_1602',['sharePseudocostRampUp',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4a234cd490c0a597b2a3d46bfeeaaa7e59',1,'BlisParams']]], + ['sharepseudocostsearch_1603',['sharePseudocostSearch',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4aa04a70fc661f956ef58224e787b0c4a1',1,'BlisParams']]], + ['sharevariables_1604',['shareVariables',['../classBlisParams.html#a99fe7f2b6c12d65f491349e4377c82b4affadca81088f66d7826ddc4413121d8c',1,'BlisParams']]], + ['strarraydummy_1605',['strArrayDummy',['../classVrpParams.html#a2b9941906895258be908386a7be043aea5e8a4b7e7eccc31cebb75a35b902d105',1,'VrpParams::strArrayDummy()'],['../classBlisParams.html#a50235e57390e794f0cc2420b0383dc6da598145647a8862701d3f29756bebb2cf',1,'BlisParams::strArrayDummy()']]], + ['strdummy_1606',['strDummy',['../classVrpParams.html#ae81aaae2cdbe79b5e2081d2284f46448aa8defde451e9bd2eab77f71cb18c559d',1,'VrpParams::strDummy()'],['../classBlisParams.html#ad6e0e869ed765edc2ebee19032d1384aad95aa64f6efa38ce1b0667ae8e025ba7',1,'BlisParams::strDummy()']]], + ['strongcandsize_1607',['strongCandSize',['../classBlisParams.html#adbdf1040a4a59d7108763c17d93cf39ba7befcd12dc8d583b224c293db38c3f57',1,'BlisParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_e.html b/Doxygen/0.94/search/enumvalues_e.html new file mode 100644 index 0000000..c5d3197 --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_e.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_e.js b/Doxygen/0.94/search/enumvalues_e.js new file mode 100644 index 0000000..ab8125d --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_e.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['tailoff_1608',['tailOff',['../classBlisParams.html#a3c8b8c72ccdad31ca87fa84251599271a83b3a4311083557b0ee6016ecf2e1c2e',1,'BlisParams']]], + ['tspprob_1609',['tspProb',['../classVrpParams.html#a9dd5e6691626b6b8f7cbb3cbc74bfe14a15aaa01bcbb3a40222757f80d131f42f',1,'VrpParams']]] +]; diff --git a/Doxygen/0.94/search/enumvalues_f.html b/Doxygen/0.94/search/enumvalues_f.html new file mode 100644 index 0000000..5de961d --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_f.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/enumvalues_f.js b/Doxygen/0.94/search/enumvalues_f.js new file mode 100644 index 0000000..efc4bbd --- /dev/null +++ b/Doxygen/0.94/search/enumvalues_f.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['verbosity_1610',['verbosity',['../classVrpParams.html#a2ce4c79f12066a0d334a4ed724d4fc3eaf2a7b266ed580b7a2664f82a69bc3cc3',1,'VrpParams']]] +]; diff --git a/Doxygen/0.94/search/files_0.html b/Doxygen/0.94/search/files_0.html new file mode 100644 index 0000000..737608e --- /dev/null +++ b/Doxygen/0.94/search/files_0.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/files_0.js b/Doxygen/0.94/search/files_0.js new file mode 100644 index 0000000..db364a2 --- /dev/null +++ b/Doxygen/0.94/search/files_0.js @@ -0,0 +1,29 @@ +var searchData= +[ + ['blis_2eh_896',['Blis.h',['../Blis_8h.html',1,'']]], + ['blisbranchobjectbilevel_2eh_897',['BlisBranchObjectBilevel.h',['../BlisBranchObjectBilevel_8h.html',1,'']]], + ['blisbranchobjectint_2eh_898',['BlisBranchObjectInt.h',['../BlisBranchObjectInt_8h.html',1,'']]], + ['blisbranchstrategybilevel_2eh_899',['BlisBranchStrategyBilevel.h',['../BlisBranchStrategyBilevel_8h.html',1,'']]], + ['blisbranchstrategymaxinf_2eh_900',['BlisBranchStrategyMaxInf.h',['../BlisBranchStrategyMaxInf_8h.html',1,'']]], + ['blisbranchstrategypseudo_2eh_901',['BlisBranchStrategyPseudo.h',['../BlisBranchStrategyPseudo_8h.html',1,'']]], + ['blisbranchstrategyrel_2eh_902',['BlisBranchStrategyRel.h',['../BlisBranchStrategyRel_8h.html',1,'']]], + ['blisbranchstrategystrong_2eh_903',['BlisBranchStrategyStrong.h',['../BlisBranchStrategyStrong_8h.html',1,'']]], + ['blisconfig_2eh_904',['BlisConfig.h',['../BlisConfig_8h.html',1,'']]], + ['bliscongenerator_2eh_905',['BlisConGenerator.h',['../BlisConGenerator_8h.html',1,'']]], + ['blisconstraint_2eh_906',['BlisConstraint.h',['../BlisConstraint_8h.html',1,'']]], + ['blishelp_2eh_907',['BlisHelp.h',['../BlisHelp_8h.html',1,'']]], + ['blisheuristic_2eh_908',['BlisHeuristic.h',['../BlisHeuristic_8h.html',1,'']]], + ['blisheurround_2eh_909',['BlisHeurRound.h',['../BlisHeurRound_8h.html',1,'']]], + ['blislicense_2eh_910',['BlisLicense.h',['../BlisLicense_8h.html',1,'']]], + ['blismessage_2eh_911',['BlisMessage.h',['../BlisMessage_8h.html',1,'']]], + ['blismodel_2eh_912',['BlisModel.h',['../BlisModel_8h.html',1,'']]], + ['blisnodedesc_2eh_913',['BlisNodeDesc.h',['../BlisNodeDesc_8h.html',1,'']]], + ['blisobjectint_2eh_914',['BlisObjectInt.h',['../BlisObjectInt_8h.html',1,'']]], + ['blisparams_2eh_915',['BlisParams.h',['../BlisParams_8h.html',1,'']]], + ['blispresolve_2eh_916',['BlisPresolve.h',['../BlisPresolve_8h.html',1,'']]], + ['blispseudo_2eh_917',['BlisPseudo.h',['../BlisPseudo_8h.html',1,'']]], + ['blissolution_2eh_918',['BlisSolution.h',['../BlisSolution_8h.html',1,'']]], + ['blissubtree_2eh_919',['BlisSubTree.h',['../BlisSubTree_8h.html',1,'']]], + ['blistreenode_2eh_920',['BlisTreeNode.h',['../BlisTreeNode_8h.html',1,'']]], + ['blisvariable_2eh_921',['BlisVariable.h',['../BlisVariable_8h.html',1,'']]] +]; diff --git a/Doxygen/0.94/search/files_1.html b/Doxygen/0.94/search/files_1.html new file mode 100644 index 0000000..f27a62d --- /dev/null +++ b/Doxygen/0.94/search/files_1.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/files_1.js b/Doxygen/0.94/search/files_1.js new file mode 100644 index 0000000..4aab8cd --- /dev/null +++ b/Doxygen/0.94/search/files_1.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['config_2eh_922',['config.h',['../config_8h.html',1,'']]], + ['config_5fblis_2eh_923',['config_blis.h',['../config__blis_8h.html',1,'']]], + ['config_5fblis_5fdefault_2eh_924',['config_blis_default.h',['../config__blis__default_8h.html',1,'']]], + ['config_5fdefault_2eh_925',['config_default.h',['../config__default_8h.html',1,'']]] +]; diff --git a/Doxygen/0.94/search/files_2.html b/Doxygen/0.94/search/files_2.html new file mode 100644 index 0000000..a45066e --- /dev/null +++ b/Doxygen/0.94/search/files_2.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/files_2.js b/Doxygen/0.94/search/files_2.js new file mode 100644 index 0000000..1dc4c20 --- /dev/null +++ b/Doxygen/0.94/search/files_2.js @@ -0,0 +1,13 @@ +var searchData= +[ + ['vrpcommontypes_2eh_926',['VrpCommonTypes.h',['../VrpCommonTypes_8h.html',1,'']]], + ['vrpconstants_2eh_927',['VrpConstants.h',['../VrpConstants_8h.html',1,'']]], + ['vrpcutgenerator_2eh_928',['VrpCutGenerator.h',['../VrpCutGenerator_8h.html',1,'']]], + ['vrpheurtsp_2eh_929',['VrpHeurTSP.h',['../VrpHeurTSP_8h.html',1,'']]], + ['vrpmacros_2eh_930',['VrpMacros.h',['../VrpMacros_8h.html',1,'']]], + ['vrpmodel_2eh_931',['VrpModel.h',['../VrpModel_8h.html',1,'']]], + ['vrpnetwork_2eh_932',['VrpNetwork.h',['../VrpNetwork_8h.html',1,'']]], + ['vrpparams_2eh_933',['VrpParams.h',['../VrpParams_8h.html',1,'']]], + ['vrpsolution_2eh_934',['VrpSolution.h',['../VrpSolution_8h.html',1,'']]], + ['vrpvariable_2eh_935',['VrpVariable.h',['../VrpVariable_8h.html',1,'']]] +]; diff --git a/Doxygen/0.94/search/functions_0.html b/Doxygen/0.94/search/functions_0.html new file mode 100644 index 0000000..e17c711 --- /dev/null +++ b/Doxygen/0.94/search/functions_0.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_0.js b/Doxygen/0.94/search/functions_0.js new file mode 100644 index 0000000..7419dfa --- /dev/null +++ b/Doxygen/0.94/search/functions_0.js @@ -0,0 +1,22 @@ +var searchData= +[ + ['addcalls_936',['addCalls',['../classBlisConGenerator.html#ae1f8453204bc9158e6d759ae2282a989',1,'BlisConGenerator::addCalls()'],['../classBlisHeuristic.html#a2066e9e5850b36d939a273ccacd3f1b2',1,'BlisHeuristic::addCalls()']]], + ['addcutgenerator_937',['addCutGenerator',['../classBlisModel.html#af8149e8ddc9b0998b18e563905da4cbc',1,'BlisModel::addCutGenerator(BlisConGenerator *generator)'],['../classBlisModel.html#a5faa6c0b1c98b6c9a430b91f09b3758b',1,'BlisModel::addCutGenerator(CglCutGenerator *generator, const char *name=NULL, BlisCutStrategy strategy=BlisCutStrategyAuto, int cutGenerationFrequency=1, bool normal=true, bool atSolution=false, bool whenInfeasible=false)']]], + ['addfeaschecktime_938',['addFeasCheckTime',['../classBlisModel.html#abbd973e26fb65e0737949f2bd2f6158b',1,'BlisModel']]], + ['addheuristic_939',['addHeuristic',['../classBlisModel.html#acda80b8343f331523b8772540194a781',1,'BlisModel']]], + ['addnoconscalls_940',['addNoConsCalls',['../classBlisConGenerator.html#a36f578c586f09e841a76aea124b2de49',1,'BlisConGenerator']]], + ['addnosolcalls_941',['addNoSolCalls',['../classBlisHeuristic.html#a786bb8ed70e70ec1d7e12280980eea88',1,'BlisHeuristic']]], + ['addnumconsgenerated_942',['addNumConsGenerated',['../classBlisConGenerator.html#a8b801d64c5b7a16780c30be5167af5e8',1,'BlisConGenerator']]], + ['addnumconsused_943',['addNumConsUsed',['../classBlisConGenerator.html#a5d01f5563397c6699ae631d86150881a',1,'BlisConGenerator']]], + ['addnumiterations_944',['addNumIterations',['../classBlisModel.html#a592208cb46b4c3a09dcd4b3046a95ca5',1,'BlisModel']]], + ['addnumnodes_945',['addNumNodes',['../classBlisModel.html#aed2d4d613490555434cfafb97917f7e6',1,'BlisModel']]], + ['addnumsolutions_946',['addNumSolutions',['../classBlisHeuristic.html#adff9c21859ffcf1c64eb2f588e244ca9',1,'BlisHeuristic']]], + ['addnumstrong_947',['addNumStrong',['../classBlisModel.html#a456373f200a2a1526bd2a5bba5acf2e4',1,'BlisModel']]], + ['addobjects_948',['addObjects',['../classBlisModel.html#a3177b18aed4cd51d2df87e9de6359454',1,'BlisModel']]], + ['addtime_949',['addTime',['../classBlisConGenerator.html#a27424f19de1b26837d4f4b9a140da668',1,'BlisConGenerator::addTime()'],['../classBlisHeuristic.html#a9c0da80d253907e06072bb9a8b53b3ed',1,'BlisHeuristic::addTime()']]], + ['addtobranchingset_950',['addToBranchingSet',['../classBlisBranchObjectBilevel.html#aa930cb39edf1294f3dc59857cbfc35bb',1,'BlisBranchObjectBilevel']]], + ['addvrpcut_951',['addVrpCut',['../classVrpCutGenerator.html#ac99d45901c04b2ec289377c88bd556a5',1,'VrpCutGenerator']]], + ['analyzeobjective_952',['analyzeObjective',['../classBlisModel.html#a2fa9cbfb5bfbc55231bfb92d1765592e',1,'BlisModel']]], + ['applyconstraints_953',['applyConstraints',['../classBlisTreeNode.html#abd9492f73a2ece055601448b317bb9ad',1,'BlisTreeNode']]], + ['atsolution_954',['atSolution',['../classBlisConGenerator.html#ac18b5aabe418441cafef0046a42f7f41',1,'BlisConGenerator']]] +]; diff --git a/Doxygen/0.94/search/functions_1.html b/Doxygen/0.94/search/functions_1.html new file mode 100644 index 0000000..0ddac0a --- /dev/null +++ b/Doxygen/0.94/search/functions_1.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_1.js b/Doxygen/0.94/search/functions_1.js new file mode 100644 index 0000000..5e3930f --- /dev/null +++ b/Doxygen/0.94/search/functions_1.js @@ -0,0 +1,41 @@ +var searchData= +[ + ['betterbranchobject_955',['betterBranchObject',['../classBlisBranchStrategyBilevel.html#a7312971ad4af8a34041f9b49b3530d96',1,'BlisBranchStrategyBilevel::betterBranchObject()'],['../classBlisBranchStrategyMaxInf.html#ae5b7370e5c528cf671691afc8a1c1a4a',1,'BlisBranchStrategyMaxInf::betterBranchObject()'],['../classBlisBranchStrategyPseudo.html#aa5de3c810d6d728f5421f91e823ca1f5',1,'BlisBranchStrategyPseudo::betterBranchObject()'],['../classBlisBranchStrategyRel.html#ab9d1642fbb540a18e1b789020704e39c',1,'BlisBranchStrategyRel::betterBranchObject()'],['../classBlisBranchStrategyStrong.html#a21b0bd1ea5a150a43ce29c4a93cd3092',1,'BlisBranchStrategyStrong::betterBranchObject()']]], + ['biconnected_956',['biconnected',['../classVrpNetwork.html#a7baa983838a4643f9159b4c77b8fcc81',1,'VrpNetwork']]], + ['blisbranchobjectbilevel_957',['BlisBranchObjectBilevel',['../classBlisBranchObjectBilevel.html#a01a57a64e47351d45b1b842082c954cc',1,'BlisBranchObjectBilevel::BlisBranchObjectBilevel()'],['../classBlisBranchObjectBilevel.html#ad4a26abf1e36f673748c810d6fdb4b5f',1,'BlisBranchObjectBilevel::BlisBranchObjectBilevel(BcpsModel *model)'],['../classBlisBranchObjectBilevel.html#a9f0848e204126aa3ad320267791f314c',1,'BlisBranchObjectBilevel::BlisBranchObjectBilevel(const BlisBranchObjectBilevel &rhs)']]], + ['blisbranchobjectint_958',['BlisBranchObjectInt',['../classBlisBranchObjectInt.html#a88dd1394b00b43660bc912b0a9ae6df7',1,'BlisBranchObjectInt::BlisBranchObjectInt()'],['../classBlisBranchObjectInt.html#a68221cd849e2bf7345e13bee3633db60',1,'BlisBranchObjectInt::BlisBranchObjectInt(BlisModel *model, int varInd, int direction, double value)'],['../classBlisBranchObjectInt.html#a7464529d60f5bea04ef81069974631d3',1,'BlisBranchObjectInt::BlisBranchObjectInt(BlisModel *model, int varInd, int intScore, double dblScore, int direction, double value)'],['../classBlisBranchObjectInt.html#a22b2d82d12190067ef7b925f950d619a',1,'BlisBranchObjectInt::BlisBranchObjectInt(BlisModel *model, int varInd, int direction, double lowerValue, double upperValue)'],['../classBlisBranchObjectInt.html#af2d02a34cc36573310b8b34f724cb8b5',1,'BlisBranchObjectInt::BlisBranchObjectInt(const BlisBranchObjectInt &)']]], + ['blisbranchstrategybilevel_959',['BlisBranchStrategyBilevel',['../classBlisBranchStrategyBilevel.html#a85025ac7a6c59acacb942405278c0514',1,'BlisBranchStrategyBilevel::BlisBranchStrategyBilevel()'],['../classBlisBranchStrategyBilevel.html#a44f0ce29e4c4226091012ea392e54f62',1,'BlisBranchStrategyBilevel::BlisBranchStrategyBilevel(BlisModel *model)'],['../classBlisBranchStrategyBilevel.html#aff5e2f37666aecaabfb3abcee16dc361',1,'BlisBranchStrategyBilevel::BlisBranchStrategyBilevel(const BlisBranchStrategyBilevel &)']]], + ['blisbranchstrategymaxinf_960',['BlisBranchStrategyMaxInf',['../classBlisBranchStrategyMaxInf.html#af1aa2b5e6bdf0849f3b81863965ebbb9',1,'BlisBranchStrategyMaxInf::BlisBranchStrategyMaxInf()'],['../classBlisBranchStrategyMaxInf.html#a43991baa0e8dfb6aecc236b834fca1bd',1,'BlisBranchStrategyMaxInf::BlisBranchStrategyMaxInf(BlisModel *model)'],['../classBlisBranchStrategyMaxInf.html#aab7c0c288c7c9b8778be06c35716fdaf',1,'BlisBranchStrategyMaxInf::BlisBranchStrategyMaxInf(const BlisBranchStrategyMaxInf &)']]], + ['blisbranchstrategypseudo_961',['BlisBranchStrategyPseudo',['../classBlisBranchStrategyPseudo.html#a57dbbd2127c8848d4f640a378b104dca',1,'BlisBranchStrategyPseudo::BlisBranchStrategyPseudo()'],['../classBlisBranchStrategyPseudo.html#a54d19c7df578565c97be396ea50b61d7',1,'BlisBranchStrategyPseudo::BlisBranchStrategyPseudo(BlisModel *model, int rel)'],['../classBlisBranchStrategyPseudo.html#a83718bea819425be3dedcd1e1fd35b4b',1,'BlisBranchStrategyPseudo::BlisBranchStrategyPseudo(const BlisBranchStrategyPseudo &)']]], + ['blisbranchstrategyrel_962',['BlisBranchStrategyRel',['../classBlisBranchStrategyRel.html#a81c30de8598bc03940d9c830380fce70',1,'BlisBranchStrategyRel::BlisBranchStrategyRel()'],['../classBlisBranchStrategyRel.html#a7531543174247b6a8c7257d023e0728a',1,'BlisBranchStrategyRel::BlisBranchStrategyRel(BlisModel *model, int rel)'],['../classBlisBranchStrategyRel.html#a9b4337f461249e213af0413ebb25ed22',1,'BlisBranchStrategyRel::BlisBranchStrategyRel(const BlisBranchStrategyRel &)']]], + ['blisbranchstrategystrong_963',['BlisBranchStrategyStrong',['../classBlisBranchStrategyStrong.html#a766bd30c1c24da0907bd49b4a835d086',1,'BlisBranchStrategyStrong::BlisBranchStrategyStrong()'],['../classBlisBranchStrategyStrong.html#ae298480a40584773936e6e49c1b20615',1,'BlisBranchStrategyStrong::BlisBranchStrategyStrong(BlisModel *model)'],['../classBlisBranchStrategyStrong.html#ab7b25f7b3cdfb5c21c81e4a4569d49b2',1,'BlisBranchStrategyStrong::BlisBranchStrategyStrong(const BlisBranchStrategyStrong &)']]], + ['bliscongenerator_964',['BlisConGenerator',['../classBlisConGenerator.html#ab4e4322c28c4d4df53098b1439f31989',1,'BlisConGenerator::BlisConGenerator()'],['../classBlisConGenerator.html#a5dffd1b6fada781c7f137c72f4f7835c',1,'BlisConGenerator::BlisConGenerator(BlisModel *model, CglCutGenerator *generator, const char *name=NULL, BlisCutStrategy strategy=BlisCutStrategyAuto, int cutGenerationFrequency_=1, bool normal=true, bool atSolution=false, bool infeasible=false)'],['../classBlisConGenerator.html#a2c6b4c0a64dfca758f084d81823b0355',1,'BlisConGenerator::BlisConGenerator(const BlisConGenerator &)']]], + ['blisconstraint_965',['BlisConstraint',['../classBlisConstraint.html#a413baed4f9c24fb815858b881a23c703',1,'BlisConstraint::BlisConstraint()'],['../classBlisConstraint.html#ac5341a6718b808b57d03cd2197f5a094',1,'BlisConstraint::BlisConstraint(int s, const int *ind, const double *val)'],['../classBlisConstraint.html#a3585da418f2b0ab5db1ba340985936f7',1,'BlisConstraint::BlisConstraint(double lbh, double ubh, double lbs, double ubs)'],['../classBlisConstraint.html#a910c921afe12b97614e34061bdcea34c',1,'BlisConstraint::BlisConstraint(double lbh, double ubh, double lbs, double ubs, int size, const int *ind, const double *val)'],['../classBlisConstraint.html#a92af9f1425542b68cd981d6721290d87',1,'BlisConstraint::BlisConstraint(const BlisConstraint &rhs)']]], + ['blisdecodewarmstart_966',['BlisDecodeWarmStart',['../BlisHelp_8h.html#a641371271a265fac1bd54c5614aabd1f',1,'BlisHelp.h']]], + ['blisencodewarmstart_967',['BlisEncodeWarmStart',['../BlisHelp_8h.html#a79344b8cc43a385b35ce8b5f0b4c14ff',1,'BlisHelp.h']]], + ['blishashingosirowcut_968',['BlisHashingOsiRowCut',['../BlisHelp_8h.html#a684e1a0bb0699f9e4942582eb014e315',1,'BlisHelp.h']]], + ['blisheuristic_969',['BlisHeuristic',['../classBlisHeuristic.html#aa237520af076a39377fab09d1966079e',1,'BlisHeuristic::BlisHeuristic()'],['../classBlisHeuristic.html#a615cbd16829a5c546a40311480fa20ef',1,'BlisHeuristic::BlisHeuristic(BlisModel *model, const char *name, BlisHeurStrategy strategy, int heurCallFrequency)'],['../classBlisHeuristic.html#a8e0bbdb1fb1acdc035f59afe2562af11',1,'BlisHeuristic::BlisHeuristic(const BlisHeuristic &rhs)']]], + ['blisheurround_970',['BlisHeurRound',['../classBlisHeurRound.html#af9cefbb202c3bc36b027d7368c803f40',1,'BlisHeurRound::BlisHeurRound()'],['../classBlisHeurRound.html#ab032d71838fc02241aaf43c6ab39eb34',1,'BlisHeurRound::BlisHeurRound(BlisModel *model, const char *name, BlisHeurStrategy strategy, int freq)'],['../classBlisHeurRound.html#a90d958753a8814bc5c29e2873e781d3a',1,'BlisHeurRound::BlisHeurRound(const BlisHeurRound &)']]], + ['blismessage_971',['BlisMessage',['../classBlisMessage.html#af412c24a47e7705486c56858b59f579f',1,'BlisMessage']]], + ['blismessagehandler_972',['blisMessageHandler',['../classBlisModel.html#ac859456755a09471eda699f9378aa88c',1,'BlisModel']]], + ['blismessages_973',['blisMessages',['../classBlisModel.html#afc209bd417b1edd96caacf19459a975e',1,'BlisModel']]], + ['blismodel_974',['BlisModel',['../classBlisModel.html#aecf8cfb5f97e0e5aa8cd152b61a66464',1,'BlisModel']]], + ['blisnodedesc_975',['BlisNodeDesc',['../classBlisNodeDesc.html#a2d8e09a3684862696ad91e29eb12b175',1,'BlisNodeDesc::BlisNodeDesc()'],['../classBlisNodeDesc.html#adc2ed2d0193d46d5c625acdeefb86eca',1,'BlisNodeDesc::BlisNodeDesc(BlisModel *m)']]], + ['blisobjectint_976',['BlisObjectInt',['../classBlisObjectInt.html#aa403fbec6f8ebb541203bc2df2baef9d',1,'BlisObjectInt::BlisObjectInt()'],['../classBlisObjectInt.html#ab1fe2f573e59fd6a37331a64c0fe6e09',1,'BlisObjectInt::BlisObjectInt(int objectIndex, int iColumn, double lb, double ub, double breakEven=0.5)'],['../classBlisObjectInt.html#ad4ef7a72dcbedf0234ed8448f632bc0c',1,'BlisObjectInt::BlisObjectInt(const BlisObjectInt &)']]], + ['blisosicuttoconstraint_977',['BlisOsiCutToConstraint',['../BlisHelp_8h.html#a1944adba70687fcd9d4c84677454450a',1,'BlisHelp.h']]], + ['blispar_978',['BlisPar',['../classBlisModel.html#a7dd85907cb8240b900c090d8ca26652a',1,'BlisModel']]], + ['blisparallelconcon_979',['BlisParallelConCon',['../BlisHelp_8h.html#adb093d92d595e1947037eb80709b1eac',1,'BlisHelp.h']]], + ['blisparallelcutcon_980',['BlisParallelCutCon',['../BlisHelp_8h.html#a129fb19e079b0e5d1b9c124a8fe7b003',1,'BlisHelp.h']]], + ['blisparallelcutcut_981',['BlisParallelCutCut',['../BlisHelp_8h.html#a0b87efcaa1a6c49f1ec787d30a73730b',1,'BlisHelp.h']]], + ['blisparams_982',['BlisParams',['../classBlisParams.html#aac92b645a6d1c82ecc2d03957f905ece',1,'BlisParams']]], + ['blispresolve_983',['BlisPresolve',['../classBlisPresolve.html#ab30462c1c74306eaa1e4c0771b03f7e3',1,'BlisPresolve']]], + ['blispseudocost_984',['BlisPseudocost',['../classBlisPseudocost.html#a647596a081096c1f359d2536850ab39d',1,'BlisPseudocost::BlisPseudocost()'],['../classBlisPseudocost.html#a88b3f12a51e59e58a76f0140a2956e1d',1,'BlisPseudocost::BlisPseudocost(double uc, int un, double dc, int dn, double s)'],['../classBlisPseudocost.html#ad0a76791ac81ad4583560a265adfb8ba',1,'BlisPseudocost::BlisPseudocost(const BlisPseudocost &cost)']]], + ['blissolution_985',['BlisSolution',['../classBlisSolution.html#aba7393898200688d6d59bdd36006c5b9',1,'BlisSolution::BlisSolution()'],['../classBlisSolution.html#ae6b56ce68a08ab6bbfe44ec1caff3798',1,'BlisSolution::BlisSolution(int s, const double *values, double objValue)']]], + ['blisstrongbranch_986',['BlisStrongBranch',['../BlisHelp_8h.html#a54941b0ba67fc4898da14360fe9a6b32',1,'BlisHelp.h']]], + ['blistreenode_987',['BlisTreeNode',['../classBlisTreeNode.html#a7497f027959d209520ebee50aecda51f',1,'BlisTreeNode::BlisTreeNode(const BlisTreeNode &)'],['../classBlisTreeNode.html#ab5681cfe586806ba962f2aa59d331408',1,'BlisTreeNode::BlisTreeNode()'],['../classBlisTreeNode.html#ab6783e182916a69811cf799edef84522',1,'BlisTreeNode::BlisTreeNode(BlisModel *m)'],['../classBlisTreeNode.html#a4720f1b15654d0b3cb6781a7cf7f2165',1,'BlisTreeNode::BlisTreeNode(AlpsNodeDesc *&desc)']]], + ['blisvariable_988',['BlisVariable',['../classBlisVariable.html#ae18cc9aa86f234b322ae630eb57406dd',1,'BlisVariable::BlisVariable()'],['../classBlisVariable.html#a26541ecac26bb2e1eb2214641f1042ff',1,'BlisVariable::BlisVariable(double obj, int s, const int *ind, const double *val)'],['../classBlisVariable.html#a761b630c3399ca239d6bdc2394b7c91b',1,'BlisVariable::BlisVariable(double lbh, double ubh, double lbs, double ubs)'],['../classBlisVariable.html#a87ea1a3a674de9ef732bb24a5f3e01d1',1,'BlisVariable::BlisVariable(double lbh, double ubh, double lbs, double ubs, double obj, int s, const int *ind, const double *val)']]], + ['bound_989',['bound',['../classBlisTreeNode.html#a191b47443d6c266510c3088d524a8321',1,'BlisTreeNode']]], + ['branch_990',['branch',['../classBlisBranchObjectBilevel.html#ad9bb1aaeb60ebd4e9b155c97a1bc3425',1,'BlisBranchObjectBilevel::branch()'],['../classBlisBranchObjectInt.html#acc7daf3351d9334df9843d28daec54d7',1,'BlisBranchObjectInt::branch()'],['../classBlisTreeNode.html#a91db94a2f86858f8bc4d6375b3b4183d',1,'BlisTreeNode::branch(AlpsTreeNode &explicitNode)'],['../classBlisTreeNode.html#a6ea34b12df708917755aed699daed063',1,'BlisTreeNode::branch()']]], + ['branchstrategy_991',['branchStrategy',['../classBlisModel.html#ab767bb888c82a53f8435742637dec168',1,'BlisModel']]], + ['breakeven_992',['breakEven',['../classBlisObjectInt.html#a8e7caeca3326a4acb41dab0fd15bf433',1,'BlisObjectInt']]] +]; diff --git a/Doxygen/0.94/search/functions_10.html b/Doxygen/0.94/search/functions_10.html new file mode 100644 index 0000000..09422e1 --- /dev/null +++ b/Doxygen/0.94/search/functions_10.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_10.js b/Doxygen/0.94/search/functions_10.js new file mode 100644 index 0000000..926d039 --- /dev/null +++ b/Doxygen/0.94/search/functions_10.js @@ -0,0 +1,10 @@ +var searchData= +[ + ['unpack_1220',['unpack',['../classVrpParams.html#ab5ff48ed973f2fe9e3aebf7a52796871',1,'VrpParams::unpack()'],['../classBlisParams.html#ac1712eed0f94e6eec64d0e4ca795148f',1,'BlisParams::unpack()']]], + ['unpacksharedconstraints_1221',['unpackSharedConstraints',['../classBlisModel.html#af2d7d44dd78f66dc5bfaed064d7fa4dc',1,'BlisModel']]], + ['unpacksharedknowledge_1222',['unpackSharedKnowledge',['../classBlisModel.html#adc70fd860678229c1a91cede3bafe207',1,'BlisModel']]], + ['unpacksharedpseudocost_1223',['unpackSharedPseudocost',['../classBlisModel.html#a8c574bba3b6145b7b5eef4cfca0557c3',1,'BlisModel']]], + ['unpacksharedvariables_1224',['unpackSharedVariables',['../classBlisModel.html#a41c46d51ed5714fc0f2cf1a38175cdcc',1,'BlisModel']]], + ['update_1225',['update',['../classBlisPseudocost.html#a53616b15bb57c05fc2dd1366f866b0fc',1,'BlisPseudocost::update(const int dir, const double parentObjValue, const double objValue, const double solValue)'],['../classBlisPseudocost.html#a8c45e42b2c8babb8a7e95510281fe0a8',1,'BlisPseudocost::update(const int dir, const double objDiff, const double solValue)'],['../classBlisPseudocost.html#addea77c2fc8dabf5d549e6f08676ae48',1,'BlisPseudocost::update(double upCost, int upCount, double downCost, int downCount)']]], + ['userfeasiblesolution_1226',['userFeasibleSolution',['../classVrpModel.html#a4a4030b814b1ef2df4171dc402fb4698',1,'VrpModel::userFeasibleSolution()'],['../classBlisModel.html#a1f1e47b57c6652dc59224c8a0b48efb6',1,'BlisModel::userFeasibleSolution()']]] +]; diff --git a/Doxygen/0.94/search/functions_11.html b/Doxygen/0.94/search/functions_11.html new file mode 100644 index 0000000..1cde7b4 --- /dev/null +++ b/Doxygen/0.94/search/functions_11.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_11.js b/Doxygen/0.94/search/functions_11.js new file mode 100644 index 0000000..436018f --- /dev/null +++ b/Doxygen/0.94/search/functions_11.js @@ -0,0 +1,13 @@ +var searchData= +[ + ['varlb_1227',['varLB',['../classBlisModel.html#a40c7365368b2669aafa4959983af97e6',1,'BlisModel']]], + ['varub_1228',['varUB',['../classBlisModel.html#a9f47c10cc8005f256ae5ee2fb3c205eb',1,'BlisModel']]], + ['violation_1229',['violation',['../classBlisConstraint.html#a4b628197a0aec5fe68e8dd96f1eb1f02',1,'BlisConstraint']]], + ['vrpcutgenerator_1230',['VrpCutGenerator',['../classVrpCutGenerator.html#a4746e74d2294ea697d43b2ba891f20d0',1,'VrpCutGenerator']]], + ['vrpheurtsp_1231',['VrpHeurTSP',['../classVrpHeurTSP.html#aedbfe629d0e7229037bb38ee91cc7adf',1,'VrpHeurTSP::VrpHeurTSP()'],['../classVrpHeurTSP.html#a7782925e206bbd7ceff7fc739dad02dd',1,'VrpHeurTSP::VrpHeurTSP(VrpModel *model, const char *name, BlisHeurStrategy strategy, int freq)']]], + ['vrpmodel_1232',['VrpModel',['../classVrpModel.html#a4fac9cfceeda8d538a54c12695b6348f',1,'VrpModel']]], + ['vrpnetwork_1233',['VrpNetwork',['../classVrpNetwork.html#ab756a0d0e3013955259ef95a146764ef',1,'VrpNetwork::VrpNetwork()'],['../classVrpNetwork.html#ae06bdd5b1f8fbf32862f71c324093ddc',1,'VrpNetwork::VrpNetwork(int edgenum, int vertnum)']]], + ['vrpparams_1234',['VrpParams',['../classVrpParams.html#a4137a42b26f6916591c9ddeca4893abe',1,'VrpParams']]], + ['vrpsolution_1235',['VrpSolution',['../classVrpSolution.html#a32871cc34020f4414877b92c8b3bc3c0',1,'VrpSolution::VrpSolution()'],['../classVrpSolution.html#abc0da5718793c707be9432b099e24148',1,'VrpSolution::VrpSolution(int s, const double *values, double objValue, VrpModel *vrp=0)']]], + ['vrpvariable_1236',['VrpVariable',['../classVrpVariable.html#a2548cb023ad3c4c678ff42565fda401b',1,'VrpVariable::VrpVariable()'],['../classVrpVariable.html#aa8ac5be4bd9d4e6aa99937cd52014447',1,'VrpVariable::VrpVariable(int v1, int v2, int cost, int ub)']]] +]; diff --git a/Doxygen/0.94/search/functions_12.html b/Doxygen/0.94/search/functions_12.html new file mode 100644 index 0000000..48e5915 --- /dev/null +++ b/Doxygen/0.94/search/functions_12.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_12.js b/Doxygen/0.94/search/functions_12.js new file mode 100644 index 0000000..194d06b --- /dev/null +++ b/Doxygen/0.94/search/functions_12.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['wheninfeasible_1237',['whenInfeasible',['../classBlisConGenerator.html#af1811855b297140e23734c1bb78a2aad',1,'BlisConGenerator']]], + ['writeparameters_1238',['writeParameters',['../classBlisModel.html#a5f882bee715a8313e137c00c38eb5549',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/functions_13.html b/Doxygen/0.94/search/functions_13.html new file mode 100644 index 0000000..f1fc553 --- /dev/null +++ b/Doxygen/0.94/search/functions_13.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_13.js b/Doxygen/0.94/search/functions_13.js new file mode 100644 index 0000000..264fcf1 --- /dev/null +++ b/Doxygen/0.94/search/functions_13.js @@ -0,0 +1,27 @@ +var searchData= +[ + ['_7eblisbranchobjectbilevel_1239',['~BlisBranchObjectBilevel',['../classBlisBranchObjectBilevel.html#a9d10139e78f519d7ade18e432f1d940e',1,'BlisBranchObjectBilevel']]], + ['_7eblisbranchobjectint_1240',['~BlisBranchObjectInt',['../classBlisBranchObjectInt.html#ad74fc1a008e6c60a45925851b72f2a88',1,'BlisBranchObjectInt']]], + ['_7eblisbranchstrategybilevel_1241',['~BlisBranchStrategyBilevel',['../classBlisBranchStrategyBilevel.html#a8739b4dcea8c81854d44621722bebef5',1,'BlisBranchStrategyBilevel']]], + ['_7eblisbranchstrategymaxinf_1242',['~BlisBranchStrategyMaxInf',['../classBlisBranchStrategyMaxInf.html#a41ce53a68e957cfa31efae0770369170',1,'BlisBranchStrategyMaxInf']]], + ['_7eblisbranchstrategypseudo_1243',['~BlisBranchStrategyPseudo',['../classBlisBranchStrategyPseudo.html#a27b9e007de5aa2891bfc0566444752c1',1,'BlisBranchStrategyPseudo']]], + ['_7eblisbranchstrategyrel_1244',['~BlisBranchStrategyRel',['../classBlisBranchStrategyRel.html#aacaeec391f9e26d8b2c3ec567296b90b',1,'BlisBranchStrategyRel']]], + ['_7eblisbranchstrategystrong_1245',['~BlisBranchStrategyStrong',['../classBlisBranchStrategyStrong.html#a15e9ebbdc4d199d9511efbf356a9cffb',1,'BlisBranchStrategyStrong']]], + ['_7ebliscongenerator_1246',['~BlisConGenerator',['../classBlisConGenerator.html#aa5a1cbafff04c7b4e53cdf97fedcb6fb',1,'BlisConGenerator']]], + ['_7eblisconstraint_1247',['~BlisConstraint',['../classBlisConstraint.html#a72083df7ab042fb07db58b3b56b8e78d',1,'BlisConstraint']]], + ['_7eblisheuristic_1248',['~BlisHeuristic',['../classBlisHeuristic.html#a6df179036cc7eb095b81b364b28aa8de',1,'BlisHeuristic']]], + ['_7eblisheurround_1249',['~BlisHeurRound',['../classBlisHeurRound.html#a96ef3a370f9f73ca93440bf3cdf7e9bb',1,'BlisHeurRound']]], + ['_7eblismodel_1250',['~BlisModel',['../classBlisModel.html#a22c1a64b360633ddf011a51176e407a9',1,'BlisModel']]], + ['_7eblisnodedesc_1251',['~BlisNodeDesc',['../classBlisNodeDesc.html#a1dae8f94bcdf202241ea74f9f6521d63',1,'BlisNodeDesc']]], + ['_7eblisobjectint_1252',['~BlisObjectInt',['../classBlisObjectInt.html#aabb6f4b0e120eb64da7e6eb6107287ff',1,'BlisObjectInt']]], + ['_7eblispresolve_1253',['~BlisPresolve',['../classBlisPresolve.html#a7e8366523f0afd1746ba5dea3b6774ec',1,'BlisPresolve']]], + ['_7eblissolution_1254',['~BlisSolution',['../classBlisSolution.html#a61b46203a05e5da53d95ff91c4773fa8',1,'BlisSolution']]], + ['_7eblistreenode_1255',['~BlisTreeNode',['../classBlisTreeNode.html#a988a27c2ad6c53d81b1db2016533cfee',1,'BlisTreeNode']]], + ['_7eblisvariable_1256',['~BlisVariable',['../classBlisVariable.html#a8d1179b4118501d24b19d965dd0e170c',1,'BlisVariable']]], + ['_7evrpcutgenerator_1257',['~VrpCutGenerator',['../classVrpCutGenerator.html#a0318302554cd442ae1a2969b8639e5ce',1,'VrpCutGenerator']]], + ['_7evrpheurtsp_1258',['~VrpHeurTSP',['../classVrpHeurTSP.html#a7e703c555ac4a73ec7b8033f0bff6d70',1,'VrpHeurTSP']]], + ['_7evrpmodel_1259',['~VrpModel',['../classVrpModel.html#afa39413ca28dba8fef266dbb56c483d5',1,'VrpModel']]], + ['_7evrpnetwork_1260',['~VrpNetwork',['../classVrpNetwork.html#af43f6f001756d9d74b838d0a9b9f8c4f',1,'VrpNetwork']]], + ['_7evrpsolution_1261',['~VrpSolution',['../classVrpSolution.html#a63c1dec6a6efcdc043b34d49b8baed75',1,'VrpSolution']]], + ['_7evrpvariable_1262',['~VrpVariable',['../classVrpVariable.html#ae81c09d2ea59eddf508c42e3f39dd041',1,'VrpVariable']]] +]; diff --git a/Doxygen/0.94/search/functions_2.html b/Doxygen/0.94/search/functions_2.html new file mode 100644 index 0000000..2737c5a --- /dev/null +++ b/Doxygen/0.94/search/functions_2.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_2.js b/Doxygen/0.94/search/functions_2.js new file mode 100644 index 0000000..83df571 --- /dev/null +++ b/Doxygen/0.94/search/functions_2.js @@ -0,0 +1,33 @@ +var searchData= +[ + ['callheuristics_993',['callHeuristics',['../classBlisTreeNode.html#adb4e9bf61a5b8f5c9bc289c0a40c26e5',1,'BlisTreeNode']]], + ['calls_994',['calls',['../classBlisConGenerator.html#a01446c88bbb3f6e3691da1e9ce039c3d',1,'BlisConGenerator::calls()'],['../classBlisHeuristic.html#ac19e802404f2b675be44db2a26e4a9fc',1,'BlisHeuristic::calls()']]], + ['checkinteger_995',['checkInteger',['../classBlisModel.html#a1b6e001901ae369407076b8f92872f5c',1,'BlisModel']]], + ['choosebranchingobject_996',['chooseBranchingObject',['../classBlisTreeNode.html#a5ab668d3f0376f9904a88ec7e5f37911',1,'BlisTreeNode']]], + ['clearsharedobjectmark_997',['clearSharedObjectMark',['../classBlisModel.html#a5f9e6a3951a0ebede72513629338b797',1,'BlisModel']]], + ['clone_998',['clone',['../classBlisBranchObjectBilevel.html#af0b47591c90cb2862ad5cbbf75643234',1,'BlisBranchObjectBilevel::clone()'],['../classBlisBranchObjectInt.html#aae647f199376a9625c1eb1386aa121f2',1,'BlisBranchObjectInt::clone()'],['../classBlisBranchStrategyBilevel.html#aee2add16c1894c1dd734108849faf8c8',1,'BlisBranchStrategyBilevel::clone()'],['../classBlisBranchStrategyMaxInf.html#af43cdd92aa018de15712b0b061541a8c',1,'BlisBranchStrategyMaxInf::clone()'],['../classBlisBranchStrategyPseudo.html#a344e41a34409aa4bb2dbd6cf7310ab39',1,'BlisBranchStrategyPseudo::clone()'],['../classBlisBranchStrategyRel.html#a7886ac8238db81f4567aa43e62e181ff',1,'BlisBranchStrategyRel::clone()'],['../classBlisBranchStrategyStrong.html#a55da718034d1e6571d2f30a078c11f67',1,'BlisBranchStrategyStrong::clone()'],['../classBlisHeuristic.html#a69317c98229c29248906e29c7015ec7e',1,'BlisHeuristic::clone()'],['../classBlisHeurRound.html#a75301ce53c463ad012c497759c0c3862',1,'BlisHeurRound::clone()'],['../classBlisObjectInt.html#a60bb97371f767a1d7f78281ff00397af',1,'BlisObjectInt::clone()']]], + ['columnindex_999',['columnIndex',['../classBlisObjectInt.html#a9b1a01c7513c64fd2612ff8121b62fb4',1,'BlisObjectInt']]], + ['computecompnums_1000',['computeCompNums',['../classVrpNetwork.html#a90902e0f7fe888722e4b2456445ee287',1,'VrpNetwork']]], + ['computecost_1001',['computeCost',['../classVrpModel.html#acb762e5dec499955ea21ffe9ecbd239c',1,'VrpModel']]], + ['conlb_1002',['conLB',['../classBlisModel.html#ad60922b4632ed4a0c3788f7ec086e3c9',1,'BlisModel']]], + ['connected_1003',['connected',['../classVrpNetwork.html#a2c42198552aab3efc174913e53800fb1',1,'VrpNetwork']]], + ['connectivitycuts_1004',['connectivityCuts',['../classVrpCutGenerator.html#a375334752cd0ed4eef7e116f9166790f',1,'VrpCutGenerator']]], + ['constraintpool_1005',['constraintPool',['../classBlisModel.html#a0a223f7df2d2e08f38b2dbd7879f6af9',1,'BlisModel']]], + ['constraintpoolreceive_1006',['constraintPoolReceive',['../classBlisModel.html#ad6dbfdc54ac9e99606893fae2b5fa215',1,'BlisModel']]], + ['constraintpoolsend_1007',['constraintPoolSend',['../classBlisModel.html#a80f370e8a76a1baed42e13163a1343e9',1,'BlisModel']]], + ['conub_1008',['conUB',['../classBlisModel.html#af08cca862bdd7048c6cefe5862d6860f',1,'BlisModel']]], + ['converttoexplicit_1009',['convertToExplicit',['../classBlisTreeNode.html#ad638cc75118d58d3e2fd216a05191a8c',1,'BlisTreeNode']]], + ['converttorelative_1010',['convertToRelative',['../classBlisTreeNode.html#a098c6b544096ac7d0b2d5a38a9e704c7',1,'BlisTreeNode']]], + ['createadjlist_1011',['createAdjList',['../classVrpHeurTSP.html#a09b210c13a3a2e03069808fb215178db',1,'VrpHeurTSP']]], + ['createbranchobject_1012',['createBranchObject',['../classBlisObjectInt.html#aa9d35ebde86cc42203312516e3d3dc05',1,'BlisObjectInt']]], + ['createcandbranchobjects_1013',['createCandBranchObjects',['../classBlisBranchStrategyBilevel.html#aad896ce5047233cbb36614d129fbf8c0',1,'BlisBranchStrategyBilevel::createCandBranchObjects()'],['../classBlisBranchStrategyMaxInf.html#acaddcf01d9015a70e50cce9a610e852f',1,'BlisBranchStrategyMaxInf::createCandBranchObjects()'],['../classBlisBranchStrategyPseudo.html#a820addbd3a432ce902c60a0bbfb7a235',1,'BlisBranchStrategyPseudo::createCandBranchObjects()'],['../classBlisBranchStrategyRel.html#a5cd0c38e453609dc60e0e9b30b2c5f19',1,'BlisBranchStrategyRel::createCandBranchObjects()'],['../classBlisBranchStrategyStrong.html#a418a63c061beb6730eba77ebceb1e4db',1,'BlisBranchStrategyStrong::createCandBranchObjects()']]], + ['createintgerobjects_1014',['createIntgerObjects',['../classBlisModel.html#af24135d10b535cdb39ad3c814edb5f96',1,'BlisModel']]], + ['createkeywordlist_1015',['createKeywordList',['../classVrpParams.html#a4db04bf3dff6f5761b03f1aa63b98655',1,'VrpParams::createKeywordList()'],['../classBlisParams.html#a32474a6065f10a229d1d466883815bac',1,'BlisParams::createKeywordList()']]], + ['createnet_1016',['createNet',['../classVrpModel.html#abf0b47d9804470811f986f23e1f3bafb',1,'VrpModel::createNet()'],['../classVrpNetwork.html#aaefabce90a76b5e6b4cfcedc5f46252e',1,'VrpNetwork::createNet()']]], + ['createnewtreenode_1017',['createNewTreeNode',['../classBlisTreeNode.html#a1424b02415188154020fca933b11f508',1,'BlisTreeNode']]], + ['createobjects_1018',['createObjects',['../classBlisModel.html#a0b397deb3e5c6185b098a4612f560fbc',1,'BlisModel']]], + ['createosirowcut_1019',['createOsiRowCut',['../classBlisConstraint.html#a1ae67954b53bab487b2dfaf31f9f2723',1,'BlisConstraint']]], + ['createroot_1020',['createRoot',['../classBlisModel.html#aa06c197451ebf7ca9ebf97c620903e91',1,'BlisModel']]], + ['cutgenerationfreq_1021',['cutGenerationFreq',['../classBlisConGenerator.html#a3fe556af32fdc462c174f0a8f7c477e0',1,'BlisConGenerator']]], + ['cutgenerators_1022',['cutGenerators',['../classBlisModel.html#a9c3f748eaa747d3d224699d96550f2e3',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/functions_3.html b/Doxygen/0.94/search/functions_3.html new file mode 100644 index 0000000..6da86e7 --- /dev/null +++ b/Doxygen/0.94/search/functions_3.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_3.js b/Doxygen/0.94/search/functions_3.js new file mode 100644 index 0000000..e166775 --- /dev/null +++ b/Doxygen/0.94/search/functions_3.js @@ -0,0 +1,11 @@ +var searchData= +[ + ['decode_1023',['decode',['../classVrpSolution.html#a692f07f58fe2ee59d70df0fed8ff7f36',1,'VrpSolution::decode()'],['../classVrpVariable.html#ace77fe9d210c78007041b797154b3883',1,'VrpVariable::decode()'],['../classBlisBranchObjectBilevel.html#a0c8291362bcdefe7abcd9a48b80bb0b4',1,'BlisBranchObjectBilevel::decode()'],['../classBlisBranchObjectInt.html#af1c724af5ca3b4b34b6806fb860b4080',1,'BlisBranchObjectInt::decode()'],['../classBlisConstraint.html#a7a0201445e5f12a2af8ac380689d76f5',1,'BlisConstraint::decode()'],['../classBlisNodeDesc.html#a46d6f8161adb0e841e6685b7ed5c41f8',1,'BlisNodeDesc::decode()'],['../classBlisPseudocost.html#a3e66aa0a6004338f3d0d07b98a7c3077',1,'BlisPseudocost::decode()'],['../classBlisSolution.html#afeb6bcb9c5e93bb2eb257fa7564976af',1,'BlisSolution::decode()'],['../classBlisTreeNode.html#a34defb4ea9b5f0ae6114a50e65128a44',1,'BlisTreeNode::decode()'],['../classBlisVariable.html#a90264ddd0119c3e1ac3c22d83c96bd47',1,'BlisVariable::decode()']]], + ['decodeblis_1024',['decodeBlis',['../classBlisBranchObjectBilevel.html#aaa4c4ed5cce8605fbd6885edbfe4536f',1,'BlisBranchObjectBilevel::decodeBlis()'],['../classBlisBranchObjectInt.html#a2304fc0e0a9cce30453ca0415f8d8ae1',1,'BlisBranchObjectInt::decodeBlis()'],['../classBlisConstraint.html#a59d9cfbb0e604345073435d79e2df273',1,'BlisConstraint::decodeBlis()'],['../classBlisModel.html#ae9c77ad991165335e43e9d369c27e88e',1,'BlisModel::decodeBlis()'],['../classBlisNodeDesc.html#a20e9819cf1d6bef4651e105fdc1db975',1,'BlisNodeDesc::decodeBlis()'],['../classBlisVariable.html#ab000d52c504c87e953b465f8129a0d0f',1,'BlisVariable::decodeBlis()']]], + ['decodefrom_1025',['decodeFrom',['../classBlisPseudocost.html#a9342410d9a9e61f56ffa2bbde00f12ab',1,'BlisPseudocost']]], + ['decodetoself_1026',['decodeToSelf',['../classVrpModel.html#a82507812bc16a3776bead63b4361bcda',1,'VrpModel::decodeToSelf()'],['../classBlisModel.html#af414d2dd65b47bacb503eed9bbaf0edd',1,'BlisModel::decodeToSelf()']]], + ['decodevrp_1027',['decodeVrp',['../classVrpModel.html#a1dabf5ddb9dd94f525b7cb21bc19d55b',1,'VrpModel::decodeVrp()'],['../classVrpVariable.html#aa2020aebe9fd0e898a5fedf670639a3f',1,'VrpVariable::decodeVrp()']]], + ['deleteobjects_1028',['deleteObjects',['../classBlisModel.html#a1f2205b2d62158e48daa6297a62af618',1,'BlisModel']]], + ['deloldconstraints_1029',['delOldConstraints',['../classBlisModel.html#a0af20550e0c6c09b6815a689a3ca5306',1,'BlisModel']]], + ['depthfirstsearch_1030',['depthFirstSearch',['../classVrpNetwork.html#a2102b7b9dfaa32ffcb1539fe7a661678',1,'VrpNetwork']]] +]; diff --git a/Doxygen/0.94/search/functions_4.html b/Doxygen/0.94/search/functions_4.html new file mode 100644 index 0000000..911304e --- /dev/null +++ b/Doxygen/0.94/search/functions_4.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_4.js b/Doxygen/0.94/search/functions_4.js new file mode 100644 index 0000000..eef8b1d --- /dev/null +++ b/Doxygen/0.94/search/functions_4.js @@ -0,0 +1,9 @@ +var searchData= +[ + ['encode_1031',['encode',['../classVrpModel.html#acb1af174fc6aff89bb40244f39819a3f',1,'VrpModel::encode()'],['../classVrpSolution.html#a473080e4f3e12f4980e0ec693571d565',1,'VrpSolution::encode()'],['../classVrpVariable.html#a47e26b64489a565c3088c530d271d79d',1,'VrpVariable::encode()'],['../classBlisBranchObjectBilevel.html#af1ed1620dbeead0d8c4494b6c69d254f',1,'BlisBranchObjectBilevel::encode()'],['../classBlisBranchObjectInt.html#a10d23ac34a084b642f916df0bd240937',1,'BlisBranchObjectInt::encode()'],['../classBlisConstraint.html#abb5dc36f65915b4ef9c7bd188a576ce6',1,'BlisConstraint::encode()'],['../classBlisModel.html#a8f410c8c49d7ecb0890165deeede60a2',1,'BlisModel::encode()'],['../classBlisNodeDesc.html#ac55c292c4b5da1af7273e5bc09eb713c',1,'BlisNodeDesc::encode()'],['../classBlisPseudocost.html#a182283af05a8b029e74f2bda33afc58d',1,'BlisPseudocost::encode()'],['../classBlisSolution.html#a253040cf88d3ab2e93d4300aaaf373de',1,'BlisSolution::encode()'],['../classBlisTreeNode.html#af69d5140ee5b731957338a5b60f050b4',1,'BlisTreeNode::encode()'],['../classBlisVariable.html#ad5230860d87135e663fef5b4e33bf949',1,'BlisVariable::encode()']]], + ['encodeblis_1032',['encodeBlis',['../classBlisBranchObjectBilevel.html#aaa1632928e5b0e6554349e7bfa9e3664',1,'BlisBranchObjectBilevel::encodeBlis()'],['../classBlisBranchObjectInt.html#a75eea283f6514c7e2fd44104ab7cafc1',1,'BlisBranchObjectInt::encodeBlis()'],['../classBlisConstraint.html#ad0bc07cb2b9180d4bc0f5c12b8d80a5b',1,'BlisConstraint::encodeBlis()'],['../classBlisModel.html#a904d4146b9f172a7b4774d2690177d02',1,'BlisModel::encodeBlis()'],['../classBlisNodeDesc.html#ab5e426ef6239acf66db89159b5c23e9d',1,'BlisNodeDesc::encodeBlis()'],['../classBlisVariable.html#af8f9659fcdd9d26a08ab1dc77206029c',1,'BlisVariable::encodeBlis()']]], + ['encodeto_1033',['encodeTo',['../classBlisPseudocost.html#ad9d520583d96a29df0dc6a312664bf35',1,'BlisPseudocost']]], + ['encodevrp_1034',['encodeVrp',['../classVrpModel.html#ac94f13a6e224d40f643388c3dbc11303',1,'VrpModel::encodeVrp()'],['../classVrpVariable.html#ab5c3c47340a13720a1091980cdd05805',1,'VrpVariable::encodeVrp()']]], + ['entry_1035',['entry',['../classVrpParams.html#a5d1e6c1edbc844d0e2d502f5ada2d45b',1,'VrpParams::entry(const boolParams key) const'],['../classVrpParams.html#af13ae5b571ed9afc9c8d0f74d0c3adeb',1,'VrpParams::entry(const intParams key) const'],['../classVrpParams.html#ab268135ebac022d6dbf57fa5cf8a6032',1,'VrpParams::entry(const dblParams key) const'],['../classVrpParams.html#ace279bf97295d07ed3a31ac31fa35c06',1,'VrpParams::entry(const strParams key) const'],['../classVrpParams.html#aecf03d80e56e0f69c95997c3cbb9f6fb',1,'VrpParams::entry(const strArrayParams key) const'],['../classBlisParams.html#a9e9cc7d966810c100d0d9c76f62b85df',1,'BlisParams::entry(const chrParams key) const'],['../classBlisParams.html#ac1c581de649f4c809dd4a233c12a167c',1,'BlisParams::entry(const intParams key) const'],['../classBlisParams.html#a57e8f6e79febf19711d017843e1b7132',1,'BlisParams::entry(const dblParams key) const'],['../classBlisParams.html#a88dac9582910af5b14d179eda0269ad3',1,'BlisParams::entry(const strParams key) const'],['../classBlisParams.html#aa82257357cf9af6360813b93eee7abaf',1,'BlisParams::entry(const strArrayParams key) const']]], + ['estimatesolution_1036',['estimateSolution',['../classBlisTreeNode.html#a04554b18f39b512b90b02cb25f39ee78',1,'BlisTreeNode']]] +]; diff --git a/Doxygen/0.94/search/functions_5.html b/Doxygen/0.94/search/functions_5.html new file mode 100644 index 0000000..61b920d --- /dev/null +++ b/Doxygen/0.94/search/functions_5.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_5.js b/Doxygen/0.94/search/functions_5.js new file mode 100644 index 0000000..131fbd6 --- /dev/null +++ b/Doxygen/0.94/search/functions_5.js @@ -0,0 +1,9 @@ +var searchData= +[ + ['fathom_1037',['fathom',['../classBlisTreeNode.html#ab077379eab5eb849d7ee2767a8d29557',1,'BlisTreeNode']]], + ['fathomallnodes_1038',['fathomAllNodes',['../classBlisModel.html#aad8ebadfe513b09a229b804a360f5a2d',1,'BlisModel']]], + ['feasibleregion_1039',['feasibleRegion',['../classBlisObjectInt.html#afa0cc09d01fb3643fde308a2850a8e32',1,'BlisObjectInt']]], + ['feasiblesolution_1040',['feasibleSolution',['../classBlisModel.html#a6e88699fda7cef4dae11b05dddd68652',1,'BlisModel']]], + ['feasiblesolutionheur_1041',['feasibleSolutionHeur',['../classBlisModel.html#afcb6c2b7b6496363edb533815e2dd47d',1,'BlisModel']]], + ['freeguts_1042',['freeGuts',['../classVrpHeurTSP.html#ab159ae82ace4576fa0680f1536744d4b',1,'VrpHeurTSP']]] +]; diff --git a/Doxygen/0.94/search/functions_6.html b/Doxygen/0.94/search/functions_6.html new file mode 100644 index 0000000..dc70a4a --- /dev/null +++ b/Doxygen/0.94/search/functions_6.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_6.js b/Doxygen/0.94/search/functions_6.js new file mode 100644 index 0000000..7fb50ce --- /dev/null +++ b/Doxygen/0.94/search/functions_6.js @@ -0,0 +1,63 @@ +var searchData= +[ + ['generateconstraints_1043',['generateConstraints',['../classVrpCutGenerator.html#a7373fd29453273770b5aca5cf0b6eb61',1,'VrpCutGenerator::generateConstraints()'],['../classBlisConGenerator.html#ad5b539938155aed495a7e486b8d1ad65',1,'BlisConGenerator::generateConstraints()'],['../classBlisTreeNode.html#a323e2a4fb10b4a887f33475bdb4ca088',1,'BlisTreeNode::generateConstraints()']]], + ['generator_1044',['generator',['../classBlisConGenerator.html#a37f8fd75f69dcf50608cddb2b0fb9a0e',1,'BlisConGenerator']]], + ['getaveiterations_1045',['getAveIterations',['../classBlisModel.html#a7ccfad6c660054ff6565a4594320a1fd',1,'BlisModel']]], + ['getbasis_1046',['getBasis',['../classBlisNodeDesc.html#a6613cd0d00a7d91c73ba9eef5806c657',1,'BlisNodeDesc']]], + ['getbrancheddir_1047',['getBranchedDir',['../classBlisNodeDesc.html#abbd9a4a940a86a11fb1d6571f6563e9f',1,'BlisNodeDesc']]], + ['getbranchedind_1048',['getBranchedInd',['../classBlisNodeDesc.html#a79db112832d3ab4be6ce387f08d8a376',1,'BlisNodeDesc']]], + ['getbranchedval_1049',['getBranchedVal',['../classBlisNodeDesc.html#aa78115d2823630894d558c28520179fc',1,'BlisNodeDesc']]], + ['getbranchingset_1050',['getBranchingSet',['../classBlisBranchObjectBilevel.html#af74d9417787c90a2c75a798d3d66d87f',1,'BlisBranchObjectBilevel']]], + ['getcollower_1051',['getColLower',['../classBlisModel.html#a1ace379f79a8b46d704fc0df27c1f3db',1,'BlisModel']]], + ['getcolupper_1052',['getColUpper',['../classBlisModel.html#a3457a4d51bd82e992074d98155e18c32',1,'BlisModel']]], + ['getconrandoms_1053',['getConRandoms',['../classBlisModel.html#ac00649c6df26aea000b02880f5acb554',1,'BlisModel']]], + ['getcutgenerationfrequency_1054',['getCutGenerationFrequency',['../classBlisModel.html#a5f676e2ec0ad1f03fc7d3c746631f0a4',1,'BlisModel']]], + ['getcutoff_1055',['getCutoff',['../classBlisModel.html#ab6f58f37d4934bca6f21938b257dbb0f',1,'BlisModel']]], + ['getcutstrategy_1056',['getCutStrategy',['../classBlisModel.html#a3737eaf783b5f0a1f378e2e6a25e439c',1,'BlisModel']]], + ['getdenseconcutoff_1057',['getDenseConCutoff',['../classBlisModel.html#ab5b551cccea28e83e31f53cfbba1b0b9',1,'BlisModel']]], + ['getdown_1058',['getDown',['../classBlisBranchObjectInt.html#aecdb099fd5873b13e7e551ab2eae7476',1,'BlisBranchObjectInt']]], + ['getdowncost_1059',['getDownCost',['../classBlisPseudocost.html#a7174c388a0adc01cb1cf57f17e778b17',1,'BlisPseudocost']]], + ['getdowncount_1060',['getDownCount',['../classBlisPseudocost.html#ad0001d6d6caaaebb2c5d67db2c1f9594',1,'BlisPseudocost']]], + ['getedgelist_1061',['getEdgeList',['../classVrpModel.html#a4d08b81c648ab7b32d0784bc6d4c3535',1,'VrpModel']]], + ['getfeaschecktime_1062',['getFeasCheckTime',['../classBlisModel.html#a0539537a2186a127544f339538fbfe77',1,'BlisModel']]], + ['getindex_1063',['getIndex',['../classVrpVariable.html#a8f3971cb639f20008db518d005b19b5f',1,'VrpVariable']]], + ['getindices_1064',['getIndices',['../classBlisConstraint.html#a00e7ebb783c80ec57820225f8417febf',1,'BlisConstraint::getIndices()'],['../classBlisVariable.html#a8af5315613fe05b14d871d734a6fb53b',1,'BlisVariable::getIndices()']]], + ['getintcolindices_1065',['getIntColIndices',['../classBlisModel.html#abfcf34fa8497b27c95b373089fdc7fbd',1,'BlisModel']]], + ['getintobjindices_1066',['getIntObjIndices',['../classBlisModel.html#a4da830ddd2bbee203271ac26b067c4a5',1,'BlisModel']]], + ['getlpobjvalue_1067',['getLpObjValue',['../classBlisModel.html#a565a4a47c24dbb93c05d3e9a4e3a1092',1,'BlisModel']]], + ['getlpsolution_1068',['getLpSolution',['../classBlisModel.html#a0613b402519b1636690f2cde50166279',1,'BlisModel']]], + ['getmaxnumcons_1069',['getMaxNumCons',['../classBlisModel.html#a258532882b2e55234dfdc7da4143eaf0',1,'BlisModel']]], + ['getmodel_1070',['getModel',['../classBlisConGenerator.html#a7e3adaf759186cc2cc5b62e68b83419c',1,'BlisConGenerator']]], + ['getnodeweight_1071',['getNodeWeight',['../classBlisModel.html#ade5169dff480abde6ceb1b853526e19f',1,'BlisModel']]], + ['getnumbranchresolve_1072',['getNumBranchResolve',['../classBlisModel.html#aa02ed965b4633f61cdabdcf370e5156c',1,'BlisModel']]], + ['getnumcols_1073',['getNumCols',['../classBlisModel.html#aeaa6efe45eb0150e2200e6c92bdd3d4e',1,'BlisModel']]], + ['getnumedges_1074',['getNumEdges',['../classVrpModel.html#afd26e057fff79d32288c3e9fbbf255b3',1,'VrpModel']]], + ['getnumheursolutions_1075',['getNumHeurSolutions',['../classBlisModel.html#ad22b235fe68b954eb4b4c0b9d8e6459a',1,'BlisModel']]], + ['getnumintobjects_1076',['getNumIntObjects',['../classBlisModel.html#af0a261c810d4af1e4eab6c05dca7b00d',1,'BlisModel']]], + ['getnumiterations_1077',['getNumIterations',['../classBlisModel.html#a798e9defd9c0b9ff897067a24342aa78',1,'BlisModel']]], + ['getnumnodes_1078',['getNumNodes',['../classBlisModel.html#abb15324201704d788a4c2a8c08d433a6',1,'BlisModel']]], + ['getnumoldconstraints_1079',['getNumOldConstraints',['../classBlisModel.html#a6e959fd3c751b927fb34f23e01a6eaa3',1,'BlisModel']]], + ['getnumrows_1080',['getNumRows',['../classBlisModel.html#ac25e488c49806d81edd7caddb536c834',1,'BlisModel']]], + ['getnumsolutions_1081',['getNumSolutions',['../classBlisModel.html#ae23a39469021a42d87ac8be779077fcf',1,'BlisModel']]], + ['getnumstrong_1082',['getNumStrong',['../classBlisModel.html#a73ac5a9ff81d91371b46caa40ac6d7c5',1,'BlisModel']]], + ['getnumvertices_1083',['getNumVertices',['../classVrpModel.html#ab9eca9f48ed9e27405cdff8b580a1256',1,'VrpModel']]], + ['getobjcoef_1084',['getObjCoef',['../classBlisModel.html#a2bd62be09340fc888a46f7ad258f725f',1,'BlisModel::getObjCoef()'],['../classBlisVariable.html#a3339b546a9b72e8c99c671ccf358f2a3',1,'BlisVariable::getObjCoef()']]], + ['getoldconstraintssize_1085',['getOldConstraintsSize',['../classBlisModel.html#a91bee7a54d09e09d7c55c1b0cf06ba99',1,'BlisModel']]], + ['getscore_1086',['getScore',['../classBlisPseudocost.html#a9bda51fa03ab711cedba2ec86e447d36',1,'BlisPseudocost']]], + ['getsize_1087',['getSize',['../classBlisConstraint.html#aee67cc1356d1b97a9a80c72b1fc93c92',1,'BlisConstraint::getSize()'],['../classBlisVariable.html#a251fc92ec97dc799fdab3cdde8f2a15a',1,'BlisVariable::getSize()']]], + ['getsolution_1088',['getSolution',['../classVrpModel.html#a1814085e81466edc93d3bed257868cea',1,'VrpModel']]], + ['getsolver_1089',['getSolver',['../classBlisModel.html#a7a8342c01e850a846e9f3bcd449a0edb',1,'BlisModel']]], + ['getup_1090',['getUp',['../classBlisBranchObjectInt.html#a7555650332bd009140a882927d0afdf2',1,'BlisBranchObjectInt']]], + ['getupcost_1091',['getUpCost',['../classBlisPseudocost.html#a8188376260755860ac9b84f341e6fdb8',1,'BlisPseudocost']]], + ['getupcount_1092',['getUpCount',['../classBlisPseudocost.html#a8a84d5efe7b615515db6ab81c18768ba',1,'BlisPseudocost']]], + ['getv0_1093',['getv0',['../classVrpVariable.html#a301feb5d30a68834aa3310584c559ee8',1,'VrpVariable']]], + ['getv1_1094',['getv1',['../classVrpVariable.html#a51d94fbe5a04e1f7826058f5f870993f',1,'VrpVariable']]], + ['getvalues_1095',['getValues',['../classBlisConstraint.html#a76c46e83d58a7e1714406d5221dbfe7b',1,'BlisConstraint::getValues()'],['../classBlisVariable.html#abb92abfb4f98242e7ce3fa24854fae0a',1,'BlisVariable::getValues()']]], + ['getviolatedconstraints_1096',['getViolatedConstraints',['../classBlisTreeNode.html#aa41bf5a9b3bf07cff3244033acb0242c',1,'BlisTreeNode']]], + ['greedyshrinking1_1097',['greedyShrinking1',['../classVrpCutGenerator.html#a4cf3a92a7485e8b9f8b8e897fcf2ba13',1,'VrpCutGenerator']]], + ['greedyshrinking1one_1098',['greedyShrinking1One',['../classVrpCutGenerator.html#a8d4e29706ab694241a6504a444f8650e',1,'VrpCutGenerator']]], + ['greedyshrinking2one_1099',['greedyShrinking2One',['../classVrpCutGenerator.html#a81745a4c5b545d4c73f13cad9093ba98',1,'VrpCutGenerator']]], + ['greedyshrinking6_1100',['greedyShrinking6',['../classVrpCutGenerator.html#a9e9989d4919df0c5f61272ad4f5db10a',1,'VrpCutGenerator']]], + ['greedyshrinking6one_1101',['greedyShrinking6One',['../classVrpCutGenerator.html#ab609be1eb4941d1530ee53b7780bc901',1,'VrpCutGenerator']]], + ['gutsofdestructor_1102',['gutsOfDestructor',['../classVrpNetwork.html#a415febacff5b1204e2b834fc59af65e2',1,'VrpNetwork::gutsOfDestructor()'],['../classBlisModel.html#ae1d3a84daec42ae06fff778362a631d4',1,'BlisModel::gutsOfDestructor()']]] +]; diff --git a/Doxygen/0.94/search/functions_7.html b/Doxygen/0.94/search/functions_7.html new file mode 100644 index 0000000..7de3106 --- /dev/null +++ b/Doxygen/0.94/search/functions_7.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_7.js b/Doxygen/0.94/search/functions_7.js new file mode 100644 index 0000000..556808c --- /dev/null +++ b/Doxygen/0.94/search/functions_7.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['hashing_1103',['hashing',['../classBlisConstraint.html#a3071a4763afbc64582711a2f592a7567',1,'BlisConstraint']]], + ['heurcallfrequency_1104',['heurCallFrequency',['../classBlisHeuristic.html#af83bbc9906b81ff7fa9ef4716ae30591',1,'BlisHeuristic']]], + ['heuristics_1105',['heuristics',['../classBlisModel.html#aa1811e7df4aceb6faad6d6a47baa0643',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/functions_8.html b/Doxygen/0.94/search/functions_8.html new file mode 100644 index 0000000..7422be2 --- /dev/null +++ b/Doxygen/0.94/search/functions_8.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_8.js b/Doxygen/0.94/search/functions_8.js new file mode 100644 index 0000000..9eaf16f --- /dev/null +++ b/Doxygen/0.94/search/functions_8.js @@ -0,0 +1,9 @@ +var searchData= +[ + ['importmodel_1106',['importModel',['../classBlisModel.html#a44ae2ca3d5d1d9dd1065491d303acf1f',1,'BlisModel']]], + ['incumbent_1107',['incumbent',['../classBlisModel.html#aa32f73ed94be953d11effddb282328f9',1,'BlisModel']]], + ['index_1108',['index',['../classVrpModel.html#abcc3d28b9791c337c96974845d304f5c',1,'VrpModel']]], + ['infeasibility_1109',['infeasibility',['../classBlisObjectInt.html#ae6676fb108212ce74ca7b0d44f054dfb',1,'BlisObjectInt']]], + ['init_1110',['init',['../classBlisModel.html#a7dc60be9ec99adcf7ecb19e9ea93e7d1',1,'BlisModel::init()'],['../classBlisTreeNode.html#acad0cbce871534ec4bce6ed72a747c81',1,'BlisTreeNode::init()']]], + ['installsubproblem_1111',['installSubProblem',['../classBlisTreeNode.html#a57f40d7662e90b2daea2cf715bf4bc95',1,'BlisTreeNode']]] +]; diff --git a/Doxygen/0.94/search/functions_9.html b/Doxygen/0.94/search/functions_9.html new file mode 100644 index 0000000..befd4fa --- /dev/null +++ b/Doxygen/0.94/search/functions_9.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_9.js b/Doxygen/0.94/search/functions_9.js new file mode 100644 index 0000000..cab6293 --- /dev/null +++ b/Doxygen/0.94/search/functions_9.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['modellog_1112',['modelLog',['../classBlisModel.html#a242d7f0b648e76512f8eba38c0232541',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/functions_a.html b/Doxygen/0.94/search/functions_a.html new file mode 100644 index 0000000..a81e963 --- /dev/null +++ b/Doxygen/0.94/search/functions_a.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_a.js b/Doxygen/0.94/search/functions_a.js new file mode 100644 index 0000000..04f92f9 --- /dev/null +++ b/Doxygen/0.94/search/functions_a.js @@ -0,0 +1,15 @@ +var searchData= +[ + ['name_1113',['name',['../classBlisConGenerator.html#a4a64826034004c2592d8d5cf1cdf461d',1,'BlisConGenerator::name()'],['../classBlisHeuristic.html#ac36729ddcfafdb9f852301572b1e4275',1,'BlisHeuristic::name()']]], + ['noconscalls_1114',['noConsCalls',['../classBlisConGenerator.html#a4e7351b14148ec6644ed700a6be5f577',1,'BlisConGenerator']]], + ['nodelog_1115',['nodeLog',['../classBlisModel.html#acc9050c2c46d08f089581c370e80b958',1,'BlisModel']]], + ['normal_1116',['normal',['../classBlisConGenerator.html#a4c935c2cf3c288b901832f632c85fb73',1,'BlisConGenerator']]], + ['nosolcalls_1117',['noSolCalls',['../classBlisHeuristic.html#a1d26701277ec79d1d4fcd01a1482232b',1,'BlisHeuristic']]], + ['notpreferrednewfeasible_1118',['notPreferredNewFeasible',['../classBlisObjectInt.html#a487aad5e6caecd8046aa590226b761cc',1,'BlisObjectInt']]], + ['numconsgenerated_1119',['numConsGenerated',['../classBlisConGenerator.html#a7c06b67214aff04e74faa9efe1a2729b',1,'BlisConGenerator']]], + ['numconsused_1120',['numConsUsed',['../classBlisConGenerator.html#af2f49d178eced4761d0f6da2e480f4b6',1,'BlisConGenerator']]], + ['numcutgenerators_1121',['numCutGenerators',['../classBlisModel.html#a99b6d20fddc576f8708c685b840c608b',1,'BlisModel']]], + ['numheuristics_1122',['numHeuristics',['../classBlisModel.html#ad6425f71c87b851d8d73d1defae0c036',1,'BlisModel']]], + ['numobjects_1123',['numObjects',['../classBlisModel.html#a4403d68e37aedfae2eb49fc54a249304',1,'BlisModel']]], + ['numsolutions_1124',['numSolutions',['../classBlisHeuristic.html#a9c037a4c40c3a1d4fee89ba533944445',1,'BlisHeuristic']]] +]; diff --git a/Doxygen/0.94/search/functions_b.html b/Doxygen/0.94/search/functions_b.html new file mode 100644 index 0000000..345265d --- /dev/null +++ b/Doxygen/0.94/search/functions_b.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_b.js b/Doxygen/0.94/search/functions_b.js new file mode 100644 index 0000000..89f97d4 --- /dev/null +++ b/Doxygen/0.94/search/functions_b.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['objects_1125',['objects',['../classBlisModel.html#a5b7c67b4a83b8490e005453809d198ba',1,'BlisModel::objects()'],['../classBlisModel.html#a9d20819cf518f4c6585a27455b2f782d',1,'BlisModel::objects(int which)']]], + ['oldconstraints_1126',['oldConstraints',['../classBlisModel.html#a389ac9b40cfb03824032b4dd78988e02',1,'BlisModel']]], + ['operator_3d_1127',['operator=',['../classVrpHeurTSP.html#a8125ac56036a38c9b04c7fd67c835eee',1,'VrpHeurTSP::operator=()'],['../classBlisBranchObjectBilevel.html#ae405da9f774bafe2488c7453b16f45ad',1,'BlisBranchObjectBilevel::operator=()'],['../classBlisBranchObjectInt.html#a5a596610a9cb7d343b833e311fbff5af',1,'BlisBranchObjectInt::operator=()'],['../classBlisBranchStrategyBilevel.html#aaeb6db26901907a5118a05867789e37b',1,'BlisBranchStrategyBilevel::operator=()'],['../classBlisBranchStrategyMaxInf.html#a5603ef9f39d1cf42bd6942b7ba9b92ba',1,'BlisBranchStrategyMaxInf::operator=()'],['../classBlisBranchStrategyPseudo.html#a717609a96c5be64dfb50b1dab1c8e3d0',1,'BlisBranchStrategyPseudo::operator=()'],['../classBlisBranchStrategyRel.html#a02cb737107b2093513f79160ff5c673f',1,'BlisBranchStrategyRel::operator=()'],['../classBlisBranchStrategyStrong.html#a3166a01aef69104314cde14d50805344',1,'BlisBranchStrategyStrong::operator=()'],['../classBlisConGenerator.html#a101c5cfdea5848b97689e25481102b4b',1,'BlisConGenerator::operator=()'],['../classBlisHeuristic.html#add55f43a1d55161e8e2ebc1b334e5744',1,'BlisHeuristic::operator=()'],['../classBlisHeurRound.html#a185e86bb15895a1e2ef5c04938a7e36d',1,'BlisHeurRound::operator=()'],['../classBlisObjectInt.html#a1b52e912ee84200a66f150572bf442b5',1,'BlisObjectInt::operator=()'],['../classBlisPseudocost.html#aec072628edaf26ee0f1a7d077686dd5a',1,'BlisPseudocost::operator=()'],['../classBlisTreeNode.html#a3a3f9f62c86c60741e639d3abc6810d9',1,'BlisTreeNode::operator=()']]], + ['originallowerbound_1128',['originalLowerBound',['../classBlisObjectInt.html#a5f6bba445210e61881615027dc020bc6',1,'BlisObjectInt']]], + ['originalupperbound_1129',['originalUpperBound',['../classBlisObjectInt.html#a29a4c1c9d66259dde6b8b205e2288f11',1,'BlisObjectInt']]] +]; diff --git a/Doxygen/0.94/search/functions_c.html b/Doxygen/0.94/search/functions_c.html new file mode 100644 index 0000000..858bfd6 --- /dev/null +++ b/Doxygen/0.94/search/functions_c.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_c.js b/Doxygen/0.94/search/functions_c.js new file mode 100644 index 0000000..a0c3cb3 --- /dev/null +++ b/Doxygen/0.94/search/functions_c.js @@ -0,0 +1,19 @@ +var searchData= +[ + ['pack_1130',['pack',['../classVrpParams.html#a5e4d5b1fe1d410f57e7b26ef4cd0f75e',1,'VrpParams::pack()'],['../classBlisParams.html#ad6e9550506e01e12e45db98678656b88',1,'BlisParams::pack()']]], + ['packsharedconstraints_1131',['packSharedConstraints',['../classBlisModel.html#af0abb5c78c2bc93996879cc4a06e0fe2',1,'BlisModel']]], + ['packsharedknowlege_1132',['packSharedKnowlege',['../classBlisModel.html#a0827e92f88980a86ec5816d2dc4304b6',1,'BlisModel']]], + ['packsharedpseudocost_1133',['packSharedPseudocost',['../classBlisModel.html#a400701760c99b059015c4bbea5fb42f4',1,'BlisModel']]], + ['packsharedvariables_1134',['packSharedVariables',['../classBlisModel.html#aa8722625dbf9490d99a72eda817eb7d1',1,'BlisModel']]], + ['parallel_1135',['parallel',['../classBlisTreeNode.html#a5ed681ea5a1eb232ba4fb5e749ad0065',1,'BlisTreeNode']]], + ['passinpriorities_1136',['passInPriorities',['../classBlisModel.html#a5cde6e7d88bf194bcc8e28a58b692325',1,'BlisModel']]], + ['postprocess_1137',['postprocess',['../classBlisModel.html#ae43419bd44816eba9e1907d4e923a87f',1,'BlisModel::postprocess()'],['../classBlisPresolve.html#a648ef1f102cdf9cce2e65ead504623e7',1,'BlisPresolve::postprocess()']]], + ['preferrednewfeasible_1138',['preferredNewFeasible',['../classBlisObjectInt.html#a8842eb0f45c2616999a99745caa19394',1,'BlisObjectInt']]], + ['preprocess_1139',['preprocess',['../classBlisModel.html#af07c6e06a26f164e5c0a7b3f7ba4866b',1,'BlisModel::preprocess()'],['../classBlisPresolve.html#a1c8eb0d12b70eb54e72f6600ae99516a',1,'BlisPresolve::preprocess()']]], + ['presolveforthewholetree_1140',['presolveForTheWholeTree',['../classBlisModel.html#ab6fe5d5751598a61b45dc36793a443b7',1,'BlisModel']]], + ['print_1141',['print',['../classVrpSolution.html#aaa1cf0b4c434b5a83d66481b88ad5928',1,'VrpSolution::print()'],['../classBlisBranchObjectBilevel.html#aa51c3df8439724633324343fed07a2ed',1,'BlisBranchObjectBilevel::print()'],['../classBlisBranchObjectInt.html#a04b9c9bb415f3527e0c29dbd2f2b8e96',1,'BlisBranchObjectInt::print()'],['../classBlisSolution.html#a4e18302cedfad4ae67c43e529938f507',1,'BlisSolution::print()']]], + ['printdesc_1142',['printDesc',['../classVrpVariable.html#a8041e35ca156638b740d6d4d523c3a6e',1,'VrpVariable']]], + ['priority_1143',['priority',['../classBlisModel.html#a70f17a669d5ee77aeb795a8641276197',1,'BlisModel::priority() const'],['../classBlisModel.html#a8cf8a0f82bf9fbe650500ee0a00e08fe',1,'BlisModel::priority(int sequence) const']]], + ['process_1144',['process',['../classBlisTreeNode.html#a02075c2c6ed1b15cfd2f47f8d5227845',1,'BlisTreeNode::process()'],['../classBlisTreeNode.html#a4fbacf0eefe80be41406f2b1831f5fed',1,'BlisTreeNode::process(bool isRoot=false, bool rampUp=false)']]], + ['pseudocost_1145',['pseudocost',['../classBlisObjectInt.html#a2e7ae7b834cb46919f38454f4b1a4ae8',1,'BlisObjectInt']]] +]; diff --git a/Doxygen/0.94/search/functions_d.html b/Doxygen/0.94/search/functions_d.html new file mode 100644 index 0000000..2f09f51 --- /dev/null +++ b/Doxygen/0.94/search/functions_d.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_d.js b/Doxygen/0.94/search/functions_d.js new file mode 100644 index 0000000..ed6df83 --- /dev/null +++ b/Doxygen/0.94/search/functions_d.js @@ -0,0 +1,12 @@ +var searchData= +[ + ['rampupbranchstrategy_1146',['rampUpBranchStrategy',['../classBlisModel.html#ad757abe619510e73644cca4883902098',1,'BlisModel']]], + ['readinstance_1147',['readInstance',['../classVrpModel.html#aa2758857bb1cd1a22efb59ef0fb86be0',1,'VrpModel::readInstance()'],['../classBlisModel.html#afbbdd6fec7d5527b6fd490f3f14fb0c8',1,'BlisModel::readInstance()']]], + ['readparameters_1148',['readParameters',['../classVrpModel.html#a3b138bc3784e34f2618f68285339388e',1,'VrpModel::readParameters()'],['../classBlisModel.html#a9a13000fefc222e94b9d6cd52e188b48',1,'BlisModel::readParameters()']]], + ['reduce_5fgraph_1149',['reduce_graph',['../classVrpNetwork.html#a3f11fbc6f3c6867750b24b785149d1c4',1,'VrpNetwork']]], + ['reducedcostfix_1150',['reducedCostFix',['../classBlisTreeNode.html#a6c561cad9f54569f55b3785232270da4',1,'BlisTreeNode']]], + ['refreshmodel_1151',['refreshModel',['../classBlisConGenerator.html#ab84a390b52712250f48f2a57004db32c',1,'BlisConGenerator']]], + ['registerknowledge_1152',['registerKnowledge',['../classVrpModel.html#a29a9c520ad865b8b47bdd1179e8c0ce5',1,'VrpModel::registerKnowledge()'],['../classBlisModel.html#a47d8386226bb183019f2de76a3a1c3f3',1,'BlisModel::registerKnowledge()']]], + ['resetbounds_1153',['resetBounds',['../classBlisObjectInt.html#ae09216d6f8f7749c94027156fc2caf17',1,'BlisObjectInt']]], + ['resolve_1154',['resolve',['../classBlisModel.html#ab56b56c9ea8f3a8c52f45bd6e7f1d5e3',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/functions_e.html b/Doxygen/0.94/search/functions_e.html new file mode 100644 index 0000000..ee5afa6 --- /dev/null +++ b/Doxygen/0.94/search/functions_e.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_e.js b/Doxygen/0.94/search/functions_e.js new file mode 100644 index 0000000..08a1689 --- /dev/null +++ b/Doxygen/0.94/search/functions_e.js @@ -0,0 +1,63 @@ +var searchData= +[ + ['searchsolution_1155',['searchSolution',['../classVrpHeurTSP.html#a86b6ee9c5e23279ef51c8d5336dd3209',1,'VrpHeurTSP::searchSolution()'],['../classBlisHeuristic.html#aad991067cc2960e54cf368c8b37f3ad1',1,'BlisHeuristic::searchSolution(double &objectiveValue, double *newSolution)=0'],['../classBlisHeuristic.html#a931100b6e1b0b0b44da2198f97b27840',1,'BlisHeuristic::searchSolution(double &objectiveValue, double *newSolution, OsiCuts &cs)'],['../classBlisHeurRound.html#aeb93dfaf0bbce26d0d1c2cf633dfdc94',1,'BlisHeurRound::searchSolution()']]], + ['selectbranchobject_1156',['selectBranchObject',['../classBlisTreeNode.html#a429feb43d814427630ba8d87070005d9',1,'BlisTreeNode']]], + ['setactivenode_1157',['setActiveNode',['../classBlisModel.html#a3565215d0eb4ce8eb43019a9c08e5bb1',1,'BlisModel']]], + ['setatsolution_1158',['setAtSolution',['../classBlisConGenerator.html#a28e192ecef94c6b2194ff57141a00ad2',1,'BlisConGenerator']]], + ['setbasis_1159',['setBasis',['../classBlisNodeDesc.html#aee69623bb3af860387f0a15d86afb932',1,'BlisNodeDesc']]], + ['setbrancheddir_1160',['setBranchedDir',['../classBlisNodeDesc.html#a52ec29f7cedffe5364b8e4b8c501c378',1,'BlisNodeDesc']]], + ['setbranchedind_1161',['setBranchedInd',['../classBlisNodeDesc.html#a437ffb54e8308ca9049f5a80c605efa7',1,'BlisNodeDesc']]], + ['setbranchedval_1162',['setBranchedVal',['../classBlisNodeDesc.html#aff3c9a177f75e863123507ddc177fd44',1,'BlisNodeDesc']]], + ['setbranchingmethod_1163',['setBranchingMethod',['../classBlisModel.html#ad9fcfbe69e72e81b5eda8e409763c03f',1,'BlisModel::setBranchingMethod(BcpsBranchStrategy *method)'],['../classBlisModel.html#ae759dc7d11c64aaf738e3eb270bd5ed1',1,'BlisModel::setBranchingMethod(BcpsBranchStrategy &method)']]], + ['setbreakeven_1164',['setBreakEven',['../classBlisObjectInt.html#ad5eeadae726cba87e3c4717337bcc840',1,'BlisObjectInt']]], + ['setcolmatrix_1165',['setColMatrix',['../classBlisModel.html#a997edb6021933c6640dc8c3098384371',1,'BlisModel']]], + ['setcoltype_1166',['setColType',['../classBlisModel.html#aa92f15ac2e30d265fa00cdef41188b05',1,'BlisModel']]], + ['setconlb_1167',['setConLb',['../classBlisModel.html#a85c36dbca361b05def118b47b9cb185e',1,'BlisModel']]], + ['setconub_1168',['setConUb',['../classBlisModel.html#aeb6b7c1ba33943584ec23b7af0a89717',1,'BlisModel']]], + ['setcutgenerationfreq_1169',['setCutGenerationFreq',['../classBlisConGenerator.html#a795a1b76bb0c0e30b7e1c5c455b458ad',1,'BlisConGenerator']]], + ['setcutoff_1170',['setCutoff',['../classBlisModel.html#a7f993ddaa21c23e76c68c36738e925c9',1,'BlisModel']]], + ['setcutstrategy_1171',['setCutStrategy',['../classBlisModel.html#a58c919927ae9534f12ca6a27b7be5fd7',1,'BlisModel::setCutStrategy(BlisCutStrategy u)'],['../classBlisModel.html#a6d9359ec5ee235ea66194196f9fb7db3',1,'BlisModel::setCutStrategy(int f)']]], + ['setdata_1172',['setData',['../classBlisConstraint.html#aa3ca0c050967c81d9af697a862ed21cf',1,'BlisConstraint::setData()'],['../classBlisVariable.html#ac217f6ab0321a27c85fe7f4e494a0d62',1,'BlisVariable::setData()']]], + ['setdefaultentries_1173',['setDefaultEntries',['../classVrpParams.html#a78bae785b4f7a336276e58eac16c4ae4',1,'VrpParams::setDefaultEntries()'],['../classBlisParams.html#a0b74d4d0c01299f346e298ad2827e949',1,'BlisParams::setDefaultEntries()']]], + ['setdenseconcutoff_1174',['setDenseConCutoff',['../classBlisModel.html#a11a84366048a8e573ef7ee31605af5bc',1,'BlisModel']]], + ['setentry_1175',['setEntry',['../classVrpParams.html#ab79c0c640ef196f457fdcaa7741be20a',1,'VrpParams::setEntry(const boolParams key, const char *val)'],['../classVrpParams.html#aa99fd48132142afeaef714efe88cf532',1,'VrpParams::setEntry(const boolParams key, const char val)'],['../classVrpParams.html#aebcadbe3ad9d32d257c140c7a97ed5db',1,'VrpParams::setEntry(const boolParams key, const bool val)'],['../classVrpParams.html#aa54a23a016f023f603ced73117ab82f9',1,'VrpParams::setEntry(const intParams key, const char *val)'],['../classVrpParams.html#a13f41126eb97293cb7d19075ad5503cb',1,'VrpParams::setEntry(const intParams key, const int val)'],['../classVrpParams.html#a12fa9fde1ef0161f6029f92a179bc9b3',1,'VrpParams::setEntry(const dblParams key, const char *val)'],['../classVrpParams.html#ab88fd16147040843bf15a4c068a3381f',1,'VrpParams::setEntry(const dblParams key, const double val)'],['../classVrpParams.html#a991a0dd51884ec38678e491a9ff4e2df',1,'VrpParams::setEntry(const strParams key, const char *val)'],['../classVrpParams.html#a92cf0f51302375cc0b8dbd8f2747b9f3',1,'VrpParams::setEntry(const strArrayParams key, const char *val)'],['../classBlisParams.html#a63101fab39d983622ffc42e00c39fe0e',1,'BlisParams::setEntry(const chrParams key, const char *val)'],['../classBlisParams.html#adaa82db282ae0fbdb9cea9cba412bf72',1,'BlisParams::setEntry(const chrParams key, const char val)'],['../classBlisParams.html#a3b5ef5a1307c592ebc14c063786c3c2a',1,'BlisParams::setEntry(const chrParams key, const bool val)'],['../classBlisParams.html#a5a73c36fdd42217ef713d8865ecfacd5',1,'BlisParams::setEntry(const intParams key, const char *val)'],['../classBlisParams.html#a13441b5da9ab32bc77884d89e9ead6e2',1,'BlisParams::setEntry(const intParams key, const int val)'],['../classBlisParams.html#a0639e6970b88d01dc989eac30833a8db',1,'BlisParams::setEntry(const dblParams key, const char *val)'],['../classBlisParams.html#a656e5b68431cf0be47a28b09ffa5bb9c',1,'BlisParams::setEntry(const dblParams key, const double val)'],['../classBlisParams.html#aba681db817941116e8fdbcd9079a76c3',1,'BlisParams::setEntry(const strParams key, const char *val)'],['../classBlisParams.html#a18cb41be462e0fbca332b622c33f8431',1,'BlisParams::setEntry(const strArrayParams key, const char *val)']]], + ['setfeaschecktime_1176',['setFeasCheckTime',['../classBlisModel.html#aae4b0058c70c45df989956a7222fe2fb',1,'BlisModel']]], + ['setheurcallfrequency_1177',['setHeurCallFrequency',['../classBlisHeuristic.html#a40b25fa04df1fd781926c2db38fa0de2',1,'BlisHeuristic']]], + ['setmaxnumcons_1178',['setMaxNumCons',['../classBlisModel.html#a2a838d6224f446ba6238fa4f38d0f60c',1,'BlisModel']]], + ['setmodel_1179',['setModel',['../classVrpCutGenerator.html#a8b5b2668691218a50fee019f84851163',1,'VrpCutGenerator::setModel()'],['../classBlisConGenerator.html#a5a48ba7579df55687a3c8519f0dbf32e',1,'BlisConGenerator::setModel()'],['../classBlisHeuristic.html#a328186d0eed0d4698dd9de2214d9b304',1,'BlisHeuristic::setModel()'],['../classBlisHeurRound.html#a6e3f4aac3a56ed6f4f65da7052cdc42b',1,'BlisHeurRound::setModel()']]], + ['setmodeldata_1180',['setModelData',['../classVrpModel.html#a6dcf606109ed2755533fb48cee8a5f92',1,'VrpModel']]], + ['setname_1181',['setName',['../classBlisConGenerator.html#a24525af8118e28febc48047de3749911',1,'BlisConGenerator']]], + ['setnodeweight_1182',['setNodeWeight',['../classBlisModel.html#a08d6728452492af2d43d057e55fba983',1,'BlisModel']]], + ['setnormal_1183',['setNormal',['../classBlisConGenerator.html#a89e6a452b6eb94b42e5b9a03502126d5',1,'BlisConGenerator']]], + ['setnumbranchresolve_1184',['setNumBranchResolve',['../classBlisModel.html#a2803ddedb519f6388f68b96580ff488b',1,'BlisModel']]], + ['setnumcons_1185',['setNumCons',['../classBlisModel.html#a8e45801ca281f84ca27e98948dee4355',1,'BlisModel']]], + ['setnumelems_1186',['setNumElems',['../classBlisModel.html#ae3727a9bc4210f98fbe2f66ae638b418',1,'BlisModel']]], + ['setnumobjects_1187',['setNumObjects',['../classBlisModel.html#ab3751523fd7d3a18283e40b9007d99fc',1,'BlisModel']]], + ['setnumoldconstraints_1188',['setNumOldConstraints',['../classBlisModel.html#a5559a42700e63d1cbf8135f42a8521e8',1,'BlisModel']]], + ['setnumvars_1189',['setNumVars',['../classBlisModel.html#acd8743d23a5c27184a9e8c6800f93f1c',1,'BlisModel']]], + ['setobjcoef_1190',['setObjCoef',['../classBlisModel.html#a94ece180a41d1a92cfe8da48d23e38d6',1,'BlisModel::setObjCoef()'],['../classBlisVariable.html#ada296a6becd54748bf566866ab2ae318',1,'BlisVariable::setObjCoef()']]], + ['setoldconstraints_1191',['setOldConstraints',['../classBlisModel.html#a719d9926f26191178c6fdf2fcdde3f88',1,'BlisModel']]], + ['setoldconstraintssize_1192',['setOldConstraintsSize',['../classBlisModel.html#a4fdb8fce40ea3034077f0e51ed584372',1,'BlisModel']]], + ['setopt_1193',['setOpt',['../classVrpSolution.html#a728698b050d81a09cb7d0c021dcbdde1',1,'VrpSolution']]], + ['setoriginallowerbound_1194',['setOriginalLowerBound',['../classBlisObjectInt.html#ac02b8b1c946e313e829c5c74a81904f9',1,'BlisObjectInt']]], + ['setoriginalupperbound_1195',['setOriginalUpperBound',['../classBlisObjectInt.html#a0f185ef614d7f91377f026ff2206a145',1,'BlisObjectInt']]], + ['setrelibility_1196',['setRelibility',['../classBlisBranchStrategyPseudo.html#ac57d5c12647876adc9b06cdde464727f',1,'BlisBranchStrategyPseudo::setRelibility()'],['../classBlisBranchStrategyRel.html#af819fb9262f55d941951542be5a6cd22',1,'BlisBranchStrategyRel::setRelibility()']]], + ['setscore_1197',['setScore',['../classBlisPseudocost.html#a116624a2727a16eabe5024029829eb09',1,'BlisPseudocost']]], + ['setseed_1198',['setSeed',['../classBlisHeurRound.html#add990aa1a11c9436da411f553d52dba7',1,'BlisHeurRound']]], + ['setsharedobjectmark_1199',['setSharedObjectMark',['../classBlisModel.html#aa31af3242486797cb89d18570bf70fab',1,'BlisModel']]], + ['setsolestimate_1200',['setSolEstimate',['../classBlisModel.html#a156652850f994af4cb0c419d9f2e886e',1,'BlisModel']]], + ['setsolver_1201',['setSolver',['../classBlisModel.html#a45e5f95913d5dc3130bbf127636ec6b2',1,'BlisModel']]], + ['setstrategy_1202',['setStrategy',['../classBlisConGenerator.html#aea1a9de15919321b684080d25dde185b',1,'BlisConGenerator::setStrategy()'],['../classBlisHeuristic.html#a38a694e2259238a81d6245cedd52bd49',1,'BlisHeuristic::setStrategy()']]], + ['setupself_1203',['setupSelf',['../classBlisModel.html#a203680c43f1b7f936572e3648c8cdcb9',1,'BlisModel']]], + ['setvarlb_1204',['setVarLb',['../classBlisModel.html#afe8f5e6e2ea3da28f66e99335c8da5af',1,'BlisModel']]], + ['setvarub_1205',['setVarUb',['../classBlisModel.html#aa83dff4cab916fb6c4951a52152f8832',1,'BlisModel']]], + ['setweight_1206',['setWeight',['../classBlisPseudocost.html#af817650f68bf243943b65de3260091b3',1,'BlisPseudocost']]], + ['setwheninfeasible_1207',['setWhenInfeasible',['../classBlisConGenerator.html#a0e4b0a2beb2070cb3eaaa0cc1b7c8f73',1,'BlisConGenerator']]], + ['solver_1208',['solver',['../classBlisModel.html#af530e8edf6feb506ecb991e4e0e27656',1,'BlisModel']]], + ['startconlb_1209',['startConLB',['../classBlisModel.html#a23c03537e103e506264be2b6eb6666c8',1,'BlisModel']]], + ['startconub_1210',['startConUB',['../classBlisModel.html#a116d379f73ae836d19bb5ea48c66c0b5',1,'BlisModel']]], + ['startvarlb_1211',['startVarLB',['../classBlisModel.html#a1d90655e7ffb2a41124d1ab3e11a5f41',1,'BlisModel']]], + ['startvarub_1212',['startVarUB',['../classBlisModel.html#adfbcb19620db1d2a61d2753fd26b8107',1,'BlisModel']]], + ['storesolution_1213',['storeSolution',['../classBlisModel.html#a30d430fbcecf522277cdcb41990de07b',1,'BlisModel']]], + ['strategy_1214',['strategy',['../classBlisConGenerator.html#a5d74c1794c5b12369882e2c98807b80d',1,'BlisConGenerator::strategy()'],['../classBlisHeuristic.html#afb69a1929db9439c638a7f64b8ee79e0',1,'BlisHeuristic::strategy()']]] +]; diff --git a/Doxygen/0.94/search/functions_f.html b/Doxygen/0.94/search/functions_f.html new file mode 100644 index 0000000..f17c412 --- /dev/null +++ b/Doxygen/0.94/search/functions_f.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/functions_f.js b/Doxygen/0.94/search/functions_f.js new file mode 100644 index 0000000..6bb5667 --- /dev/null +++ b/Doxygen/0.94/search/functions_f.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['tempconlbpos_1215',['tempConLBPos',['../classBlisModel.html#a9f108e4a2d884de594ce897c61cfdd2c',1,'BlisModel']]], + ['tempconubpos_1216',['tempConUBPos',['../classBlisModel.html#a6726710149ff64eaa884d5f0c3f5d54e',1,'BlisModel']]], + ['tempvarlbpos_1217',['tempVarLBPos',['../classBlisModel.html#a3b21293e37075e3b5b5f9b6bc1b81bda',1,'BlisModel']]], + ['tempvarubpos_1218',['tempVarUBPos',['../classBlisModel.html#a886e4a837fc11648763a673a84fcbc99',1,'BlisModel']]], + ['time_1219',['time',['../classBlisConGenerator.html#af2cfc62c91c06763c6b2449de76177dc',1,'BlisConGenerator::time()'],['../classBlisHeuristic.html#aac390687b9ac40a61603608a93b7ce90',1,'BlisHeuristic::time()']]] +]; diff --git a/Doxygen/0.94/search/mag_sel.png b/Doxygen/0.94/search/mag_sel.png new file mode 100644 index 0000000..39c0ed5 Binary files /dev/null and b/Doxygen/0.94/search/mag_sel.png differ diff --git a/Doxygen/0.94/search/nomatches.html b/Doxygen/0.94/search/nomatches.html new file mode 100644 index 0000000..4377320 --- /dev/null +++ b/Doxygen/0.94/search/nomatches.html @@ -0,0 +1,12 @@ + + + + + + + +
    +
    No Matches
    +
    + + diff --git a/Doxygen/0.94/search/related_0.html b/Doxygen/0.94/search/related_0.html new file mode 100644 index 0000000..bbe15fa --- /dev/null +++ b/Doxygen/0.94/search/related_0.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/related_0.js b/Doxygen/0.94/search/related_0.js new file mode 100644 index 0000000..710625e --- /dev/null +++ b/Doxygen/0.94/search/related_0.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['vrpcutgenerator_1613',['VrpCutGenerator',['../classVrpModel.html#ae227b3961232601fdbb8462c9c92fbc2',1,'VrpModel::VrpCutGenerator()'],['../classVrpNetwork.html#ae227b3961232601fdbb8462c9c92fbc2',1,'VrpNetwork::VrpCutGenerator()']]], + ['vrpmodel_1614',['VrpModel',['../classVrpNetwork.html#aa08ae18b96f04f1ab4be32fa5bf0aa8d',1,'VrpNetwork']]], + ['vrpsolution_1615',['VrpSolution',['../classVrpModel.html#a3061c74c35ecb99a70446dd8fef8c63b',1,'VrpModel::VrpSolution()'],['../classVrpNetwork.html#a3061c74c35ecb99a70446dd8fef8c63b',1,'VrpNetwork::VrpSolution()']]] +]; diff --git a/Doxygen/0.94/search/search.css b/Doxygen/0.94/search/search.css new file mode 100644 index 0000000..3cf9df9 --- /dev/null +++ b/Doxygen/0.94/search/search.css @@ -0,0 +1,271 @@ +/*---------------- Search Box */ + +#FSearchBox { + float: left; +} + +#MSearchBox { + white-space : nowrap; + float: none; + margin-top: 8px; + right: 0px; + width: 170px; + height: 24px; + z-index: 102; +} + +#MSearchBox .left +{ + display:block; + position:absolute; + left:10px; + width:20px; + height:19px; + background:url('search_l.png') no-repeat; + background-position:right; +} + +#MSearchSelect { + display:block; + position:absolute; + width:20px; + height:19px; +} + +.left #MSearchSelect { + left:4px; +} + +.right #MSearchSelect { + right:5px; +} + +#MSearchField { + display:block; + position:absolute; + height:19px; + background:url('search_m.png') repeat-x; + border:none; + width:115px; + margin-left:20px; + padding-left:4px; + color: #909090; + outline: none; + font: 9pt Arial, Verdana, sans-serif; + -webkit-border-radius: 0px; +} + +#FSearchBox #MSearchField { + margin-left:15px; +} + +#MSearchBox .right { + display:block; + position:absolute; + right:10px; + top:8px; + width:20px; + height:19px; + background:url('search_r.png') no-repeat; + background-position:left; +} + +#MSearchClose { + display: none; + position: absolute; + top: 4px; + background : none; + border: none; + margin: 0px 4px 0px 0px; + padding: 0px 0px; + outline: none; +} + +.left #MSearchClose { + left: 6px; +} + +.right #MSearchClose { + right: 2px; +} + +.MSearchBoxActive #MSearchField { + color: #000000; +} + +/*---------------- Search filter selection */ + +#MSearchSelectWindow { + display: none; + position: absolute; + left: 0; top: 0; + border: 1px solid #90A5CE; + background-color: #F9FAFC; + z-index: 10001; + padding-top: 4px; + padding-bottom: 4px; + -moz-border-radius: 4px; + -webkit-border-top-left-radius: 4px; + -webkit-border-top-right-radius: 4px; + -webkit-border-bottom-left-radius: 4px; + -webkit-border-bottom-right-radius: 4px; + -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); +} + +.SelectItem { + font: 8pt Arial, Verdana, sans-serif; + padding-left: 2px; + padding-right: 12px; + border: 0px; +} + +span.SelectionMark { + margin-right: 4px; + font-family: monospace; + outline-style: none; + text-decoration: none; +} + +a.SelectItem { + display: block; + outline-style: none; + color: #000000; + text-decoration: none; + padding-left: 6px; + padding-right: 12px; +} + +a.SelectItem:focus, +a.SelectItem:active { + color: #000000; + outline-style: none; + text-decoration: none; +} + +a.SelectItem:hover { + color: #FFFFFF; + background-color: #3D578C; + outline-style: none; + text-decoration: none; + cursor: pointer; + display: block; +} + +/*---------------- Search results window */ + +iframe#MSearchResults { + width: 60ex; + height: 15em; +} + +#MSearchResultsWindow { + display: none; + position: absolute; + left: 0; top: 0; + border: 1px solid #000; + background-color: #EEF1F7; + z-index:10000; +} + +/* ----------------------------------- */ + + +#SRIndex { + clear:both; + padding-bottom: 15px; +} + +.SREntry { + font-size: 10pt; + padding-left: 1ex; +} + +.SRPage .SREntry { + font-size: 8pt; + padding: 1px 5px; +} + +body.SRPage { + margin: 5px 2px; +} + +.SRChildren { + padding-left: 3ex; padding-bottom: .5em +} + +.SRPage .SRChildren { + display: none; +} + +.SRSymbol { + font-weight: bold; + color: #425E97; + font-family: Arial, Verdana, sans-serif; + text-decoration: none; + outline: none; +} + +a.SRScope { + display: block; + color: #425E97; + font-family: Arial, Verdana, sans-serif; + text-decoration: none; + outline: none; +} + +a.SRSymbol:focus, a.SRSymbol:active, +a.SRScope:focus, a.SRScope:active { + text-decoration: underline; +} + +span.SRScope { + padding-left: 4px; +} + +.SRPage .SRStatus { + padding: 2px 5px; + font-size: 8pt; + font-style: italic; +} + +.SRResult { + display: none; +} + +DIV.searchresults { + margin-left: 10px; + margin-right: 10px; +} + +/*---------------- External search page results */ + +.searchresult { + background-color: #F0F3F8; +} + +.pages b { + color: white; + padding: 5px 5px 3px 5px; + background-image: url("../tab_a.png"); + background-repeat: repeat-x; + text-shadow: 0 1px 1px #000000; +} + +.pages { + line-height: 17px; + margin-left: 4px; + text-decoration: none; +} + +.hl { + font-weight: bold; +} + +#searchresults { + margin-bottom: 20px; +} + +.searchpages { + margin-top: 10px; +} + diff --git a/Doxygen/0.94/search/search.js b/Doxygen/0.94/search/search.js new file mode 100644 index 0000000..a554ab9 --- /dev/null +++ b/Doxygen/0.94/search/search.js @@ -0,0 +1,814 @@ +/* + @licstart The following is the entire license notice for the + JavaScript code in this file. + + Copyright (C) 1997-2017 by Dimitri van Heesch + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License along + with this program; if not, write to the Free Software Foundation, Inc., + 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. + + @licend The above is the entire license notice + for the JavaScript code in this file + */ +function convertToId(search) +{ + var result = ''; + for (i=0;i do a search + { + this.Search(); + } + } + + this.OnSearchSelectKey = function(evt) + { + var e = (evt) ? evt : window.event; // for IE + if (e.keyCode==40 && this.searchIndex0) // Up + { + this.searchIndex--; + this.OnSelectItem(this.searchIndex); + } + else if (e.keyCode==13 || e.keyCode==27) + { + this.OnSelectItem(this.searchIndex); + this.CloseSelectionWindow(); + this.DOMSearchField().focus(); + } + return false; + } + + // --------- Actions + + // Closes the results window. + this.CloseResultsWindow = function() + { + this.DOMPopupSearchResultsWindow().style.display = 'none'; + this.DOMSearchClose().style.display = 'none'; + this.Activate(false); + } + + this.CloseSelectionWindow = function() + { + this.DOMSearchSelectWindow().style.display = 'none'; + } + + // Performs a search. + this.Search = function() + { + this.keyTimeout = 0; + + // strip leading whitespace + var searchValue = this.DOMSearchField().value.replace(/^ +/, ""); + + var code = searchValue.toLowerCase().charCodeAt(0); + var idxChar = searchValue.substr(0, 1).toLowerCase(); + if ( 0xD800 <= code && code <= 0xDBFF && searchValue > 1) // surrogate pair + { + idxChar = searchValue.substr(0, 2); + } + + var resultsPage; + var resultsPageWithSearch; + var hasResultsPage; + + var idx = indexSectionsWithContent[this.searchIndex].indexOf(idxChar); + if (idx!=-1) + { + var hexCode=idx.toString(16); + resultsPage = this.resultsPath + '/' + indexSectionNames[this.searchIndex] + '_' + hexCode + '.html'; + resultsPageWithSearch = resultsPage+'?'+escape(searchValue); + hasResultsPage = true; + } + else // nothing available for this search term + { + resultsPage = this.resultsPath + '/nomatches.html'; + resultsPageWithSearch = resultsPage; + hasResultsPage = false; + } + + window.frames.MSearchResults.location = resultsPageWithSearch; + var domPopupSearchResultsWindow = this.DOMPopupSearchResultsWindow(); + + if (domPopupSearchResultsWindow.style.display!='block') + { + var domSearchBox = this.DOMSearchBox(); + this.DOMSearchClose().style.display = 'inline'; + if (this.insideFrame) + { + var domPopupSearchResults = this.DOMPopupSearchResults(); + domPopupSearchResultsWindow.style.position = 'relative'; + domPopupSearchResultsWindow.style.display = 'block'; + var width = document.body.clientWidth - 8; // the -8 is for IE :-( + domPopupSearchResultsWindow.style.width = width + 'px'; + domPopupSearchResults.style.width = width + 'px'; + } + else + { + var domPopupSearchResults = this.DOMPopupSearchResults(); + var left = getXPos(domSearchBox) + 150; // domSearchBox.offsetWidth; + var top = getYPos(domSearchBox) + 20; // domSearchBox.offsetHeight + 1; + domPopupSearchResultsWindow.style.display = 'block'; + left -= domPopupSearchResults.offsetWidth; + domPopupSearchResultsWindow.style.top = top + 'px'; + domPopupSearchResultsWindow.style.left = left + 'px'; + } + } + + this.lastSearchValue = searchValue; + this.lastResultsPage = resultsPage; + } + + // -------- Activation Functions + + // Activates or deactivates the search panel, resetting things to + // their default values if necessary. + this.Activate = function(isActive) + { + if (isActive || // open it + this.DOMPopupSearchResultsWindow().style.display == 'block' + ) + { + this.DOMSearchBox().className = 'MSearchBoxActive'; + + var searchField = this.DOMSearchField(); + + if (searchField.value == this.searchLabel) // clear "Search" term upon entry + { + searchField.value = ''; + this.searchActive = true; + } + } + else if (!isActive) // directly remove the panel + { + this.DOMSearchBox().className = 'MSearchBoxInactive'; + this.DOMSearchField().value = this.searchLabel; + this.searchActive = false; + this.lastSearchValue = '' + this.lastResultsPage = ''; + } + } +} + +// ----------------------------------------------------------------------- + +// The class that handles everything on the search results page. +function SearchResults(name) +{ + // The number of matches from the last run of . + this.lastMatchCount = 0; + this.lastKey = 0; + this.repeatOn = false; + + // Toggles the visibility of the passed element ID. + this.FindChildElement = function(id) + { + var parentElement = document.getElementById(id); + var element = parentElement.firstChild; + + while (element && element!=parentElement) + { + if (element.nodeName == 'DIV' && element.className == 'SRChildren') + { + return element; + } + + if (element.nodeName == 'DIV' && element.hasChildNodes()) + { + element = element.firstChild; + } + else if (element.nextSibling) + { + element = element.nextSibling; + } + else + { + do + { + element = element.parentNode; + } + while (element && element!=parentElement && !element.nextSibling); + + if (element && element!=parentElement) + { + element = element.nextSibling; + } + } + } + } + + this.Toggle = function(id) + { + var element = this.FindChildElement(id); + if (element) + { + if (element.style.display == 'block') + { + element.style.display = 'none'; + } + else + { + element.style.display = 'block'; + } + } + } + + // Searches for the passed string. If there is no parameter, + // it takes it from the URL query. + // + // Always returns true, since other documents may try to call it + // and that may or may not be possible. + this.Search = function(search) + { + if (!search) // get search word from URL + { + search = window.location.search; + search = search.substring(1); // Remove the leading '?' + search = unescape(search); + } + + search = search.replace(/^ +/, ""); // strip leading spaces + search = search.replace(/ +$/, ""); // strip trailing spaces + search = search.toLowerCase(); + search = convertToId(search); + + var resultRows = document.getElementsByTagName("div"); + var matches = 0; + + var i = 0; + while (i < resultRows.length) + { + var row = resultRows.item(i); + if (row.className == "SRResult") + { + var rowMatchName = row.id.toLowerCase(); + rowMatchName = rowMatchName.replace(/^sr\d*_/, ''); // strip 'sr123_' + + if (search.length<=rowMatchName.length && + rowMatchName.substr(0, search.length)==search) + { + row.style.display = 'block'; + matches++; + } + else + { + row.style.display = 'none'; + } + } + i++; + } + document.getElementById("Searching").style.display='none'; + if (matches == 0) // no results + { + document.getElementById("NoMatches").style.display='block'; + } + else // at least one result + { + document.getElementById("NoMatches").style.display='none'; + } + this.lastMatchCount = matches; + return true; + } + + // return the first item with index index or higher that is visible + this.NavNext = function(index) + { + var focusItem; + while (1) + { + var focusName = 'Item'+index; + focusItem = document.getElementById(focusName); + if (focusItem && focusItem.parentNode.parentNode.style.display=='block') + { + break; + } + else if (!focusItem) // last element + { + break; + } + focusItem=null; + index++; + } + return focusItem; + } + + this.NavPrev = function(index) + { + var focusItem; + while (1) + { + var focusName = 'Item'+index; + focusItem = document.getElementById(focusName); + if (focusItem && focusItem.parentNode.parentNode.style.display=='block') + { + break; + } + else if (!focusItem) // last element + { + break; + } + focusItem=null; + index--; + } + return focusItem; + } + + this.ProcessKeys = function(e) + { + if (e.type == "keydown") + { + this.repeatOn = false; + this.lastKey = e.keyCode; + } + else if (e.type == "keypress") + { + if (!this.repeatOn) + { + if (this.lastKey) this.repeatOn = true; + return false; // ignore first keypress after keydown + } + } + else if (e.type == "keyup") + { + this.lastKey = 0; + this.repeatOn = false; + } + return this.lastKey!=0; + } + + this.Nav = function(evt,itemIndex) + { + var e = (evt) ? evt : window.event; // for IE + if (e.keyCode==13) return true; + if (!this.ProcessKeys(e)) return false; + + if (this.lastKey==38) // Up + { + var newIndex = itemIndex-1; + var focusItem = this.NavPrev(newIndex); + if (focusItem) + { + var child = this.FindChildElement(focusItem.parentNode.parentNode.id); + if (child && child.style.display == 'block') // children visible + { + var n=0; + var tmpElem; + while (1) // search for last child + { + tmpElem = document.getElementById('Item'+newIndex+'_c'+n); + if (tmpElem) + { + focusItem = tmpElem; + } + else // found it! + { + break; + } + n++; + } + } + } + if (focusItem) + { + focusItem.focus(); + } + else // return focus to search field + { + parent.document.getElementById("MSearchField").focus(); + } + } + else if (this.lastKey==40) // Down + { + var newIndex = itemIndex+1; + var focusItem; + var item = document.getElementById('Item'+itemIndex); + var elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem && elem.style.display == 'block') // children visible + { + focusItem = document.getElementById('Item'+itemIndex+'_c0'); + } + if (!focusItem) focusItem = this.NavNext(newIndex); + if (focusItem) focusItem.focus(); + } + else if (this.lastKey==39) // Right + { + var item = document.getElementById('Item'+itemIndex); + var elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem) elem.style.display = 'block'; + } + else if (this.lastKey==37) // Left + { + var item = document.getElementById('Item'+itemIndex); + var elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem) elem.style.display = 'none'; + } + else if (this.lastKey==27) // Escape + { + parent.searchBox.CloseResultsWindow(); + parent.document.getElementById("MSearchField").focus(); + } + else if (this.lastKey==13) // Enter + { + return true; + } + return false; + } + + this.NavChild = function(evt,itemIndex,childIndex) + { + var e = (evt) ? evt : window.event; // for IE + if (e.keyCode==13) return true; + if (!this.ProcessKeys(e)) return false; + + if (this.lastKey==38) // Up + { + if (childIndex>0) + { + var newIndex = childIndex-1; + document.getElementById('Item'+itemIndex+'_c'+newIndex).focus(); + } + else // already at first child, jump to parent + { + document.getElementById('Item'+itemIndex).focus(); + } + } + else if (this.lastKey==40) // Down + { + var newIndex = childIndex+1; + var elem = document.getElementById('Item'+itemIndex+'_c'+newIndex); + if (!elem) // last child, jump to parent next parent + { + elem = this.NavNext(itemIndex+1); + } + if (elem) + { + elem.focus(); + } + } + else if (this.lastKey==27) // Escape + { + parent.searchBox.CloseResultsWindow(); + parent.document.getElementById("MSearchField").focus(); + } + else if (this.lastKey==13) // Enter + { + return true; + } + return false; + } +} + +function setKeyActions(elem,action) +{ + elem.setAttribute('onkeydown',action); + elem.setAttribute('onkeypress',action); + elem.setAttribute('onkeyup',action); +} + +function setClassAttr(elem,attr) +{ + elem.setAttribute('class',attr); + elem.setAttribute('className',attr); +} + +function createResults() +{ + var results = document.getElementById("SRResults"); + for (var e=0; e + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/typedefs_0.js b/Doxygen/0.94/search/typedefs_0.js new file mode 100644 index 0000000..ad32c25 --- /dev/null +++ b/Doxygen/0.94/search/typedefs_0.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['_5fnode_1468',['_node',['../VrpCommonTypes_8h.html#a8d7378456dff30f651f0c7453623e90f',1,'VrpCommonTypes.h']]] +]; diff --git a/Doxygen/0.94/search/typedefs_1.html b/Doxygen/0.94/search/typedefs_1.html new file mode 100644 index 0000000..9b8bf72 --- /dev/null +++ b/Doxygen/0.94/search/typedefs_1.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/typedefs_1.js b/Doxygen/0.94/search/typedefs_1.js new file mode 100644 index 0000000..f18fd97 --- /dev/null +++ b/Doxygen/0.94/search/typedefs_1.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['best_5ftours_1469',['best_tours',['../VrpCommonTypes_8h.html#ad7f47a7cff701a1f1dd9835149b4891a',1,'VrpCommonTypes.h']]] +]; diff --git a/Doxygen/0.94/search/typedefs_2.html b/Doxygen/0.94/search/typedefs_2.html new file mode 100644 index 0000000..d18982f --- /dev/null +++ b/Doxygen/0.94/search/typedefs_2.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/typedefs_2.js b/Doxygen/0.94/search/typedefs_2.js new file mode 100644 index 0000000..837cd2f --- /dev/null +++ b/Doxygen/0.94/search/typedefs_2.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['edge_1470',['edge',['../VrpNetwork_8h.html#aa7318ad4bf57dc8a6975ba747c2b3082',1,'VrpNetwork.h']]], + ['edge_5fdata_1471',['edge_data',['../VrpCommonTypes_8h.html#a6e47de6b8c9af95be6aaaf64a6bd632f',1,'VrpCommonTypes.h']]], + ['elist_1472',['elist',['../VrpNetwork_8h.html#ad44645af1ee482355dff890ea0f80aa9',1,'VrpNetwork.h']]] +]; diff --git a/Doxygen/0.94/search/typedefs_3.html b/Doxygen/0.94/search/typedefs_3.html new file mode 100644 index 0000000..8941740 --- /dev/null +++ b/Doxygen/0.94/search/typedefs_3.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/typedefs_3.js b/Doxygen/0.94/search/typedefs_3.js new file mode 100644 index 0000000..f65246d --- /dev/null +++ b/Doxygen/0.94/search/typedefs_3.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['route_5fdata_1473',['route_data',['../VrpCommonTypes_8h.html#af857749e2f6df34ecf513e968136a739',1,'VrpCommonTypes.h']]] +]; diff --git a/Doxygen/0.94/search/typedefs_4.html b/Doxygen/0.94/search/typedefs_4.html new file mode 100644 index 0000000..933bd3b --- /dev/null +++ b/Doxygen/0.94/search/typedefs_4.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/typedefs_4.js b/Doxygen/0.94/search/typedefs_4.js new file mode 100644 index 0000000..79d8a4b --- /dev/null +++ b/Doxygen/0.94/search/typedefs_4.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['small_5fgraph_1474',['small_graph',['../VrpCommonTypes_8h.html#ace055152032f06b0e61c15459fa56d24',1,'VrpCommonTypes.h']]] +]; diff --git a/Doxygen/0.94/search/typedefs_5.html b/Doxygen/0.94/search/typedefs_5.html new file mode 100644 index 0000000..7712e6f --- /dev/null +++ b/Doxygen/0.94/search/typedefs_5.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/typedefs_5.js b/Doxygen/0.94/search/typedefs_5.js new file mode 100644 index 0000000..4c3b10a --- /dev/null +++ b/Doxygen/0.94/search/typedefs_5.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['vertex_1475',['vertex',['../VrpNetwork_8h.html#a7229316a0bc1f3dcd0bd839e9433d4b9',1,'VrpNetwork.h']]] +]; diff --git a/Doxygen/0.94/search/variables_0.html b/Doxygen/0.94/search/variables_0.html new file mode 100644 index 0000000..bf3eba5 --- /dev/null +++ b/Doxygen/0.94/search/variables_0.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_0.js b/Doxygen/0.94/search/variables_0.js new file mode 100644 index 0000000..3a09f71 --- /dev/null +++ b/Doxygen/0.94/search/variables_0.js @@ -0,0 +1,9 @@ +var searchData= +[ + ['activenode_5f_1263',['activeNode_',['../classBlisModel.html#ade2ba7da0c681234b67a6499c1c3e0fc',1,'BlisModel']]], + ['adjlist_5f_1264',['adjList_',['../classVrpHeurTSP.html#a9d161f05588fc965ea2fdff649794f4c',1,'VrpHeurTSP::adjList_()'],['../classVrpNetwork.html#a8be247b3d20943ea379523088f3a4a98',1,'VrpNetwork::adjList_()']]], + ['algorithm_1265',['algorithm',['../structBEST__TOURS.html#a00d08dc9db7f2e3299e74d0d70b3a5ab',1,'BEST_TOURS']]], + ['allocated_5fedgenum_1266',['allocated_edgenum',['../structSMALL__GRAPH.html#a695d3da55d071f69d7b041a449e3e241',1,'SMALL_GRAPH']]], + ['atsolution_5f_1267',['atSolution_',['../classBlisConGenerator.html#a67bd218c7290aca555d0b2c4634b1a39',1,'BlisConGenerator']]], + ['aveiterations_5f_1268',['aveIterations_',['../classBlisModel.html#ad5705638120dc7c9083d97bda2fd67d3',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/variables_1.html b/Doxygen/0.94/search/variables_1.html new file mode 100644 index 0000000..49fe59a --- /dev/null +++ b/Doxygen/0.94/search/variables_1.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_1.js b/Doxygen/0.94/search/variables_1.js new file mode 100644 index 0000000..29582bc --- /dev/null +++ b/Doxygen/0.94/search/variables_1.js @@ -0,0 +1,15 @@ +var searchData= +[ + ['basis_5f_1269',['basis_',['../classBlisNodeDesc.html#a0731e512cd008931dcf58a16c2213b62',1,'BlisNodeDesc']]], + ['blismessagehandler_5f_1270',['blisMessageHandler_',['../classBlisModel.html#a2c222ab12dce0ab86d7c7e3e0e67eba7',1,'BlisModel']]], + ['blismessages_5f_1271',['blisMessages_',['../classBlisModel.html#a7c38d7795993ae2b30f84abec3717db3',1,'BlisModel']]], + ['blispar_5f_1272',['BlisPar_',['../classBlisModel.html#a8db7d533e942d54bc354147aac25ebd5',1,'BlisModel']]], + ['bobject_1273',['bObject',['../structBlisStrong.html#a4388efe213c37cda5489fe5a72f3f455',1,'BlisStrong']]], + ['boundingpass_5f_1274',['boundingPass_',['../classBlisModel.html#a38161698f3a048f7d9c0432176584685',1,'BlisModel']]], + ['brancheddir_5f_1275',['branchedDir_',['../classBlisNodeDesc.html#ad7359675ad2b12c28332d22d441caf53',1,'BlisNodeDesc']]], + ['branchedind_5f_1276',['branchedInd_',['../classBlisNodeDesc.html#a9cd75ed8745ef6efb0726b4ac984c96f',1,'BlisNodeDesc']]], + ['branchedval_5f_1277',['branchedVal_',['../classBlisNodeDesc.html#ab6ff99fc0449d17a14918edb28e4be41',1,'BlisNodeDesc']]], + ['branchingset_5f_1278',['branchingSet_',['../classBlisBranchObjectBilevel.html#ad44354bcb1e5cba56da4f964a1825f35',1,'BlisBranchObjectBilevel']]], + ['branchstrategy_5f_1279',['branchStrategy_',['../classBlisModel.html#a9655b257da44af62280a8079527fa64f',1,'BlisModel']]], + ['breakeven_5f_1280',['breakEven_',['../classBlisObjectInt.html#a6450fe693f2973d3f779eeecd0e9265f',1,'BlisObjectInt']]] +]; diff --git a/Doxygen/0.94/search/variables_10.html b/Doxygen/0.94/search/variables_10.html new file mode 100644 index 0000000..92982ac --- /dev/null +++ b/Doxygen/0.94/search/variables_10.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_10.js b/Doxygen/0.94/search/variables_10.js new file mode 100644 index 0000000..9f9c367 --- /dev/null +++ b/Doxygen/0.94/search/variables_10.js @@ -0,0 +1,11 @@ +var searchData= +[ + ['tempconlbpos_5f_1442',['tempConLBPos_',['../classBlisModel.html#a0049233c3e1c47873b653e1e108eda9a',1,'BlisModel']]], + ['tempconubpos_5f_1443',['tempConUBPos_',['../classBlisModel.html#a68d71683e0ec33c1b3c07e389c0a7a9e',1,'BlisModel']]], + ['tempvarlbpos_5f_1444',['tempVarLBPos_',['../classBlisModel.html#a4d62967129662d0c7701cabed9cc9172',1,'BlisModel']]], + ['tempvarubpos_5f_1445',['tempVarUBPos_',['../classBlisModel.html#a6b2c1f28c2f354b3d5159fd2020598f8',1,'BlisModel']]], + ['time_5f_1446',['time_',['../classBlisConGenerator.html#a7fbe9338611af3a37ba936800dfc7fc2',1,'BlisConGenerator::time_()'],['../classBlisHeuristic.html#a3499608c5868833574737149042e6eb2',1,'BlisHeuristic::time_()']]], + ['tour_1447',['tour',['../structBEST__TOURS.html#af24de94fb555e7ffdd664c20918735d3',1,'BEST_TOURS']]], + ['tour_5f_1448',['tour_',['../classVrpHeurTSP.html#ac159dcd8ddc392e876a536b65b2e3621',1,'VrpHeurTSP']]], + ['tree_5fedge_1449',['tree_edge',['../structEDGE.html#a3cb28e96f9ee3017338b25d003ea89ec',1,'EDGE']]] +]; diff --git a/Doxygen/0.94/search/variables_11.html b/Doxygen/0.94/search/variables_11.html new file mode 100644 index 0000000..94f1a8c --- /dev/null +++ b/Doxygen/0.94/search/variables_11.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_11.js b/Doxygen/0.94/search/variables_11.js new file mode 100644 index 0000000..60e7773 --- /dev/null +++ b/Doxygen/0.94/search/variables_11.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['uind_5f_1450',['uind_',['../classVrpVariable.html#a6e554fc2afdd581a529e012cdc55f9e4',1,'VrpVariable']]], + ['up_5f_1451',['up_',['../classBlisBranchObjectInt.html#aacf59cf0399ce95c1d3e1587d283d96f',1,'BlisBranchObjectInt']]], + ['upcost_5f_1452',['upCost_',['../classBlisPseudocost.html#aa80dca73a4ab867d5313b552efaa1e3e',1,'BlisPseudocost']]], + ['upcount_5f_1453',['upCount_',['../classBlisPseudocost.html#af54ea6a1cefded36fd510cb96e518ffd',1,'BlisPseudocost']]] +]; diff --git a/Doxygen/0.94/search/variables_12.html b/Doxygen/0.94/search/variables_12.html new file mode 100644 index 0000000..61c013a --- /dev/null +++ b/Doxygen/0.94/search/variables_12.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_12.js b/Doxygen/0.94/search/variables_12.js new file mode 100644 index 0000000..f39b84a --- /dev/null +++ b/Doxygen/0.94/search/variables_12.js @@ -0,0 +1,13 @@ +var searchData= +[ + ['v0_1454',['v0',['../structEDGE__DATA.html#a20c0970716761104d6bd6e698005e41c',1,'EDGE_DATA::v0()'],['../structEDGE.html#abfdee23eba1abdf6103babc1ca426a80',1,'EDGE::v0()']]], + ['v1_1455',['v1',['../structEDGE__DATA.html#abe4a7d05006c85318537e62666563211',1,'EDGE_DATA::v1()'],['../structEDGE.html#ac9030f1ea3c44b8cebb192c0c10ea955',1,'EDGE::v1()']]], + ['values_5f_1456',['values_',['../classBlisConstraint.html#abcfeac67b724d248ddb88e47acaa81f4',1,'BlisConstraint::values_()'],['../classBlisVariable.html#aca8d4234ecd53a5a44adca68b4ed8d52',1,'BlisVariable::values_()']]], + ['varlb_5f_1457',['varLB_',['../classBlisModel.html#aee002f4447d372004d8e60c7f037ab69',1,'BlisModel']]], + ['varub_5f_1458',['varUB_',['../classBlisModel.html#ad85baace4d574edce40a830f31708e82',1,'BlisModel']]], + ['vertnum_1459',['vertnum',['../structSMALL__GRAPH.html#a7eabb05ab72c4506e2cf354b3ac7b434',1,'SMALL_GRAPH']]], + ['vertnum_5f_1460',['vertnum_',['../classVrpModel.html#af84b4e633ed77adc9700c78e5d9eb118',1,'VrpModel::vertnum_()'],['../classVrpNetwork.html#ac15f7ad5829c3107466e6b18f00b8e23',1,'VrpNetwork::vertnum_()']]], + ['verts_5f_1461',['verts_',['../classVrpNetwork.html#a408b689857077f6053e1d7b4803632d2',1,'VrpNetwork']]], + ['visited_5f_1462',['visited_',['../classVrpHeurTSP.html#afbe512fdb880330bf6ecf5bf6f10e9dd',1,'VrpHeurTSP']]], + ['vrppar_5f_1463',['VrpPar_',['../classVrpModel.html#abf21aaba2906d9c2b1d6c00fa281334d',1,'VrpModel']]] +]; diff --git a/Doxygen/0.94/search/variables_13.html b/Doxygen/0.94/search/variables_13.html new file mode 100644 index 0000000..87b7ca6 --- /dev/null +++ b/Doxygen/0.94/search/variables_13.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_13.js b/Doxygen/0.94/search/variables_13.js new file mode 100644 index 0000000..5ff9d92 --- /dev/null +++ b/Doxygen/0.94/search/variables_13.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['weight_1464',['weight',['../structROUTE__DATA.html#a3cdfb46485922ddc1161bb35865b944a',1,'ROUTE_DATA::weight()'],['../structEDGE.html#a11432fab8fcdb74beef9b5711c6037b4',1,'EDGE::weight()']]], + ['weight_5f_1465',['weight_',['../classBlisPseudocost.html#adc727ace5c0e8c53b34fd258c46a0bb7',1,'BlisPseudocost']]], + ['wheninfeasible_5f_1466',['whenInfeasible_',['../classBlisConGenerator.html#a07fc99d8a9c02f9a7c2f2ed895abfcbb',1,'BlisConGenerator']]], + ['wtype_5f_1467',['wtype_',['../classVrpModel.html#a02a582ac4a77e441ac85c21c5397460e',1,'VrpModel']]] +]; diff --git a/Doxygen/0.94/search/variables_2.html b/Doxygen/0.94/search/variables_2.html new file mode 100644 index 0000000..0c8a18c --- /dev/null +++ b/Doxygen/0.94/search/variables_2.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_2.js b/Doxygen/0.94/search/variables_2.js new file mode 100644 index 0000000..ffe03a1 --- /dev/null +++ b/Doxygen/0.94/search/variables_2.js @@ -0,0 +1,32 @@ +var searchData= +[ + ['calls_5f_1281',['calls_',['../classBlisConGenerator.html#a4bc08f4aa36d6a7e57a451597cbc2c6a',1,'BlisConGenerator::calls_()'],['../classBlisHeuristic.html#af86e7190f22a8e71415474a73e0b58a9',1,'BlisHeuristic::calls_()']]], + ['capacity_5f_1282',['capacity_',['../classVrpModel.html#ac9e75d0aebf98e922e2c667b9f15e9ba',1,'VrpModel']]], + ['coef_5flist_1283',['coef_list',['../classVrpCutGenerator.html#a19bfe8e685a5983fd0c6d95ed2e6a3de',1,'VrpCutGenerator']]], + ['colmatrix_5f_1284',['colMatrix_',['../classBlisModel.html#a4d484f2ff1f20ee1d8fd93bf2ea95b2a',1,'BlisModel']]], + ['coltype_5f_1285',['colType_',['../classBlisModel.html#ae2e579a6fcabbb3f34cc5eb02512f709',1,'BlisModel']]], + ['columnindex_5f_1286',['columnIndex_',['../classBlisObjectInt.html#af52c5dff0680028232e04921a26e0524',1,'BlisObjectInt']]], + ['comp_1287',['comp',['../structVERTEX.html#a350acd472ed647c46f508a85854ca748',1,'VERTEX']]], + ['compcuts_5f_1288',['compCuts_',['../classVrpNetwork.html#a6cf405d9121977a6327076fd3d2525a3',1,'VrpNetwork']]], + ['compdemands_5f_1289',['compDemands_',['../classVrpNetwork.html#a8d49ffff83cbde8652811f03981a0a59',1,'VrpNetwork']]], + ['compmembers_5f_1290',['compMembers_',['../classVrpNetwork.html#ac5d4a77b99add20ab18cc95f924f4ab6',1,'VrpNetwork']]], + ['compnodes_5f_1291',['compNodes_',['../classVrpNetwork.html#a7f1b186a8e401bc93dd1a0751950cb04',1,'VrpNetwork']]], + ['conlb_5f_1292',['conLB_',['../classBlisModel.html#a83af2a8261c9053991924efb91bb8fa1',1,'BlisModel']]], + ['conrandoms_5f_1293',['conRandoms_',['../classBlisModel.html#a56328a9081738fda77dc2fd597d85f0e',1,'BlisModel']]], + ['constraintpool_5f_1294',['constraintPool_',['../classBlisModel.html#afeccd0210e20452f8b6ae2d17372bcff',1,'BlisModel']]], + ['constraintpoolreceive_5f_1295',['constraintPoolReceive_',['../classBlisModel.html#a93165526f79f2ae1b34a4c5fa7a5c7e7',1,'BlisModel']]], + ['constraintpoolsend_5f_1296',['constraintPoolSend_',['../classBlisModel.html#acdb0fc5b594f398b8d9f43f4c84ace92',1,'BlisModel']]], + ['conub_5f_1297',['conUB_',['../classBlisModel.html#ae3b4e24670d5481a949dbef2095d0c26',1,'BlisModel']]], + ['coordx_5f_1298',['coordx_',['../classVrpModel.html#ae58a817d94bf639964ea4ed61dbc5088',1,'VrpModel']]], + ['coordy_5f_1299',['coordy_',['../classVrpModel.html#af046272edb6dac5a021391888e0a3571',1,'VrpModel']]], + ['coordz_5f_1300',['coordz_',['../classVrpModel.html#a7eb762d403974ef00f89c35c72ca2ecf',1,'VrpModel']]], + ['cost_1301',['cost',['../structROUTE__DATA.html#af7f58b48e8dc9e68b145da298ca7ff1f',1,'ROUTE_DATA::cost()'],['../structBEST__TOURS.html#a97916f3e3aaeab3968da2b1c5c6f6c6b',1,'BEST_TOURS::cost()'],['../structEDGE__DATA.html#acfa3bfcdb4e477b8e3392ec41eaf2463',1,'EDGE_DATA::cost()'],['../structEDGE.html#a14b73ce303514fbb2aab2141f7bfadfa',1,'EDGE::cost()']]], + ['currabsgap_5f_1302',['currAbsGap_',['../classBlisModel.html#a9b657906913b688b3658aac3e2f15c49',1,'BlisModel']]], + ['currrelgap_5f_1303',['currRelGap_',['../classBlisModel.html#a9494ad50b310de5b8d6831672b7c84c7',1,'BlisModel']]], + ['cutgenerationfrequency_5f_1304',['cutGenerationFrequency_',['../classBlisConGenerator.html#ad3601b437e212de0ffba3e0345f6edc9',1,'BlisConGenerator::cutGenerationFrequency_()'],['../classBlisModel.html#a10a3441c898d1712aa5c1f06c6815262',1,'BlisModel::cutGenerationFrequency_()']]], + ['cutlist_5f_1305',['cutList_',['../classVrpCutGenerator.html#af5ea47cc7e91943480a63ea8d36bd965',1,'VrpCutGenerator']]], + ['cutoff_5f_1306',['cutoff_',['../classBlisModel.html#a7466cb4d6fafc464f762e59eb7e18ce6',1,'BlisModel']]], + ['cutoffinc_5f_1307',['cutoffInc_',['../classBlisModel.html#ae30764dc0fe1adcd4fc167c69d7c1879',1,'BlisModel']]], + ['cutstrategy_5f_1308',['cutStrategy_',['../classBlisModel.html#a28da2231361be50f5547ec96ca22b64a',1,'BlisModel']]], + ['cutval_5f_1309',['cutVal_',['../classVrpCutGenerator.html#a1bfe959afd9b715aed22685b04728ff4',1,'VrpCutGenerator']]] +]; diff --git a/Doxygen/0.94/search/variables_3.html b/Doxygen/0.94/search/variables_3.html new file mode 100644 index 0000000..19a31fc --- /dev/null +++ b/Doxygen/0.94/search/variables_3.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_3.js b/Doxygen/0.94/search/variables_3.js new file mode 100644 index 0000000..e9086f1 --- /dev/null +++ b/Doxygen/0.94/search/variables_3.js @@ -0,0 +1,15 @@ +var searchData= +[ + ['data_1310',['data',['../structELIST.html#a5c001c5da03be92145ff8c0667d5b662',1,'ELIST']]], + ['degree_1311',['degree',['../structVERTEX.html#a9398df0d3e010f46e0139f55afb9d35e',1,'VERTEX']]], + ['del_5fedgenum_1312',['del_edgenum',['../structSMALL__GRAPH.html#a9067213cf0c90800984adad2ad70f8e4',1,'SMALL_GRAPH']]], + ['deleted_1313',['deleted',['../structEDGE.html#ade771f19c4612b9037a2a135ec880447',1,'EDGE::deleted()'],['../structVERTEX.html#a3f786cd698a056f3191822b8a8f1eeaa',1,'VERTEX::deleted()']]], + ['demand_1314',['demand',['../structVERTEX.html#aacfeb5f6ffc4832aeb0d4ce329ebe1d8',1,'VERTEX']]], + ['demand_5f_1315',['demand_',['../classVrpModel.html#a4c3e624760c633993f83978c128484af',1,'VrpModel']]], + ['denseconcutoff_5f_1316',['denseConCutoff_',['../classBlisModel.html#a447fcedf0c893166b43a92d32f473b59',1,'BlisModel']]], + ['depot_5f_1317',['depot_',['../classVrpModel.html#afc29f794b221bf61c18ee1d30941dcfb',1,'VrpModel']]], + ['dfnumber_1318',['dfnumber',['../structVERTEX.html#a8390cefd5ac74126e371fe4338e1a80d',1,'VERTEX']]], + ['down_5f_1319',['down_',['../classBlisBranchObjectInt.html#ad9dfe5ab6ae2b6c37dca61010b53a622',1,'BlisBranchObjectInt']]], + ['downcost_5f_1320',['downCost_',['../classBlisPseudocost.html#a96efd371c9c626c8d88446de86566eb1',1,'BlisPseudocost']]], + ['downcount_5f_1321',['downCount_',['../classBlisPseudocost.html#a8dd92e42b645fa540ee9b24b1dd06797',1,'BlisPseudocost']]] +]; diff --git a/Doxygen/0.94/search/variables_4.html b/Doxygen/0.94/search/variables_4.html new file mode 100644 index 0000000..bdc37be --- /dev/null +++ b/Doxygen/0.94/search/variables_4.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_4.js b/Doxygen/0.94/search/variables_4.js new file mode 100644 index 0000000..0269e29 --- /dev/null +++ b/Doxygen/0.94/search/variables_4.js @@ -0,0 +1,11 @@ +var searchData= +[ + ['edgecolmatch_5f_1322',['edgeColMatch_',['../classVrpHeurTSP.html#a2f122a3a0e59d35adb2ef8b007beddcb',1,'VrpHeurTSP']]], + ['edgenum_1323',['edgenum',['../structSMALL__GRAPH.html#ae4ff16180eee38306abbaf00ece309c6',1,'SMALL_GRAPH']]], + ['edgenum_5f_1324',['edgenum_',['../classVrpModel.html#a42c0678d07f257009402ab57f1f1af4d',1,'VrpModel::edgenum_()'],['../classVrpNetwork.html#a7be4ad3f923f6627c6e74afc4e95d141',1,'VrpNetwork::edgenum_()']]], + ['edges_1325',['edges',['../structSMALL__GRAPH.html#af757402b0c84740cc812d62ce90dfa63',1,'SMALL_GRAPH']]], + ['edges_5f_1326',['edges_',['../classVrpModel.html#a288805532e2dc9d4c31297768c8c5e1f',1,'VrpModel::edges_()'],['../classVrpNetwork.html#a7fc48b1db05672e69fb43b9347e7e0ef',1,'VrpNetwork::edges_()']]], + ['ends_5f_1327',['ends_',['../classVrpVariable.html#a587b44219cacec920bbef9b588993284',1,'VrpVariable']]], + ['enodenum_1328',['enodenum',['../structVERTEX.html#a34e35fa4a0bf442cf88d1a845a3e19a5',1,'VERTEX']]], + ['etol_5f_1329',['etol_',['../classVrpModel.html#a824cbee748d6e77838a252319e0c490c',1,'VrpModel']]] +]; diff --git a/Doxygen/0.94/search/variables_5.html b/Doxygen/0.94/search/variables_5.html new file mode 100644 index 0000000..6aa2249 --- /dev/null +++ b/Doxygen/0.94/search/variables_5.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_5.js b/Doxygen/0.94/search/variables_5.js new file mode 100644 index 0000000..d04144d --- /dev/null +++ b/Doxygen/0.94/search/variables_5.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['feaschecktime_5f_1330',['feasCheckTime_',['../classBlisModel.html#a4dd498d8022a2276b4cd90cfa4f9ff2c',1,'BlisModel']]], + ['finisheddown_1331',['finishedDown',['../structBlisStrong.html#a49f917e74d9fa49b458243b3d8288285',1,'BlisStrong']]], + ['finishedup_1332',['finishedUp',['../structBlisStrong.html#a6fa69cf2a838abc9c75802f2ec7ff1db',1,'BlisStrong']]], + ['first_1333',['first',['../structROUTE__DATA.html#abcf4195370754b4fd4e61d31af716e9c',1,'ROUTE_DATA::first()'],['../structVERTEX.html#adfbfdf5c32690a942a5866365784d064',1,'VERTEX::first()']]] +]; diff --git a/Doxygen/0.94/search/variables_6.html b/Doxygen/0.94/search/variables_6.html new file mode 100644 index 0000000..ce4a906 --- /dev/null +++ b/Doxygen/0.94/search/variables_6.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_6.js b/Doxygen/0.94/search/variables_6.js new file mode 100644 index 0000000..87c6981 --- /dev/null +++ b/Doxygen/0.94/search/variables_6.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['generator_5f_1334',['generator_',['../classBlisConGenerator.html#aaad1548651e42b145b96703e66338cae',1,'BlisConGenerator']]], + ['generators_5f_1335',['generators_',['../classBlisModel.html#aa92fc0eb1191680fb61f1c2ebf0bb784',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/variables_7.html b/Doxygen/0.94/search/variables_7.html new file mode 100644 index 0000000..39ffd47 --- /dev/null +++ b/Doxygen/0.94/search/variables_7.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_7.js b/Doxygen/0.94/search/variables_7.js new file mode 100644 index 0000000..ebdbd81 --- /dev/null +++ b/Doxygen/0.94/search/variables_7.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['heurcallfrequency_5f_1336',['heurCallFrequency_',['../classBlisHeuristic.html#a933b73f8169ed5b7059ff84385ffc5c6',1,'BlisHeuristic::heurCallFrequency_()'],['../classBlisModel.html#afa00d6fcc0cc2c84c5d28914a3b95404',1,'BlisModel::heurCallFrequency_()']]], + ['heuristics_5f_1337',['heuristics_',['../classBlisModel.html#a52f68e9c77897a875b81d711f18e0ad4',1,'BlisModel']]], + ['heurstrategy_5f_1338',['heurStrategy_',['../classBlisModel.html#aedb9bfd188c6d25e2d4c16afdcce3496',1,'BlisModel']]], + ['hotstartstrategy_5f_1339',['hotstartStrategy_',['../classBlisModel.html#a4a146916da83dcb06710ba3771b6610d',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/variables_8.html b/Doxygen/0.94/search/variables_8.html new file mode 100644 index 0000000..37a2edd --- /dev/null +++ b/Doxygen/0.94/search/variables_8.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_8.js b/Doxygen/0.94/search/variables_8.js new file mode 100644 index 0000000..5ec70db --- /dev/null +++ b/Doxygen/0.94/search/variables_8.js @@ -0,0 +1,15 @@ +var searchData= +[ + ['incobjvalue_5f_1340',['incObjValue_',['../classBlisModel.html#adb8a42f358f40ed40e6e34e4733e0f1b',1,'BlisModel']]], + ['incumbent_5f_1341',['incumbent_',['../classBlisModel.html#a1dcc77aafadeef3eeed569016b02b1af',1,'BlisModel']]], + ['indices_5f_1342',['indices_',['../classBlisConstraint.html#a985d4fa0eac3cda9b6641e3ae4c1b470',1,'BlisConstraint::indices_()'],['../classBlisVariable.html#ac4dfff37e63ffb42dd9de0d02fe7cbc5',1,'BlisVariable::indices_()']]], + ['inputcon_5f_1343',['inputCon_',['../classBlisModel.html#a5d19ba1d752081e9a9879c978c3c6037',1,'BlisModel']]], + ['inputvar_5f_1344',['inputVar_',['../classBlisModel.html#a68ad762a290b25548efeaafe072d68ec',1,'BlisModel']]], + ['inset_5f_1345',['inSet_',['../classVrpCutGenerator.html#ad881ba92788518fbf8a4e6b21bdfece3',1,'VrpCutGenerator']]], + ['intcolindices_5f_1346',['intColIndices_',['../classBlisModel.html#a0d83390f3d5803b5a4df75f329e9bd98',1,'BlisModel']]], + ['integertol_5f_1347',['integerTol_',['../classBlisModel.html#ae7fd0ce2020174c54729632741da20a2',1,'BlisModel']]], + ['intobjindices_5f_1348',['intObjIndices_',['../classBlisModel.html#a608bb424be7d9a4bf2a0dada4cab14b4',1,'BlisModel']]], + ['is_5fart_5fpoint_1349',['is_art_point',['../structVERTEX.html#a8ee10d018f75eea535d401f9d6c80174',1,'VERTEX']]], + ['isintegral_5f_1350',['isIntegral_',['../classVrpNetwork.html#a84bddc4df3103a1b2059e93e720347d7',1,'VrpNetwork']]], + ['isroot_5f_1351',['isRoot_',['../classBlisModel.html#ac4ccb0b7b21b1ce0cd6dcda96249d9f9',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/variables_9.html b/Doxygen/0.94/search/variables_9.html new file mode 100644 index 0000000..21e5a4f --- /dev/null +++ b/Doxygen/0.94/search/variables_9.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_9.js b/Doxygen/0.94/search/variables_9.js new file mode 100644 index 0000000..bb35958 --- /dev/null +++ b/Doxygen/0.94/search/variables_9.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['last_1352',['last',['../structROUTE__DATA.html#ab5823502ccef74e1ce24cd99ef938ddc',1,'ROUTE_DATA::last()'],['../structVERTEX.html#a2079599a7bfc0c91ff0c567b07c4addc',1,'VERTEX::last()']]], + ['leaftorootpath_1353',['leafToRootPath',['../classBlisModel.html#a4773ab41dfe021f8aa8ea6b5b5b8b941',1,'BlisModel']]], + ['low_1354',['low',['../structVERTEX.html#afbcf2ebac7279aa21edc7c9232b05aee',1,'VERTEX']]], + ['lpsolver_5f_1355',['lpSolver_',['../classBlisModel.html#a77c6ce7be84a7aa9a949fe84a6f61ae4',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/variables_a.html b/Doxygen/0.94/search/variables_a.html new file mode 100644 index 0000000..1f65055 --- /dev/null +++ b/Doxygen/0.94/search/variables_a.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_a.js b/Doxygen/0.94/search/variables_a.js new file mode 100644 index 0000000..0c01956 --- /dev/null +++ b/Doxygen/0.94/search/variables_a.js @@ -0,0 +1,9 @@ +var searchData= +[ + ['matrix_5f_1356',['matrix_',['../classBlisHeurRound.html#a12df22d273fd5a4bb47dc62e5879330a',1,'BlisHeurRound']]], + ['matrixbyrow_5f_1357',['matrixByRow_',['../classBlisHeurRound.html#af34c767f62e3cfc92a86aca29004904b',1,'BlisHeurRound']]], + ['maxedgenum_5f_1358',['maxEdgenum_',['../classVrpNetwork.html#a555f7fb8561d3b0f929193943f9e7628',1,'VrpNetwork']]], + ['maxnumcons_5f_1359',['maxNumCons_',['../classBlisModel.html#af7471b431afe6f1a4012437b1c6bcc7f',1,'BlisModel']]], + ['mincut_5f_1360',['mincut_',['../classVrpNetwork.html#aa41531d548a79de77f1c7d7d0d6d79c5',1,'VrpNetwork']]], + ['model_5f_1361',['model_',['../classVrpCutGenerator.html#ad50b571829adaae7fea39e6c1ea723a4',1,'VrpCutGenerator::model_()'],['../classBlisConGenerator.html#a41487047261a5ba2c9eb4118d9e4770c',1,'BlisConGenerator::model_()'],['../classBlisHeuristic.html#a022a81d07cb404f1b2714fe91afa1b62',1,'BlisHeuristic::model_()']]] +]; diff --git a/Doxygen/0.94/search/variables_b.html b/Doxygen/0.94/search/variables_b.html new file mode 100644 index 0000000..c02d066 --- /dev/null +++ b/Doxygen/0.94/search/variables_b.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_b.js b/Doxygen/0.94/search/variables_b.js new file mode 100644 index 0000000..fd5a2e6 --- /dev/null +++ b/Doxygen/0.94/search/variables_b.js @@ -0,0 +1,39 @@ +var searchData= +[ + ['n_5f_1362',['n_',['../classVrpModel.html#a71f7e25b188084de20692188777688f2',1,'VrpModel']]], + ['name_5f_1363',['name_',['../classVrpModel.html#afb1d7a80430d30af276a2ffe807e7076',1,'VrpModel::name_()'],['../classBlisConGenerator.html#ad2bfac705a3b3fe05f0d9eda28f85b98',1,'BlisConGenerator::name_()'],['../classBlisHeuristic.html#ac482fd341202b1160b8fb87e31313d1c',1,'BlisHeuristic::name_()']]], + ['neighbors_5f_1364',['neighbors_',['../classVrpHeurTSP.html#a5d8fc8103640dfa1b7a4758820a51a51',1,'VrpHeurTSP']]], + ['newcutpool_5f_1365',['newCutPool_',['../classBlisModel.html#ab3c11f894b024b86d5bdb0ae086645a1',1,'BlisModel']]], + ['newdemand_5f_1366',['newDemand_',['../classVrpNetwork.html#aa5ad05bf2a0b9aa9eb3425632a8029f5',1,'VrpNetwork']]], + ['next_1367',['next',['../struct__NODE.html#a6c6f95eb9986b52268f411d953329b51',1,'_NODE']]], + ['next_5fedge_1368',['next_edge',['../structELIST.html#ab6855167d545035cad41181541ba4c82',1,'ELIST']]], + ['noconscalls_5f_1369',['noConsCalls_',['../classBlisConGenerator.html#a751ce6491c653f281f901e3fdd56f022',1,'BlisConGenerator']]], + ['nodecalls_5f_1370',['nodeCalls_',['../classVrpHeurTSP.html#a37942d1dcb57b82f9b90ca5b2d55864f',1,'VrpHeurTSP']]], + ['nodeweight_5f_1371',['nodeWeight_',['../classBlisModel.html#a073c136e2e0c0f0f48656ad7bf186cf3',1,'BlisModel']]], + ['normal_5f_1372',['normal_',['../classBlisConGenerator.html#a46368781cb77effa8c546f52a16db34d',1,'BlisConGenerator']]], + ['nosolscalls_5f_1373',['noSolsCalls_',['../classBlisHeuristic.html#af00a7d5df9d56733284aaca07989f1a6',1,'BlisHeuristic']]], + ['numbranchresolve_5f_1374',['numBranchResolve_',['../classBlisModel.html#ac39db5633f328e27020fdd9ca78e6d4a',1,'BlisModel']]], + ['numcols_5f_1375',['numCols_',['../classBlisModel.html#a98d8045e54859e3a70b753c02d4b071c',1,'BlisModel']]], + ['numcomps_5f_1376',['numComps_',['../classVrpNetwork.html#ac9b5c6a089e8d4183e6d08456dcdd379',1,'VrpNetwork']]], + ['numconsgenerated_5f_1377',['numConsGenerated_',['../classBlisConGenerator.html#a814502804b19d3e3e655821ceb94d85a',1,'BlisConGenerator']]], + ['numconsused_5f_1378',['numConsUsed_',['../classBlisConGenerator.html#ad7eae3370172bd48aec9c85ac739eda5',1,'BlisConGenerator']]], + ['numcust_1379',['numcust',['../structROUTE__DATA.html#afd107bf2bafa448d7e9fdd5891eda086',1,'ROUTE_DATA']]], + ['numcutgenerators_5f_1380',['numCutGenerators_',['../classBlisModel.html#ae665c951a382071c264ff536ccb53384',1,'BlisModel']]], + ['numelems_5f_1381',['numElems_',['../classBlisModel.html#a299524e0a6cee8c0bba9e8d1573c078b',1,'BlisModel']]], + ['numheuristics_5f_1382',['numHeuristics_',['../classBlisModel.html#af6e0d5285d60c8ce762ff3d42958df63',1,'BlisModel']]], + ['numheursolutions_5f_1383',['numHeurSolutions_',['../classBlisModel.html#a529cc1702f044f5d2e703bbd6cb766a8',1,'BlisModel']]], + ['numintinfdown_1384',['numIntInfDown',['../structBlisStrong.html#a26a18cf59669e0ae18f06f75c455ac62',1,'BlisStrong']]], + ['numintinfup_1385',['numIntInfUp',['../structBlisStrong.html#a3abc3ce196022e4c84a31bcafe444fac',1,'BlisStrong']]], + ['numintobjects_5f_1386',['numIntObjects_',['../classBlisModel.html#af23ca7595602ec45ed9e29f2fa8a76d3',1,'BlisModel']]], + ['numiterations_5f_1387',['numIterations_',['../classBlisModel.html#a4d6f3cd6fa3af3fcedbb7ab04b850226',1,'BlisModel']]], + ['numnodes_5f_1388',['numNodes_',['../classBlisModel.html#a28fa05f69e8c33feca167efbe23e7767',1,'BlisModel']]], + ['numobjects_5f_1389',['numObjects_',['../classBlisModel.html#aa3f0fd1d5a5f06aeec52426c06d275a7',1,'BlisModel']]], + ['numobjinfdown_1390',['numObjInfDown',['../structBlisStrong.html#aef6071b20a29cc97c83871d6d39faf24',1,'BlisStrong']]], + ['numobjinfup_1391',['numObjInfUp',['../structBlisStrong.html#a943168810b0e87f53582ebe3849c058a',1,'BlisStrong']]], + ['numoldconstraints_5f_1392',['numOldConstraints_',['../classBlisModel.html#aa7f7a5fbc86bc5d92aaef3122bb966c8',1,'BlisModel']]], + ['numroutes_1393',['numroutes',['../structBEST__TOURS.html#ac44ad9dab51f5d2e49b635b7be5c9d53',1,'BEST_TOURS']]], + ['numroutes_5f_1394',['numroutes_',['../classVrpModel.html#a142ee3c3f1185c37a417c876be61de36',1,'VrpModel']]], + ['numrows_5f_1395',['numRows_',['../classBlisModel.html#a3d143b5f330e1d8284cc1f68066fbcc3',1,'BlisModel']]], + ['numsolutions_5f_1396',['numSolutions_',['../classBlisHeuristic.html#a5273fff6cf49d27bd7b9e253843b6479',1,'BlisHeuristic::numSolutions_()'],['../classBlisModel.html#af14d6b32ed394f7bf4dc952f58f87a97',1,'BlisModel::numSolutions_()']]], + ['numstrong_5f_1397',['numStrong_',['../classBlisModel.html#a1a3e614a36379b7ba79286b515c828d6',1,'BlisModel']]] +]; diff --git a/Doxygen/0.94/search/variables_c.html b/Doxygen/0.94/search/variables_c.html new file mode 100644 index 0000000..4b866c6 --- /dev/null +++ b/Doxygen/0.94/search/variables_c.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_c.js b/Doxygen/0.94/search/variables_c.js new file mode 100644 index 0000000..0f39b1a --- /dev/null +++ b/Doxygen/0.94/search/variables_c.js @@ -0,0 +1,20 @@ +var searchData= +[ + ['objcoef_5f_1398',['objCoef_',['../classBlisModel.html#a07a94e96a609a556f0326319025abf67',1,'BlisModel::objCoef_()'],['../classBlisVariable.html#ab06d75ababe82b4c896d40cd878ee532',1,'BlisVariable::objCoef_()']]], + ['objectindex_1399',['objectIndex',['../structBlisStrong.html#ad4518553a024bec8972b8a0e09bf6c7f',1,'BlisStrong']]], + ['objects_5f_1400',['objects_',['../classBlisModel.html#a814bd2e2690b50329e49fa8367c62296',1,'BlisModel']]], + ['objsense_5f_1401',['objSense_',['../classBlisModel.html#aa05801edb841b1518a08c0b1f90c5dd6',1,'BlisModel']]], + ['oldconstraints_5f_1402',['oldConstraints_',['../classBlisModel.html#a2ca9f96f595a3d3c5eda301c6ae21589',1,'BlisModel']]], + ['oldconstraintssize_5f_1403',['oldConstraintsSize_',['../classBlisModel.html#a6fd6bebed45214f1532fd91baf1f77c3',1,'BlisModel']]], + ['opt_5f_1404',['opt_',['../classVrpSolution.html#a65e55f48f8f2c8535b0c353d2f98a31e',1,'VrpSolution']]], + ['optimalabsgap_5f_1405',['optimalAbsGap_',['../classBlisModel.html#a07ced1a7abc3a426e15502a5899f3bcb',1,'BlisModel']]], + ['optimalrelgap_5f_1406',['optimalRelGap_',['../classBlisModel.html#a4546e5de99cc514446418e5dae5b3307',1,'BlisModel']]], + ['orig_5fnode_5flist_1407',['orig_node_list',['../structVERTEX.html#a098b234b2b5f8c4f672dce8ffcddee81',1,'VERTEX']]], + ['orig_5fnode_5flist_5fsize_1408',['orig_node_list_size',['../structVERTEX.html#a889b34d7a3011c86ee79ef61063adcbe',1,'VERTEX']]], + ['originallower_5f_1409',['originalLower_',['../classBlisObjectInt.html#a236f25691735066d302bd32120f4210f',1,'BlisObjectInt']]], + ['originalupper_5f_1410',['originalUpper_',['../classBlisObjectInt.html#a447690afd31886ee515f652035501d09',1,'BlisObjectInt']]], + ['origlpsolver_5f_1411',['origLpSolver_',['../classBlisModel.html#a25d80c218c4d227d9b8a4d2a26b7c45d',1,'BlisModel']]], + ['orignodenum_1412',['orignodenum',['../structVERTEX.html#aa128bd8ef950d5de68045b222f8f65ef',1,'VERTEX']]], + ['other_1413',['other',['../structELIST.html#a071038980f57eaa103babff8e25b748f',1,'ELIST']]], + ['other_5fend_1414',['other_end',['../structELIST.html#a5d4258c9d50d037c24c091341c26fd0c',1,'ELIST']]] +]; diff --git a/Doxygen/0.94/search/variables_d.html b/Doxygen/0.94/search/variables_d.html new file mode 100644 index 0000000..84d878b --- /dev/null +++ b/Doxygen/0.94/search/variables_d.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_d.js b/Doxygen/0.94/search/variables_d.js new file mode 100644 index 0000000..0280f51 --- /dev/null +++ b/Doxygen/0.94/search/variables_d.js @@ -0,0 +1,14 @@ +var searchData= +[ + ['postmatrix_5f_1415',['postMatrix_',['../classBlisPresolve.html#aabde24f3039bed8d839649566aeaf78e',1,'BlisPresolve']]], + ['posx_5f_1416',['posx_',['../classVrpModel.html#a53027aa34c2bf497ddde6db53211958e',1,'VrpModel']]], + ['posy_5f_1417',['posy_',['../classVrpModel.html#a52e89633a65dbc0c3b2db8956af2bbe2',1,'VrpModel']]], + ['prematrix_5f_1418',['preMatrix_',['../classBlisPresolve.html#a68368b99f7140a537211d1686dffdb57',1,'BlisPresolve']]], + ['prenode_5f_1419',['preNode_',['../classVrpHeurTSP.html#a5502b8f31ddc1de402338525e3be5c82',1,'VrpHeurTSP']]], + ['presolve_5f_1420',['presolve_',['../classBlisModel.html#a7153ce7b58478d38f3c3861eef6d005d',1,'BlisModel']]], + ['presolved_1421',['presolved',['../classBlisModel.html#ae7c50e4d8ad58ebb2555e733caa70d93',1,'BlisModel']]], + ['presolvedlpsolver_5f_1422',['presolvedLpSolver_',['../classBlisModel.html#ad906fbfef3763db27a38f9957f533160',1,'BlisModel']]], + ['priority_5f_1423',['priority_',['../classBlisModel.html#aac4585e76c04ecc8088cda3b293f0139',1,'BlisModel']]], + ['problemsetup_1424',['problemSetup',['../classBlisModel.html#a41e2b1fa4f3983591e952548d88c1b28',1,'BlisModel']]], + ['pseudocost_5f_1425',['pseudocost_',['../classBlisObjectInt.html#ab949c3591cb5c0b2b3c698023de79add',1,'BlisObjectInt']]] +]; diff --git a/Doxygen/0.94/search/variables_e.html b/Doxygen/0.94/search/variables_e.html new file mode 100644 index 0000000..b0d9b7b --- /dev/null +++ b/Doxygen/0.94/search/variables_e.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_e.js b/Doxygen/0.94/search/variables_e.js new file mode 100644 index 0000000..101d742 --- /dev/null +++ b/Doxygen/0.94/search/variables_e.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['rampupbranchstrategy_5f_1426',['rampUpBranchStrategy_',['../classBlisModel.html#a8b3fe24d68d9060116f210acc728bf75',1,'BlisModel']]], + ['ref_5f_1427',['ref_',['../classVrpCutGenerator.html#a09886849586d19a5c110493fca7f0abc',1,'VrpCutGenerator']]], + ['relibility_5f_1428',['relibility_',['../classBlisBranchStrategyPseudo.html#aeed2feec856b41e391329d0a4de91d7e',1,'BlisBranchStrategyPseudo::relibility_()'],['../classBlisBranchStrategyRel.html#ae6e9ed798426322a4794b91d8dc539a1',1,'BlisBranchStrategyRel::relibility_()']]], + ['route_1429',['route',['../struct__NODE.html#af38cedb8786cffa0f6eb065b1287d4c6',1,'_NODE']]], + ['route_5finfo_1430',['route_info',['../structBEST__TOURS.html#a4c6ab11dbee650bcda97ef6db372791b',1,'BEST_TOURS']]] +]; diff --git a/Doxygen/0.94/search/variables_f.html b/Doxygen/0.94/search/variables_f.html new file mode 100644 index 0000000..a708dbf --- /dev/null +++ b/Doxygen/0.94/search/variables_f.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Doxygen/0.94/search/variables_f.js b/Doxygen/0.94/search/variables_f.js new file mode 100644 index 0000000..f5eb00f --- /dev/null +++ b/Doxygen/0.94/search/variables_f.js @@ -0,0 +1,14 @@ +var searchData= +[ + ['scanned_1431',['scanned',['../structEDGE.html#a44236ec93acbb222f04d86010e4ba2bb',1,'EDGE::scanned()'],['../structVERTEX.html#a9585afaa08582675719aaa5976b0d81e',1,'VERTEX::scanned()']]], + ['score_5f_1432',['score_',['../classBlisPseudocost.html#a280b29b689bd643ea5bbd319addf7857',1,'BlisPseudocost']]], + ['seed_5f_1433',['seed_',['../classBlisHeurRound.html#a5b76c8b4df40f1907bdcdce1656b8c41',1,'BlisHeurRound']]], + ['sharedobjectmark_5f_1434',['sharedObjectMark_',['../classBlisModel.html#aa39a7195c0ebf0341bd65d73244a3518',1,'BlisModel']]], + ['size_5f_1435',['size_',['../classBlisConstraint.html#a0db44a303800dfd3b335b5ac58438d53',1,'BlisConstraint::size_()'],['../classBlisVariable.html#ab866901ddff8af0744de941c73508a79',1,'BlisVariable::size_()']]], + ['solve_5ftime_1436',['solve_time',['../structBEST__TOURS.html#a5df8fedcc23adac844e40aaade11ddfb',1,'BEST_TOURS']]], + ['startconlb_5f_1437',['startConLB_',['../classBlisModel.html#af29b13925d7f408f8c34451c3576edee',1,'BlisModel']]], + ['startconub_5f_1438',['startConUB_',['../classBlisModel.html#a6a9da9a98376b839fe1f98f0b2e6fedd',1,'BlisModel']]], + ['startvarlb_5f_1439',['startVarLB_',['../classBlisModel.html#a34836753a16340e046c6d5ed6bd63407',1,'BlisModel']]], + ['startvarub_5f_1440',['startVarUB_',['../classBlisModel.html#ada4a5c0c2c47e94780bde8174d88ae36',1,'BlisModel']]], + ['strategy_5f_1441',['strategy_',['../classBlisConGenerator.html#adc29afb8836d1cf8c910bb54dbc0868f',1,'BlisConGenerator::strategy_()'],['../classBlisHeuristic.html#addbfe4f7ba7ac5f0ab450790c397ccf3',1,'BlisHeuristic::strategy_()']]] +]; diff --git a/Doxygen/0.94/splitbar.png b/Doxygen/0.94/splitbar.png new file mode 100644 index 0000000..fe895f2 Binary files /dev/null and b/Doxygen/0.94/splitbar.png differ diff --git a/Doxygen/0.94/structBEST__TOURS-members.html b/Doxygen/0.94/structBEST__TOURS-members.html new file mode 100644 index 0000000..e447196 --- /dev/null +++ b/Doxygen/0.94/structBEST__TOURS-members.html @@ -0,0 +1,86 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +
    BEST_TOURS Member List
    +
    +
    + +

    This is the complete list of members for BEST_TOURS, including all inherited members.

    + + + + + + + +
    algorithmBEST_TOURS
    costBEST_TOURS
    numroutesBEST_TOURS
    route_infoBEST_TOURS
    solve_timeBEST_TOURS
    tourBEST_TOURS
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structBEST__TOURS.html b/Doxygen/0.94/structBEST__TOURS.html new file mode 100644 index 0000000..b9c0b5b --- /dev/null +++ b/Doxygen/0.94/structBEST__TOURS.html @@ -0,0 +1,213 @@ + + + + + + + +Blis: BEST_TOURS Struct Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +Public Attributes | +List of all members
    +
    +
    BEST_TOURS Struct Reference
    +
    +
    + +

    #include <VrpCommonTypes.h>

    +
    + + Collaboration diagram for BEST_TOURS:
    +
    +
    + + + + + + + + + + + + + + + +

    +Public Attributes

    int algorithm
     
    double solve_time
     
    int cost
     
    int numroutes
     
    route_data * route_info
     
    _node * tour
     
    +

    Detailed Description

    +
    +

    Definition at line 33 of file VrpCommonTypes.h.

    +

    Member Data Documentation

    + +

    ◆ algorithm

    + +
    +
    + + + + +
    int BEST_TOURS::algorithm
    +
    + +

    Definition at line 34 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ solve_time

    + +
    +
    + + + + +
    double BEST_TOURS::solve_time
    +
    + +

    Definition at line 35 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ cost

    + +
    +
    + + + + +
    int BEST_TOURS::cost
    +
    + +

    Definition at line 36 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ numroutes

    + +
    +
    + + + + +
    int BEST_TOURS::numroutes
    +
    + +

    Definition at line 37 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ route_info

    + +
    +
    + + + + +
    route_data* BEST_TOURS::route_info
    +
    + +

    Definition at line 38 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ tour

    + +
    +
    + + + + +
    _node* BEST_TOURS::tour
    +
    + +

    Definition at line 39 of file VrpCommonTypes.h.

    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structBEST__TOURS__coll__graph.map b/Doxygen/0.94/structBEST__TOURS__coll__graph.map new file mode 100644 index 0000000..c99bf5d --- /dev/null +++ b/Doxygen/0.94/structBEST__TOURS__coll__graph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/structBEST__TOURS__coll__graph.md5 b/Doxygen/0.94/structBEST__TOURS__coll__graph.md5 new file mode 100644 index 0000000..a722226 --- /dev/null +++ b/Doxygen/0.94/structBEST__TOURS__coll__graph.md5 @@ -0,0 +1 @@ +add5799ba4b2de1033d2e03953eda6a1 \ No newline at end of file diff --git a/Doxygen/0.94/structBEST__TOURS__coll__graph.png b/Doxygen/0.94/structBEST__TOURS__coll__graph.png new file mode 100644 index 0000000..77a7390 Binary files /dev/null and b/Doxygen/0.94/structBEST__TOURS__coll__graph.png differ diff --git a/Doxygen/0.94/structBlisStrong-members.html b/Doxygen/0.94/structBlisStrong-members.html new file mode 100644 index 0000000..7bf2b88 --- /dev/null +++ b/Doxygen/0.94/structBlisStrong-members.html @@ -0,0 +1,88 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +
    BlisStrong Member List
    +
    +
    + +

    This is the complete list of members for BlisStrong, including all inherited members.

    + + + + + + + + + +
    bObjectBlisStrong
    finishedDownBlisStrong
    finishedUpBlisStrong
    numIntInfDownBlisStrong
    numIntInfUpBlisStrong
    numObjInfDownBlisStrong
    numObjInfUpBlisStrong
    objectIndexBlisStrong
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structBlisStrong.html b/Doxygen/0.94/structBlisStrong.html new file mode 100644 index 0000000..6eadb3d --- /dev/null +++ b/Doxygen/0.94/structBlisStrong.html @@ -0,0 +1,237 @@ + + + + + + + +Blis: BlisStrong Struct Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +Public Attributes | +List of all members
    +
    +
    BlisStrong Struct Reference
    +
    +
    + +

    #include <BlisBranchStrategyStrong.h>

    + + + + + + + + + + + + + + + + + + +

    +Public Attributes

    int objectIndex
     
    BcpsBranchObject * bObject
     
    int numIntInfUp
     
    int numObjInfUp
     
    bool finishedUp
     
    int numIntInfDown
     
    int numObjInfDown
     
    bool finishedDown
     
    +

    Detailed Description

    +
    +

    Definition at line 41 of file BlisBranchStrategyStrong.h.

    +

    Member Data Documentation

    + +

    ◆ objectIndex

    + +
    +
    + + + + +
    int BlisStrong::objectIndex
    +
    + +

    Definition at line 42 of file BlisBranchStrategyStrong.h.

    + +
    +
    + +

    ◆ bObject

    + +
    +
    + + + + +
    BcpsBranchObject* BlisStrong::bObject
    +
    + +

    Definition at line 43 of file BlisBranchStrategyStrong.h.

    + +
    +
    + +

    ◆ numIntInfUp

    + +
    +
    + + + + +
    int BlisStrong::numIntInfUp
    +
    + +

    Definition at line 44 of file BlisBranchStrategyStrong.h.

    + +
    +
    + +

    ◆ numObjInfUp

    + +
    +
    + + + + +
    int BlisStrong::numObjInfUp
    +
    + +

    Definition at line 45 of file BlisBranchStrategyStrong.h.

    + +
    +
    + +

    ◆ finishedUp

    + +
    +
    + + + + +
    bool BlisStrong::finishedUp
    +
    + +

    Definition at line 46 of file BlisBranchStrategyStrong.h.

    + +
    +
    + +

    ◆ numIntInfDown

    + +
    +
    + + + + +
    int BlisStrong::numIntInfDown
    +
    + +

    Definition at line 47 of file BlisBranchStrategyStrong.h.

    + +
    +
    + +

    ◆ numObjInfDown

    + +
    +
    + + + + +
    int BlisStrong::numObjInfDown
    +
    + +

    Definition at line 48 of file BlisBranchStrategyStrong.h.

    + +
    +
    + +

    ◆ finishedDown

    + +
    +
    + + + + +
    bool BlisStrong::finishedDown
    +
    + +

    Definition at line 49 of file BlisBranchStrategyStrong.h.

    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structEDGE-members.html b/Doxygen/0.94/structEDGE-members.html new file mode 100644 index 0000000..cc9823f --- /dev/null +++ b/Doxygen/0.94/structEDGE-members.html @@ -0,0 +1,87 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +
    EDGE Member List
    +
    +
    + +

    This is the complete list of members for EDGE, including all inherited members.

    + + + + + + + + +
    costEDGE
    deletedEDGE
    scannedEDGE
    tree_edgeEDGE
    v0EDGE
    v1EDGE
    weightEDGE
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structEDGE.html b/Doxygen/0.94/structEDGE.html new file mode 100644 index 0000000..98d3a9f --- /dev/null +++ b/Doxygen/0.94/structEDGE.html @@ -0,0 +1,219 @@ + + + + + + + +Blis: EDGE Struct Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +Public Attributes | +List of all members
    +
    +
    EDGE Struct Reference
    +
    +
    + +

    #include <VrpNetwork.h>

    + + + + + + + + + + + + + + + + +

    +Public Attributes

    int v0
     
    int v1
     
    int cost
     
    double weight
     
    bool scanned
     
    bool tree_edge
     
    bool deleted
     
    +

    Detailed Description

    +
    +

    Definition at line 43 of file VrpNetwork.h.

    +

    Member Data Documentation

    + +

    ◆ v0

    + +
    +
    + + + + +
    int EDGE::v0
    +
    + +

    Definition at line 44 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ v1

    + +
    +
    + + + + +
    int EDGE::v1
    +
    + +

    Definition at line 45 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ cost

    + +
    +
    + + + + +
    int EDGE::cost
    +
    + +

    Definition at line 46 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ weight

    + +
    +
    + + + + +
    double EDGE::weight
    +
    + +

    Definition at line 47 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ scanned

    + +
    +
    + + + + +
    bool EDGE::scanned
    +
    + +

    Definition at line 48 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ tree_edge

    + +
    +
    + + + + +
    bool EDGE::tree_edge
    +
    + +

    Definition at line 49 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ deleted

    + +
    +
    + + + + +
    bool EDGE::deleted
    +
    + +

    Definition at line 50 of file VrpNetwork.h.

    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structEDGE__DATA-members.html b/Doxygen/0.94/structEDGE__DATA-members.html new file mode 100644 index 0000000..5bcf328 --- /dev/null +++ b/Doxygen/0.94/structEDGE__DATA-members.html @@ -0,0 +1,83 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +
    EDGE_DATA Member List
    +
    +
    + +

    This is the complete list of members for EDGE_DATA, including all inherited members.

    + + + + +
    costEDGE_DATA
    v0EDGE_DATA
    v1EDGE_DATA
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structEDGE__DATA.html b/Doxygen/0.94/structEDGE__DATA.html new file mode 100644 index 0000000..6eecd4b --- /dev/null +++ b/Doxygen/0.94/structEDGE__DATA.html @@ -0,0 +1,147 @@ + + + + + + + +Blis: EDGE_DATA Struct Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +Public Attributes | +List of all members
    +
    +
    EDGE_DATA Struct Reference
    +
    +
    + +

    #include <VrpCommonTypes.h>

    + + + + + + + + +

    +Public Attributes

    int v0
     
    int v1
     
    int cost
     
    +

    Detailed Description

    +
    +

    Definition at line 42 of file VrpCommonTypes.h.

    +

    Member Data Documentation

    + +

    ◆ v0

    + +
    +
    + + + + +
    int EDGE_DATA::v0
    +
    + +

    Definition at line 43 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ v1

    + +
    +
    + + + + +
    int EDGE_DATA::v1
    +
    + +

    Definition at line 44 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ cost

    + +
    +
    + + + + +
    int EDGE_DATA::cost
    +
    + +

    Definition at line 45 of file VrpCommonTypes.h.

    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structELIST-members.html b/Doxygen/0.94/structELIST-members.html new file mode 100644 index 0000000..1c0b9af --- /dev/null +++ b/Doxygen/0.94/structELIST-members.html @@ -0,0 +1,84 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +
    ELIST Member List
    +
    +
    + +

    This is the complete list of members for ELIST, including all inherited members.

    + + + + + +
    dataELIST
    next_edgeELIST
    otherELIST
    other_endELIST
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structELIST.html b/Doxygen/0.94/structELIST.html new file mode 100644 index 0000000..127a039 --- /dev/null +++ b/Doxygen/0.94/structELIST.html @@ -0,0 +1,177 @@ + + + + + + + +Blis: ELIST Struct Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +Public Attributes | +List of all members
    +
    +
    ELIST Struct Reference
    +
    +
    + +

    #include <VrpNetwork.h>

    +
    + + Collaboration diagram for ELIST:
    +
    +
    + + + + + + + + + + + +

    +Public Attributes

    struct ELIST * next_edge
     
    struct EDGE * data
     
    int other_end
     
    struct VERTEX * other
     
    +

    Detailed Description

    +
    +

    Definition at line 53 of file VrpNetwork.h.

    +

    Member Data Documentation

    + +

    ◆ next_edge

    + +
    +
    + + + + +
    struct ELIST* ELIST::next_edge
    +
    + +

    Definition at line 54 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ data

    + +
    +
    + + + + +
    struct EDGE* ELIST::data
    +
    + +

    Definition at line 55 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ other_end

    + +
    +
    + + + + +
    int ELIST::other_end
    +
    + +

    Definition at line 56 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ other

    + +
    +
    + + + + +
    struct VERTEX* ELIST::other
    +
    + +

    Definition at line 57 of file VrpNetwork.h.

    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structELIST__coll__graph.map b/Doxygen/0.94/structELIST__coll__graph.map new file mode 100644 index 0000000..3334016 --- /dev/null +++ b/Doxygen/0.94/structELIST__coll__graph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/structELIST__coll__graph.md5 b/Doxygen/0.94/structELIST__coll__graph.md5 new file mode 100644 index 0000000..7344e7c --- /dev/null +++ b/Doxygen/0.94/structELIST__coll__graph.md5 @@ -0,0 +1 @@ +919a331b28a67f6ffae7f2dd04fc1306 \ No newline at end of file diff --git a/Doxygen/0.94/structELIST__coll__graph.png b/Doxygen/0.94/structELIST__coll__graph.png new file mode 100644 index 0000000..516628f Binary files /dev/null and b/Doxygen/0.94/structELIST__coll__graph.png differ diff --git a/Doxygen/0.94/structROUTE__DATA-members.html b/Doxygen/0.94/structROUTE__DATA-members.html new file mode 100644 index 0000000..a07baad --- /dev/null +++ b/Doxygen/0.94/structROUTE__DATA-members.html @@ -0,0 +1,85 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +
    ROUTE_DATA Member List
    +
    +
    + +

    This is the complete list of members for ROUTE_DATA, including all inherited members.

    + + + + + + +
    costROUTE_DATA
    firstROUTE_DATA
    lastROUTE_DATA
    numcustROUTE_DATA
    weightROUTE_DATA
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structROUTE__DATA.html b/Doxygen/0.94/structROUTE__DATA.html new file mode 100644 index 0000000..2c93564 --- /dev/null +++ b/Doxygen/0.94/structROUTE__DATA.html @@ -0,0 +1,183 @@ + + + + + + + +Blis: ROUTE_DATA Struct Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +Public Attributes | +List of all members
    +
    +
    ROUTE_DATA Struct Reference
    +
    +
    + +

    #include <VrpCommonTypes.h>

    + + + + + + + + + + + + +

    +Public Attributes

    int first
     
    int last
     
    int numcust
     
    int weight
     
    int cost
     
    +

    Detailed Description

    +
    +

    Definition at line 25 of file VrpCommonTypes.h.

    +

    Member Data Documentation

    + +

    ◆ first

    + +
    +
    + + + + +
    int ROUTE_DATA::first
    +
    + +

    Definition at line 26 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ last

    + +
    +
    + + + + +
    int ROUTE_DATA::last
    +
    + +

    Definition at line 27 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ numcust

    + +
    +
    + + + + +
    int ROUTE_DATA::numcust
    +
    + +

    Definition at line 28 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ weight

    + +
    +
    + + + + +
    int ROUTE_DATA::weight
    +
    + +

    Definition at line 29 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ cost

    + +
    +
    + + + + +
    int ROUTE_DATA::cost
    +
    + +

    Definition at line 30 of file VrpCommonTypes.h.

    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structSMALL__GRAPH-members.html b/Doxygen/0.94/structSMALL__GRAPH-members.html new file mode 100644 index 0000000..2c67521 --- /dev/null +++ b/Doxygen/0.94/structSMALL__GRAPH-members.html @@ -0,0 +1,85 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +
    SMALL_GRAPH Member List
    +
    +
    + +

    This is the complete list of members for SMALL_GRAPH, including all inherited members.

    + + + + + + +
    allocated_edgenumSMALL_GRAPH
    del_edgenumSMALL_GRAPH
    edgenumSMALL_GRAPH
    edgesSMALL_GRAPH
    vertnumSMALL_GRAPH
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structSMALL__GRAPH.html b/Doxygen/0.94/structSMALL__GRAPH.html new file mode 100644 index 0000000..2b3adc1 --- /dev/null +++ b/Doxygen/0.94/structSMALL__GRAPH.html @@ -0,0 +1,194 @@ + + + + + + + +Blis: SMALL_GRAPH Struct Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +Public Attributes | +List of all members
    +
    +
    SMALL_GRAPH Struct Reference
    +
    +
    + +

    #include <VrpCommonTypes.h>

    +
    + + Collaboration diagram for SMALL_GRAPH:
    +
    +
    + + + + + + + + + + + + + +

    +Public Attributes

    int vertnum
     
    int edgenum
     
    int allocated_edgenum
     
    int del_edgenum
     
    edge_data * edges
     
    +

    Detailed Description

    +
    +

    Definition at line 48 of file VrpCommonTypes.h.

    +

    Member Data Documentation

    + +

    ◆ vertnum

    + +
    +
    + + + + +
    int SMALL_GRAPH::vertnum
    +
    + +

    Definition at line 49 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ edgenum

    + +
    +
    + + + + +
    int SMALL_GRAPH::edgenum
    +
    + +

    Definition at line 50 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ allocated_edgenum

    + +
    +
    + + + + +
    int SMALL_GRAPH::allocated_edgenum
    +
    + +

    Definition at line 51 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ del_edgenum

    + +
    +
    + + + + +
    int SMALL_GRAPH::del_edgenum
    +
    + +

    Definition at line 52 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ edges

    + +
    +
    + + + + +
    edge_data* SMALL_GRAPH::edges
    +
    + +

    Definition at line 53 of file VrpCommonTypes.h.

    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structSMALL__GRAPH__coll__graph.map b/Doxygen/0.94/structSMALL__GRAPH__coll__graph.map new file mode 100644 index 0000000..db2ac18 --- /dev/null +++ b/Doxygen/0.94/structSMALL__GRAPH__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/Doxygen/0.94/structSMALL__GRAPH__coll__graph.md5 b/Doxygen/0.94/structSMALL__GRAPH__coll__graph.md5 new file mode 100644 index 0000000..b547e70 --- /dev/null +++ b/Doxygen/0.94/structSMALL__GRAPH__coll__graph.md5 @@ -0,0 +1 @@ +3149c97db5e2260d1df656137019e18e \ No newline at end of file diff --git a/Doxygen/0.94/structSMALL__GRAPH__coll__graph.png b/Doxygen/0.94/structSMALL__GRAPH__coll__graph.png new file mode 100644 index 0000000..128a9e5 Binary files /dev/null and b/Doxygen/0.94/structSMALL__GRAPH__coll__graph.png differ diff --git a/Doxygen/0.94/structVERTEX-members.html b/Doxygen/0.94/structVERTEX-members.html new file mode 100644 index 0000000..8dbbc17 --- /dev/null +++ b/Doxygen/0.94/structVERTEX-members.html @@ -0,0 +1,94 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +
    VERTEX Member List
    +
    +
    + +

    This is the complete list of members for VERTEX, including all inherited members.

    + + + + + + + + + + + + + + + +
    compVERTEX
    degreeVERTEX
    deletedVERTEX
    demandVERTEX
    dfnumberVERTEX
    enodenumVERTEX
    firstVERTEX
    is_art_pointVERTEX
    lastVERTEX
    lowVERTEX
    orig_node_listVERTEX
    orig_node_list_sizeVERTEX
    orignodenumVERTEX
    scannedVERTEX
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structVERTEX.html b/Doxygen/0.94/structVERTEX.html new file mode 100644 index 0000000..cb1c8f4 --- /dev/null +++ b/Doxygen/0.94/structVERTEX.html @@ -0,0 +1,357 @@ + + + + + + + +Blis: VERTEX Struct Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +Public Attributes | +List of all members
    +
    +
    VERTEX Struct Reference
    +
    +
    + +

    #include <VrpNetwork.h>

    +
    + + Collaboration diagram for VERTEX:
    +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Public Attributes

    int enodenum
     
    int orignodenum
     
    struct ELIST * first
     
    struct ELIST * last
     
    int comp
     
    bool scanned
     
    int demand
     
    int degree
     
    int orig_node_list_size
     
    int * orig_node_list
     
    int dfnumber
     
    int low
     
    bool is_art_point
     
    bool deleted
     
    +

    Detailed Description

    +
    +

    Definition at line 60 of file VrpNetwork.h.

    +

    Member Data Documentation

    + +

    ◆ enodenum

    + +
    +
    + + + + +
    int VERTEX::enodenum
    +
    + +

    Definition at line 61 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ orignodenum

    + +
    +
    + + + + +
    int VERTEX::orignodenum
    +
    + +

    Definition at line 62 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ first

    + +
    +
    + + + + +
    struct ELIST* VERTEX::first
    +
    + +

    Definition at line 63 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ last

    + +
    +
    + + + + +
    struct ELIST* VERTEX::last
    +
    + +

    Definition at line 64 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ comp

    + +
    +
    + + + + +
    int VERTEX::comp
    +
    + +

    Definition at line 65 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ scanned

    + +
    +
    + + + + +
    bool VERTEX::scanned
    +
    + +

    Definition at line 67 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ demand

    + +
    +
    + + + + +
    int VERTEX::demand
    +
    + +

    Definition at line 68 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ degree

    + +
    +
    + + + + +
    int VERTEX::degree
    +
    + +

    Definition at line 69 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ orig_node_list_size

    + +
    +
    + + + + +
    int VERTEX::orig_node_list_size
    +
    + +

    Definition at line 70 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ orig_node_list

    + +
    +
    + + + + +
    int* VERTEX::orig_node_list
    +
    + +

    Definition at line 71 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ dfnumber

    + +
    +
    + + + + +
    int VERTEX::dfnumber
    +
    + +

    Definition at line 74 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ low

    + +
    +
    + + + + +
    int VERTEX::low
    +
    + +

    Definition at line 75 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ is_art_point

    + +
    +
    + + + + +
    bool VERTEX::is_art_point
    +
    + +

    Definition at line 76 of file VrpNetwork.h.

    + +
    +
    + +

    ◆ deleted

    + +
    +
    + + + + +
    bool VERTEX::deleted
    +
    + +

    Definition at line 77 of file VrpNetwork.h.

    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/structVERTEX__coll__graph.map b/Doxygen/0.94/structVERTEX__coll__graph.map new file mode 100644 index 0000000..42eea8d --- /dev/null +++ b/Doxygen/0.94/structVERTEX__coll__graph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/Doxygen/0.94/structVERTEX__coll__graph.md5 b/Doxygen/0.94/structVERTEX__coll__graph.md5 new file mode 100644 index 0000000..22666c0 --- /dev/null +++ b/Doxygen/0.94/structVERTEX__coll__graph.md5 @@ -0,0 +1 @@ +38555cba9fd078a51fbc202ac45a2c9c \ No newline at end of file diff --git a/Doxygen/0.94/structVERTEX__coll__graph.png b/Doxygen/0.94/structVERTEX__coll__graph.png new file mode 100644 index 0000000..ec5d983 Binary files /dev/null and b/Doxygen/0.94/structVERTEX__coll__graph.png differ diff --git a/Doxygen/0.94/struct__NODE-members.html b/Doxygen/0.94/struct__NODE-members.html new file mode 100644 index 0000000..22ea665 --- /dev/null +++ b/Doxygen/0.94/struct__NODE-members.html @@ -0,0 +1,82 @@ + + + + + + + +Blis: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +
    _NODE Member List
    +
    +
    + +

    This is the complete list of members for _NODE, including all inherited members.

    + + + +
    next_NODE
    route_NODE
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/struct__NODE.html b/Doxygen/0.94/struct__NODE.html new file mode 100644 index 0000000..f577372 --- /dev/null +++ b/Doxygen/0.94/struct__NODE.html @@ -0,0 +1,129 @@ + + + + + + + +Blis: _NODE Struct Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    Blis +  0.94.12 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + +
    +
    +
    +Public Attributes | +List of all members
    +
    +
    _NODE Struct Reference
    +
    +
    + +

    #include <VrpCommonTypes.h>

    + + + + + + +

    +Public Attributes

    int next
     
    int route
     
    +

    Detailed Description

    +
    +

    Definition at line 20 of file VrpCommonTypes.h.

    +

    Member Data Documentation

    + +

    ◆ next

    + +
    +
    + + + + +
    int _NODE::next
    +
    + +

    Definition at line 21 of file VrpCommonTypes.h.

    + +
    +
    + +

    ◆ route

    + +
    +
    + + + + +
    int _NODE::route
    +
    + +

    Definition at line 22 of file VrpCommonTypes.h.

    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by   +doxygen + 1.8.17 +
    + + diff --git a/Doxygen/0.94/sync_off.png b/Doxygen/0.94/sync_off.png new file mode 100644 index 0000000..3b443fc Binary files /dev/null and b/Doxygen/0.94/sync_off.png differ diff --git a/Doxygen/0.94/sync_on.png b/Doxygen/0.94/sync_on.png new file mode 100644 index 0000000..e08320f Binary files /dev/null and b/Doxygen/0.94/sync_on.png differ diff --git a/Doxygen/0.94/tab_a.png b/Doxygen/0.94/tab_a.png new file mode 100644 index 0000000..3b725c4 Binary files /dev/null and b/Doxygen/0.94/tab_a.png differ diff --git a/Doxygen/0.94/tab_b.png b/Doxygen/0.94/tab_b.png new file mode 100644 index 0000000..e2b4a86 Binary files /dev/null and b/Doxygen/0.94/tab_b.png differ diff --git a/Doxygen/0.94/tab_h.png b/Doxygen/0.94/tab_h.png new file mode 100644 index 0000000..fd5cb70 Binary files /dev/null and b/Doxygen/0.94/tab_h.png differ diff --git a/Doxygen/0.94/tab_s.png b/Doxygen/0.94/tab_s.png new file mode 100644 index 0000000..ab478c9 Binary files /dev/null and b/Doxygen/0.94/tab_s.png differ diff --git a/Doxygen/0.94/tabs.css b/Doxygen/0.94/tabs.css new file mode 100644 index 0000000..7d45d36 --- /dev/null +++ b/Doxygen/0.94/tabs.css @@ -0,0 +1 @@ +.sm{position:relative;z-index:9999}.sm,.sm ul,.sm li{display:block;list-style:none;margin:0;padding:0;line-height:normal;direction:ltr;text-align:left;-webkit-tap-highlight-color:rgba(0,0,0,0)}.sm-rtl,.sm-rtl ul,.sm-rtl li{direction:rtl;text-align:right}.sm>li>h1,.sm>li>h2,.sm>li>h3,.sm>li>h4,.sm>li>h5,.sm>li>h6{margin:0;padding:0}.sm ul{display:none}.sm li,.sm a{position:relative}.sm a{display:block}.sm a.disabled{cursor:not-allowed}.sm:after{content:"\00a0";display:block;height:0;font:0px/0 serif;clear:both;visibility:hidden;overflow:hidden}.sm,.sm *,.sm *:before,.sm *:after{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}.sm-dox{background-image:url("tab_b.png")}.sm-dox a,.sm-dox a:focus,.sm-dox a:hover,.sm-dox a:active{padding:0px 12px;padding-right:43px;font-family:"Lucida Grande","Geneva","Helvetica",Arial,sans-serif;font-size:13px;font-weight:bold;line-height:36px;text-decoration:none;text-shadow:0px 1px 1px rgba(255,255,255,0.9);color:#283A5D;outline:none}.sm-dox a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:#fff;text-shadow:0px 1px 1px #000}.sm-dox a.current{color:#D23600}.sm-dox a.disabled{color:#bbb}.sm-dox a span.sub-arrow{position:absolute;top:50%;margin-top:-14px;left:auto;right:3px;width:28px;height:28px;overflow:hidden;font:bold 12px/28px monospace !important;text-align:center;text-shadow:none;background:rgba(255,255,255,0.5);border-radius:5px}.sm-dox a.highlighted span.sub-arrow:before{display:block;content:'-'}.sm-dox>li:first-child>a,.sm-dox>li:first-child>:not(ul) a{border-radius:5px 5px 0 0}.sm-dox>li:last-child>a,.sm-dox>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul{border-radius:0 0 5px 5px}.sm-dox>li:last-child>a.highlighted,.sm-dox>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted{border-radius:0}.sm-dox ul{background:rgba(162,162,162,0.1)}.sm-dox ul a,.sm-dox ul a:focus,.sm-dox ul a:hover,.sm-dox ul a:active{font-size:12px;border-left:8px solid transparent;line-height:36px;text-shadow:none;background-color:white;background-image:none}.sm-dox ul a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:#fff;text-shadow:0px 1px 1px #000}.sm-dox ul ul a,.sm-dox ul ul a:hover,.sm-dox ul ul a:focus,.sm-dox ul ul a:active{border-left:16px solid transparent}.sm-dox ul ul ul a,.sm-dox ul ul ul a:hover,.sm-dox ul ul ul a:focus,.sm-dox ul ul ul a:active{border-left:24px solid transparent}.sm-dox ul ul ul ul a,.sm-dox ul ul ul ul a:hover,.sm-dox ul ul ul ul a:focus,.sm-dox ul ul ul ul a:active{border-left:32px solid transparent}.sm-dox ul ul ul ul ul a,.sm-dox ul ul ul ul ul a:hover,.sm-dox ul ul ul ul ul a:focus,.sm-dox ul ul ul ul ul a:active{border-left:40px solid transparent}@media (min-width: 768px){.sm-dox ul{position:absolute;width:12em}.sm-dox li{float:left}.sm-dox.sm-rtl li{float:right}.sm-dox ul li,.sm-dox.sm-rtl ul li,.sm-dox.sm-vertical li{float:none}.sm-dox a{white-space:nowrap}.sm-dox ul a,.sm-dox.sm-vertical a{white-space:normal}.sm-dox .sm-nowrap>li>a,.sm-dox .sm-nowrap>li>:not(ul) a{white-space:nowrap}.sm-dox{padding:0 10px;background-image:url("tab_b.png");line-height:36px}.sm-dox a span.sub-arrow{top:50%;margin-top:-2px;right:12px;width:0;height:0;border-width:4px;border-style:solid dashed dashed dashed;border-color:#283A5D transparent transparent transparent;background:transparent;border-radius:0}.sm-dox a,.sm-dox a:focus,.sm-dox a:active,.sm-dox a:hover,.sm-dox a.highlighted{padding:0px 12px;background-image:url("tab_s.png");background-repeat:no-repeat;background-position:right;border-radius:0 !important}.sm-dox a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:#fff;text-shadow:0px 1px 1px #000}.sm-dox a:hover span.sub-arrow{border-color:#fff transparent transparent transparent}.sm-dox a.has-submenu{padding-right:24px}.sm-dox li{border-top:0}.sm-dox>li>ul:before,.sm-dox>li>ul:after{content:'';position:absolute;top:-18px;left:30px;width:0;height:0;overflow:hidden;border-width:9px;border-style:dashed dashed solid dashed;border-color:transparent transparent #bbb transparent}.sm-dox>li>ul:after{top:-16px;left:31px;border-width:8px;border-color:transparent transparent #fff transparent}.sm-dox ul{border:1px solid #bbb;padding:5px 0;background:#fff;border-radius:5px !important;box-shadow:0 5px 9px rgba(0,0,0,0.2)}.sm-dox ul a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-color:transparent transparent transparent #555;border-style:dashed dashed dashed solid}.sm-dox ul a,.sm-dox ul a:hover,.sm-dox ul a:focus,.sm-dox ul a:active,.sm-dox ul a.highlighted{color:#555;background-image:none;border:0 !important;color:#555;background-image:none}.sm-dox ul a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:#fff;text-shadow:0px 1px 1px #000}.sm-dox ul a:hover span.sub-arrow{border-color:transparent transparent transparent #fff}.sm-dox span.scroll-up,.sm-dox span.scroll-down{position:absolute;display:none;visibility:hidden;overflow:hidden;background:#fff;height:36px}.sm-dox span.scroll-up:hover,.sm-dox span.scroll-down:hover{background:#eee}.sm-dox span.scroll-up:hover span.scroll-up-arrow,.sm-dox span.scroll-up:hover span.scroll-down-arrow{border-color:transparent transparent #D23600 transparent}.sm-dox span.scroll-down:hover span.scroll-down-arrow{border-color:#D23600 transparent transparent transparent}.sm-dox span.scroll-up-arrow,.sm-dox span.scroll-down-arrow{position:absolute;top:0;left:50%;margin-left:-6px;width:0;height:0;overflow:hidden;border-width:6px;border-style:dashed dashed solid dashed;border-color:transparent transparent #555 transparent}.sm-dox span.scroll-down-arrow{top:8px;border-style:solid dashed dashed dashed;border-color:#555 transparent transparent transparent}.sm-dox.sm-rtl a.has-submenu{padding-right:12px;padding-left:24px}.sm-dox.sm-rtl a span.sub-arrow{right:auto;left:12px}.sm-dox.sm-rtl.sm-vertical a.has-submenu{padding:10px 20px}.sm-dox.sm-rtl.sm-vertical a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-rtl>li>ul:before{left:auto;right:30px}.sm-dox.sm-rtl>li>ul:after{left:auto;right:31px}.sm-dox.sm-rtl ul a.has-submenu{padding:10px 20px !important}.sm-dox.sm-rtl ul a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-vertical{padding:10px 0;border-radius:5px}.sm-dox.sm-vertical a{padding:10px 20px}.sm-dox.sm-vertical a:hover,.sm-dox.sm-vertical a:focus,.sm-dox.sm-vertical a:active,.sm-dox.sm-vertical a.highlighted{background:#fff}.sm-dox.sm-vertical a.disabled{background-image:url("tab_b.png")}.sm-dox.sm-vertical a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-style:dashed dashed dashed solid;border-color:transparent transparent transparent #555}.sm-dox.sm-vertical>li>ul:before,.sm-dox.sm-vertical>li>ul:after{display:none}.sm-dox.sm-vertical ul a{padding:10px 20px}.sm-dox.sm-vertical ul a:hover,.sm-dox.sm-vertical ul a:focus,.sm-dox.sm-vertical ul a:active,.sm-dox.sm-vertical ul a.highlighted{background:#eee}.sm-dox.sm-vertical ul a.disabled{background:#fff}}