A new upper bound for the 0-1 quadratic knapsack problem. - Alain Billionnet; Alain Faye; Éric Soutif (Eur. J. Oper. Res., 1999)

Decomposition and Linearization for 0-1 Quadratic Programming. - Sourour Elloumi; Alain Faye; Éric Soutif (Ann. Oper. Res., 2000)

An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem. - Alain Billionnet; Éric Soutif (Eur. J. Oper. Res., 2004)

Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem. - Alain Billionnet; Éric Soutif (INFORMS J. Comput., 2004)

On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems. - Marc Demange; Bernard Kouakou; Éric Soutif (ISAAC, 2005)

A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems. - Dominique Quadri; Éric Soutif; Pierre Tolla (SOFSEM (1), 2007)

Rewriting integer variables into zero-one variables: Some guidelines for the integer quadratic multi-knapsack problem. - Dominique Quadri; Éric Soutif (Oper. Res., 2007)

Exact solution method to solve large scale integer quadratic multidimensional knapsack problems. - Dominique Quadri; Éric Soutif; Pierre Tolla (J. Comb. Optim., 2009)

A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming. - Dominique Quadri; Éric Soutif (Electron. Notes Discret. Math., 2010)