Feasibility-Based Bounds Tightening via Fixed Points
From MaRDI portal
Publication:3066145
DOI10.1007/978-3-642-17458-2_7zbMath1311.90189OpenAlexW1506322549MaRDI QIDQ3066145
Pietro Belotti, Jon Lee, Sonia Cafieri, Leo Liberti
Publication date: 8 January 2011
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17458-2_7
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Optimal crashing of an activity network with disruptions, Bound reduction using pairs of linear inequalities, SUSPECT: MINLP special structure detector for Pyomo, On interval-subgradient and no-good cuts, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Presolving linear bilevel optimization problems, Computational advances in polynomial optimization: RAPOSa, a freely available global solver, Domain reduction techniques for global NLP and MINLP optimization, Two-row and two-column mixed-integer presolve using hashing-based pairing methods, SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework, Reverse propagation of McCormick relaxations, Three enhancements for optimization-based bound tightening, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, Optimization, Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns, Mathematical programming formulations for the alternating current optimal power flow problem, Mathematical programming formulations for the alternating current optimal power flow problem, AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization, An algorithm-independent measure of progress for linear constraint propagation, On generalized surrogate duality in mixed-integer nonlinear programming
Uses Software
