summaryrefslogtreecommitdiff
path: root/thirdparty/linux/include/coin/BonHeuristicDiveVectorLength.hpp
diff options
context:
space:
mode:
Diffstat (limited to 'thirdparty/linux/include/coin/BonHeuristicDiveVectorLength.hpp')
-rw-r--r--thirdparty/linux/include/coin/BonHeuristicDiveVectorLength.hpp74
1 files changed, 74 insertions, 0 deletions
diff --git a/thirdparty/linux/include/coin/BonHeuristicDiveVectorLength.hpp b/thirdparty/linux/include/coin/BonHeuristicDiveVectorLength.hpp
new file mode 100644
index 0000000..90942a2
--- /dev/null
+++ b/thirdparty/linux/include/coin/BonHeuristicDiveVectorLength.hpp
@@ -0,0 +1,74 @@
+// Copyright (C) 2007, International Business Machines Corporation and others.
+// All Rights Reserved.
+// This code is published under the Eclipse Public License.
+//
+// Authors :
+// Joao P. Goncalves, International Business Machines Corporation
+//
+// Date : November 12, 2007
+
+#ifndef BonHeuristicDiveVectorLength_H
+#define BonHeuristicDiveVectorLength_H
+
+#include "BonBonminSetup.hpp"
+#include "BonHeuristicDive.hpp"
+
+/** DiveVectorLength class
+ */
+
+namespace Bonmin
+{
+ class HeuristicDiveVectorLength : public HeuristicDive {
+ public:
+ /// Default Constructor
+ HeuristicDiveVectorLength ();
+
+ /// Constructor with setup
+ HeuristicDiveVectorLength(BonminSetup * setup);
+
+ /// Copy constructor
+ HeuristicDiveVectorLength(const HeuristicDiveVectorLength &copy);
+
+ /// Destructor
+ ~HeuristicDiveVectorLength()
+ {
+ delete [] columnLength_;
+ }
+
+ /// Assignment operator
+ HeuristicDiveVectorLength & operator=(const HeuristicDiveVectorLength & rhs);
+
+ /// Clone
+ virtual CbcHeuristic * clone() const;
+
+ /** Change setup used for heuristic.*/
+ virtual void setSetup(BonminSetup * setup){
+ HeuristicDive::setSetup(setup);
+ Initialize(setup->options());
+ }
+
+ /// sets internal variables
+ virtual void setInternalVariables(TMINLP2TNLP* minlp);
+
+ /// Selects the next variable to branch on
+ /** If bestColumn = -1, it means that no variable was found
+ */
+ virtual void selectVariableToBranch(TMINLP2TNLP* minlp,
+ const vector<int> & integerColumns,
+ const double* newSolution,
+ int& bestColumn,
+ int& bestRound);
+
+ /** Register the options common to all local search based heuristics.*/
+ static void registerOptions(Ipopt::SmartPtr<Bonmin::RegisteredOptions> roptions);
+
+ /** Initiaize using passed options.*/
+ void Initialize(Ipopt::SmartPtr<Ipopt::OptionsList> options);
+
+ private:
+ /// the number of nonzero elements in each column
+ int* columnLength_;
+
+ };
+}
+#endif