Pages that link to "Item:Q2571004"

The following pages link to Cuts for mixed 0-1 conic programming (Q2571004):

Displaying 49 items.

• How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
• On interval-subgradient and no-good cuts (Q613320) (← links)
• Lifting for conic mixed-integer programming (Q623366) (← links)
• Exact approaches for competitive facility location with discrete attractiveness (Q828655) (← links)
• A strong conic quadratic reformulation for machine-job assignment with controllable processing times (Q833574) (← links)
• Conic mixed-integer rounding cuts (Q847842) (← links)
• Two-term disjunctions on the second-order cone (Q896297) (← links)
• The submodular knapsack polytope (Q1040079) (← links)
• Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
• Supermodular covering knapsack polytope (Q1751131) (← links)
• A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization (Q1751214) (← links)
• Some cut-generating functions for second-order conic sets (Q1751217) (← links)
• Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
• Intersection cuts for convex mixed integer programs from translated cones (Q1751221) (← links)
• Split cuts and extended formulations for mixed integer conic quadratic programming (Q1785310) (← links)
• Disjunctive cuts for cross-sections of the second-order cone (Q1785397) (← links)
• Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
• On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
• Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)
• Theorems of the alternative for conic integer programming (Q2183216) (← links)
• Certifiably optimal sparse inverse covariance estimation (Q2205987) (← links)
• On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
• Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs (Q2231326) (← links)
• On the Chvátal-Gomory closure of a compact convex set (Q2248755) (← links)
• On valid inequalities for mixed integer \(p\)-order cone programming (Q2251546) (← links)
• A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
• On pathological disjunctions and redundant disjunctive conic cuts (Q2294223) (← links)
• Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs (Q2339823) (← links)
• A geometric approach to cut-generating functions (Q2349120) (← 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)
• On families of quadratic surfaces having fixed intersections with two hyperplanes (Q2444574) (← links)
• Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
• Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)
• On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
• Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming (Q2897293) (← links)
• Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
• Polyhedral approximations in<i>p</i>-order cone programming (Q2926080) (← links)
• Aircraft Rescheduling with Cruise Speed Control (Q2931703) (← links)
• Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
• On the Chvátal-Gomory Closure of a Compact Convex Set (Q3009756) (← links)
• Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction (Q3386769) (← links)
• A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization (Q3462302) (← 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)
• Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
• Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
• Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)