Bpp/Graph_problem Min_cost_tension Linear_system | C++ |
|  |
This module provides facilities to solve the minimum cost tension problem in graphs using linear program modeling. This section allows you to access the C++ source files of the module. This module is part of Bpp/Graph_problem/Min_cost_tension . 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. 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. 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
Here are listed the classes provided by the module. To use one of them, you have to specify the namespace of the module. template <tdGraph> class clBinarySolveAlgo
Represents an algorithm to solve the minimum binary cost tension problem in a graph using a linear program modeling. It is an abstract class. The cost functions of the arcs in the graph must be binary as defined by the clBinaryArcData class of the Structure module. public_property virtual void buildLinearSystem(clTensionSystem & agSystem,clGraph<tuGraph> & agGraph) const Builds a linear program equivalent to the minimum cost tension problem of a graph. Abstract method.
public_property virtual tyInteger run(clGraph<tuGraph> & agGraph,ctTensionSystemSolver & agLinearSolver) const Solves the minimum cost tension problem of a graph using a given linear program solver. Abstract method.
public_property virtual void buildLagrangeanRelaxation(clTensionSystem & agSystem,clGraph<tuGraph> & agGraph,std_map(clArc<tuGraph> *,tyPairReal) & agCoefficientX) const Builds a Lagrangean relaxation of the linear program equivalent to the minimum binary cost tension problem of a graph. Lagrangean coefficients for the relaxed constraints must be given. Abstract method.
template <tdGraph> inline clBinarySolveAlgo<tuGraph>::clBinarySolveAlgo(void) Builds an algorithm to solve the minimum cost tension problem.
template <tdGraph> inline clBinarySolveAlgo<tuGraph>::~clBinarySolveAlgo(void) Destructs the algorithm.
template <tdGraph> inline tyInteger clBinarySolveAlgo<tuGraph>::run(clGraph<tuGraph> & agGraph) const Solves the minimum cost tension problem using the default linear program solver.
template <tdGraph> inline tyInteger clBinarySolveAlgo<tuGraph>::defaultRun(clGraph<tuGraph> & agGraph) Solves the minimum cost tension problem of a graph using the default version of the algorithm (modeling I) with the default linear program solver. Static method.
template <tdGraph> void clBinarySolveAlgo<tuGraph>::buildLinearRelaxation(clTensionSystem & agSystem,clGraph<tuGraph> & agGraph) const Builds a linear relaxation of the linear program equivalent to the minimum binary cost tension problem of a graph.
template <tdGraph> tyInteger clBinarySolveAlgo<tuGraph>::solveLinearRelaxation(clGraph<tuGraph> & agGraph,ctTensionSystemSolver & agLinearSolver,tyReal & agLowerBound) const Solves the linear relaxation of the minimum binary cost tension problem of a graph using a given linear program solver. A lower bound for the original problem can be collected.
template <tdGraph> tyInteger clBinarySolveAlgo<tuGraph>::solveLagrangeanRelaxation(clGraph<tuGraph> & agGraph,ctTensionSystemSolver & agLinearSolver,tyCardinal agMaxIteration,tyReal & agLowerBound) const Solves the Lagrangean relaxation of the minimum binary cost tension problem of a graph using a given linear program solver. The maximum number of iterations to solve the relaxation with the subgradient method must be given. A lower bound for the original problem can be collected.
template <tdGraph> tyInteger clBinarySolveAlgo<tuGraph>::solveLagrangeanRelaxation(clGraph<tuGraph> & agGraph,ctTensionSystemSolver & agLinearSolver,tyCardinal agMaxIteration,tyCardinal agBlockIteration,tyReal & agStep,tyReal & agLowerBound,std_map(clArc<tuGraph> *,tyPairReal) & agCoefficientX) const Solves the Lagrangean relaxation of the minimum binary cost tension problem of a graph using a given linear program solver. The maximum and per-block numbers of iterations to solve the relaxation with the subgradient method and its step must be given. A lower bound for the original problem can be collected. The starting Lagrangean coefficients must also be provided.
template <tdGraph> class clDiscreteSolveAlgo
Represents an algorithm to solve the minimum cost discrete tension problem in a graph using a linear program modeling. It is an abstract class. The cost functions of the arcs in the graph must be linear as defined by the clDiscreteArcData class of the Structure module. template <tdGraph> class clLinearSolveAlgo
Represents an algorithm to solve the minimum linear cost tension problem in a graph using a linear program modeling. It is an abstract class. The cost functions of the arcs in the graph must be linear as defined by the clLinearArcData class of the Structure module. template <tdGraph> class clBinarySolveAlgoI : public clBinarySolveAlgo<tuGraph>
Represents an algorithm to solve the minimum cost tension problem with binary costs in a graph using the linear program modeling I (using a cycle base). template <tdGraph> class clDiscreteSolveAlgoI : public clDiscreteSolveAlgo<tuGraph>
Represents an algorithm to solve the minimum cost discrete tension problem in a graph using the linear program modeling I (using a cycle base). template <tdGraph> class clLinearSolveAlgoI : public clLinearSolveAlgo<tuGraph>
Represents an algorithm to solve the minimum cost tension problem with linear costs in a graph using the linear program modeling I (using a cycle base). template <tdGraph> class clBinarySolveAlgoII : public clBinarySolveAlgo<tuGraph>
Represents an algorithm to solve the minimum cost tension problem with binary costs in a graph using the linear program modeling II (using the incidence matrix). template <tdGraph> class clDiscreteSolveAlgoII : public clDiscreteSolveAlgo<tuGraph>
Represents an algorithm to solve the minimum cost discrete tension problem in a graph using the linear program modeling II (using the incidence matrix). template <tdGraph> class clLinearSolveAlgoII : public clLinearSolveAlgo<tuGraph>
Represents an algorithm to solve the minimum cost tension problem with linear costs in a graph using the linear program modeling II (using a cycle base). template <tdGraph> class clLinearSolveAlgoIII : public clLinearSolveAlgo<tuGraph>
Represents an algorithm to solve the minimum linear cost tension problem with linear costs in a graph using the linear program modeling III (using the incidence matrix). | | 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). |
|
| |