Minotaur 0.4.1
Docs for developers
SOS1Handler.h
Go to the documentation of this file.
1//
2// Minotaur -- It's only 1/2 bull
3//
4// (C)opyright 2008 - 2025 The Minotaur Team.
5//
6
15#ifndef MINOTAURSOS1HANDLER_H
16#define MINOTAURSOS1HANDLER_H
17
18#include "Handler.h"
19
20namespace Minotaur {
21
27class SOS1Handler : public Handler {
28public:
29
32
34 SOS1Handler(EnvPtr env, ProblemPtr problem);
35
38
39 // Does nothing.
40 void relaxInitFull(RelaxationPtr rel, SolutionPool *sp, bool *is_inf);
41
42 // Does nothing.
43 void relaxInitInc(RelaxationPtr rel, SolutionPool *sp, bool *is_inf);
44
45 // Does nothing.
46 void relaxNodeFull(NodePtr node, RelaxationPtr rel, bool *is_inf);
47
48 // Does nothing.
49 void relaxNodeInc(NodePtr node, RelaxationPtr rel, bool *is_inf);
50
51 // Check if solution is feasible.
52 bool isFeasible(ConstSolutionPtr sol, RelaxationPtr relaxation,
53 bool &should_prune, double &inf_meas);
54
57 CutManager *cutman, SolutionPoolPtr s_pool, ModVector &p_mods,
58 ModVector &r_mods, bool *sol_found, SeparationStatus *status);
59 // Base class method.
60 void getBranchingCandidates(RelaxationPtr rel, const DoubleVector &x,
61 ModVector & mods, BrVarCandSet &cands,
62 BrCandVector &gencands, bool & is_inf);
63
64 // Base class method.
65 ModificationPtr getBrMod(BrCandPtr cand, DoubleVector &x,
67
68 // Base class method.
69 Branches getBranches(BrCandPtr cand, DoubleVector & x,
70 RelaxationPtr rel, SolutionPoolPtr s_pool);
71
72 bool isGUB(SOS *sos);
73 bool isNeeded();
74
76 SolveStatus presolve(PreModQ *, bool *, Solution **) {return Finished;};
77
79 void postsolveGetX(const double *, UInt, DoubleVector *);
80
83 ModVector &)
84 {return false;};
85
86 // Write name
87 std::string getName() const;
88
89 void getNzNumSum_(SOSPtr sos, const DoubleVector x, int *nz,
90 double *nzsum);
91
93 void writePreStats(std::ostream &) const {};
94
96 double getTol() const;
97
99 void setTol(double tol);
100
101private:
103 EnvPtr env_;
104
106 LoggerPtr logger_;
107
109 static const std::string me_;
110
112 ProblemPtr problem_;
113
119 double zTol_;
120};
121typedef SOS1Handler* SOS1HandlerPtr;
122typedef const SOS1Handler* ConstSOS1HandlerPtr;
123}
124#endif
125
Define abstract base class for handlers of various kinds.
Base class for describing candidates for branching on a node in branch-and-bound.
Definition: BrCand.h:32
Abstract base class to manage cuts in the relaxation.
Definition: CutManager.h:42
Definition: Environment.h:28
Base class for handling specific types of constraints or objective.
Definition: Handler.h:49
Definition: Logger.h:37
Definition: Modification.h:29
Definition: Node.h:54
Definition: Problem.h:74
Definition: Relaxation.h:53
Definition: SOS1Handler.h:27
SolveStatus presolve(PreModQ *, bool *, Solution **)
Presolve. Do not do any presolving.
Definition: SOS1Handler.h:76
Branches getBranches(BrCandPtr cand, DoubleVector &x, RelaxationPtr rel, SolutionPoolPtr s_pool)
Return branches for branching.
Definition: SOS1Handler.cpp:98
void separate(ConstSolutionPtr sol, NodePtr node, RelaxationPtr rel, CutManager *cutman, SolutionPoolPtr s_pool, ModVector &p_mods, ModVector &r_mods, bool *sol_found, SeparationStatus *status)
Empty method as we do not do any separation in SOS1.
Definition: SOS1Handler.cpp:393
~SOS1Handler()
Destroy.
Definition: SOS1Handler.cpp:54
SOS1Handler()
Default constructor.
void relaxNodeFull(NodePtr node, RelaxationPtr rel, bool *is_inf)
Create a relaxation for a node, building from scratch.
Definition: SOS1Handler.cpp:381
double getTol() const
Return the integer tolerance.
Definition: SOS1Handler.cpp:295
bool isFeasible(ConstSolutionPtr sol, RelaxationPtr relaxation, bool &should_prune, double &inf_meas)
Check if a solution is feasible.
Definition: SOS1Handler.cpp:63
void writePreStats(std::ostream &) const
Does nothing.
Definition: SOS1Handler.h:93
std::string getName() const
Return the name of the handler.
Definition: SOS1Handler.cpp:272
void postsolveGetX(const double *, UInt, DoubleVector *)
Does nothing.
void getBranchingCandidates(RelaxationPtr rel, const DoubleVector &x, ModVector &mods, BrVarCandSet &cands, BrCandVector &gencands, bool &is_inf)
find branching candidates.
Definition: SOS1Handler.cpp:163
void relaxInitInc(RelaxationPtr rel, SolutionPool *sp, bool *is_inf)
Create root relaxation if doing incremental node relaxations.
Definition: SOS1Handler.cpp:375
bool isNeeded()
Return true if this handler is needed for the problem.
Definition: SOS1Handler.cpp:349
void relaxInitFull(RelaxationPtr rel, SolutionPool *sp, bool *is_inf)
Create root relaxation if doing full node relaxations.
Definition: SOS1Handler.cpp:369
void relaxNodeInc(NodePtr node, RelaxationPtr rel, bool *is_inf)
Create an incremental relaxation for a node.
Definition: SOS1Handler.cpp:387
void setTol(double tol)
Set the integer tolerance.
Definition: SOS1Handler.cpp:401
bool presolveNode(RelaxationPtr, NodePtr, SolutionPoolPtr, ModVector &, ModVector &)
Does nothing.
Definition: SOS1Handler.h:82
ModificationPtr getBrMod(BrCandPtr cand, DoubleVector &x, RelaxationPtr rel, BranchDirection dir)
Get the modifcation that creates a given (up or down) branch.
Definition: SOS1Handler.cpp:248
Definition: SOS.h:23
Definition: SolutionPool.h:28
Definition: Solution.h:30
Definition: ActiveNodeStore.h:20
BranchDirection
Two directions for branching.
Definition: Types.h:201
unsigned int UInt
Unsigned integer.
Definition: Types.h:30
SeparationStatus
Status from separation routine:
Definition: Types.h:217
SolveStatus
Different states an algorithm like branch-and-bound can be in.
Definition: Types.h:158

Minotaur source code documented by Doxygen 1.9.4 on Thu Apr 24 2025