Alain Faye

13 papers A 1Journal 12
YearRankTypeTitle / Venue / Authors
2018 J jnl
A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes.
Eur. J. Oper. Res.
Alain Faye
2018 J jnl
Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive.
Theor. Comput. Sci.
Dimitri Watel, Alain Faye
2015 J jnl
Solving the Aircraft Landing Problem with time discretization approach.
Eur. J. Oper. Res.
Alain Faye
2013 J jnl
Solving the Two-Stage Robust FTTH network design Problem under Demand Uncertainty.
Electron. Notes Discret. Math.
Cédric Hervet, Alain Faye, Marie-Christine Costa, Matthieu Chardy, Stanislas Francfort
2012 J jnl
Optimizing splitter and fiber location in a multilevel optical FTTH network.
Eur. J. Oper. Res.
Matthieu Chardy, Marie-Christine Costa, Alain Faye, M. Trampont
2011 J jnl
Solving a continuous local access network design problem with a stabilized central column generation approach.
Eur. J. Oper. Res.
M. Trampont, C. Destré, Alain Faye
2007 J jnl
Partial Lagrangian relaxation for general quadratic programming.
4OR
Alain Faye, Frédéric Roupin
2005 A conf
A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem.
ESA
Alain Faye, Frédéric Roupin
2005 J jnl
A polyhedral approach for a constrained quadratic 0-1 problem.
Discret. Appl. Math.
Alain Faye, Quoc-an Trinh
2003 J jnl
Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1.
RAIRO Oper. Res.
Alain Faye, Olivier Boyer
2000 J jnl
Decomposition and Linearization for 0-1 Quadratic Programming.
Ann. Oper. Res.
Sourour Elloumi, Alain Faye, Éric Soutif
1999 J jnl
A new upper bound for the 0-1 quadratic knapsack problem.
Eur. J. Oper. Res.
Alain Billionnet, Alain Faye, Éric Soutif
1997 J jnl
A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem.
Discret. Appl. Math.
Alain Billionnet, Alain Faye