Intersection cuts for convex mixed integer programs from translated cones

DOI10.1016/j.disopt.2016.11.003zbMath1387.90163OpenAlexW2562666567MaRDI QIDQ1751221

Umakanta Pattanayak, Vishnu Narayanan

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2016.11.003

zbMATH Keywords

intersection cuttranslated cone

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11)

Related Items (1)

Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion

Cites Work

• Unnamed Item
• Unnamed Item
• Some properties of convex hulls of integer points contained in general convex sets
• How to convexify the intersection of a second order cone and a nonconvex quadratic
• A note on the split rank of intersection cuts
• Conic mixed-integer rounding cuts
• Two-term disjunctions on the second-order cone
• How tight is the corner relaxation?
• Equivalence between intersection cuts and the corner polyhedron
• Convex hulls of integral points
• Split cuts and extended formulations for mixed integer conic quadratic programming
• Disjunctive cuts for cross-sections of the second-order cone
• Generalized intersection cuts and a new cut generating paradigm
• A branch-and-cut method for 0-1 mixed convex programming
• The split closure of a strictly convex body
• On families of quadratic surfaces having fixed intersections with two hyperplanes
• Some polyhedra related to combinatorial problems
• Cuts for mixed 0-1 conic programming
• On Minimal Valid Inequalities for Mixed Integer Conic Programs
• Intersection Cuts with Infinite Split Rank
• Lift-and-Project Cuts for Mixed Integer Convex Programs
• Maximal Lattice-Free Convex Sets in Linear Subspaces
• A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
• Intersection Cuts for Mixed Integer Conic Quadratic Sets
• Cut-Generating Functions and S-Free Sets
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Integer programming and convex analysis: Intersection cuts from outer polars
• On Polyhedral Approximations of the Second-Order Cone
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets

This page was built for publication: Intersection cuts for convex mixed integer programs from translated cones