Combinatorial Losses through Generalized Gradients of Integer Linear Programs.
Xi GaoHan ZhangAliakbar PanahiTomasz ArodzPublished in: CoRR (2019)
Keyphrases
- linear program
- linear programming
- extreme points
- semi infinite
- optimal solution
- simplex method
- convex functions
- linear programming problems
- objective function
- multistage stochastic
- np hard
- linear inequalities
- mixed integer
- interior point methods
- stochastic programming
- nelder mead
- primal dual
- column generation
- simplex algorithm
- minimum cost flow
- strongly polynomial
- interior point
- quadratic program
- integer solution
- dynamic programming
- computational complexity
- feasible solution
- mixed integer linear program