A memory-efficient algorithm for conservative cuts in disjoint bilinear programming

DOI10.47745/AUSI-2024-0002MaRDI QIDQ6954717zbMATH OpenFDO

Authors Xiaosong Ding, Xi Chen, Qing Sun, Chao Liu, Jun Ma

Publication date 23 July 2025

Published in Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.47745/AUSI-2024-0002

zbMATH Keywords

conservative cutsdegeneracydisjoint bilinear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

This page was built for publication: A memory-efficient algorithm for conservative cuts in disjoint bilinear programming

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