A multi-objective approach for solving the survivable network design problem with simultaneous unicast and anycast flows.
Huynh Thi Thanh BinhLam Thu BuiNguyen Sy Thai HaHisao IshibuchiPublished in: Appl. Soft Comput. (2014)
Keyphrases
- network design problem
- multi objective
- network flow problem
- network design
- approximation algorithms
- branch and bound
- mixed integer programming
- evolutionary algorithm
- minimal cost
- exact solution
- mixed integer
- transportation networks
- integer programming
- lagrangian relaxation
- lp relaxation
- valid inequalities
- upper bound
- objective function
- particle swarm optimization
- genetic algorithm
- multistage
- network architecture
- neural network
- traveling salesman problem
- combinatorial optimization
- linear programming
- worst case
- scheduling problem