Bpp/Graph_problem
Min_cost_tension
Dual_cost_scaling
C++
 
 
DESCRIPTION
 

This module implements an algorithm to solve the minimum cost tension problem in graphs with integer values. It solves a Lagrangian relaxation of the minimum cost tension problem, which is a minimum cost flow problem. The resolution is performed with the cost-scaling algorithm. The cost functions of the arcs are linear as defined by the clLinearArcData class of the Structure module.

 
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_flow.hpp>

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

  • <bpp/graph_problem/shortest_path.hpp>

  • <bpp/graph_problem/tension.hpp>

 
NEEDED FILES
 

The files listed below are needed by the implementation part of the module. But a module dependent of this module is not necessary dependent of the files listed here.

  • <bpp/modules.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.

  • graphProblemMinCostTensionAlgorithm

 
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

 
CLASSES
 

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

 
clSolveAlgo
 
 
Declaration

template <tdGraph> class clSolveAlgo : public clLinearSolver<tuGraph>

 
Description

Represents an algorithm to solve the minimum cost tension problem in a graph using the cost-scaling method on a dual minimum cost flow problem.

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