Pages that link to "Item:Q1762890"
From MaRDI portal
The following pages link to Reformulation and convex relaxation techniques for global optimization (Q1762890):
Displayed 12 items.
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\) (Q2093276) (← links)
- Convexity and level sets for interval-valued fuzzy sets (Q2096665) (← links)
- Cutting ellipses from area-minimizing rectangles (Q2250089) (← links)
- Deterministic global optimization in ab-initio quantum chemistry (Q2392771) (← links)
- Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
- The Kissing Number Problem: A New Result from Global Optimization (Q3439154) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- Constraint reformulations for set point optimization problems using fuzzy cognitive map models (Q6053732) (← links)
- Efficient separation of RLT cuts for implicit and explicit bilinear products (Q6085984) (← links)
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs (Q6166099) (← links)