A branch-and-cut method for 0-1 mixed convex programming

Cited In (only showing first 100 items - show all)

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

Uses Software

MINOS

Recommendations

Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework 👍 👎
Lift-and-project for mixed 0-1 programming: recent progress 👍 👎
Partial convexification cuts for 0--1 mixed-integer programs 👍 👎
Cuts for mixed 0-1 conic programming 👍 👎
An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems 👍 👎

This page was built for publication: A branch-and-cut method for 0-1 mixed convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968795)