A branch-and-cut algorithm for solving an intraring synchronous optical network design problem.
Youngho LeeHanif D. SheraliJunghee HanSeong-in KimPublished in: Networks (2000)
Keyphrases
- dynamic programming
- network flow problem
- np hard
- network design problem
- computational complexity
- combinatorial optimization
- benchmark problems
- knapsack problem
- cost function
- expectation maximization
- convergence rate
- particle swarm optimization
- linear programming
- solution quality
- lp relaxation
- minimal cost
- worst case