Bpp/Graph_problem
Min_cost_tension
Algorithm
C++
 
 
DESCRIPTION
 

This module provides basic algorithms for the minimum cost tension problem in graphs.

 
SOURCE FILES
 

This section allows you to access the C++ source files of the module.

 
PARENT MODULE
 

This module is part of Bpp/Graph_problem/Min_cost_tension.

 
INCLUDED FILES
 

The files listed below are included in the interface part of the module. So any module dependent of this module is also dependent of the files listed here.

  • <bpp/graph_problem/min_cost_tension/structure.hpp>

 
INTEGRATED NAMESPACES
 

The namespaces listed below are integrated in this module. That means any element declared in one of those namespaces can now be directly used by or from this module.

  • graphProblemMinCostTensionStructure

 
ALIASES
 

The aliases listed below are only used internally by the interface. They are here just to lighten the writing of certain declarations. Never use them, they are local to the interface and can not be used outside of it.

  • tdGraph = class prArcData,class prNodeData

  • tuGraph = prArcData,prNodeData

 
FUNCTIONS
 

Here are listed the functions provided by the module. To use one of them, you have to specify the namespace of the module.

 
CLASSES
 

Here are listed the classes provided by the module. To use one of them, you have to specify the namespace of the module.

 
clRestrictConstraintsAlgo
 
 
Declaration

template <tdGraph> class clRestrictConstraintsAlgo

 
Description

Represents an algorithm to restrict the tension capacity constraints upon the arcs of a graph. It is an abstract class.

 
Methods
 
clRestrictConstraintsAlgoI
 
 
Declaration

template <tdGraph> class clRestrictConstraintsAlgoI : public clRestrictConstraintsAlgo<tuGraph>

 
Description

Represents an algorithm to restrict the tension capacity constraints upon the arcs of a graph (method I).

 
Methods
 
clRestrictConstraintsAlgoII
 
 
Declaration

template <tdGraph> class clRestrictConstraintsAlgoII : public clRestrictConstraintsAlgo<tuGraph>

 
Description

Represents an algorithm to restrict the tension capacity constraints upon the arcs of a graph (method II).

 
Methods
 
clBinarySolver
 
 
Declaration

template <tdGraph> class clBinarySolver

 
Description

Represents a solver for the minimum cost tension problem in a graph. It is an abstract class. The cost functions of the arcs must be binary functions as defined by the clBinaryArcData class of the Structure module.

 
Types
  • type graphProblemMinCostTensionLinearSystem::clBinarySolveAlgoI<tuGraph> clDefaultSolver
    Type of the default solver (linear modeling, version I).

 
Methods
 
clConvexSolver
 
 
Declaration

template <tdGraph> class clConvexSolver

 
Description

Represents a solver for the minimum cost tension problem in a graph. It is an abstract class. The cost functions of the arcs must be convex functions as defined by the clConvexArcData1 or clConvexArcData2 class of the Structure module.

 
Types
  • type graphProblemMinCostTensionConformingConvex::clSolveAlgoIII<tuGraph> clDefaultSolver
    Type of the default solver (conforming method, version III).

 
Methods
 
clDiscreteSolver
 
 
Declaration

template <tdGraph> class clDiscreteSolver

 
Description

Represents a solver for the minimum cost discrete tension problem in a graph. It is an abstract class. The cost functions of the arcs must be linear functions as defined by the clDiscreteArcData class of the Structure module.

 
Types
  • type graphProblemMinCostTensionLinearSystem::clDiscreteSolveAlgoI<tuGraph> clDefaultSolver
    Type of the default solver (linear modeling, version I).

 
Methods
 
clLinearSolver
 
 
Declaration

template <tdGraph> class clLinearSolver

 
Description

Represents a solver for the minimum cost tension problem in a graph. It is an abstract class. The cost functions of the arcs must be linear functions as defined by the clLinearArcData class of the Structure module.

 
Types
  • type graphProblemMinCostTensionDualCostScaling::clSolveAlgo<tuGraph> clDefaultSolver
    Type of the default solver (dual cost scaling method).

 
Methods
 
clPiecewiseSolver
 
 
Declaration

template <tdGraph> class clPiecewiseSolver

 
Description

Represents a solver for the minimum cost tension problem in a graph. It is an abstract class. The cost functions of the arcs must be piecewise functions as defined by the clPiecewiseArcData class of the Structure module.

 
Types
  • type graphProblemMinCostTensionConformingPiecewise::clSolveAlgo<tuGraph> clDefaultSolver
    Type of the default solver (conforming method).

 
Methods
 
 
Copyright (c) 1999-2016 - Bruno Bachelet - bruno@nawouak.net - http://www.nawouak.net
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation. See this license for more details (http://www.gnu.org).