Some remarks on quadratic programming with 0-1 variables
Peter L. Hammer, Abraham A. Rubin (1970)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “Brèves communications. 0-1 optimization and non-linear programming”
Some remarks on quadratic programming with 0-1 variables
An efficient method for obtaining sharp bounds for nonlinear boolean programming problems
P. F. Körner (1992)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Fixed cost minimization over a Leontief substitution system
Gary J. Kœhler, Andrew B. Whinston, Gordon P. Wright (1974)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
Thaï Quynh Phong, Le Thi Hoai An, Pham Dinh Tao (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Lower bounds to the graph partitioning problem through generalized linear programming and network flows
M. Minoux, E. Pinson (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
RedInv-SA : a simulated annealing for the quadratic assignment problem
N. M. M. de Abreu, T. M. Querido, P. O. Boaventura-Netto (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau (2008)
RAIRO - Operations Research
Similarity:
Many combinatorial optimization problems can be formulated as the minimization of a 0–1 quadratic function subject to linear constraints. In this paper, we are interested in the exact solution of this problem through a two-phase general scheme. The first phase consists in reformulating the initial problem either into a compact mixed integer linear program or into a 0–1 quadratic convex program. The second phase simply consists in submitting the reformulated problem to a standard solver....