Bonmin  1.8.8
BonOACutGenerator2.hpp
Go to the documentation of this file.
1 // (C) Copyright Carnegie Mellon University 2005
2 // All Rights Reserved.
3 // This code is published under the Eclipse Public License.
4 //
5 // Authors :
6 // P. Bonami, Carnegie Mellon University
7 //
8 // Date : 05/26/2005
9 
10 
11 #ifndef BonOACutGenerator2_HPP
12 #define BonOACutGenerator2_HPP
13 #include "BonOaDecBase.hpp"
14 
15 namespace Bonmin
16 {
19  {
20  public:
23 
26  :
27  OaDecompositionBase(copy),
28  subMip_(new SubMipSolver (*copy.subMip_))
29  {}
32 
33  void setStrategy(const CbcStrategy & strategy)
34  {
35  parameters_.setStrategy(strategy);
36  }
37 
38  virtual CglCutGenerator * clone() const
39  {
40  return new OACutGenerator2(*this);
41  }
44 
45  protected:
47  virtual double performOa(OsiCuts & cs, solverManip &lpManip,
48  BabInfo * babInfo, double &cutoff, const CglTreeInfo & info) const;
50  virtual bool doLocalSearch(BabInfo * babInfo) const;
51 
52  private:
53  SubMipSolver * subMip_;
54  };
55 }
56 #endif
CglTreeInfo
Bonmin::OaDecompositionBase::parameters_
Parameters parameters_
Parameters.
Definition: BonOaDecBase.hpp:265
Bonmin::OACutGenerator2::OACutGenerator2
OACutGenerator2(BabSetupBase &b)
Constructor with basic setup.
Bonmin::OACutGenerator2
Class to perform OA in its classical form.
Definition: BonOACutGenerator2.hpp:19
Bonmin::OACutGenerator2::performOa
virtual double performOa(OsiCuts &cs, solverManip &lpManip, BabInfo *babInfo, double &cutoff, const CglTreeInfo &info) const
virtual method which performs the OA algorithm by modifying lp and nlp.
Bonmin
(C) Copyright International Business Machines Corporation 2007
Definition: BonAmplSetup.hpp:16
Bonmin::OACutGenerator2::OACutGenerator2
OACutGenerator2(const OACutGenerator2 &copy)
Copy constructor.
Definition: BonOACutGenerator2.hpp:25
Bonmin::BabSetupBase
A class to have all elements necessary to setup a branch-and-bound.
Definition: BonBabSetupBase.hpp:26
Bonmin::SubMipSolver
A very simple class to provide a common interface for solving MIPs with Cplex and Cbc.
Definition: BonSubMipSolver.hpp:30
Bonmin::OACutGenerator2::doLocalSearch
virtual bool doLocalSearch(BabInfo *babInfo) const
virutal method to decide if local search is performed
CglCutGenerator
Bonmin::BabInfo
Bonmin class for passing info between components of branch-and-cuts.
Definition: BonBabInfos.hpp:20
Ipopt::SmartPtr
Bonmin::OACutGenerator2::setStrategy
void setStrategy(const CbcStrategy &strategy)
Definition: BonOACutGenerator2.hpp:33
OsiCuts
Bonmin::OACutGenerator2::~OACutGenerator2
~OACutGenerator2()
Destructor.
Bonmin::OaDecompositionBase::Parameters::setStrategy
void setStrategy(const CbcStrategy &strategy)
Strategy to apply when using Cbc as MILP sub-solver.
Definition: BonOaDecBase.hpp:183
Bonmin::OaDecompositionBase
Base class for OA algorithms.
Definition: BonOaDecBase.hpp:28
Bonmin::OACutGenerator2::clone
virtual CglCutGenerator * clone() const
Definition: BonOACutGenerator2.hpp:38
Bonmin::OaDecompositionBase::solverManip
Small class to manipulatee various things in an OsiSolverInterface and restore them.
Definition: BonOaDecBase.hpp:35
Bonmin::OACutGenerator2::registerOptions
static void registerOptions(Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
Register OA options.
BonOaDecBase.hpp