20#include "ParReliabilityBrancher.h"
26 typedef SolutionPool* SolutionPoolPtr;
65 const static std::string me_;
80 HandlerVector handlersCopy[],
85 void setInitialOptions_();
86 void writeLPStats_(std::string name, std::vector<double> stats);
87 void writeNLPStats_(std::string name, std::vector<double> stats);
89 void writeParBnbStatus_(
ParQGBranchAndBound *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 the default branch-and-bound-algorithm.
Declare Presolver class for presolving.
Define the abstract base class Solver.
Declare important 'types' used in Minotaur.
A brancher is used to find suitable branches for a given node. e.g. LexicoBrancher....
Definition Brancher.h:33
Definition Environment.h:28
Definition ParNodeIncRelaxer.h:32
Default node processor used in solver for now.
Definition ParPCBProcessor.h:47
Implement a generic parallel branch-and-bound algorithm on a multicore cpu.
Definition ParQGBranchAndBound.h:48
Definition Presolver.h:39
void showHelp() const
show help messages
Definition QGPar.cpp:174
virtual SolutionPtr getSol()
get status of the last solve.
Definition QGPar.h:56
int showInfo()
Display information.
Definition QGPar.cpp:187
~QGPar()
Destroy.
Definition QGPar.cpp:84
virtual SolveStatus getStatus()
get status of the last solve.
Definition QGPar.h:53
virtual int solve(ProblemPtr p)
Solve the problem.
Definition QGPar.cpp:400
double getLb()
Return the lower bound for the optimal value.
Definition QGPar.h:62
double getUb()
Return the upper bound for the optimal value.
Definition QGPar.h:59
Definition Relaxation.h:53
Definition SolutionPool.h:28
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