The Ring Spur Assignment Problem: New formulation, valid inequalities and a branch-and-cut approach.
Rahimeh Neamatian MonemiShahin GelarehPublished in: Comput. Oper. Res. (2017)
Keyphrases
- valid inequalities
- integer programming
- traveling salesman problem
- mixed integer
- linear programming
- cutting plane algorithm
- mixed integer programming
- linear programming relaxation
- convex hull
- integer programming formulation
- integer program
- feasible solution
- cutting plane
- lower and upper bounds
- randomly generated problems
- column generation
- mixed integer linear programs
- network design problem
- np hard
- primal dual
- lagrangian relaxation
- continuous variables
- lp relaxation
- mixed integer program
- network flow problem
- set partitioning
- lot sizing
- constraint programming
- maximum margin
- knapsack problem
- combinatorial optimization
- upper bound