LP extreme points and cuts for the fixed-charge network design problem.
Anantaram BalakrishnanPublished in: Math. Program. (1987)
Keyphrases
- extreme points
- network design problem
- network flow problem
- valid inequalities
- feasible solution
- linear program
- mixed integer
- convex hull
- linear programming
- optimal solution
- lp relaxation
- lagrangian relaxation
- column generation
- minimal cost
- mixed integer programming
- branch and bound
- finite number
- primal dual
- network design
- approximation algorithms
- integer programming
- transportation networks
- objective function
- integer program
- dynamic programming
- interior point methods
- tabu search
- np hard
- mathematical model
- cutting plane
- traveling salesman problem
- convex sets
- search algorithm
- state space
- branch and bound algorithm
- scheduling problem