Heuristic Algorithms for Solving Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows.
Huynh Thi Thanh BinhPham Vu LongNguyen Ngoc DatNguyen Sy Thai HaPublished in: ICIC (1) (2012)
Keyphrases
- network design problem
- network flow problem
- network design
- approximation algorithms
- branch and bound
- mixed integer programming
- exact solution
- minimal cost
- mixed integer
- transportation networks
- integer programming
- combinatorial optimization
- lagrangian relaxation
- column generation
- integer program
- special case
- valid inequalities
- lp relaxation
- search algorithm
- search space
- lower bound
- worst case
- np hard