Pages that link to "Item:Q4120313"
From MaRDI portal
The following pages link to Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems (Q4120313):
Displaying 16 items.
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- Reformulation in mathematical programming: An application to quantum chemistry (Q1025997) (← links)
- Chebyshev model arithmetic for factorable functions (Q1675562) (← links)
- Global optimization in Hilbert space (Q1717227) (← links)
- Global solution of semi-infinite programs (Q1780954) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Probabilistic Partial Set Covering with an Oracle for Chance Constraints (Q4629339) (← links)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
