Pages that link to "Item:Q5429254"

The following pages link to Cuts for Conic Mixed-Integer Programming (Q5429254):

Displaying 18 items.

• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
• Conic mixed-integer rounding cuts (Q847842) (← links)
• Polymatroids and mean-risk minimization in discrete optimization (Q957370) (← links)
• Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
• Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
• Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
• Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs (Q2339823) (← links)
• Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
• Lifted polymatroid inequalities for mean-risk optimization with indicator variables (Q2423781) (← links)
• Cutting-planes for weakly-coupled 0/1 second order cone programs (Q2883643) (← links)
• Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming (Q2897293) (← links)
• Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction (Q3386769) (← links)
• Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables (Q3503836) (← links)
• Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model (Q4971390) (← links)
• (Q4998944) (← links)
• Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
• Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization (Q5172959) (← links)
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)