|
Minotaur 0.4.1
Docs for developers
|
The main function for solving instances in ampl format (.nl) by using a parallel implementation of Advanced Quesada-Grossmann (QG) algorithm for solving convex MINLPs. More...
#include "QGPar.h"#include <iomanip>#include <iostream>#include "AMPLHessian.h"#include "AMPLInterface.h"#include "AMPLJacobian.h"#include "MinotaurConfig.h"#include "EngineFactory.h"#include "Environment.h"#include "FixVarsHeur.h"#include "IntVarHandler.h"#include "LexicoBrancher.h"#include "LinearHandler.h"#include "LinFeasPump.h"#include "LinearFunction.h"#include "Logger.h"#include "LPEngine.h"#include "MaxFreqBrancher.h"#include "MaxVioBrancher.h"#include "ParMINLPDiving.h"#include "NLPEngine.h"#include "NlPresHandler.h"#include "Node.h"#include "NodeRelaxer.h"#include "Objective.h"#include "Option.h"#include "ParNodeIncRelaxer.h"#include "ParPCBProcessor.h"#include "ParQGBranchAndBound.h"#include "Presolver.h"#include "ProblemSize.h"#include "Problem.h"#include "QPEngine.h"#include "RandomBrancher.h"#include "RCHandler.h"#include "Relaxation.h"#include "ReliabilityBrancher.h"#include "ParReliabilityBrancher.h"#include "SamplingHeur.h"#include "Solution.h"#include "SOS1Handler.h"#include "SOS2Handler.h"#include "ParQGHandlerAdvance.h"#include "Timer.h"
The main function for solving instances in ampl format (.nl) by using a parallel implementation of Advanced Quesada-Grossmann (QG) algorithm for solving convex MINLPs.