Solving Integer Linear Programs with a Small Number of Global Variables and Constraints.
Pavel DvorákEduard EibenRobert GanianDusan KnopSebastian OrdyniakPublished in: CoRR (2017)
Keyphrases
- linear program
- linear programming problems
- mixed integer
- integer variables
- integer program
- linear relaxation
- small number
- mixed integer program
- linear programming
- binary variables
- simplex method
- dual variables
- semi infinite
- lp relaxation
- lagrange multipliers
- extreme points
- column generation
- primal dual
- constraint problems
- optimal solution
- linear inequalities
- objective function
- quadratic program
- interior point methods
- stochastic programming
- simplex algorithm
- decision variables
- cutting plane
- continuous variables
- feasible solution
- mixed integer linear program
- np hard
- branch and bound algorithm
- market equilibrium
- random variables
- constrained problems
- constraint satisfaction
- valid inequalities
- interior point
- quadratic programming
- convex optimization problems
- semidefinite programming
- constraint satisfaction problems
- convex functions
- evolutionary algorithm
- nonlinear programming