The symbolic constraint for Steiner arborescences. More...
#include <SteinerArborescence.h>
Classes | |
class | dfs_visitor |
Visitor for algorith boost::depth_first_search. More... | |
Public Member Functions | |
SteinerArborescence (Graph &G_, vertex_descriptor root_, std::list< vertex_descriptor > &terminals_, var_map< edge_descriptor > &VM_) | |
Constructor. | |
void | init (subproblem &S) |
status | standard_separation (subproblem &S) |
status | fast_separation (subproblem &S) |
status | feasible (solution &S) |
void | info () |
Definition at line 25 of file SteinerArborescence.h.
SteinerArborescence< Graph >::status SteinerArborescence::fast_separation | ( | subproblem & | S | ) | [inline, virtual] |
Separation function separating less constraints
Reimplemented from SCIL::sym_constraint.
Definition at line 462 of file SteinerArborescence.cc.
SteinerArborescence< Graph >::status SteinerArborescence::feasible | ( | solution & | S | ) | [inline, virtual] |
returns true if the induced graph is a Steiner arborescence
Reimplemented from SCIL::sym_constraint.
Definition at line 118 of file SteinerArborescence.cc.
References SCIL::subproblem::configuration(), and SCIL::solution::value().
void SteinerArborescence::info | ( | ) | [inline, virtual] |
Returns information on the symbolic constraints.
Reimplemented from SCIL::sym_constraint.
Definition at line 467 of file SteinerArborescence.cc.
void SteinerArborescence::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 SteinerArborescence.cc.
References SCIL::subproblem::add_basic_constraint(), and SCIL::subproblem::configuration().
SteinerArborescence< Graph >::status SteinerArborescence::standard_separation | ( | subproblem & | S | ) | [inline, virtual] |
The main separation function.
Reimplemented from SCIL::sym_constraint.
Definition at line 257 of file SteinerArborescence.cc.