A branch-and-cut method for 0-1 mixed convex programming
From MaRDI portal
Publication:1968795
Recommendations
- Lift-and-project for mixed 0-1 programming: recent progress
- Cuts for mixed 0-1 conic programming
- Partial convexification cuts for 0--1 mixed-integer programs
- An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
Cited in
(only showing first 100 items - show all)- 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
- A modified lift-and-project procedure
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Solving linear optimization over arithmetic constraint formula
- Extended formulations in mixed integer conic quadratic programming
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
- 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
- Partial convexification cuts for 0--1 mixed-integer programs
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Disjunctive cuts for cross-sections of the second-order cone
- Log-robust portfolio management with parameter ambiguity
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- A review of deterministic optimization methods in engineering and management
- Strong formulations for conic quadratic optimization with indicator variables
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Ideal formulations for constrained convex optimization problems with indicator variables
- A disjunctive cut strengthening technique for convex MINLP
- Inversion of convection-diffusion equation with discrete sources
- Tightening methods based on nontrivial bounds on bilinear terms
- 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
- On the facet defining inequalities of the mixed-integer bilinear covering set
- On valid inequalities for mixed integer \(p\)-order cone programming
- Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach
- On pathological disjunctions and redundant disjunctive conic cuts
- Small and strong formulations for unions of convex sets from the Cayley embedding
- Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs
- A geometric approach to cut-generating functions
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Finding multiple solutions to general integer linear programs
- A partial outer convexification approach to control transmission lines
- Finding multiple optimal solutions of signomial discrete programming problems with free variables
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Exact solutions to a class of stochastic generalized assignment problems
- Cuts for mixed 0-1 conic programming
- Approximated perspective relaxations: a project and lift approach
- 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
- An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems
- On minimal valid inequalities for mixed integer conic programs
- Mixed integer nonlinear programs featuring ``on/off constraints: convex analysis and applications
- Cutting-planes for weakly-coupled 0/1 second order cone programs
- 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
- Lift-and-project cuts for mixed integer convex programs
- Cutting plane algorithm for convex generalized disjunctive programs
- Convex relaxations for quadratic on/off constraints and applications to optimal transmission switching
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- A hierarchy of relaxations for linear generalized disjunctive programming
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- scientific article; zbMATH DE number 1953196 (Why is no real title available?)
- scientific article; zbMATH DE number 1953199 (Why is no real title available?)
- Mixed-integer nonlinear programs featuring ``on/off constraints
- A general system for heuristic minimization of convex functions over non-convex sets
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Branch-and-cut for complementarity-constrained optimization
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- Optimization methods for mixed integer weakly concave programming problems
- Genomic feature selection by coverage design optimization
- Mathematical programming models and exact algorithms
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- Mixed-integer convex representability
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Smoothing and regularization for mixed-integer second-order cone programming with applications in portfolio optimization
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Regularized optimization methods for convex MINLP problems
- A simple effective heuristic for embedded mixed-integer quadratic programming
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
- Solution approaches to linear fractional programming and its stochastic generalizations using second order cone approximations
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Disjunctive cuts in mixed-integer conic optimization
- A new perspective on low-rank optimization
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
- A computational study of perspective cuts
- Shapes and recession cones in mixed-integer convex representability
- Service center location problems with decision dependent utilities and a pandemic case study
- Shortest Paths in Graphs of Convex Sets
- Outer approximation for pseudo-convex mixed-integer nonlinear program problems
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- A disjunctive cutting plane algorithm for bilinear programming
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
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)
