A cutting plane algorithm for the fixed charge problem.
Hamdy A. TahaPublished in: ACM Annual Conference (1973)
Keyphrases
- fixed charge
- cutting plane algorithm
- valid inequalities
- integer programming
- cutting plane
- transportation problem
- traveling salesman problem
- mixed integer programming
- linear programming
- convex hull
- lower and upper bounds
- mixed integer
- feasible solution
- column generation
- network design problem
- integer program
- primal dual
- linear program
- lagrangian relaxation
- continuous variables
- network design
- combinatorial optimization
- lp relaxation
- mathematical model
- production planning
- maximum margin
- constraint programming
- special case
- reinforcement learning
- training set
- lower bound