A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems.
Christopher Thomas RyanRobert L. SmithMarina A. EpelmanPublished in: SIAM J. Optim. (2018)
Keyphrases
- simplex method
- network flow problem
- fixed charge
- linear programming
- network design problem
- linear program
- mixed integer
- network flow
- valid inequalities
- linear fractional
- minimum cost
- np hard
- minimal cost
- approximation algorithms
- transportation problem
- column generation
- primal dual
- integer programming
- network design
- linear programming problems
- mixed integer programming
- simplex algorithm
- branch and bound
- feasible solution
- convergence rate
- optimal solution
- objective function
- interior point methods
- transportation networks
- integer program
- semidefinite programming
- lower bound
- lp relaxation
- cutting plane
- lagrangian relaxation
- branch and bound algorithm
- capacity expansion
- lot sizing
- knapsack problem