New partial aggregations for multicommodity network flow problems: An application to the fixed-charge network design problem.
Ahmad KazemiPierre Le BodicAndreas T. ErnstMohan KrishnamoorthyPublished in: Comput. Oper. Res. (2021)
Keyphrases
- network flow problem
- network design problem
- fixed charge
- network design
- approximation algorithms
- branch and bound
- minimal cost
- mixed integer programming
- mixed integer
- transportation networks
- valid inequalities
- integer programming
- lagrangian relaxation
- minimum cost
- exact solution
- communication networks
- lower bound
- branch and bound algorithm
- feasible solution
- linear programming
- travel time
- genetic algorithm
- network architecture
- supply chain
- np hard
- search algorithm