Branch-and-cut for linear programs with overlapping SOS1 constraints.
Tobias FischerMarc E. PfetschPublished in: Math. Program. Comput. (2018)
Keyphrases
- linear program
- semi infinite
- linear programming problems
- mixed integer
- linear programming
- linear inequalities
- integer program
- mixed integer program
- simplex method
- primal dual
- objective function
- stochastic programming
- optimal solution
- dynamic programming
- column generation
- interior point methods
- mixed integer linear program
- simplex algorithm
- np hard
- extreme points
- geometric constraints
- dual variables
- linear constraints
- convex functions
- feasible solution
- binary variables
- learning algorithm
- inventory routing