Efficient separation of RLT cuts for implicit and explicit bilinear products
From MaRDI portal
Publication:6085984
DOI10.1007/978-3-031-32726-1_2arXiv2211.13545OpenAlexW4377200007MaRDI QIDQ6085984
Ksenia Bestuzheva, Ambros M. Gleixner, Tobias Achterberg
Publication date: 9 November 2023
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.13545
Cites Work
- Unnamed Item
- Unnamed Item
- Reduced RLT representations for nonconvex polynomial programming problems
- Mixed-integer bilinear programming problems
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A new reformulation-linearization technique for bilinear programming problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Reformulation and convex relaxation techniques for global optimization
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Linearity embedded in nonconvex programs
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- Exact Algorithms for the Quadratic Linear Ordering Problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Reduction constraints for the global optimization of NLPs
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
