Mixed integer second order cone programming.
From MaRDI portal
Publication:3394516
zbMATH Open1176.90002MaRDI QIDQ3394516FDOQ3394516
Authors: Sarah Drewes 
Publication date: 8 September 2009
Full work available at URL: http://www3.mathematik.tu-darmstadt.de/fileadmin/home/users/82/DissertationDrewes.pdf
Recommendations
Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mixed integer programming (90C11)
Cited In (29)
- On minimal valid inequalities for mixed integer conic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs
- Cardinality minimization, constraints, and regularization: a survey
- Smoothing and regularization for mixed-integer second-order cone programming with applications in portfolio optimization
- Inversion of convection-diffusion equation with discrete sources
- A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Polyhedral approximations in \(p\)-order cone programming
- Cutting-planes for weakly-coupled \(0/1\) second order cone programs
- Disjunctive Cuts for Nonconvex MINLP
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Convexification of queueing formulas by mixed-integer second-order cone programming: an application to a discrete location problem with congestion
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Two-term disjunctions on the second-order cone
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Minotaur: a mixed-integer nonlinear optimization toolkit
- On valid inequalities for mixed integer \(p\)-order cone programming
- Subgradient based outer approximation for mixed integer second order cone programming
- Disjunctive cuts for cross-sections of the second-order cone
- Split cuts and extended formulations for mixed integer conic quadratic programming
- A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
- Theorems of the alternative for conic integer programming
- On pathological disjunctions and redundant disjunctive conic cuts
- On families of quadratic surfaces having fixed intersections with two hyperplanes
- Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
This page was built for publication: Mixed integer second order cone programming.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394516)
