Alain Faye

Associate Professor (Accreditation to supervise research)
Personal website: http://cedric.cnam.fr/~faye

2023

Unpublished

  1. Kim, H.; Watel, D.; Faye, A. and Cédric, H. On the complexity of the data-driven wasserstein distributionally robust binary problem. , working paper or preprint. doi  www 

2022

Conference Articles

  1. Kim, H.; Watel, D.; Faye, A. and Hervet, C. On the complexity of the data-driven Wasserstein distributionally robust binary problem. In 23ème congrès annuel de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision, Villeurbanne - Lyon, France, 2022. www 

2019

Conference Articles

  1. Diamantini, M.; Faye, A. and Khamphousone, J. Calcul des dates d'atterrissage d'une séquence d'avions pour des fonctions de co^ut convexes et affines par morceaux. In ROADEF 2019, Le Havre, France, 2019. www 

2018

Journal Articles

  1. Bou-Fakhreddine, B.; Mougharbel, I.; Faye, A. and Pollet, Y. Estimating daily evaporation from poorly-monitored lakes using limited meteorological data: A case study within Qaraoun dam - Lebanon. In Journal of Environmental Management, 241: 502-513, 2018. doi  www 
  1. Faye, A. A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes. In European Journal of Operational Research, 270 (3), 2018. doi  www 

2017

Conference Articles

  1. Gladkikh, E.; Lambert, A.; Faye, A.; Watel, D. and Costa, M-C. Optimisation du maillage électrique du parc éoliennes off-shore -- projet Stationis. In ROADEF 17, Metz, France, 2017. www 

2014

Conference Articles

  1. Faye, A. Solving the Aircraft Landing Problem with time discretization approach. In ROADEF - 15ème congrès annuel de la Société franc caise de recherche opérationnelle et d'aide `a la décision, Bordeaux, France, 2014. www 

2013

Conference Articles

  1. Hervet, C.; Faye, A.; Costa, M-C.; Chardy, M. and Francfort, S. Solving the Two-Stage Robust FTTH network design Problem under Demand Uncertainty. In International Network Optimization Conference, INOC, May 20-22, 2013; Electronic Notes in Discrete Mathematics, pages 335-342, Tenerife, Spain, 2013. www 

2012

Conference Articles

  1. Hervet, C.; Chardy, M.; Costa, M-C.; Faye, A. and Francfort, S. Robust optimization of optical fiber access networks deployments. In International Symposium on Mathematical Programming (ISMP 2012) (and EURO 2012, Vilnius, Lithuania), pages 1, Berlin, Germany, 2012. www 

2009

Conference Articles

  1. Trampont, M.; Destr?, C. and Faye, A. Une méthode de génération de colonnes basée sur un algorithme central de plans sécants. In ROADEF'09, Nancy, Février, pages 61-62, X, France, 2009. www 
  1. Trampont, M.; Destr?, C. and Faye, A. Solving a hierarchical network design problem with two stabilized column generation approaches. In International Network Optimization Conference, Pisa, pages 6 pages, X, France, 2009. www 

2007

Conference Articles

  1. Costa, M-C.; Faye, A.; Hardy, T. and Gressier-Soudan, E. Localisation optimale de capteurs dans un réseau point `a point. In ROADEF'07, Grenoble, février, pages 75-76, X, France, 2007. www 

2006

Conference Articles

  1. Faye, A. and Roupin, F. Partial Lagrangian relaxation for General Quadratic Programming (version préliminaire). In JOPT'06, Montréal, pages 113, X, France, 2006. www 
  1. Le Nestour, S.; Chapuis, S.; Billionnet, A. and Faye, A. Applications de la génération de colonnes `a un problème de rotations d'équipages. In ROADEF'06 7ème congrès, Lille, février, pages 38, X, France, 2006. www 

2005

Journal Articles

  1. Faye, A. and Trinh, Q.A. A polyhedral approach for a constrained quadratic 0-1 problem. In Discrete Applied Mathematics, 149: 87-100, 2005. www 

