Login / Signup
Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem.
Alper Atamtürk
Birce Tezel
Simge Küçükyavuz
Published in:
CoRR (2017)
Keyphrases
</>
network design problem
capacitated fixed charge
network flow problem
minimum cost
valid inequalities
minimal cost
shortest path
approximation algorithms
integer programming
distributed databases
endpoints
transportation networks