Login / Signup

Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem.

Alper AtamtürkSimge KüçükyavuzBirce Tezel
Published in: SIAM J. Optim. (2017)
Keyphrases
  • network design problem
  • capacitated fixed charge
  • network flow problem
  • minimum cost
  • shortest path
  • network design
  • neural network
  • minimal cost
  • genetic algorithm
  • special case
  • mixed integer programming