Cover Image

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bestuzheva, Ksenia, Gleixner, Ambros, Achterberg, Tobias
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control 90-08, 90C11, 90C20, 90C26, 90C57
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
by: Yildirim, E. Alper
Published: (2025)

An extension of an RLT-based solver to MINLP polynomial problems
by: González-Díaz, Julio, et al.
Published: (2024)

Cutting planes for signomial programming
by: Xu, Liding, et al.
Published: (2022)

A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
by: Bolusani, Suresh, et al.
Published: (2024)

A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization
by: Mexi, Gioni, et al.
Published: (2025)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
by: Gómez-Casares, Ignacio, et al.
Published: (2025)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
by: Göß, Adrian
Published: (2026)

Parabolic Approximation & Relaxation for MINLP
by: Göß, Adrian, et al.
Published: (2024)

A Unifying Convexification Framework for Chance-Constrained Programs via Bilinear Extended Formulations over a Simplex
by: Davarnia, Danial, et al.
Published: (2025)

Separable QCQPs and Their Exact SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2026)

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
by: Tawarmalani, Mohit
Published: (2024)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
by: González-Díaz, Julio, et al.
Published: (2025)

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
by: Del Pia, Alberto
Published: (2023)

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem
by: Bencheikh, Ali, et al.
Published: (2024)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
by: Tanınmış, Kübra, et al.
Published: (2023)

Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems
by: de Roux, Daniel, et al.
Published: (2025)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
by: Halbig, Katrin, et al.
Published: (2024)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
by: Kempke, Nils-Christian, et al.
Published: (2025)

Mixed-Integer Linear Optimization for Cardinality-Constrained Random Forests
by: Burgard, Jan Pablo, et al.
Published: (2024)

Mixed-Integer Linear Optimization for Semi-Supervised Optimal Classification Trees
by: Burgard, Jan Pablo, et al.
Published: (2024)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
by: Lapucci, Matteo, et al.
Published: (2024)

Exact Decomposition Branching exploiting Lattice Structures
by: Halbig, Katrin, et al.
Published: (2024)

New results on the local-nonglobal minimizers of the generalized trust-region subproblem
by: Ai, Wenbao, et al.
Published: (2024)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
by: Arima, Naohiko, et al.
Published: (2023)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
by: Arima, Naohiko, et al.
Published: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
by: Kojima, Masakazu, et al.
Published: (2025)

Hidden convexity of quadratic systems and its application to quadratic programming
by: Huy, Nguyen Quang, et al.
Published: (2026)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
by: Qu, Zheng, et al.
Published: (2023)

Beyond binarity: Semidefinite programming for ternary quadratic problems
by: de Meijer, Frank, et al.
Published: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2025)

On the Convexity of the Solution Set of Linear Complementarity Problem over Tensor Spaces
by: Sharma, Sonali, et al.
Published: (2026)

Outer Approximation Scheme for Weakly Convex Constrained Optimization Problems
by: Bednarczuk, Ewa M., et al.
Published: (2024)

On the convexity for the range set of two quadratic functions
by: Nguyen, Huu-Quang, et al.
Published: (2025)

An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
by: Fujii, Koichi, et al.
Published: (2023)

Extended Triangle Inequalities for Nonconvex Box-Constrained Quadratic Programming
by: Anstreicher, Kurt M., et al.
Published: (2025)

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
by: da Silva, Renan F. F., et al.
Published: (2023)

Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
by: Borgwardt, Steffen, et al.
Published: (2024)

The SCIP Optimization Suite 9.0
by: Bolusani, Suresh, et al.
Published: (2024)

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
by: Göß, Adrian, et al.
Published: (2024)

Continuous models combining slacks-based measures of efficiency and super-efficiency
by: Bolos, Vicente J., et al.
Published: (2024)