V- the vertex type the graph
E- the edge type of the graph
public 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
|Constructor and Description|
Constructs an algorithm with given inputs
|Modifier and Type||Method and Description|
Calculates a valid subset-disjoint 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 detect
labelMap- the labelMap of the vertices encoding the subsets of vertices
bestImprovement- contains whether the best or the first improvement is returned: best if true, first if false
Copyright © 2019. All rights reserved.