An enhanced logical benders approach for linear programs with complementarity constraints
From MaRDI portal
Publication:785626
DOI10.1007/s10898-020-00905-zzbMath1447.90040OpenAlexW3022556914MaRDI QIDQ785626
Francisco Jara-Moroni, Andreas Wächter, Jong-Shi Pang, John E. Mitchell
Publication date: 7 August 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00905-z
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An LPCC approach to nonconvex quadratic programs
- On linear programs with linear complementarity constraints
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Logic-based Benders decomposition
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- Information-based branching schemes for binary linear mixed integer problems
- Solving linear programs with complementarity constraints using branch-and-cut
- On mathematical programming with indicator constraints
- On handling indicator constraints in mixed integer programming
- On convex quadratic programs with linear complementarity constraints
- On learning and branching: a survey
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- The polynomial hierarchy and a simple model for competitive analysis
- Cutting-Planes for Complementarity Constraints
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Exploiting Erraticism in Search
- Technical Note—The Use of Cuts in Complementary Programming
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Technical Note—Complementary Programming
- A Machine Learning-Based Approximation of Strong Branching
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
