Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I

We study mixed-integer programming (MIP) relaxation techniques for the solution of non-convex mixed-integer quadratically constrained quadratic programs (MIQCQPs). We present MIP relaxation methods for non-convex continuous variable products. In this paper, we consider MIP relaxations based on separ...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computational optimization and applications Jg. 87; H. 3; S. 835 - 891
Hauptverfasser:	Beach, Benjamin, Burlacu, Robert, Bärmann, Andreas, Hager, Lukas, Hildebrand, Robert
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY Springer US 01.04.2024 Springer Nature B.V
Schlagworte:	Binarization Continuity (mathematics) Convex and Discrete Geometry Discretization Integer programming Linear programming Management Science Mathematics Mathematics and Statistics MIP relaxations Mixed integer Operations Research Operations Research/Decision Theory Optimization Piecewise linear approximation Quadratic programming Statistics Binarization Discretization Quadratic programming Piecewise linear approximation MIP relaxations
ISSN:	1573-2894, 0926-6003, 1573-2894
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!