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

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming computation Vol. 14; no. 1; pp. 85 - 120
Main Authors:	Ceselli, Alberto, Létocart, Lucas, Traversi, Emiliano
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2022 Springer Nature B.V Springer
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!