A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes.

Alain Faye

Alain Faye A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes. 1148-1157 2018 270 Eur. J. Oper. Res. 3 https://doi.org/10.1016/j.ejor.2018.04.021 https://www.wikidata.org/entity/Q129971141 db/journals/eor/eor270.html#Faye18

Dimitri Watel Alain Faye Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive. 202-223 2018 745 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2018.06.006 db/journals/tcs/tcs745.html#WatelF18

Alain Faye Solving the Aircraft Landing Problem with time discretization approach. 1028-1038 2015 242 Eur. J. Oper. Res. 3 https://doi.org/10.1016/j.ejor.2014.10.064 db/journals/eor/eor242.html#Faye15

Cédric Hervet Alain Faye Marie-Christine Costa Matthieu Chardy Stanislas Francfort Solving the Two-Stage Robust FTTH network design Problem under Demand Uncertainty. 335-342 2013 41 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2013.05.110 db/journals/endm/endm41.html#HervetFCCF13

Matthieu Chardy Marie-Christine Costa Alain Faye M. Trampont Optimizing splitter and fiber location in a multilevel optical FTTH network. 430-440 2012 222 Eur. J. Oper. Res. 3 https://doi.org/10.1016/j.ejor.2012.05.024 db/journals/eor/eor222.html#ChardyCFT12

M. Trampont C. Destré Alain Faye Solving a continuous local access network design problem with a stabilized central column generation approach. 546-558 2011 214 Eur. J. Oper. Res. 3 https://doi.org/10.1016/j.ejor.2011.05.021 db/journals/eor/eor214.html#TrampontDF11

Alain Faye Frédéric Roupin Partial Lagrangian relaxation for general quadratic programming. 75-88 2007 5 4OR 1 https://doi.org/10.1007/s10288-006-0011-7 db/journals/4or/4or5.html#FayeR07

Alain Faye Quoc-an Trinh A polyhedral approach for a constrained quadratic 0-1 problem. 87-100 2005 149 Discret. Appl. Math. 1-3 https://doi.org/10.1016/j.dam.2004.02.020 db/journals/dam/dam149.html#FayeT05

Alain Faye Frédéric Roupin A Cutting Planes Algorithm Based Upon a Semidefinite Relaxation for the Quadratic Assignment Problem. 850-861 2005 conf/esa/2005 ESA https://doi.org/10.1007/11561071_75 db/conf/esa/esa2005.html#FayeR05

Alain Faye Olivier Boyer Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1. 249-271 2003 37 RAIRO Oper. Res. 4 https://doi.org/10.1051/ro:2004008 db/journals/rairo/rairo37.html#FayeB03

Sourour Elloumi Alain Faye Éric Soutif Decomposition and Linearization for 0-1 Quadratic Programming. 79-93 2000 99 Ann. Oper. Res. 1-4 https://doi.org/10.1023/A%3A1019236832495 db/journals/anor/anor99.html#ElloumiFS00

Alain Billionnet Alain Faye Éric Soutif A new upper bound for the 0-1 quadratic knapsack problem. 664-672 1999 112 Eur. J. Oper. Res. 3 https://doi.org/10.1016/S0377-2217(97)00414-1 db/journals/eor/eor112.html#BillionnetFS99

Alain Billionnet Alain Faye A Lower Bound for a Constrained Quadratic 0-1 Minimization Problem. 135-146 1997 74 Discret. Appl. Math. 2 https://doi.org/10.1016/S0166-218X(96)00026-1 db/journals/dam/dam74.html#BillionnetF97

Alain Billionnet Olivier Boyer Matthieu Chardy Marie-Christine Costa C. Destré Sourour Elloumi Stanislas Francfort Cédric Hervet Frédéric Roupin Éric Soutif M. Trampont Quoc-an Trinh Dimitri Watel