Pages that link to "Item:Q1304752"
From MaRDI portal
The following pages link to A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms (Q1304752):
Displaying 45 items.
- Extended reverse-convex programming: an approximate enumeration approach to global optimization (Q288222) (← links)
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Non polyhedral convex envelopes for 1-convex functions (Q312465) (← links)
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes (Q524905) (← links)
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks (Q628648) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Time-optimal velocity planning by a bound-tightening technique (Q1753068) (← links)
- Convex envelopes of bivariate functions through the solution of KKT systems (Q1756774) (← links)
- Safe and tight linear estimators for global optimization (Q1774166) (← links)
- A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
- A polyhedral branch-and-cut approach to global optimization (Q1780949) (← links)
- Design of planar articulated mechanisms using branch and bound (Q1780959) (← links)
- Global optimization problems and domain reduction strategies (Q1960192) (← links)
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs (Q2010085) (← links)
- Convergent upper bounds in global minimization with nonlinear equality constraints (Q2020617) (← links)
- A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
- Identification of mechanical properties of arteries with certification of global optimality (Q2070372) (← links)
- Convex envelopes for ray-concave functions (Q2080818) (← links)
- An exploratory computational analysis of dual degeneracy in mixed-integer programming (Q2219511) (← links)
- A technique to derive the analytical form of convex envelopes for some bivariate functions (Q2250092) (← links)
- Multivariate McCormick relaxations (Q2250101) (← links)
- Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) (← links)
- Linear transformation based solution methods for non-convex mixed integer quadratic programs (Q2359405) (← links)
- On convex envelopes for bivariate functions over polytopes (Q2452372) (← links)
- Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (Q2494301) (← links)
- Tight convex relaxations for the expansion planning problem (Q2671451) (← links)
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
- Alternative branching rules for some nonconvex problems (Q2943824) (← links)
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex (Q2954391) (← links)
- A sixth bibliography of fractional programming (Q3426331) (← links)
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)
- On the Performance of NLP Solvers Within Global MINLP Solvers (Q4685828) (← links)
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
- Mathematical programming formulations for the alternating current optimal power flow problem (Q5918268) (← links)
- Mathematical programming formulations for the alternating current optimal power flow problem (Q5918757) (← links)
- Preface (Q5970730) (← links)
- General convex relaxations of implicit functions and inverse functions (Q6173953) (← links)
- Interval constraint programming for globally solving catalog-based categorical optimization (Q6541384) (← links)
- A comparison of alternative models for solving a non-linear single plant hydro unit commitment problem (Q6561239) (← links)
