|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--mascoptCplex.algos.digraph.TubesLP
Constructs a Linear Program for Traffic grooming in a network. This assumes that the demands have already been routed. The grooming phase then packs the wavelengths in multiple layers. It should be noted that the paths are provided as an input.
constructLP
Constructor Summary | |
TubesLP(DiGraph g,
Vector pathSet,
int num,
int[] capLayer,
int[][] costLayer)
The Default Constructor |
Method Summary | |
void |
constructLP()
The main function - constructs an LP for the traffic grooming, solves it and sets the costOfPipes field of the class. |
double |
getCostOfPipes()
The function returns the cost of the pipes in the solution |
TubeSet |
getTubes()
Returns an iterator over the Tubes found by the LP |
void |
writeTubesLP(boolean choice,
String filename)
Allow to write the linear program solved by cplex representing the tube problem |
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public TubesLP(DiGraph g, Vector pathSet, int num, int[] capLayer, int[][] costLayer)
g
- the Graph of the networkpathSet
- the paths found by the routingnum
- the number of layers for multiple layer groomingcapLayer
- capacity of layer k pipe in terms of layer k-1 pipescostLayer
- for cost parameters alpha and beta of each layerMethod Detail |
public void constructLP()
public double getCostOfPipes()
public TubeSet getTubes()
public void writeTubesLP(boolean choice, String filename)
choice
- true for writting otherwise falsefilename
- the name of the file to write
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |