Pages that link to "Item:Q2571004"
From MaRDI portal
The following pages link to Cuts for mixed 0-1 conic programming (Q2571004):
Displaying 15 items.
- 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)
- (Q4414642) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← 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)
- Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization (Q5172959) (← links)
- On Subadditive Duality for Conic Mixed-integer Programs (Q5234281) (← links)
- A note on characterizing canonical cuts using geometry (Q5449873) (← links)
- Integer Programming and Combinatorial Optimization (Q5712451) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs (Q6589745) (← links)
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization (Q6665386) (← links)
