A branch-and-cut method for 0-1 mixed convex programming
From MaRDI portal
Publication:1968795
DOI10.1007/s101070050103zbMath0946.90054OpenAlexW2049505431MaRDI QIDQ1968795
Robert A. Stubbs, Sanjay Mehrotra
Publication date: 29 October 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050103
Related Items (96)
Cutting-planes for weakly-coupled 0/1 second order cone programs ⋮ Genomic feature selection by coverage design optimization ⋮ Convex hull of two quadratic or a conic quadratic and a quadratic inequality ⋮ A disjunctive cut strengthening technique for convex MINLP ⋮ Inversion of convection-diffusion equation with discrete sources ⋮ A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes ⋮ Algorithms and Software for Convex Mixed Integer Nonlinear Programs ⋮ Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming ⋮ Perspective Reformulation and Applications ⋮ Disjunctive Cuts for Nonconvex MINLP ⋮ Mathematical Programming Models and Exact Algorithms ⋮ Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints ⋮ Lifting inequalities: a framework for generating strong cuts for nonlinear programs ⋮ Conic mixed-integer rounding cuts ⋮ Perspective reformulations of mixed integer nonlinear programs with indicator variables ⋮ Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations ⋮ Strong valid inequalities for orthogonal disjunctions and bilinear covering sets ⋮ Finding multiple solutions to general integer linear programs ⋮ A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization ⋮ Cutting Plane Algorithm for Convex Generalized Disjunctive Programs ⋮ Strong formulations for quadratic optimization with M-matrices and indicator variables ⋮ A modified lift-and-project procedure ⋮ Mixed-Integer Convex Representability ⋮ Tightening methods based on nontrivial bounds on bilinear terms ⋮ Solving linear optimization over arithmetic constraint formula ⋮ An overview of MINLP algorithms and their implementation in Muriqui optimizer ⋮ A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function ⋮ SUSPECT: MINLP special structure detector for Pyomo ⋮ Mathematical programming formulations for piecewise polynomial functions ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ A new perspective on low-rank optimization ⋮ A partial outer convexification approach to control transmission lines ⋮ Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective ⋮ A computational study of perspective cuts ⋮ Extended formulations in mixed integer conic quadratic programming ⋮ Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables ⋮ Two-term disjunctions on the second-order cone ⋮ Shapes and recession cones in mixed-integer convex representability ⋮ Service center location problems with decision dependent utilities and a pandemic case study ⋮ Convex envelopes generated from finitely many compact convex sets ⋮ A hierarchy of relaxations for linear generalized disjunctive programming ⋮ Lift-and-project cuts for convex mixed integer nonlinear programs ⋮ Shortest Paths in Graphs of Convex Sets ⋮ Explicit convex and concave envelopes through polyhedral subdivisions ⋮ A hierarchy of relaxations for nonlinear convex generalized disjunctive programming ⋮ A review of deterministic optimization methods in engineering and management ⋮ Mixed-integer nonlinear programs featuring ``on/off constraints ⋮ Finding multiple optimal solutions of signomial discrete programming problems with free variables ⋮ On the facet defining inequalities of the mixed-integer bilinear covering set ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations ⋮ Strong-branching inequalities for convex mixed integer nonlinear programs ⋮ Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming ⋮ Optimization methods for mixed integer weakly concave programming problems ⋮ Global optimization of generalized semi-infinite programs using disjunctive programming ⋮ A general system for heuristic minimization of convex functions over non-convex sets ⋮ Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming ⋮ Lift-and-Project Cuts for Mixed Integer Convex Programs ⋮ Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques ⋮ An algorithmic framework for convex mixed integer nonlinear programs ⋮ How to convexify the intersection of a second order cone and a nonconvex quadratic ⋮ A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization ⋮ Mixed integer programming with a class of nonlinear convex constraints ⋮ Intersection cuts for convex mixed integer programs from translated cones ⋮ Regularized optimization methods for convex MINLP problems ⋮ On valid inequalities for mixed integer \(p\)-order cone programming ⋮ Lift-and-project for mixed 0-1 programming: recent progress ⋮ Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization ⋮ Perspective cuts for a class of convex 0-1 mixed integer programs ⋮ Unnamed Item ⋮ Exact solutions to a class of stochastic generalized assignment problems ⋮ Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes ⋮ Split cuts and extended formulations for mixed integer conic quadratic programming ⋮ Disjunctive cuts for cross-sections of the second-order cone ⋮ Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach ⋮ Log-robust portfolio management with parameter ambiguity ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ Strong formulations for conic quadratic optimization with indicator variables ⋮ A simple effective heuristic for embedded mixed-integer quadratic programming ⋮ On Minimal Valid Inequalities for Mixed Integer Conic Programs ⋮ On pathological disjunctions and redundant disjunctive conic cuts ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs ⋮ Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching ⋮ Global optimization of signomial mixed-integer nonlinear programming problems with free variables ⋮ A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions ⋮ Small and strong formulations for unions of convex sets from the Cayley embedding ⋮ Cuts for mixed 0-1 conic programming ⋮ Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations ⋮ Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs ⋮ A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming ⋮ A geometric approach to cut-generating functions ⋮ Between steps: intermediate relaxations between big-M and convex hull formulations ⋮ Ideal formulations for constrained convex optimization problems with indicator variables ⋮ Logic-based modeling and solution of nonlinear discrete/continuous optimization problems ⋮ Projection, lifting and extended formulation integer and combinatorial optimization ⋮ Approximated perspective relaxations: a project and lift approach
Uses Software
This page was built for publication: A branch-and-cut method for 0-1 mixed convex programming
