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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computational optimization and applications Ročník 87; číslo 3; s. 835 - 891
Hlavní autoři:	Beach, Benjamin, Burlacu, Robert, Bärmann, Andreas, Hager, Lukas, Hildebrand, Robert
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY Springer US 01.04.2024 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!