A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
From MaRDI portal
Publication:1304752
Recommendations
- A global optimization algorithm for linear fractional and bilinear programs
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
- A finite algorithm for concave minimization over a polyhedron
- scientific article; zbMATH DE number 2146951
Cited in
(45)- Tight convex relaxations for the expansion planning problem
- Alternative branching rules for some nonconvex problems
- Convergent upper bounds in global minimization with nonlinear equality constraints
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- A technique to derive the analytical form of convex envelopes for some bivariate functions
- Multivariate McCormick relaxations
- A sixth bibliography of fractional programming
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- A review of recent advances in global optimization
- Extended reverse-convex programming: an approximate enumeration approach to global optimization
- Mathematical programming formulations for the alternating current optimal power flow problem
- Mathematical programming formulations for the alternating current optimal power flow problem
- Theoretical and computational results about optimality-based domain reductions
- A geometric branch and bound method for robust maximization of convex functions
- Convex envelopes for ray-concave functions
- A new two-level linear relaxed bound method for geometric programming problems
- Improve-and-branch algorithm for the global optimization of nonconvex NLP problems
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- Global optimization problems and domain reduction strategies
- Interval constraint programming for globally solving catalog-based categorical optimization
- Safe and tight linear estimators for global optimization
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem
- Domain reduction techniques for global NLP and MINLP optimization
- Non polyhedral convex envelopes for 1-convex functions
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- Design of planar articulated mechanisms using branch and bound
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- Time-optimal velocity planning by a bound-tightening technique
- General convex relaxations of implicit functions and inverse functions
- Three enhancements for optimization-based bound tightening
- Convex envelopes of bivariate functions through the solution of KKT systems
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- Identification of mechanical properties of arteries with certification of global optimality
- On the Performance of NLP Solvers Within Global MINLP Solvers
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- Solving linear programs with complementarity constraints using branch-and-cut
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- A polyhedral branch-and-cut approach to global optimization
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- On convex envelopes for bivariate functions over polytopes
- A comparison of alternative models for solving a non-linear single plant hydro unit commitment problem
- Preface
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
This page was built for publication: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304752)
