A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem. - Alain Billionnet; Alain Faye (Discret. Appl. Math., 1997)

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)

Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1. - Alain Faye; Olivier Boyer (RAIRO Oper. Res., 2003)

A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem. - Alain Faye; Frédéric Roupin (ESA, 2005)

A polyhedral approach for a constrained quadratic 0-1 problem. - Alain Faye; Quoc-an Trinh (Discret. Appl. Math., 2005)

Partial Lagrangian relaxation for general quadratic programming. - Alain Faye; Frédéric Roupin (4OR, 2007)

Solving a continuous local access network design problem with a stabilized central column generation approach. - M. Trampont; C. Destré; Alain Faye (Eur. J. Oper. Res., 2011)

Optimizing splitter and fiber location in a multilevel optical FTTH network. - Matthieu Chardy; Marie-Christine Costa; Alain Faye; M. Trampont (Eur. J. Oper. Res., 2012)

Solving the Two-Stage Robust FTTH network design Problem under Demand Uncertainty. - Cédric Hervet; Alain Faye; Marie-Christine Costa; Matthieu Chardy; Stanislas Francfort (Electron. Notes Discret. Math., 2013)

Solving the Aircraft Landing Problem with time discretization approach. - Alain Faye (Eur. J. Oper. Res., 2015)

A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes. - Alain Faye (Eur. J. Oper. Res., 2018)

Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive. - Dimitri Watel; Alain Faye (Theor. Comput. Sci., 2018)