A very simple class to provide a common interface for solving MIPs with Cplex and Cbc.
More...
#include <BonSubMipSolver.hpp>
|
| SubMipSolver (BabSetupBase &b, const std::string &prefix) |
| Constructor. More...
|
|
| SubMipSolver (const SubMipSolver ©) |
| Copy Constructor. More...
|
|
| ~SubMipSolver () |
|
void | setLpSolver (OsiSolverInterface *lp) |
| Assign lp solver. More...
|
|
void | setStrategy (CbcStrategyDefault *strategy) |
| Assign a strategy. More...
|
|
const double * | getLastSolution () |
| get the solution found in last local search (return NULL if no solution). More...
|
|
double | getLowerBound () |
|
void | solve (double cutoff, int loglevel, double maxTime) |
|
void | find_good_sol (double cutoff, int loglevel, double maxTime) |
| update cutoff and perform a local search to a good solution. More...
|
|
void | optimize (double cutoff, int loglevel, double maxTime) |
| update cutoff and optimize MIP. More...
|
|
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. More...
|
|
double | lowBound () |
| Returns lower bound. More...
|
|
bool | optimal () |
| returns optimality status. More...
|
|
int | nodeCount () |
| Returns number of nodes in last solve. More...
|
|
int | iterationCount () |
| Returns number of simplex iterations in last solve. More...
|
|
OsiSolverInterface * | solver () |
|
A very simple class to provide a common interface for solving MIPs with Cplex and Cbc.
Definition at line 29 of file BonSubMipSolver.hpp.
◆ MILP_solve_strategy
◆ SubMipSolver() [1/2]
Bonmin::SubMipSolver::SubMipSolver |
( |
BabSetupBase & |
b, |
|
|
const std::string & |
prefix |
|
) |
| |
◆ SubMipSolver() [2/2]
Bonmin::SubMipSolver::SubMipSolver |
( |
const SubMipSolver & |
copy | ) |
|
◆ ~SubMipSolver()
Bonmin::SubMipSolver::~SubMipSolver |
( |
| ) |
|
◆ setLpSolver()
◆ setStrategy()
void Bonmin::SubMipSolver::setStrategy |
( |
CbcStrategyDefault * |
strategy | ) |
|
◆ getLastSolution()
const double* Bonmin::SubMipSolver::getLastSolution |
( |
| ) |
|
|
inline |
get the solution found in last local search (return NULL if no solution).
Definition at line 50 of file BonSubMipSolver.hpp.
◆ getLowerBound()
double Bonmin::SubMipSolver::getLowerBound |
( |
| ) |
|
|
inline |
◆ solve()
void Bonmin::SubMipSolver::solve |
( |
double |
cutoff, |
|
|
int |
loglevel, |
|
|
double |
maxTime |
|
) |
| |
|
inline |
◆ find_good_sol()
void Bonmin::SubMipSolver::find_good_sol |
( |
double |
cutoff, |
|
|
int |
loglevel, |
|
|
double |
maxTime |
|
) |
| |
update cutoff and perform a local search to a good solution.
◆ optimize()
void Bonmin::SubMipSolver::optimize |
( |
double |
cutoff, |
|
|
int |
loglevel, |
|
|
double |
maxTime |
|
) |
| |
update cutoff and optimize MIP.
◆ optimize_with_lazy_constraints()
void Bonmin::SubMipSolver::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.
◆ lowBound()
double Bonmin::SubMipSolver::lowBound |
( |
| ) |
|
|
inline |
◆ optimal()
bool Bonmin::SubMipSolver::optimal |
( |
| ) |
|
|
inline |
◆ nodeCount()
int Bonmin::SubMipSolver::nodeCount |
( |
| ) |
|
|
inline |
◆ iterationCount()
int Bonmin::SubMipSolver::iterationCount |
( |
| ) |
|
|
inline |
◆ solver()
◆ registerOptions()
Register options for that Oa based cut generation method.
The documentation for this class was generated from the following file: