Conic mixed-integer rounding cuts

DOI10.1007/s10107-008-0239-4zbMath1184.90112OpenAlexW2106871914MaRDI QIDQ847842

Vishnu Narayanan, Atamtürk, Alper

Publication date: 19 February 2010

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-008-0239-4

zbMATH Keywords

branch-and-bound algorithmsconic programming

Mathematics Subject Classification ID

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

Related Items

Convex hull of two quadratic or a conic quadratic and a quadratic inequality, A disjunctive cut strengthening technique for convex MINLP, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming, Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets, On sublinear inequalities for mixed integer conic programs, Perspective reformulations of mixed integer nonlinear programs with indicator variables, A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization, Valid Inequalities for Separable Concave Constraints with Indicator Variables, Polyhedral approximations inp-order cone programming, Aircraft Rescheduling with Cruise Speed Control, On interval-subgradient and no-good cuts, Disjunctive cuts in mixed-integer conic optimization, Lifting for conic mixed-integer programming, Two-term disjunctions on the second-order cone, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, Unnamed Item, Outer-product-free sets for polynomial optimization and oracle-based cuts, Lift-and-project cuts for convex mixed integer nonlinear programs, Certifiably optimal sparse inverse covariance estimation, On families of quadratic surfaces having fixed intersections with two hyperplanes, On the facet defining inequalities of the mixed-integer bilinear covering set, Submodularity in Conic Quadratic Mixed 0–1 Optimization, Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs, A framework for solving mixed-integer semidefinite programs, Lift-and-Project Cuts for Mixed Integer Convex Programs, How to convexify the intersection of a second order cone and a nonconvex quadratic, Supermodular covering knapsack polytope, Some cut-generating functions for second-order conic sets, Mixed integer programming with a class of nonlinear convex constraints, Intersection cuts for convex mixed integer programs from translated cones, On valid inequalities for mixed integer \(p\)-order cone programming, A computational study for common network design in multi-commodity supply chains, Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization, A conic quadratic formulation for a class of convex congestion functions in network flow problems, A cutting plane method for risk-constrained traveling salesman problem with random arc costs, A solution approach for optimizing long- and short-term production scheduling at LKAB's kiruna mine, Split cuts and extended formulations for mixed integer conic quadratic programming, Disjunctive cuts for cross-sections of the second-order cone, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach, Strong formulations for conic quadratic optimization with indicator variables, On Minimal Valid Inequalities for Mixed Integer Conic Programs, On pathological disjunctions and redundant disjunctive conic cuts, On Subadditive Duality for Conic Mixed-integer Programs, A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming, A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs, A geometric approach to cut-generating functions

Uses Software

• CSDP
• SDPA
• SeDuMi
• SDPT3
• DSDP5
• Bonmin
• FilMINT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithmic framework for convex mixed integer nonlinear programs
• Applications of second-order cone programming
• Optimization with disjunctive constraints
• Semidefinite programming in combinatorial optimization
• On blind source separation using mutual information criterion
• Second-order cone programming
• A polyhedral branch-and-cut approach to global optimization
• Generating convex polynomial inequalities for mixed 0-1 programs
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• A branch-and-cut method for 0-1 mixed convex programming
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Cuts for mixed 0-1 conic programming
• Lectures on Modern Convex Optimization
• FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Integer Programming and Pricing
• A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
• Algorithm 875
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Disjunctive Programming
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• CSDP, A C library for semidefinite programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
• Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
• Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Cuts for Conic Mixed-Integer Programming