New commodity representations for multicommodity network flow problems: An application to the fixed-charge network design problem.
Ahmad KazemiPierre Le BodicAndreas T. ErnstMohan KrishnamoorthyPublished in: CoRR (2021)
Keyphrases
- network flow problem
- network design problem
- fixed charge
- network design
- approximation algorithms
- minimal cost
- branch and bound
- mixed integer
- integer programming
- minimum cost
- mixed integer programming
- lagrangian relaxation
- transportation networks
- network architecture
- communication networks
- network flow
- feasible solution
- neural network
- valid inequalities
- np hard
- computational complexity