SCIL::STABLESET< Graph > Class Template Reference
The symbolic constraint for stable sets.
#include <stableset.h>
Public Member Functions | |
| STABLESET (Graph &G_, var_map< vertex_descriptor > &VM_) | |
| void | init (subproblem &S) |
| status | standard_separation (subproblem &S) |
| status | fast_separation (subproblem &S) |
| int | exactOddCycleSeparation (subproblem &S, int maxnum) |
| int | heuristicCliqueSeparation (subproblem &S, int maxnum) |
| status | feasible (solution &S) |
| void | info () |
Detailed Description
template<typename Graph>
class SCIL::STABLESET< Graph >
Definition at line 25 of file stableset.h.
Constructor & Destructor Documentation
| STABLESET::STABLESET | ( | Graph & | G_, | |
| var_map< vertex_descriptor > & | VM_ | |||
| ) | [inline] |
Ensures that the edges in X form a stable set.
Preconditions:
- The variables associated to the edges are binary.
Definition at line 15 of file stableset.cc.
Member Function Documentation
| int STABLESET::exactOddCycleSeparation | ( | subproblem & | S, | |
| int | maxnum | |||
| ) | [inline] |
Separates odd cycle constraints with an exact algorithm
Definition at line 57 of file stableset.cc.
References SCIL::subproblem::add_basic_constraint(), SCIL::subproblem::configuration(), SCIL::row::normalize(), and SCIL::subproblem::value().
Referenced by SCIL::STABLESET< Graph >::standard_separation().
| STABLESET< Graph >::status STABLESET::fast_separation | ( | subproblem & | S | ) | [inline, virtual] |
Separation function separating less contraints
Reimplemented from SCIL::sym_constraint.
Definition at line 346 of file stableset.cc.
References SCIL::subproblem::configuration(), and SCIL::STABLESET< Graph >::heuristicCliqueSeparation().
| STABLESET< Graph >::status STABLESET::feasible | ( | solution & | S | ) | [inline, virtual] |
Returns true if the induced graph is a matching
Reimplemented from SCIL::sym_constraint.
Definition at line 311 of file stableset.cc.
References SCIL::subproblem::configuration(), and SCIL::solution::value().
| int STABLESET::heuristicCliqueSeparation | ( | subproblem & | S, | |
| int | maxnum | |||
| ) | [inline] |
Separates clique constraints with a heuristic algorithm
Definition at line 246 of file stableset.cc.
References SCIL::subproblem::add_basic_constraint(), and SCIL::subproblem::value().
Referenced by SCIL::STABLESET< Graph >::fast_separation(), and SCIL::STABLESET< Graph >::standard_separation().
| void STABLESET::info | ( | ) | [inline, virtual] |
Returns information on the symbolic constraints.
Reimplemented from SCIL::sym_constraint.
Definition at line 357 of file stableset.cc.
| void STABLESET::init | ( | subproblem & | ) | [inline, virtual] |
This function is called before the first LP at the root of the BCP-tree is solved.
Reimplemented from SCIL::sym_constraint.
Definition at line 28 of file stableset.cc.
References SCIL::subproblem::add_basic_constraint(), and SCIL::subproblem::configuration().
| STABLESET< Graph >::status STABLESET::standard_separation | ( | subproblem & | S | ) | [inline, virtual] |
The main separation function
Reimplemented from SCIL::sym_constraint.
Definition at line 330 of file stableset.cc.
References SCIL::subproblem::configuration(), SCIL::STABLESET< Graph >::exactOddCycleSeparation(), and SCIL::STABLESET< Graph >::heuristicCliqueSeparation().
The documentation for this class was generated from the following files:
