PathHeurBoundsG< GView > Struct Template Reference
[Examples/TestsProgramming search heuristics for graph problems.]

Inherits Gecode::Graph::BoundsGraphs< GView >< GView >.

List of all members.

Detailed Description

template<class GView>
struct PathHeurBoundsG< GView >

GraphBounds class used for branching on a constrained path problem.

The heuristic is adapted from: Sparse heuristic from Pesant G, Gengreau M, Potvin J-Y and Rousseau J-M, "An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows", Transportation Science 32, 12-29 (1998). page 17. CPGraphSimplePathHeur2var

Definition at line 26 of file

Public Types

typedef GBD GraphBD

Public Member Functions

 PathHeurBoundsG (GView &g)
 The real branch method.
pair< bool, GBD * > branch (Branching *b)
void pesant_et_al ()
 as an example here is the code for the original heuristic (for outneighbours)

Member Typedef Documentation

template<class GView>
typedef GBD PathHeurBoundsG< GView >::GraphBD

Definition at line 27 of file

Constructor & Destructor Documentation

template<class GView>
PathHeurBoundsG< GView >::PathHeurBoundsG GView &  g  )  [inline]

The real branch method.

Definition at line 35 of file

Member Function Documentation

template<class GView>
pair<bool,GBD*> PathHeurBoundsG< GView >::branch Branching b  )  [inline]

Definition at line 36 of file

template<class GView>
void PathHeurBoundsG< GView >::pesant_et_al  )  [inline]

as an example here is the code for the original heuristic (for outneighbours)

Definition at line 130 of file

The documentation for this struct was generated from the following file: