59 const static std::string me_;
66 int getEngine_(
Engine **e);
68 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.
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
Definition: MultiStart.h:29
double getLb()
Return the lower bound for the optimal value.
virtual int solve(ProblemPtr p)
Solve the problem.
Definition: MultiStart.cpp:447
void showHelp() const
show help messages
Definition: MultiStart.cpp:329
~MultiStart()
Destroy.
Definition: MultiStart.cpp:69
double getUb()
Return the upper bound for the optimal value.
virtual DoubleVector getSolution()
get solution of the last solve.
Definition: MultiStart.cpp:253
int showInfo()
Display information.
Definition: MultiStart.cpp:346
MultiStart(EnvPtr env)
Default constructor.
Definition: MultiStart.cpp:60
virtual SolveStatus getStatus()
get status of the last solve.
Definition: MultiStart.cpp:260
Definition: Presolver.h:39
Definition: ActiveNodeStore.h:20
SolveStatus
Different states an algorithm like branch-and-bound can be in.
Definition: Types.h:158