Cuts for Conic Mixed-Integer Programming

DOI10.1007/978-3-540-72792-7_2zbMath1136.90518OpenAlexW1508501959MaRDI QIDQ5429254

Atamtürk, Alper, Vishnu Narayanan

Publication date: 29 November 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_2

zbMATH Keywords

Integer programmingbranch-and-cutconic programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (19)

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

Uses Software

• SeDuMi

This page was built for publication: Cuts for Conic Mixed-Integer Programming