Global optimization problems and domain reduction strategies
From MaRDI portal
Publication:1960192
DOI10.1007/s10107-008-0263-4zbMath1198.90325OpenAlexW2092700130MaRDI QIDQ1960192
Alberto Caprara, Marco Locatelli
Publication date: 13 October 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0263-4
Related Items
Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations, Extended reverse-convex programming: an approximate enumeration approach to global optimization, Theoretical and computational results about optimality-based domain reductions, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Bound reduction using pairs of linear inequalities, A virtual microstructure generator for 3D stone masonry walls, Alternative branching rules for some nonconvex problems, On interval-subgradient and no-good cuts, A computational study on QP problems with general linear constraints, (Global) optimization: historical notes and recent developments, Domain reduction techniques for global NLP and MINLP optimization, Reduced RLT representations for nonconvex polynomial programming problems, An exploratory computational analysis of dual degeneracy in mixed-integer programming, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, Time-optimal velocity planning by a bound-tightening technique, Three enhancements for optimization-based bound tightening, Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns, Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems, Bidimensional packing by bilinear programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bidimensional packing by bilinear programming
- An analytical approach to global optimization
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- Packing equal circles in a square: A deterministic global optimization approach
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Introduction to global optimization
- A branch-and-reduce approach to global optimization
- BARON: A general purpose global optimization software package
- Integrals which are convex functionals. II
- Complete search in continuous global optimization and constraint satisfaction
- Maxima for Graphs and a New Proof of a Theorem of Turán
