Cuts for mixed 0-1 conic programming
From MaRDI portal
Publication:2571004
DOI10.1007/s10107-005-0578-3zbMath1159.90457OpenAlexW1964191135MaRDI QIDQ2571004
Publication date: 31 October 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0578-3
Related Items (52)
Convex hull of two quadratic or a conic quadratic and a quadratic inequality ⋮ Exact approaches for competitive facility location with discrete attractiveness ⋮ Inversion of convection-diffusion equation with discrete sources ⋮ A strong conic quadratic reformulation for machine-job assignment with controllable processing times ⋮ Algorithms and Software for Convex Mixed Integer Nonlinear Programs ⋮ Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming ⋮ Disjunctive Cuts for Nonconvex MINLP ⋮ Conic mixed-integer rounding cuts ⋮ 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 ⋮ Polyhedral approximations inp-order cone programming ⋮ Aircraft Rescheduling with Cruise Speed Control ⋮ Theorems of the alternative for conic integer programming ⋮ On interval-subgradient and no-good cuts ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables ⋮ Lifting for conic mixed-integer programming ⋮ Two-term disjunctions on the second-order cone ⋮ Lifted polymatroid inequalities for mean-risk optimization with indicator variables ⋮ Lift-and-project cuts for convex mixed integer nonlinear programs ⋮ Conic formulation of QPCCs applied to truly sparse QPs ⋮ 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 ⋮ On the Chvátal-Gomory Closure of a Compact Convex Set ⋮ How to convexify the intersection of a second order cone and a nonconvex quadratic ⋮ Supermodular covering knapsack polytope ⋮ A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization ⋮ 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 the Chvátal-Gomory closure of a compact convex set ⋮ On valid inequalities for mixed integer \(p\)-order cone programming ⋮ Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization ⋮ A cutting plane method for risk-constrained traveling salesman problem with random arc costs ⋮ 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 ⋮ 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 ⋮ 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 ⋮ On Subadditive Duality for Conic Mixed-integer Programs ⋮ The submodular knapsack polytope ⋮ Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs ⋮ A geometric approach to cut-generating functions ⋮ On a generalization of the Chvátal-Gomory closure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applications of second-order cone programming
- On the solution of traveling salesman problems
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Semidefinite programming in combinatorial optimization
- Second-order cone programming
- Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Generating convex polynomial inequalities for mixed 0-1 programs
- A branch-and-cut method for 0-1 mixed convex programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Portfolio optimization with linear and fixed transaction costs
- Global Optimization with Polynomials and the Problem of Moments
- Robust Convex Optimization
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- TSPLIB—A Traveling Salesman Problem Library
- Disjunctive Programming
- Robust Solutions to Uncertain Semidefinite Programs
- How Good is the Goemans--Williamson MAX CUT Algorithm?
- Linear Matrix Inequalities in System and Control Theory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Computational Experience with an Interior Point Cutting Plane Algorithm
- On the cut polytope
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
- Robust Portfolio Selection Problems
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems
This page was built for publication: Cuts for mixed 0-1 conic programming
