|
Minotaur 0.4.1
Docs for developers
|
The class for solving nonconvex problems using multistart Branch-and-estimate heuristic. More...
#include <iomanip>#include <iostream>#include <sys/time.h>#include "MinotaurConfig.h"#include "BndProcessor.h"#include "BranchAndBound.h"#include "EngineFactory.h"#include "Environment.h"#include "IntVarHandler.h"#include "LexicoBrancher.h"#include "LinearHandler.h"#include "LinFeasPump.h"#include "Logger.h"#include "LPEngine.h"#include "MaxFreqBrancher.h"#include "MaxVioBrancher.h"#include "MINLPDiving.h"#include "MsProcessor.h"#include "MultiStart.h"#include "NLPEngine.h"#include "NlPresHandler.h"#include "NodeIncRelaxer.h"#include "Objective.h"#include "Option.h"#include "PCBProcessor.h"#include "Presolver.h"#include "ProblemSize.h"#include "QPEngine.h"#include "Problem.h"#include "RandomBrancher.h"#include "Relaxation.h"#include "ReliabilityBrancher.h"#include "Solution.h"#include "SOS1Handler.h"#include "SOS2Handler.h"#include "Timer.h"#include "TreeManager.h"#include "AMPLHessian.h"#include "AMPLInterface.h"#include "AMPLJacobian.h"
Functions | |
| void | writeSol (EnvPtr env, VarVector *orig_v, PresolverPtr pres, SolutionPtr sol, SolveStatus status, MINOTAUR_AMPL::AMPLInterface *iface) |
| double | getWallTime () |
The class for solving nonconvex problems using multistart Branch-and-estimate heuristic.