Quadratic reformulations of nonlinear binary optimization problems

Very large nonlinear unconstrained binary optimization problems arise in a broad array of applications. Several exact or heuristic techniques have proved quite successful for solving many of these problems when the objective function is a quadratic polynomial. However, no similarly efficient methods...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 162; no. 1-2; pp. 115 - 144
Main Authors:	Anthony, Martin, Boros, Endre, Crama, Yves, Gruber, Aritanan
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2017 Springer Nature B.V Springer
Subjects:	Arrays Binary system Boolean Business & economic sciences Calculus of Variations and Optimal Control; Optimization Codes Combinatorics Computer vision Cost engineering Full Length Paper Linear programming Mathematical analysis Mathematical and Computational Physics Mathematical functions Mathematical Methods in Physics Mathematical models Mathematics Mathematics and Statistics Mathematics of Computing Mathématiques Méthodes quantitatives en économie & gestion nonlinear binary optimization Nonlinearity Numerical Analysis Optimization Optimization algorithms Physical, chemical, mathematical & earth Sciences Physique, chimie, mathématiques & sciences de la terre Polynomials pseudo-Boolean functions quadratic binary optimization Quantitative methods in economics & management reformulation methods Sciences économiques & de gestion Studies Theoretical Upper bounds Variables 90C20 90C10 90C30 Pseudo-Boolean functions Reformulation methods Quadratic binary optimization Nonlinear binary optimization 90C09
ISSN:	0025-5610, 1436-4646, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!