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/CbcHeuristicDivePseudoCost.hpp    | 60 ----------------------
 1 file changed, 60 deletions(-)
 delete mode 100644 build/Bonmin/include/coin/CbcHeuristicDivePseudoCost.hpp

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

diff --git a/build/Bonmin/include/coin/CbcHeuristicDivePseudoCost.hpp b/build/Bonmin/include/coin/CbcHeuristicDivePseudoCost.hpp
deleted file mode 100644
index 4f0dcb0..0000000
--- a/build/Bonmin/include/coin/CbcHeuristicDivePseudoCost.hpp
+++ /dev/null
@@ -1,60 +0,0 @@
-/* $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
-
-- 
cgit