Global optimization and constraint satisfaction: the branch-and-reduce approach
From MaRDI portal
(Redirected from Publication:5897037)
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- A branch-and-reduce approach to global optimization
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- BARON: A general purpose global optimization software package
- A reduced space branch and bound algorithm for global optimization.
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
Cited in
(23)- Global optimization and constraint satisfaction. First international workshop on global constraint optimization and constraint satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2--4, 2002. Revised selected papers
- Domain reduction techniques for global NLP and MINLP optimization
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch-and-reduce approach to global optimization
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Tuning BARON using derivative-free optimization algorithms
- Facets of a mixed-integer bilinear covering set with bounds on variables
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- Strategic robust supply chain design based on the Pareto-optimal tradeoff between efficiency and risk
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization
- scientific article; zbMATH DE number 4035581 (Why is no real title available?)
- scientific article; zbMATH DE number 1795205 (Why is no real title available?)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Deletion presolve for accelerating infeasibility diagnosis in optimization models
- Global propagation of side constraints for solving over-constrained problems
- Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
- Solving continuous and discrete nonlinear programs with BARON
- Efficient interval partitioning for constrained global optimization
This page was built for publication: Global optimization and constraint satisfaction: the branch-and-reduce approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897037)
