Cited in
(69)- Reformulation and convex relaxation techniques for global optimization
- Set convergence of non-convex vector optimization problem with variable ordering structure
- Global optimization of minimum weight truss topology problems with stress, displacement, and local buckling constraints using branch‐and‐bound
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- The Convex Envelope of (n–1)-Convex Functions
- Geometric branch-and-bound methods for constrained global optimization problems
- Designing globally optimal delta-sigma modulator topologies via signomial programming
- Tighter McCormick relaxations through subgradient propagation
- Positive definiteness of Hermitian interval matrices
- Risk-averse traffic assignment with elastic demands: NCP formulation and solution method for assessing performance reliability
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Low order-value approach for solving var-constrained optimization problems
- On the functional form of convex underestimators for twice continuously differentiable functions
- scientific article; zbMATH DE number 1304342 (Why is no real title available?)
- Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in De Novo protein design
- Reformulations in Mathematical Programming: Definitions and Systematics
- Ab initio tertiary structure prediction of proteins
- A combinatorial approach for small and strong formulations of disjunctive constraints
- Dynamics of peptide folding: Transition states and reaction pathways of solvated and unsolvated tetra-alanine
- Feasible method for generalized semi-infinite programming
- scientific article; zbMATH DE number 2243098 (Why is no real title available?)
- Recent developments and trends in global optimization
- Fair transfer price and inventory holding policies in two-enterprise supply chains
- GGPECP
- NOA
- Delta Sigma
- RLT-POS
- ARGONAUT
- cyipopt
- MAiNGO
- pyDOE
- scientific article; zbMATH DE number 2068068 (Why is no real title available?)
- scientific article; zbMATH DE number 2068055 (Why is no real title available?)
- Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
- A reformulation framework for global optimization
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Global optimization of mixed-integer bilevel programming problems
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- Global optimization of linear hybrid systems with explicit transitions
- A nonlinear interval portfolio selection model and its application in banks
- Convergence rate of McCormick relaxations
- Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design
- A new class of hybrid global optimization algorithms for peptide structure prediction: integrated hybrids
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
- A fully explicit and unconditionally energy-stable scheme for Peng-Robinson VT flash calculation based on dynamic modeling
- Global optimization with nonlinear ordinary differential equations
- GOPS
- Rigorous enclosures of ellipsoids and directed Cholesky factorizations
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Complete solutions to general box-constrained global optimization problems
- Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Interval mathematics, algebraic equations and optimization
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
- scientific article; zbMATH DE number 1301595 (Why is no real title available?)
- scientific article; zbMATH DE number 1840376 (Why is no real title available?)
- scientific article; zbMATH DE number 6183015 (Why is no real title available?)
- A cover partitioning method for bound constrained global optimization
- A combined global and local search method to deal with constrained optimization for continuous tabu search
- Proof of convergence for a global optimization algorithm for problems with ordinary differential equations
- Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
- Novel formulations for the sequence selection problem in de novo protein design with flexible templates
- ENTMOOT
- Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Large-scale standard pooling problems with constrained pools and fixed demands
This page was built for software: alphaBB
