Originally posted by: DeyeTao
Thank you very much.
You are just right. I used the CPLEX to solve the ILP problem. I am sorry to post my question on the wrong forum.
But I wanna to further describe my model. It aims to solve the routing and spectrum allocation problem in a network. Given a network graph with N nodes and E edges, as well as some traffic demand with respective bandwidth demand and certain destination. Now we need to compute the path to the destination node and allocate the spectrum to each path to satisfy the requirement. Of course, my model includes some more complex conditions, but the crucial point is that I wrote above. So on each link, we should allocate some spectrum for each traffic, which should subject to spectrum continuity meaning spectrum allocated continuous, for example 1..3. To compute the path from source node to destination node, the nodes should subject to flow constraint meaning for each node, the input flow must equal to the output flow except for the source node and destination node. There are also some other constraints and I just not list each of them here.
I do not know whether I describe the question well. I wonder whether the running time of the software is relative to the number of variables and number of constraints? And if I use more constraints to limit the variables, the time would be decreased or increased? I mean which is better, the constraints is strict or loose?
Thank you very much again!
#CPOptimizer#DecisionOptimization