Between steps: intermediate relaxations between big-M and convex hull formulations
From MaRDI portal
Publication:2117230
Cites work
- A branch-and-cut method for 0-1 mixed convex programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- A mixed-integer programming approach to the clustering problem with an application in customer segmentation
- A simplification for some disjunctive formulations
- Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs
- Compact formulations as a union of polyhedra
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Convex programming for disjunctive convex optimization
- Deep neural networks and mixed integer linear optimization
- Disjunctive programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Integer Programming
- Integer Programming Solution of a Classification Problem
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Lossless compression of deep neural networks
- Mixed integer linear programming formulation techniques
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Modelling with integer variables
- On mathematical programming with indicator constraints
- On the convex hull of the union of certain polyhedra
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- 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
- Solving mixed integer classification problems by decomposition
- Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
Cited in
(7)- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
- Optimization of sparsity-constrained neural networks as a mixed integer linear program
- Between steps: Intermediate relaxations between big-M and convex hull formulations
- Norm-induced cuts: outer approximation for Lipschitzian constraint functions
- PySCIPOpt-ML: embedding trained machine learning models into mixed-integer programs
- 50 years of mixed-integer nonlinear and disjunctive programming
- P-split formulations: a class of intermediate formulations between big-M and convex hull for disjunctive constraints
This page was built for publication: Between steps: intermediate relaxations between big-M and convex hull formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117230)
