66 const static std::string me_;
75 void fwd2Bnb_(VarVector *orig_v);
80 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 NLPEngine Class for solving nonlinear problems using a nonlinear solver.
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
A brancher is used to find suitable branches for a given node. e.g. LexicoBrancher....
Definition: Brancher.h:33
Definition: Environment.h:28
virtual int solve(ProblemPtr p)
Solve the problem.
Definition: Glob.cpp:334
virtual DoubleVector getSolution()
get status of the last solve.
Definition: Glob.cpp:309
void showHelp() const
show help messages
Definition: Glob.cpp:510
double getUb()
Return the upper bound for the optimal value.
Glob(EnvPtr env)
Default constructor.
Definition: Glob.cpp:59
virtual SolveStatus getStatus()
get status of the last solve.
Definition: Glob.cpp:315
~Glob()
Destroy.
Definition: Glob.cpp:70
virtual SolutionPtr getSol()
get solution of the last solve
Definition: Glob.h:58
void doSetup()
Starting setup for glob.
Definition: Glob.cpp:77
int showInfo()
Display information.
Definition: Glob.cpp:523
double getLb()
Return the lower bound for the optimal value.
Definition: LPEngine.h:29
Definition: NLPEngine.h:37
Definition: Presolver.h:39
Definition: Solution.h:30
Definition: ActiveNodeStore.h:20
SolveStatus
Different states an algorithm like branch-and-bound can be in.
Definition: Types.h:158