Minotaur 0.4.1
Docs for developers
|
Define class for Quesada-Grossmann (QG) algorithm for solving MINLPs. More...
#include "QG.h"
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <ostream>
#include "AMPLHessian.h"
#include "AMPLInterface.h"
#include "AMPLJacobian.h"
#include "EngineFactory.h"
#include "Environment.h"
#include "FixVarsHeur.h"
#include "Handler.h"
#include "HybridBrancher.h"
#include "IntVarHandler.h"
#include "LPEngine.h"
#include "LexicoBrancher.h"
#include "LinearHandler.h"
#include "Logger.h"
#include "MaxVioBrancher.h"
#include "MinotaurConfig.h"
#include "NLPEngine.h"
#include "NlPresHandler.h"
#include "NodeIncRelaxer.h"
#include "Objective.h"
#include "Option.h"
#include "PCBProcessor.h"
#include "Presolver.h"
#include "Problem.h"
#include "QGHandler.h"
#include "QPEngine.h"
#include "RCHandler.h"
#include "Reader.h"
#include "ReliabilityBrancher.h"
#include "SamplingHeur.h"
#include "TransSep.h"
#include "Types.h"
Define class for Quesada-Grossmann (QG) algorithm for solving MINLPs.