Conference Articles

  1. Faye, A. and Roupin, F. A Cutting planes Algorithm based upon a Semidefinite relaxation for the Quadratic Assignment Problem. In LNCS, pages 850-861, X, France, LNCS 3669, 2005. www 
  1. Faye, A. and Roupin, F. Relaxations Lagrangienne et Semidéfinie de Programmes Quadratiques. In ROADEF'05 6ème congrès, Tours, février, pages 176, X, France, 2005. www 
  1. Faye, A. and Roupin, F. Un algorithme de coupes pour l'Affectation Quadratique. In Journ?e Francilienne de Recherche Op?rationnelle CNAM Paris, X, France, 2005. www 

2004

Conference Articles

  1. Faye, A. and Roupin, F. A lower bound for the Quadratic Assignment Problem based upon a semidefinite relaxation and a cutting planes approach. In ECCO 2004, Beirut, Lebanon, X, France, 2004. www 

2003

Journal Articles

  1. Faye, A. and Boyer, O. Construction de facettes pour le polytope du sac-`a-dos quadratique en 0-1. In RAIRO - Operations Research, 37 (4): 249-271, 2003. doi  www 
  1. Blanchard, A.; Elloumi, S.; Faye, A. and Wicker, N. Un algorithme de génération de coupes pour le problème de l'affectation quadratique. In INFOR: Information Systems and Operational Research, 41: 35-49, 2003. www 

Conference Articles

  1. Faye, A. and Maire, A. Décomposition de Benders pour le problème du sac-`a-dos quadratique en 0-1. In ROADEF 2003, X, France, 2003. www 

Reports

  1. Faye, A. and Trinh, Q.A. Polyhedral results for a constrained quadratic 0-1 problem. Technical Report CEDRIC-03-511, CEDRIC Lab/CNAM, 2003.

2002

Conference Articles

  1. Faye, A. Building facets for the quadratic 0-1 knapsack polytope. In CO'02, X, France, 2002. www 

Reports

  1. Blanchard, A.; Elloumi, S.; Faye, A. and Wicker, N. Une famille de facettes pour le polytope de l'affectation quadratique. Technical Report CEDRIC-02-330, CEDRIC Lab/CNAM, 2002.

2001

Conference Articles

  1. Blanchard, A.; Elloumi, S.; Faye, A. and Wicker, N. Un algorithme de coupes pour l'Affectation Quadratique. In FRANCORO III, X, France, 2001. www 

2000

Conference Articles

  1. Blanchard, A.; Faye, A. and Elloumi, S. Facettes du polytope de l'affectation quadratique. In ROADEF'2000, Nantes, X, France, 2000. www 

1999

Journal Articles

  1. Billionnet, A.; Faye, A. and Soutif, E. A new upper bound for the 0-1 quadratic knapsack problem. In European Journal of Operational Research, 112: 664-672, 1999. www 

1998

Conference Articles

  1. Billionnet, A.; Djabali, R. and Faye, A. Bornes inférieures pour le problème de la bipartition d'un graphe. In Francoro II, Sousse, Tunisie, X, France, 1998. www 
  1. Elloumi, S.; Faye, A. and Soutif, E. Decomposition and Linearization for 0-1 Quadratic Programming. In APMOD'98, Limassol, CYPRUS, X, France, 1998. www 
  1. Billionnet, A.; Djabali, R. and Faye, A. Lower bounds for a constrained quadratic 0-1 problem. In EURO 16, Bruxelles, X, France, 1998. www 

1997

Journal Articles

  1. Billionnet, A. and Faye, A. A lower bound for a constrained quadratic 0-1 minimization problem. In Discrete Applied Mathematics, 74: 135-146, 1997. www 

Reports

  1. Billionnet, A.; Elloumi, S. and Faye, A. The Quadratic Assignment Polytope. Technical Report CEDRIC-97-381, CEDRIC Lab/CNAM, 1997.
Top