A Subdivision Approach to the Solution of Polynomial Constraints over Finite Domains Using the Modified Bernstein Form.
Federico BergentiStefania MonicaGianfranco RossiPublished in: AI*IA (2016)
Keyphrases
- closed form
- constraint programming
- finite number
- linear programming
- numerically stable
- polynomial equations
- optimization criteria
- mixed integer
- integer programming
- constraint satisfaction
- real world
- constrained optimization
- exact solution
- closed form solutions
- linear constraints
- soft constraints
- linear equations
- integer program
- application domains
- constraint solver
- inequality constraints
- mathematical model
- constrained minimization