Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time.
Jana CslovjecsekFriedrich EisenbrandChristoph HunkenschröderLars RohwedderRobert WeismantelPublished in: SODA (2021)
Keyphrases
- strongly polynomial
- linear programming
- minimum cost flow
- linear program
- np hard
- shortest path
- primal dual
- objective function
- minimum cost
- integer programming
- interior point methods
- dynamic programming
- feasible solution
- bi objective
- worst case
- approximation algorithms
- neural network
- shortest path algorithm
- reinforcement learning
- algorithm for linear programming
- structured data
- optimal solution
- decision variables
- interior point
- clustering algorithm