20#include "ParReliabilityBrancher.h"
63 const static std::string me_;
74 HandlerVector handlersCopy[],
78 void setInitialOptions_();
79 void writeNLPStats_(std::string name, std::vector<double> stats);
80 void writeParBnbStatus_(
ParBranchAndBound *parbab,
double wallTimeStart, clock_t clockTimeStart);
Declare the AMPLInterface class fo reading problems from AMPL.
Declare the class LPEngine for solving LPs and getting solution.
Declare the default branch-and-bound-algorithm.
Declare Presolver class for presolving.
Define the abstract base class Solver.
Declare important 'types' used in Minotaur.
double getUb()
Return the upper bound for the optimal value.
Definition BnbPar.h:57
~BnbPar()
Destroy.
Definition BnbPar.cpp:81
virtual SolutionPtr getSol()
get status of the last solve.
Definition BnbPar.h:54
virtual int solve(ProblemPtr p)
Solve the problem.
Definition BnbPar.cpp:418
double getLb()
Return the lower bound for the optimal value.
Definition BnbPar.h:60
int showInfo()
Display information.
Definition BnbPar.cpp:185
void showHelp() const
show help messages
Definition BnbPar.cpp:171
virtual SolveStatus getStatus()
get status of the last solve.
Definition BnbPar.h:51
A brancher is used to find suitable branches for a given node. e.g. LexicoBrancher....
Definition Brancher.h:33
Definition Environment.h:28
Implement a generic parallel branch-and-bound algorithm on a multicore cpu.
Definition ParBranchAndBound.h:48
Definition ParNodeIncRelaxer.h:32
Default node processor used in solver for now.
Definition ParPCBProcessor.h:47
Definition Presolver.h:39
Definition Relaxation.h:53
Definition ActiveNodeStore.h:20
unsigned int UInt
Unsigned integer.
Definition Types.h:30
SolveStatus
Different states an algorithm like branch-and-bound can be in.
Definition Types.h:158