| 
rootOfNameOfInputTrafficFiles: Default: multiHourDynamicRouting Root of the names of the traffic files. If the root is "XXX", the files are XXX_tm0.n2p, XXX_tm1.n2p, ...rootOfNameOfOutputFiles: Default: multiHourDynamicRouting Root of the names of the output files. One per input traffic file. If the root is "XXX", the files are XXX_res_tm0.n2p, XXX_res_tm1.n2p, ...k: Default: 5 Maximum number of admissible paths per demandshortestPathType: Value to select within {hops, km} Criteria to compute the shortest path. Valid values: 'hops' or 'km'optimizationTarget: Value to select within {min-av-num-hops, minimax-link-utilization, maximin-link-idle-capacity} Type of optimization target. Choose among minimize the average number of hops, minimize the highest link utilization, maximize the lowest link idle capacitygammaFactor: Default: 1.0E-5 Penalization factor to changing the routing of trafficmaxLengthInKm: Default: 2000.0 Paths longer than this are considered not admissible. A non-positive number means this limit does not existsolverName: Value to select within {glpk, ipopt, 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 constraintssolverLibraryName: 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) |