Cbc  2.9.9
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
CbcSolverLongThin.hpp
Go to the documentation of this file.
1 // $Id: CbcSolverLongThin.hpp 1574 2011-01-05 01:13:55Z lou $
2 // Copyright (C) 2004, International Business Machines
3 // Corporation and others. All Rights Reserved.
4 // This code is licensed under the terms of the Eclipse Public License (EPL).
5 
6 
7 #ifndef CbcSolverLongThin_H
8 #define CbcSolverLongThin_H
9 
11 class CbcModel;
12 //#############################################################################
13 
20 
21 public:
22  //---------------------------------------------------------------------------
25  virtual void initialSolve();
27 
29  virtual void resolve();
30 
32 
33 
38 
40  virtual OsiSolverInterface * clone(bool CopyData=true) const;
41 
44 
47 
49  virtual ~CbcSolverLongThin ();
50 
52 
53 
56  void initialize(CbcModel * model, const char * keep);
59  inline const int * when() const
60  { return node_;}
62  inline int getMemory() const
63  { return memory_;}
65  inline int getCount() const
66  { return count_;}
68  inline void setMemory(int value)
69  { memory_=value;}
71  inline void setBelieveInfeasible(bool yesNo)
72  { believeInfeasible_=yesNo;}
74  inline void setAlgorithm(int value)
75  { algorithm_=value;}
77  inline void setNested(double value)
78  { nestedSearch_=value;}
80  inline int getAlgorithm() const
81  { return algorithm_;}
83  inline double getNested() const
84  { return nestedSearch_;}
86 
87  //---------------------------------------------------------------------------
88 
89 private:
90 
93  double nestedSearch_;
96  int * node_;
98  int * howMany_;
102  int count_;
104  int memory_;
110 };
111 
112 #endif
bool algorithm_
If 0 nothing, 1 compress and fix, 2 long thin.
int * node_
Node number when variable last in problem.
CbcSolverLongThin()
Default Constructor.
void setAlgorithm(int value)
Say whether to just count usage.
virtual void resolve()
Resolve an LP relaxation after problem modification.
const int * when() const
get which ones have been used
int * howMany_
How many times in problem.
Clp Solver Interface.
void setBelieveInfeasible(bool yesNo)
Say whether to believe infeasible.
virtual ~CbcSolverLongThin()
Destructor.
CbcSolverLongThin & operator=(const CbcSolverLongThin &rhs)
Assignment operator.
Abstract Base Class for describing an interface to a solver.
double getNested() const
Do nested search if this fraction fixed.
int getCount() const
Get current count.
This is to allow the user to replace initialSolve and resolve.
double nestedSearch_
Do nested search if this fraction fixed.
virtual OsiSolverInterface * clone(bool CopyData=true) const
Clone.
void setMemory(int value)
Set memory (i.e. how recent use should be)
int getAlgorithm() const
Say whether to just count usage.
void setNested(double value)
Do nested search if this fraction fixed.
bool believeInfeasible_
If infeasible on subset means infeasible.
int memory_
How recently it must have been used.
void initialize(CbcModel *model, const char *keep)
Setup arrays - ones in keep will always be in.
CbcModel * model_
Pointer back to model.
Simple Branch and bound class.
Definition: CbcModel.hpp:101
int getMemory() const
Get memory (i.e. how recent use should be)
virtual void initialSolve()
Solve initial LP relaxation.