Pages that link to "Item:Q2897294"
From MaRDI portal
The following pages link to Perspective Reformulation and Applications (Q2897294):
Displaying 28 items.
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
- An improved formulation for the maximum coverage patrol routing problem (Q337517) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- A perspective-based convex relaxation for switched-affine optimal control (Q893481) (← links)
- An exact algorithm for a resource allocation problem in mobile wireless communications (Q1687306) (← links)
- Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints (Q1751215) (← links)
- On speed scaling via integer programming (Q1785426) (← links)
- Polyhedral approximation in mixed-integer convex optimization (Q1800994) (← links)
- A fast exact method for the capacitated facility location problem with differentiable convex production costs (Q2030454) (← links)
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
- Minimizing a sum of clipped convex functions (Q2228412) (← links)
- Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization (Q2231331) (← links)
- Bi-perspective functions for mixed-integer fractional programs with indicator variables (Q2235139) (← links)
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion (Q2241568) (← links)
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (Q2250087) (← links)
- Delay-constrained shortest paths: approximation algorithms and second-order cone models (Q2342143) (← links)
- Locally ideal formulations for piecewise linear functions with indicator variables (Q2450745) (← links)
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation (Q2664297) (← links)
- Perspective Reformulations of the CTA Problem with <i>L</i><sub>2</sub> Distances (Q2931708) (← links)
- Extended Formulations in Mixed-Integer Convex Programming (Q3186495) (← links)
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
- A Scalable Algorithm for Sparse Portfolio Selection (Q5087719) (← links)
- A computational study of perspective cuts (Q6062884) (← links)
- Complex portfolio selection via convex mixed‐integer quadratic programming: a survey (Q6070970) (← links)
- The p-hub centre routing problem with emissions budget: formulation and solution procedure (Q6164586) (← links)
