Alain Faye

According to our database1, Alain Faye authored at least 13 papers between 1997 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive.
Theor. Comput. Sci., 2018

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

2015
Solving the Aircraft Landing Problem with time discretization approach.
Eur. J. Oper. Res., 2015

2013
Solving the Two-Stage Robust FTTH network design Problem under Demand Uncertainty.
Electron. Notes Discret. Math., 2013

2012
Optimizing splitter and fiber location in a multilevel optical FTTH network.
Eur. J. Oper. Res., 2012

2011
Solving a continuous local access network design problem with a stabilized central column generation approach.
Eur. J. Oper. Res., 2011

2007
Partial Lagrangian relaxation for general quadratic programming.
4OR, 2007

2005
A polyhedral approach for a constrained quadratic 0-1 problem.
Discret. Appl. Math., 2005

A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem.
Proceedings of the Algorithms, 2005

2003
Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1.
RAIRO Oper. Res., 2003

2000
Decomposition and Linearization for 0-1 Quadratic Programming.
Ann. Oper. Res., 2000

1999
A new upper bound for the 0-1 quadratic knapsack problem.
Eur. J. Oper. Res., 1999

1997
A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem.
Discret. Appl. Math., 1997


  Loading...