Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming.
Alexandre MaréchalDavid MonniauxMichaël PérinPublished in: SAS (2017)
Keyphrases
- linear programming
- linear program
- linear arithmetic constraints
- memory efficient
- objective function
- extreme points
- constraint propagation
- highly scalable
- quadratic programming
- feasible solution
- lightweight
- convex polyhedra
- optimal solution
- column generation
- morphological operators
- primal dual
- convex sets
- dynamic programming
- convex functions
- neural network
- algorithm for linear programming
- interior point
- special case
- np hard
- databases
- line drawings
- graph cuts
- convex hull