Let (QP) be a 0-1 quadratic program which consists in minimizing a quadratic function subject to linear equality constraints. In this paper, we present QCR, a general method to reformulate (QP) intoâ€¦ (More)

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â€¦ (More)

kâ‰¤m Ek and m is minimum. Two related and reasonably well-studied problems are the Minimum Biclique Cover (MBC), where Hk are required to be bicliques (i.e. complete bipartite subgraphs) [4,3,2,1] andâ€¦ (More)

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â€¦ (More)

We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its variants as 0-1â€¦ (More)

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â€¦ (More)

Let (QP ) be a 0-1 quadratic program which consists in minimizing a quadratic function subject to linear equality constraints. In this paper, we present QCR, a general method to reformulate (QP )â€¦ (More)