shortestPathType : Value to select within {hops, km} Criteria to compute the shortest path. Valid values: 'hops' or 'km'
alphaFairnessFactor : Default: 2.0 Fairness alpha factor
utilityFunctionType : Value to select within {alphaFairness, TCP-Reno, TCP-Vegas} The type of utility function of each demand, in the NUM problem to solve: standard alpha-fairness (alpha parameter is given by alphaFairnessFactor), an utility function suitable for TCP-Reno NUM model (each demand is a TCP connection) and the same for TCP-Vegas
solverName : Value to select within {ipopt, glpk, xpress, cplex} The solver name to be used by JOM. GLPK and IPOPT are free, XPRESS and CPLEX commercial. GLPK, XPRESS and CPLEX solve linear problems w/w.o integer contraints. IPOPT is can solve nonlinear problems (if convex, returns global optimum), but cannot handle integer constraints
solverLibraryName : Default: The solver library full or relative path, to be used by JOM. Leave blank to use JOM default.
maxSolverTimeInSeconds : Default: -1.0 Maximum time granted to the solver to solve the problem. If this time expires, the solver returns the best solution found so far (if a feasible solution is found)
|