Main Page   Class Hierarchy   Compound List   File List   Contact   Download   Symbolic Constraints   Examples  

SCIL::SteinerArborescence< Graph > Class Template Reference

The symbolic constraint for Steiner arborescences. More...

#include <SteinerArborescence.h>

Inheritance diagram for SCIL::SteinerArborescence< Graph >:
Inheritance graph
[legend]
Collaboration diagram for SCIL::SteinerArborescence< Graph >:
Collaboration graph
[legend]

List of all members.

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 ()

Detailed Description

template<typename Graph>
class SCIL::SteinerArborescence< Graph >

Examples:

Steiner_Arborescence.

Definition at line 25 of file SteinerArborescence.h.


Member Function Documentation

template<typename Graph >
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.

template<typename Graph >
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().

template<typename Graph >
void SteinerArborescence::info (  )  [inline, virtual]

Returns information on the symbolic constraints.

Reimplemented from SCIL::sym_constraint.

Definition at line 467 of file SteinerArborescence.cc.

template<typename Graph >
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().

template<typename Graph >
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.


The documentation for this class was generated from the following files:
Generated on Mon Mar 28 22:03:52 2011 for SCIL by  doxygen 1.6.3