The following pages link to Conic mixed-integer rounding cuts (Q847842):
Displayed 33 items.
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets (Q312703) (← links)
- On sublinear inequalities for mixed integer conic programs (Q312706) (← links)
- 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)
- A conic quadratic formulation for a class of convex congestion functions in network flow problems (Q713098) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← 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)
- On valid inequalities for mixed integer \(p\)-order cone programming (Q2251546) (← links)
- A computational study for common network design in multi-commodity supply chains (Q2257365) (← links)
- A solution approach for optimizing long- and short-term production scheduling at LKAB's kiruna mine (Q2275613) (← 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)
- 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)
- On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming (Q2897298) (← 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)
- Valid Inequalities for Separable Concave Constraints with Indicator Variables (Q3186509) (← links)
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization (Q3462302) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization (Q5172959) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
- Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach (Q5963315) (← links)