48 virtual std::string getAbout();
63 const static std::string me_;
71 int getEngine_(
Engine **e);
74 void setInitialOptions_();
Declare the AMPLInterface class fo reading problems from AMPL.
Declare the BranchAndBound class for branch-and-bound-algorithm, BabStats class for statistics and Ba...
Declare the base class Brancher for finding and creating branches in Branch-and-Bound.
Declare Presolver class for presolving.
Declare the base class Modification.
Define the abstract base class Solver.
Declare important 'types' used in Minotaur.
int showInfo()
Display information.
Definition Bnb.cpp:418
void showHelp() const
show help messages
Definition Bnb.cpp:407
double getUb()
Return the upper bound for the optimal value.
virtual SolveStatus getStatus()
get status of the last solve.
Definition Bnb.cpp:338
virtual SolutionPtr getSol()
get solution of the last solve.
Definition Bnb.cpp:333
~Bnb()
Destroy.
Definition Bnb.cpp:68
virtual int solve(ProblemPtr p)
Solve the problem.
Definition Bnb.cpp:457
double getLb()
Return the lower bound for the optimal value.
Implement a generic branch-and-bound algorithm on a single cpu.
Definition BranchAndBound.h:38
A brancher is used to find suitable branches for a given node. e.g. LexicoBrancher....
Definition Brancher.h:33
Definition Environment.h:28
Definition Presolver.h:39
Definition ActiveNodeStore.h:20
SolveStatus
Different states an algorithm like branch-and-bound can be in.
Definition Types.h:158