Solution of a 200-Node p-Cycle Network Design Problem with GA-Based Pre-Selection of Candidate Structures.
Diane Prisca OnguetouWayne D. GroverPublished in: ICC (2009)
Keyphrases
- network design problem
- network flow problem
- mixed integer
- benders decomposition
- approximation algorithms
- network design
- mixed integer programming
- integer programming
- lagrangian relaxation
- branch and bound
- exact solution
- transportation networks
- feasible solution
- dynamic systems
- optimal solution
- network flow
- mathematical model