Login / Signup
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems.
Alper Atamtürk
Andrés Gómez
Simge Küçükyavuz
Published in:
Networks (2016)
Keyphrases
</>
network flow problem
fixed charge
minimum cost
capacity expansion
network flow
minimal cost
network design problem
mixed integer
np hard
fixed cost
transportation problem
lot sizing
mixed integer programming
search algorithm
total cost
endpoints
approximation algorithms
linear program