RAIRO Operations Research Will be set by the publisher QUADRATIC 0-1 PROGRAMMING: TIGHTENING LINEAR OR QUADRATIC CONVEX REFORMULATION BY USE OF RELAXATIONS [PDF]
, 2008 . 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.
Alain Billionnet, Sourour Elloumi
core
A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs [PDF]
, 2013 Quadratic Convex Reformulation (QCR) is a technique that was originally proposed for quadratic 0-1 programs, and then extended to various other problems.
Galli, Laura +2 more
core +1 more source
Convex quadratic programming for exact solution of 0-1 quadratic programs [PDF]
, 2005 Let (QP) be a 0-1 quadratic program which consists in minimizing a quadratic function subject to linear constraints. In this paper, we present a general method to solve (QP) by reformulation of the problem into an equivalent 0-1 program with a convex ...
Marie-christine Plateau +5 more
core
A Strong Convex Quadratic Reformulation Using the Iteratif Factorization Method in the Mixed-Integer Polynomial Programs [PDF]
This paper discusses solving Mixed-integer Polynomial Programs through convex quadratic reformulation. This quadratic reformulation is carried out using the factorization method.
Sinaga, Lasker P
core
Optimization and Engineering, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Recent advances in solving some optimization problems in graphs by quadratic programming [PDF]
, 2014 We review Quadratic Convex Reformulation (QCR) for quadratic pro-grams with general integer variables. This solution 2-phase approachconsist in first reformulating the quadratic program into an equivalentother problem having a convex ob jective function.
Lambert, Amélie, Elloumi, Sourour
core +2 more sources
Quadratic convex reformulation : a computational study of the graph bisection problem [PDF]
, 2005 Given an undirected graph G = (V, E), we consider the graph bisection problem, which consists in partitioning the nodes of G in two disjoined sets with p and n − p nodes respectively such that the total weight of edges crossing between subsets is minimal.
Marie-christine Plateau +5 more
core
Data Mining via Support Vector Machines [PDF]
, 2001 Support vector machines (SVMs) have played a key role in broad classes of problems arising in various elds. Much more recently, SVMs have become the tool of choice for problems arising in data classi - cation and mining.
Mangasarian, Olvi
core +1 more source
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I [PDF]
We study mixed-integer programming (MIP) relaxation techniques for the solution of non-convex mixed-integer quadratically constrained quadratic programs (MIQCQPs). We present MIP relaxation methods for non-convex continuous variable products.
Hager, Lukas +4 more
core +2 more sources
State feedback policies for robust receding horizon control: uniqueness, continuity, and stability [PDF]
, 2005 Published ...
Goulart,P.J. +2 more
core