14#ifndef MINOTAURSPPHEUR_H
15#define MINOTAURSPPHEUR_H
32 std::deque<Variable *> vq0;
33 ConstraintConstIterator cit;
34 std::deque<Constraint *> cq;
66 static const std::string me_;
75 ConstraintVector cv2_;
77 std::deque<SppHeurMods *> mstack_;
78 std::deque<Variable *> vq_;
87 void sortVars_(VarVector &vvec);
96 bool isFeasible_(
const double* x);
98 bool propVal_(
VariablePtr v,
int &num0,
int &consfixed);
99 bool propEnum_(
Variable* v, ConstraintConstIterator cit2, VarSetConstIter vit2);
Define abstract base class for heuristics of various kinds.
Declare important 'types' used in Minotaur.
Definition: Environment.h:28
Definition: Heuristic.h:30
Definition: Relaxation.h:53
Definition: SolutionPool.h:28
Definition: Solution.h:30
SppHeur(EnvPtr env, ProblemPtr p)
default constructor
Definition: SppHeur.cpp:35
void solveNode(ConstSolutionPtr sol, NodePtr node, RelaxationPtr rel, SolutionPoolPtr s_pool)
Use this heuristic.
Definition: SppHeur.cpp:109
void solve(NodePtr, RelaxationPtr, SolutionPoolPtr s_pool)
call to heuristic
Definition: SppHeur.cpp:79
void writeStats(std::ostream &out) const
writing the statistics to the logger
Definition: SppHeur.cpp:1031
~SppHeur()
default destructor
Definition: SppHeur.h:46
Definition: Variable.h:31
Definition: ActiveNodeStore.h:20
unsigned int UInt
Unsigned integer.
Definition: Types.h:30