12 #ifndef BonSubMipSolver_HPP 13 #define BonSubMipSolver_HPP 21 class CbcStrategyDefault;
26 class RegisteredOptions;
52 return integerSolution_;
84 double maxTime,
const OsiCuts & cs);
107 return iterationCount_;
125 double * integerSolution_;
127 CbcStrategyDefault * strategy_;
bool optimal()
returns optimality status.
(C) Copyright International Business Machines Corporation 2007
SubMipSolver(BabSetupBase &b, const std::string &prefix)
Constructor.
void optimize(double cutoff, int loglevel, double maxTime)
update cutoff and optimize MIP.
void setStrategy(CbcStrategyDefault *strategy)
Assign a strategy.
void solve(double cutoff, int loglevel, double maxTime)
static void registerOptions(Ipopt::SmartPtr< Bonmin::RegisteredOptions > roptions)
Register options for that Oa based cut generation method.
int iterationCount()
Returns number of simplex iterations in last solve.
A very simple class to provide a common interface for solving MIPs with Cplex and Cbc.
const double * getLastSolution()
get the solution found in last local search (return NULL if no solution).
void find_good_sol(double cutoff, int loglevel, double maxTime)
update cutoff and perform a local search to a good solution.
A class to have all elements necessary to setup a branch-and-bound.
OsiSolverInterface * solver()
int nodeCount()
Returns number of nodes in last solve.
void optimize_with_lazy_constraints(double cutoff, int loglevel, double maxTime, const OsiCuts &cs)
update cutoff, put OA constraints in cs as lazy constraints and optimize MIP.
void setLpSolver(OsiSolverInterface *lp)
Assign lp solver.
double lowBound()
Returns lower bound.