Dantzig–Wolfe reformulations for binary quadratic problems

The purpose of this paper is to provide strong reformulations for binary quadratic problems. We propose a first methodological analysis on a family of reformulations combining Dantzig–Wolfe and Quadratic Convex optimization principles. We show that a few reformulations of our family yield continuous...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical programming computation Ročník 14; číslo 1; s. 85 - 120
Hlavní autori:	Ceselli, Alberto, Létocart, Lucas, Traversi, Emiliano
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2022 Springer Nature B.V Springer
Predmet:	Computational geometry Computer Science Convexity Discrete Mathematics Full Length Paper Knapsack problem Mathematics Mathematics and Statistics Mathematics of Computing Operations Research Operations Research/Decision Theory Optimization Theory of Computation Column generation 90C11 Mixed integer programming 90C20 Quadratic programming Decomposition methods 90C27 Combinatorial optimization Binary quadratic programming Quadratic convex reformulation
ISSN:	1867-2949, 1867-2957
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!