20#include "ParReliabilityBrancher.h"
63 const static std::string me_;
74 HandlerVector handlersCopy[],
75 EnginePtr eCopy[],
int proc_rank,
int num_procs);
78 void setInitialOptions_();
79 void writeNLPStats_(std::string name, std::vector<double> stats);
80 void writeDistParBnbStatus_(
DistParBranchAndBound *parbab,
double wallTimeStart, clock_t clockTimeStart);
Declare the AMPLInterface class fo reading problems from AMPL.
Declare the distributed memory parallel branch-and-bound-algorithm.
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.
Definition BnbDistPar.h:29
~BnbDistPar()
Destroy.
Definition BnbDistPar.cpp:83
virtual int solve(ProblemPtr p)
Solve the problem.
Definition BnbDistPar.cpp:436
int showInfo()
Display information.
Definition BnbDistPar.cpp:193
double getLb()
Return the lower bound for the optimal value.
Definition BnbDistPar.h:60
double getUb()
Return the upper bound for the optimal value.
Definition BnbDistPar.h:57
virtual SolutionPtr getSolution()
get status of the last solve.
Definition BnbDistPar.h:54
virtual SolveStatus getStatus()
get status of the last solve.
Definition BnbDistPar.h:51
void showHelp() const
show help messages
Definition BnbDistPar.cpp:179
A brancher is used to find suitable branches for a given node. e.g. LexicoBrancher....
Definition Brancher.h:33
Implement a generic parallel branch-and-bound algorithm on a multicore cpu.
Definition DistParBranchAndBound.h:48
Definition Environment.h:28
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