Split cuts and extended formulations for mixed integer conic quadratic programming
type: Item
instance of: scholarly article
title: Split cuts and extended formulations for mixed integer conic quadratic programming
zbMATH Open document ID: 1408.90201
author: Sina Modaresi
author: Mustafa R. Kılınç
author: J. P. Vielma
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
full work available at URL: http://hdl.handle.net/1721.1/113216
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6945322
zbMATH Keywords: split cut
zbMATH Keywords: conic MIR
zbMATH Keywords: mixed integer conic quadratic programming
MaRDI profile type: Publication
OpenAlex ID: W2098304414
cites work: Intersection Cuts for Mixed Integer Conic Quadratic Sets
cites work: Conic mixed-integer rounding cuts
cites work: Disjunctive programming: Properties of the convex hull of feasible points
cites work: A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
cites work: On families of quadratic surfaces having fixed intersections with two hyperplanes
cites work: Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
cites work: Q5465123
cites work: Lift-and-Project Cuts for Mixed Integer Convex Programs
cites work: An effective branch-and-bound algorithm for convex quadratic integer programming
cites work: Cuts for mixed 0-1 conic programming
cites work: Chvátal closures for mixed integer programming problems
cites work: On the rank of mixed 0,1 polyhedra.
cites work: The split closure of a strictly convex body
cites work: MIR closures of polyhedral sets
cites work: Q3394516
cites work: Some polyhedra related to combinatorial problems
cites work: On minimal valid inequalities for mixed integer conic programs
cites work: Q4829810
cites work: Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
cites work: A Strong Dual for Conic Mixed-Integer Programs
cites work: Q4040221
cites work: A recursive procedure to generate all cuts for 0-1 mixed integer programs
cites work: A branch-and-cut method for 0-1 mixed convex programming
cites work: A constructive characterization of the split closure of a mixed integer linear program
DOI: 10.1016/J.ORL.2014.10.006
description: scientific article; zbMATH DE number 6945322