Hybridizing two linear relaxation techniques in interval-based solvers
From MaRDI portal
Cites work
- A Deterministic Global Optimization Algorithm for Design Problems
- A general reliable quadratic form: An extension of affine arithmetic
- A polyhedral branch-and-cut approach to global optimization
- A reliable affine relaxation method for global optimization
- A rigorous global filtering algorithm for quadratic constraints
- Adaptive constructive interval disjunction: algorithms and experiments
- Affine arithmetic: concepts and applications
- An efficient and safe framework for solving optimization problems
- An improved interval linearization for solving nonlinear problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Benchmarking global optimization and constraint satisfaction codes
- Benchmarking optimization software with performance profiles.
- Branch-and-Bound interval global optimization on shared memory multiprocessors
- Branching and bounds tighteningtechniques for non-convex MINLP
- Constructive Interval Disjunction
- Contractor programming
- Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
- Enhancing numerical constraint propagation using multiple inclusion representations
- Extensions of affine arithmetic: application to unconstrained global optimization
- scientific article; zbMATH DE number 1408651 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems. 9th international conference, CPAIOR 2012, Nantes, France, May 28--June 1, 2012. Proceedings
- INTLAB implementation of an interval global optimization algorithm
- Rigorous global search: continuous problems
- Rigorous Lower and Upper Bounds in Linear Programming
- Safe bounds in linear and mixed-integer linear programming
- SCIP: solving constraint integer programs
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Upper bounding in inner regions for global optimization under inequality constraints
- Validated Linear Relaxations and Preprocessing: Some Experiments
This page was built for publication: Hybridizing two linear relaxation techniques in interval-based solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008135)
