mascoptCplex.algos.networks
Class RoutingCplexFlowCapacitySum
java.lang.Object
|
+--mascoptCplex.algos.networks.RoutingCplexFlowCapacityMax
|
+--mascoptCplex.algos.networks.RoutingCplexFlowCapacitySum
- public class RoutingCplexFlowCapacitySum
- extends RoutingCplexFlowCapacityMax
The RoutingCplexFlowCapacityMax class provides an algorithm to compute and
solve the problem of multi-flow with capacity. The algorithm solve the
problem with Cplex, so it use the NetworkCplexFlow object. In first, the
algorithm add to Cplex the constraints of capacity and the objective of
problem, then solve the problem with Cplex. The Objective is to minimize the
sum of the flow. Note that result represent the optimality or the
realisability of the problem.
Methods inherited from class mascoptCplex.algos.networks.RoutingCplexFlowCapacityMax |
addCapacity, averageFlow, getArcFlow, getChain, getPathSolution, getSingleChains, maxFlow, minFlow, printSolution, saveSolutionPath, solve, sumFlow, sumLengthPaths |
RoutingCplexFlowCapacitySum
public RoutingCplexFlowCapacitySum(NetworkCplexFlow f)
- constructor by recopy
objectiveRouting
public void objectiveRouting()
- Add the objective to the Cplex problem. The objective minimize the sum of
the flow.
- Overrides:
objectiveRouting
in class RoutingCplexFlowCapacityMax