summaryrefslogtreecommitdiff
path: root/build/Bonmin/include/coin/CbcHeuristicDivePseudoCost.hpp
diff options
context:
space:
mode:
authorHarpreet2016-08-04 15:25:44 +0530
committerHarpreet2016-08-04 15:25:44 +0530
commit9fd2976931c088dc523974afb901e96bad20f73c (patch)
tree22502de6e6988d5cd595290d11266f8432ad825b /build/Bonmin/include/coin/CbcHeuristicDivePseudoCost.hpp
downloadFOSSEE-Optim-toolbox-development-9fd2976931c088dc523974afb901e96bad20f73c.tar.gz
FOSSEE-Optim-toolbox-development-9fd2976931c088dc523974afb901e96bad20f73c.tar.bz2
FOSSEE-Optim-toolbox-development-9fd2976931c088dc523974afb901e96bad20f73c.zip
initial add
Diffstat (limited to 'build/Bonmin/include/coin/CbcHeuristicDivePseudoCost.hpp')
-rw-r--r--build/Bonmin/include/coin/CbcHeuristicDivePseudoCost.hpp60
1 files changed, 60 insertions, 0 deletions
diff --git a/build/Bonmin/include/coin/CbcHeuristicDivePseudoCost.hpp b/build/Bonmin/include/coin/CbcHeuristicDivePseudoCost.hpp
new file mode 100644
index 0000000..4f0dcb0
--- /dev/null
+++ b/build/Bonmin/include/coin/CbcHeuristicDivePseudoCost.hpp
@@ -0,0 +1,60 @@
+/* $Id: CbcHeuristicDivePseudoCost.hpp 1899 2013-04-09 18:12:08Z stefan $ */
+// Copyright (C) 2008, International Business Machines
+// Corporation and others. All Rights Reserved.
+// This code is licensed under the terms of the Eclipse Public License (EPL).
+
+#ifndef CbcHeuristicDivePseudoCost_H
+#define CbcHeuristicDivePseudoCost_H
+
+#include "CbcHeuristicDive.hpp"
+
+/** DivePseudoCost class
+ */
+
+class CbcHeuristicDivePseudoCost : public CbcHeuristicDive {
+public:
+
+ // Default Constructor
+ CbcHeuristicDivePseudoCost ();
+
+ // Constructor with model - assumed before cuts
+ CbcHeuristicDivePseudoCost (CbcModel & model);
+
+ // Copy constructor
+ CbcHeuristicDivePseudoCost ( const CbcHeuristicDivePseudoCost &);
+
+ // Destructor
+ ~CbcHeuristicDivePseudoCost ();
+
+ /// Clone
+ virtual CbcHeuristicDivePseudoCost * clone() const;
+
+ /// Assignment operator
+ CbcHeuristicDivePseudoCost & operator=(const CbcHeuristicDivePseudoCost& rhs);
+
+ /// Create C++ lines to get to current state
+ virtual void generateCpp( FILE * fp) ;
+
+ /// Selects the next variable to branch on
+ /** Returns true if all the fractional variables can be trivially
+ rounded. Returns false, if there is at least one fractional variable
+ that is not trivially roundable. In this case, the bestColumn
+ returned will not be trivially roundable.
+ */
+ virtual bool selectVariableToBranch(OsiSolverInterface* solver,
+ const double* newSolution,
+ int& bestColumn,
+ int& bestRound);
+ /** Initializes any data which is going to be used repeatedly
+ in selectVariableToBranch */
+ virtual void initializeData() ;
+ /// Fix other variables at bounds
+ virtual int fixOtherVariables(OsiSolverInterface * solver,
+ const double * solution,
+ PseudoReducedCost * candidate,
+ const double * random);
+
+};
+
+#endif
+