Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Mathematical Programming

Quadratic reformulations of nonlinear binary optimization problems

Martin Anthony, Endre Boros, Yves Crama, Aritanan Gruber

Published Jun 1, 2016• 90 citations
Publisher
DOI
10.1007/s10107-016-1032-4

Related papers

Convex reformulation for binary quadratic programming problems via average objective value maximization

Cheng Zhu Lu, Xiaoling Guo

Optimization Letters•Jul 16, 2014•11 citations

Efficient linear reformulations for binary polynomial optimization problems

Sourour Elloumi, Zoé Verchère

Computers & Operations Research•Apr 5, 2023•5 citations

Compact quadratizations of nonlinear binary optimization problems

Yves Crama, Elisabeth Rodríguez-Heck

PAI COMEX

•Mar 25, 2014•0 citations

Quadratic Convex Reformulations for MultiObjective Binary Quadratic Programming

Marianna De Santis, Lucas Létocart, Yue Zhang

Quadratic Convex Reformulations for MultiObjective Binary Quadratic Programming

•Feb 24, 2026•0 citations

A Characterization of Binary Quadratic Optimization Problems

최혜지

•Jan 1, 2018•0 citations

A convex reformulation and an outer approximation for a class of binary quadratic program

Borzou Rostami, Fausto Errico, Andrea Lodi

In this paper, we propose a general modeling framework for a large class of binary quadratic programs subject to variable partitioning constraints.This problem has a wide range of applications as many of the binary quadratic programs with linear constraints can be represented in this form.By exploiting the problems' structure, we propose mixed-integer nonlinear program (MINLP) and mixed-integer linear program (MILP) reformulations and show the relationship between the two models in terms of the relaxation strength.Our methodology relies on a convex reformulation of the proposed MINLP and a branch-and-cut algorithm based on outer approximation cuts where the cuts are generated on the fly by efficiently solving separation subproblems.Our experimental results on various quadratic combinatorial optimization problems show that our approach outperforms the state-of-the-art solver applied to different MILP reformulations of the corresponding problems.

•Jan 1, 2018•4 citations
In this paper, we propose a general modeling framework for a large class of binary quadratic programs subject to variable partitioning constraints.This problem has a wide range of applications as many of the binary quadratic programs with linear constraints can be represented in this form.By exploiting the problems' structure, we propose mixed-integer nonlinear program (MINLP) and mixed-integer linear program (MILP) reformulations and show the relationship between the two models in terms of the relaxation strength.Our methodology relies on a convex reformulation of the proposed MINLP and a branch-and-cut algorithm based on outer approximation cuts where the cuts are generated on the fly by efficiently solving separation subproblems.Our experimental results on various quadratic combinatorial optimization problems show that our approach outperforms the state-of-the-art solver applied to different MILP reformulations of the corresponding problems.