V
 the vertex type the graphE
 the edge type of the graphpublic class AhujaOrlinSharmaCyclicExchangeLocalAugmentation<V,E> extends Object
lengthBound
, i.e the algorithm runs in exponential time.
This algorithm is used to detect valid cyclic exchanges in a cyclic exchange neighborhood for the Capacitated Minomum
Spanning Tree problem AhujaOrlinSharmaCapacitatedMinimumSpanningTree
AhujaOrlinSharmaCapacitatedMinimumSpanningTree
Constructor and Description 

AhujaOrlinSharmaCyclicExchangeLocalAugmentation(Graph<V,E> graph,
int lengthBound,
Map<V,Integer> labelMap,
boolean bestImprovement)
Constructs an algorithm with given inputs

Modifier and Type  Method and Description 

GraphWalk<V,E> 
getLocalAugmentationCycle()
Calculates a valid subsetdisjoint negative cycle.

public AhujaOrlinSharmaCyclicExchangeLocalAugmentation(Graph<V,E> graph, int lengthBound, Map<V,Integer> labelMap, boolean bestImprovement)
graph
 the directed graph on which to find the negative subset disjoint cycle. The vertices of the graph are labeled according to labelMap.lengthBound
 the (inclusive) upper bound for the length of cycles to detectlabelMap
 the labelMap of the vertices encoding the subsets of verticesbestImprovement
 contains whether the best or the first improvement is returned: best if true, first if falseCopyright © 2019. All rights reserved.