Bpp/Graph_problem
Min_cost_tension
Heuristic_binary
C++
 
 
DESCRIPTION
 

This module provides heuristics to solve the minimum cost tension problem with binary costs, as defined by the clBinaryArcData 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_tension/algorithm.hpp>

  • <bpp/graph_problem/min_cost_tension/linear_system.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 clBinarySolver<tuGraph>

 
Description

Represents an algorithm to solve the minimum binary cost tension problem in a graph using a heuristic approach. It is an abstract class.

 
Methods
 
clGreedyAlgoI
 
 
Declaration

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

 
Description

Represents an algorithm to solve the minimum binary cost tension problem in a graph using a greedy heuristic based on linear programming (approach I).

 
Types
  • type graphProblemMinCostTensionLinearSystem::clBinarySolveAlgo<tuGraph> cpBinarySolver
    Type of the binary solver used by the algorithm.

 
Methods
 
clGreedyAlgoII
 
 
Declaration

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

 
Description

Represents an algorithm to solve the minimum binary cost tension problem in a graph using a greedy heuristic based on linear programming (approach II).

 
Types
  • type graphProblemMinCostTensionLinearSystem::clBinarySolveAlgo<tuGraph> cpBinarySolver
    Type of the binary solver used by the algorithm.

 
Methods
 
clLagrangeanAlgo
 
 
Declaration

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

 
Description

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.

 
Types
  • type graphProblemMinCostTensionLinearSystem::clBinarySolveAlgo<tuGraph> cpBinarySolver
    Type of the binary solver used by the algorithm.

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