4 #include "OsiSolverInterface.hpp"
5 #include "CoinWarmStart.hpp"
21 const int varnum = vars.
size();
22 const int cutnum = cuts.
size();
25 const int num = std::max<int>(varnum, cutnum);
30 ind.unchecked_push_back(i);
37 for ( ; vi != lastvi; ++vi) {
41 p.
lp_solver->setColSetBounds(ind.begin(), ind.entry(varnum), bd.
begin());
46 for ( ; ci != lastci; ++ci) {
50 p.
lp_solver->setRowSetBounds(ind.begin(), ind.entry(cutnum), bd.
begin());
BCP_lp_node * node
Description he current search tree node.
void clear()
Delete every entry.
Abstract base class that defines members common to all types of cuts.
iterator begin()
Return an iterator to the beginning of the object.
This class is just a collection of pointers to cuts with a number of methods to manipulate these cuts...
void reserve(const size_t n)
Reallocate the object to make space for n entries.
BCP_lp_cut_pool * local_cut_pool
BCP_lp_user * user
A class that holds the methods about how to pack things.
BCP_warmstart * warmstart
bool rows_are_valid() const
OsiSolverInterface * lp_solver
A class that holds the methods about how to pack things.
void BCP_lp_create_lp(BCP_lp_prob &p)
virtual CoinWarmStart * convert_to_CoinWarmStart() const =0
Return an OsiWarmStart object that can be fed to the LP engine.
BCP_lp_var_pool * local_var_pool
void fint fint fint real fint real real real real real real real real real fint real fint fint fint real * ws
Abstract base class that defines members common to all types of variables.
size_t size() const
Return the current number of entries.
iterator end()
Return an iterator to the end of the object.
This class is just a collection of pointers to variables with a number of methods to manipulate these...
void unchecked_push_back(const_reference x)
Append x to the end of the vector.
bool cols_are_valid() const
virtual void load_problem(OsiSolverInterface &osi, BCP_problem_core *core, BCP_var_set &vars, BCP_cut_set &cuts)
Load the problem specified by core, vars, and cuts into the solver interface.