62 const static std::string me_;
71 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 class LPEngine for solving LPs and getting solution.
Declare Presolver class for presolving.
Define the abstract base class Solver.
Declare important 'types' used in Minotaur.
Implement a generic branch-and-bound algorithm on a single cpu.
Definition: BranchAndBound.h:38
Definition: Environment.h:28
Definition: LPEngine.h:29
Definition: Presolver.h:39
virtual SolutionPtr getSolution()
get status of the last solve.
Definition: QG.h:53
~QG()
Destroy.
Definition: QG.cpp:67
int showInfo()
Display information.
Definition: QG.cpp:185
virtual int solve(ProblemPtr p)
Solve the problem.
Definition: QG.cpp:231
void showHelp() const
show help messages
Definition: QG.cpp:173
virtual SolveStatus getStatus()
get status of the last solve.
Definition: QG.h:50
double getLb()
Return the lower bound for the optimal value.
Definition: QG.h:59
double getUb()
Return the upper bound for the optimal value.
Definition: QG.h:56
QG(EnvPtr env)
Default constructor.
Definition: QG.cpp:55
Definition: Solution.h:30
Definition: ActiveNodeStore.h:20
SolveStatus
Different states an algorithm like branch-and-bound can be in.
Definition: Types.h:158