Efficient separation of RLT cuts for implicit and explicit bilinear terms

DOI10.1007/S10107-024-02104-0MaRDI QIDQ7019077zbMATH OpenFDO

Authors Ksenia Bestuzheva, Ambros M. Gleixner, Tobias Achterberg

Publication date 5 March 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10107-024-02104-0

zbMATH Keywords

bilinear termscutting planesmixed integer programmingreformulation-linearization technique

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Mixed integer programming (90C11) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• A new reformulation-linearization technique for bilinear programming problems
• A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
• Compact linearization for binary quadratic problems
• Compact linearization for binary quadratic problems subject to assignment constraints
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Enabling research through the SCIP Optimization Suite 8.0
• Exact algorithms for the quadratic linear ordering problem
• Global optimization of mixed-integer nonlinear programs with SCIP 8
• scientific article; zbMATH DE number 7124428 (Why is no real title available?)
• Inductive linearization for binary quadratic programs with linear constraints
• Linearity embedded in nonconvex programs
• Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
• MINLPLib -- a collection of test models for mixed-integer nonlinear programming
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Mixed-integer bilinear programming problems
• New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
• Noncommercial software for mixed-integer linear programming
• Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
• Reduced RLT representations for nonconvex polynomial programming problems
• Reduction constraints for the global optimization of NLPs
• Reformulation and convex relaxation techniques for global optimization

Cited in

(1)

• Extending a continuous RLT-based algorithm to mixed-integer polynomial problems

This page was built for publication: Efficient separation of RLT cuts for implicit and explicit bilinear terms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7019077)