#include <cmath>#include <iomanip>#include <iostream>#include <fstream>#include <sstream>#include <string>#include "MinotaurConfig.h"#include "Branch.h"#include "BrCand.h"#include "BrVarCand.h"#include "CGraph.h"#include "CNode.h"#include "Constraint.h"#include "ConBoundMod.h"#include "Engine.h"#include "Environment.h"#include "Function.h"#include "Logger.h"#include "Node.h"#include "NonlinearFunction.h"#include "QuadraticFunction.h"#include "Objective.h"#include "Operations.h"#include "Option.h"#include "ProblemSize.h"#include "QGHandlerAdvance.h"#include "Relaxation.h"#include "Solution.h"#include "Timer.h"#include "SolutionPool.h"#include "VarBoundMod.h"#include "Variable.h"
Include dependency graph for QGHandlerAdvance.cpp:
Typedefs | |
| typedef std::vector< ConstraintPtr >::const_iterator | CCIter |
Detailed Description
\Briefly define a handler to enhance Quesada-Grossmann Algorithm by using schemes for adding extra linearization at different node of the branch-and-bound tree \Author Meenarli Sharma, Indian Institute of Technology Bombay