Bpp/Graph_problem Min_cost_tension Heuristic_binary | C++ |
|  |
This module provides heuristics to solve the minimum cost tension problem with binary costs, as defined by the clBinaryArcData class of the Structure module. 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 clSolveAlgo : public clBinarySolver<tuGraph>
Represents an algorithm to solve the minimum binary cost tension problem in a graph using a heuristic approach. It is an abstract class. template <tdGraph> class clGreedyAlgoI : public clSolveAlgo<tuGraph>
Represents an algorithm to solve the minimum binary cost tension problem in a graph using a greedy heuristic based on linear programming (approach I). template <tdGraph> inline clGreedyAlgoI<tuGraph>::clGreedyAlgoI(void) Builds an algorithm to solve the minimum cost tension problem.
template <tdGraph> inline clGreedyAlgoI<tuGraph>::~clGreedyAlgoI(void) Destructs the algorithm.
template <tdGraph> inline tyInteger clGreedyAlgoI<tuGraph>::run(clGraph<tuGraph> & agGraph) const Solves the minimum cost tension problem of a graph, with default parameters to tune the heuristic.
template <tdGraph> inline tyInteger clGreedyAlgoI<tuGraph>::run(clGraph<tuGraph> & agGraph,const cpBinarySolver & agBinarySolver,tyReal agThreshold,tyBoolean agOnesFixed,tyBoolean agCycleScoreUsed) const Solves the minimum cost tension problem of a graph. Several parameters must be specified to tune the heuristic: a binary solver to use to get the linear model, a threshold (default 0.005) to decide when a variable must be fixed and two booleans (default false and false ) to indicate the fixing strategy (whether or not fixing the variables when equal to one, whether or not using scores based on the cycle topology to intervene in the fixing policy).
template <tdGraph> tyInteger clGreedyAlgoI<tuGraph>::run(clGraph<tuGraph> & agGraph,clTensionSystem & agSystem,tyReal agThreshold,tyBoolean agOnesFixed,tyBoolean agCycleScoreUsed) const Solves the minimum cost tension problem of a graph. Several parameters must be specified to tune the heuristic: a linear model of the problem, a threshold (default 0.005) to decide when a variable must be fixed and two booleans (default false and false ) to indicate the fixing strategy (whether or not fixing the variables when equal to one, whether or not using scores based on the cycle topology to intervene in the fixing policy). The linear model will be modified during the process.
template <tdGraph> class clGreedyAlgoII : public clSolveAlgo<tuGraph>
Represents an algorithm to solve the minimum binary cost tension problem in a graph using a greedy heuristic based on linear programming (approach II). template <tdGraph> class clLagrangeanAlgo : public clSolveAlgo<tuGraph>
Represents an algorithm to solve the minimum binary cost tension problem in a graph using greedy heuristic II of the module and a Lagrangean relaxation of the problem. | | 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). |
|
| |