A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints
From MaRDI portal
Publication:5158761
DOI10.1137/20M1346778zbMath1479.90138arXiv1907.02109WikidataQ120689954 ScholiaQ120689954MaRDI QIDQ5158761
Jean Pauphilet, Ryan Cory-Wright, Dimitris J. Bertsimas
Publication date: 26 October 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.02109
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables, Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, A Scalable Algorithm for Sparse Portfolio Selection, A new perspective on low-rank optimization, \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables, A unifying framework for sparsity-constrained optimization, Cardinality-constrained distributionally robust portfolio optimization, Unnamed Item, Ideal formulations for constrained convex optimization problems with indicator variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximated perspective relaxations: a project and lift approach
- Best subset selection via a modern optimization lens
- Benders decomposition without separability: a computational study for capacitated facility location problems
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Practical enhancements to the Magnanti-Wong method
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- An exact algorithm for the capacitated facility location problems with single sourcing
- Partitioning procedures for solving mixed-variables programming problems
- An algorithm for disjunctive programs
- Solving mixed integer nonlinear programs by outer approximation
- Computational study of a family of mixed-integer quadratic programming problems
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Certifiably optimal sparse inverse covariance estimation
- Sparse regression: scalable algorithms and empirical performance
- Sparse learning via Boolean relaxations
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Generalized Benders decomposition
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Lectures on Modern Convex Optimization
- Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
- Mixed Integer Linear Programming Formulation Techniques
- Optimal Cardinality Constrained Portfolio Selection
- Perspective Reformulation and Applications
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- The Cutting-Plane Method for Solving Convex Programs
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- L’algebre de Boole et ses applications en recherche operationnelle
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Scalable Algorithms for the Sparse Ridge Regression
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- JuMP: A Modeling Language for Mathematical Optimization
- Geometry of cuts and metrics
