All programs at the ESSEC Business SchoolESSEC Business School BrochuresProfessors at the ESSEC Business SchoolResearch at the ESSEC Business SchoolESSEC Business SchoolPress area at the ESSEC Business SchoolLife at the ESSEC Business SchoolContact the ESSEC Business School
  
 
Home > Faculty > Professors' profiles > Laurent Alfandari

Laurent Alfandari
Associate Professor,  Information Systems and Decision Sciences Department

Photo de Laurent Alfandari
Curriculum Vitae (pdf)
General Information Research Areas Publications Other Activities
Education
Doctorat en informatique (Recherche Opérationnelle), Université Paris IX Dauphine
DEA Méthodes Scientifiques de Gestion, Université Paris IX Dauphine
Diplôme ESSEC
DEUG Mathématiques et Sciences Sociales, Université Paris IX-Dauphine
On-going Projects
- modeling and solving multi-commodity resource-constrained flow problems for transportation planning, with A. Nagih, L. Letocart, A. Plateau and S. Toulouse (ACI project)
- multi-period agricultural planning : new models for optimizing crop rotations, with JL. Lemalade and A. Nagih
- approximation of facility location problems
- multicriteria decision aid
- inverse combinatorial optimization problems, with M. Demange and J. Monnot
Academic Publications
Articles
  "Improved approximation of the Soft-Capacitated facility Location Problem" (, L. Alfandari).. RAIRO Operations Research, Mar. 2007, Vol. 41, p.  83‑ 93
  "The Minimum Bounded-Diameter Spanning Forest Problem Is Log-Approximable" (, L. Alfandari).. Foundations of Computing and Decision Sciences, Jan. 2001, p. 123‑132
  "Master-slave Strategy and Polynomial Approximation" (V. Paschos, L. Alfandari).. Computational Optimization and Applications, Sept. 2000, Vol. 16, Issue 3, p. 231‑245
  "Approximating Minimum Spanning Tree of Depth 2" (V. Paschos, L. Alfandari).. International Transactions in Operations Research, June 1999, Vol. 6, p. 607‑622


Chapters
  Optimisation de la construction de rotations d'équipages en transport aérien. In: PASCHOS V.T.. Optimisation combinatoire 3. Applications (traité IC2) (with A. Nagih). Paris (France) : Hermes. Lavoisier, 2006
  A Path Relinking Algorithm for the Generalized Assignment Problem. In: Resende M.G.C., de Sousa J.P. (eds.). Metaheuristics Computer Decision-making (with A. Plateau, P. Tolla). Boston (Etats-Unis) : Kluwer Academic Publishers, 2004


Working papers
  "Approximation of the Constrained Path Covering Problem" LIPN CNRS UMR 7030, Université Paris XIII, hal00174878 sept. 07.
  "Improved Approximation of the General Soft-Capacitated Facility Location Problem" (, L. Alfandari). Essec Research Center, DR‑05003 mars 05.
  "Choice Rules with Size Constraints for Multiple Criteria Decision Making" (, L. Alfandari). Essec Research Center, DR‑04002 janv. 04.
  "A Path-relinking Algorithm for the Generalized Assignement Problem" (A. Plateau, P. Tolla, L. Alfandari). Essec Research Center, DR‑02007 avr. 02.


Other Publications
Articles published in conference proceedings
  "Une approche de modélisation générique pour la gestion des locomotives frêt à la SNCF", N. Marcos, D. de Almeida, D. Gauyacq, A. Nagih, G. Plateau ", With N. Marcos, D. De Almeida, D. Gauyacq, A. Nagih, G. Plateau. In : Proceedings Conference ROADEF 2005, ROADEF 2005, Tours. (France) : , 2005
  "On the Approximation of Some Spanning Arborescence Problems", With V. Paschos. In : Advances in Computer and Information Sciences '98. 13th International Symposium on Computer and Information Sciences (ISCIS),. Antalya (Turquie) : Ios Press, Ohmsha, 1998, p. 574-581


Scientific Activities
Conference Presentations
International conferences:
EURO XX, Rhodos, July 4-7, 2004: "Boolean inverse optimization problems", with M. Demange and J. Monnot CO'02 (12th Intl Symp. on Combinatorial Opt.), Paris, Apr. 8-10, 2002: "A path-relinking metaheuristic for the Generalized Assignment Problem", with A. Plateau and P. Tolla.
MIC 2001 (Metaheuristics Intl Conf.), Porto, Jul. 16-20, 2001: "A two-phase path-relinking algorithm for the Generalized Assignment Problem", with A. Plateau and P. Tolla. CLAIO X (10th Latin-Ibero-American Conf. on Op. Res. and Syst.), Mexico, Sept.
4-8, 2000: "Logical Definability of Covering and Partitioning Minimization Problems." ISCIS XIII (Intl Symp. on Comp. and Inf. Sc.), Antalya, Oct. 26-28, 1998: "On the Approximation of Some Spanning-Arborescence Problems", with V. Paschos.
FRANCORO II (2è Journées Francophones de RO), Sousse, 6-8 avr. 2000 : "Une approche heuristique pour des problèmes d'affectation de personnel appliqués au transport ferroviaire", with S. Gabteni.
EURO XV/ INFORMS XXXIV, Barcelona, Jul 13-16, 1997: "Approximating the Minimum Weight Rooted Spanning Tree with Radius Less Than Two."

National conferences:
ROADEF 2005 (French OR Society), Tours, february 2005, "Une approche de modélisation générique pour la gestion des locomotives frêt à la SNCF", N. Marcos
ROADEF 2003, Avignon, 26-28 fev 2003, "Modeles de localisation pour l'Aide Multicritere a la Decision"
ROADEF II, Autrans, 12-15 jan 1999, "Une heuristique avec garantie de performance pour le problème d'arbre recouvrant euclidien de diamètre 4."
ROADEF I, Paris, 14-16 jan 1998, "Le problème de la forêt minimum de diamètre k."
MODE 5(Math. de l'Opt. et de la Déc.), Paris, 19-21 mar 1997, "Approximation du problème de l'arbre recouvrant de poids minimum de profondeur 2."

Affiliations and Academic Responsibilities
Member of the French OR Society (ROADEF)
Reviews for international journals European J. of Op. Res., Comp. Optimization and Applications, Annals of Op. Res., RAIRO Op. Res., and for conferences
STACS, ROADEF, ORP3
Useful Links
Information Systems and Decision Sciences
Contact
E-mail

ESSEC Business School
Av. Bernard Hirsch
B.P. 50105
95021 Cergy Pontoise Cedex
France