Global optimization and constraint satisfaction: the branch-and-reduce approach
DOI10.1007/B94062zbMATH Open1255.90102OpenAlexW2624301280MaRDI QIDQ5897037FDOQ5897037
Publication date: 2 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94062
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cited In (20)
- Strategic robust supply chain design based on the Pareto-optimal tradeoff between efficiency and risk
- Title not available (Why is that?)
- Global propagation of side constraints for solving over-constrained problems
- 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
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- 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
- Efficient interval partitioning for constrained global optimization
- Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- 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
- Tuning BARON using derivative-free optimization algorithms
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Facets of a mixed-integer bilinear covering set with bounds on variables
- Title not available (Why is that?)
- Domain reduction techniques for global NLP and MINLP optimization
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
Uses Software
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)
