From 4b64cf486f5c999fd8167758cae27839f3b50848 Mon Sep 17 00:00:00 2001
From: Harpreet
Date: Sat, 3 Sep 2016 00:34:27 +0530
Subject: Structure updated and intqpipopt files added

---
 .../include/coin/BonHeuristicDiveMIPFractional.hpp | 67 ----------------------
 1 file changed, 67 deletions(-)
 delete mode 100644 build/Bonmin/include/coin/BonHeuristicDiveMIPFractional.hpp

(limited to 'build/Bonmin/include/coin/BonHeuristicDiveMIPFractional.hpp')

diff --git a/build/Bonmin/include/coin/BonHeuristicDiveMIPFractional.hpp b/build/Bonmin/include/coin/BonHeuristicDiveMIPFractional.hpp
deleted file mode 100644
index dae7b3f..0000000
--- a/build/Bonmin/include/coin/BonHeuristicDiveMIPFractional.hpp
+++ /dev/null
@@ -1,67 +0,0 @@
-// 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 BonHeuristicDiveMIPFractional_H
-#define BonHeuristicDiveMIPFractional_H
-
-#include "BonBonminSetup.hpp"
-#include "BonHeuristicDiveMIP.hpp"
-
-/** DiveMIPFractional class
- */
-
-namespace Bonmin
-{
-  class HeuristicDiveMIPFractional : public HeuristicDiveMIP {
-  public:
-    /// Default Constructor 
-    HeuristicDiveMIPFractional ();
-
-    /// Constructor with setup
-    HeuristicDiveMIPFractional(BonminSetup * setup);
-
-    /// Copy constructor
-    HeuristicDiveMIPFractional(const HeuristicDiveMIPFractional &copy);
-
-    /// Destructor
-    ~HeuristicDiveMIPFractional() {}
-
-    /// Assignment operator
-    HeuristicDiveMIPFractional & operator=(const HeuristicDiveMIPFractional & rhs);
-
-    /// Clone
-    virtual CbcHeuristic * clone() const;
-
-    /** Change setup used for heuristic.*/
-    virtual void setSetup(BonminSetup * setup){
-      HeuristicDiveMIP::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);
-
-  };
-}
-#endif
-- 
cgit