Pages that link to "Item:Q5698733"
From MaRDI portal
The following pages link to Efficient and Safe Global Constraints for Handling Numerical Constraint Systems (Q5698733):
Displayed 14 items.
- Finding all solutions of separable systems of piecewise-linear equations using integer programming (Q413729) (← links)
- Upper bounding in inner regions for global optimization under inequality constraints (Q486384) (← links)
- Reverse propagation of McCormick relaxations (Q496587) (← links)
- LP narrowing: A new strategy for finding all solutions of nonlinear equations (Q732502) (← links)
- Efficient task scheduling in the parallel result-verifying solution of nonlinear systems (Q811943) (← links)
- An efficient and safe framework for solving optimization problems (Q861905) (← links)
- Adaptive constructive interval disjunction: algorithms and experiments (Q903916) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- A rigorous global filtering algorithm for quadratic constraints (Q1774519) (← links)
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments (Q2022248) (← links)
- An efficient algorithm for finding all solutions of nonlinear equations using parallelogram LP test (Q2196050) (← links)
- Improving inter-block backtracking with interval Newton (Q2267807) (← links)
- A review of computation of mathematically rigorous bounds on optima of linear programs (Q2399497) (← links)
- Validated constraints solving --- practicalities, pitfalls, and new developments (Q2568645) (← links)