From a0d9443af147e949c1e6a01ac24749d12593ec5b Mon Sep 17 00:00:00 2001 From: Harpreet Date: Sat, 3 Sep 2016 00:36:51 +0530 Subject: cbcintlinprog added --- .../thirdparty/linux/include/coin/BonCbcNode.hpp | 133 --------------------- 1 file changed, 133 deletions(-) delete mode 100644 newstructure/thirdparty/linux/include/coin/BonCbcNode.hpp (limited to 'newstructure/thirdparty/linux/include/coin/BonCbcNode.hpp') diff --git a/newstructure/thirdparty/linux/include/coin/BonCbcNode.hpp b/newstructure/thirdparty/linux/include/coin/BonCbcNode.hpp deleted file mode 100644 index 9594124..0000000 --- a/newstructure/thirdparty/linux/include/coin/BonCbcNode.hpp +++ /dev/null @@ -1,133 +0,0 @@ -// (C) Copyright International Business Machines Corporation and Carnegie Mellon University 2006 -// All Rights Reserved. -// This code is published under the Eclipse Public License. -// -// Authors : -// John J. Forrest, International Business Machines Corporation -// Pierre Bonami, Carnegie Mellon University, -// -// Date : 03/15/2006 - -#ifndef BonminCbcNode_H -#define BonminCbcNode_H - -#include "CbcNode.hpp" -#include "BonRegisteredOptions.hpp" - - -namespace Bonmin -{ - /** \brief Holds information for recreating a subproblem by incremental change - from the parent for Bonmin - - A BonminBonminCbcPartialNodeInfo object contains changes to the bounds and basis, and - additional cuts, required to recreate a subproblem by modifying and - augmenting the parent subproblem. - */ - - class BonCbcFullNodeInfo : public CbcFullNodeInfo - { - - public: - friend class BonCbcPartialNodeInfo; - // Default Constructor - BonCbcFullNodeInfo (); - - // Constructor from current state - BonCbcFullNodeInfo (CbcModel * model, int numberRowsAtContinuous); - - // Copy constructor - BonCbcFullNodeInfo ( const BonCbcFullNodeInfo &); - - // Destructor - ~BonCbcFullNodeInfo (); - - /// Clone - virtual CbcNodeInfo * clone() const; - - /**Method called when all direct sons have been explored to flush - useless warm start information.*/ - virtual void allBranchesGone(); - - /** Number of consecutive infeasible parents only recorded if node is infeasible*/ - inline int getSequenceOfInfeasiblesSize() - { - return sequenceOfInfeasiblesSize_; - } - /** Number of consecutive unsolved parents only recorded if node is infeasible*/ - inline int getSequenceOfUnsolvedSize() - { - return sequenceOfUnsolvedSize_; - } - /** Register all the options for class instance.*/ - static void registerOptions(Ipopt::SmartPtr roptions); - - private: - /* Data values */ - /** Number of consecutive infeasible parents only recorded if node is infeasible*/ - int sequenceOfInfeasiblesSize_; - /** Number of consecutive unsolved parents only recorded if node is infeasible*/ - int sequenceOfUnsolvedSize_; - private: - - /// Illegal Assignment operator - BonCbcFullNodeInfo & operator=(const BonCbcFullNodeInfo& rhs); - }; - - /** \brief Holds information for recreating a subproblem by incremental change - from the parent for - - A BonminCbcPartialNodeInfo object contains changes to the bounds and basis, and - additional cuts, required to recreate a subproblem by modifying and - augmenting the parent subproblem. - */ - - class BonCbcPartialNodeInfo : public CbcPartialNodeInfo - { - - public: - // Default Constructor - BonCbcPartialNodeInfo (); - - // Constructor from current state - BonCbcPartialNodeInfo (CbcModel * model, CbcNodeInfo * parent, CbcNode * owner, - int numberChangedBounds,const int * variables, - const double * boundChanges, - const CoinWarmStartDiff *basisDiff) ; - - // Copy constructor - BonCbcPartialNodeInfo ( const BonCbcPartialNodeInfo &); - - // Destructor - ~BonCbcPartialNodeInfo (); - - /// Clone - virtual CbcNodeInfo * clone() const; - - /**Method called when all direct sons have been explored to flush - useless warm start information.*/ - virtual void allBranchesGone(); - - /** Number of consecutive infeasible parents only recorded if node is infeasible*/ - inline int getSequenceOfInfeasiblesSize() - { - return sequenceOfInfeasiblesSize_; - } - /** Number of consecutive unsolved parents only recorded if node is infeasible*/ - inline int getSequenceOfUnsolvedSize() - { - return sequenceOfUnsolvedSize_; - } - private: - /* Data values */ - /** Number of consecutive infeasible parents only recorded if node is infeasible*/ - int sequenceOfInfeasiblesSize_; - /** Number of consecutive unsolved parents only recorded if node is infeasible*/ - int sequenceOfUnsolvedSize_; - private: - - /// Illegal Assignment operator - BonCbcPartialNodeInfo & operator=(const Bonmin::BonCbcPartialNodeInfo& rhs); - }; -} -#endif -- cgit