Between steps: intermediate relaxations between big-M and convex hull formulations
From MaRDI portal
Publication:2117230
DOI10.1007/978-3-030-78230-6_19OpenAlexW3177301368MaRDI QIDQ2117230
Calvin Tsay, Ruth Misener, Jan Kronqvist
Publication date: 21 March 2022
Full work available at URL: https://arxiv.org/abs/2101.12708
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Optimization of sparsity-constrained neural networks as a mixed integer linear program, Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Compact formulations as a union of polyhedra
- A simplification for some disjunctive formulations
- On the convex hull of the union of certain polyhedra
- Disjunctive programming: Properties of the convex hull of feasible points
- Solving mixed integer classification problems by decomposition
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Deep neural networks and mixed integer linear optimization
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Lossless compression of deep neural networks
- Small and strong formulations for unions of convex sets from the Cayley embedding
- On mathematical programming with indicator constraints
- A mixed-integer programming approach to the clustering problem with an application in customer segmentation
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Lectures on Modern Convex Optimization
- Mixed Integer Linear Programming Formulation Techniques
- Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Integer Programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Modelling with integer variables
- Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Integer Programming Solution of a Classification Problem
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Disjunctive Programming
- Strong mixed-integer programming formulations for trained neural networks
