Laurent Alfandari

According to our database, Laurent Alfandari authored at least 24 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Correction to: Solving utility-maximization selection problems with Multinomial Logit demand: Is the First-Choice model a good approximation?

Laurent Alfandari, Victoire Denoyel, Aurélie Thiele

Ann. Oper. Res., January, 2024

2022

Designing an optimal sequence of non-pharmaceutical interventions for controlling COVID-19.

Debajyoti Biswas, Laurent Alfandari

Eur. J. Oper. Res., 2022

A tailored Benders decomposition approach for last-mile delivery with autonomous robots.

Laurent Alfandari, Ivana Ljubic, Marcos de Melo da Silva

Eur. J. Oper. Res., 2022

2021

Approximation of the Double Traveling Salesman Problem with Multiple Stacks.

Laurent Alfandari, Sophie Toulouse

Theor. Comput. Sci., 2021

An exact method for assortment optimization under the nested logit model.

Laurent Alfandari, Alborz Hassanzadeh, Ivana Ljubic

Eur. J. Oper. Res., 2021

2020

Design of diversified package tours for the digital travel industry : A branch-cut-and-price approach.

Yanlu Zhao, Laurent Alfandari

Eur. J. Oper. Res., 2020

Approximation of the Double Travelling Salesman Problem with Multiple Stacks.

Laurent Alfandari, Sophie Toulouse

CoRR, 2020

Solving utility-maximization selection problems with Multinomial Logit demand: Is the First-Choice model a good approximation?

Laurent Alfandari, Victoire Denoyel, Aurélie Thiele

Ann. Oper. Res., 2020

2019

Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem.

Milad Keshvari Fard, Laurent Alfandari

Comput. Oper. Res., 2019

2018

Robust optimization for non-linear impact of data variation.

Laurent Alfandari, Juan-Carlos Espinoza García

Comput. Oper. Res., 2018

Robust location of new housing developments using a choice model.

Juan-Carlos Espinoza García, Laurent Alfandari

Ann. Oper. Res., 2018

2017

Optimizing healthcare network design under reference pricing and parameter uncertainty.

Victoire Denoyel, Laurent Alfandari, Aurélie Thiele

Eur. J. Oper. Res., 2017

2016

The Multicommodity-Ring Location Routing Problem.

Paolo Gianessi, Laurent Alfandari, Lucas Létocart, Roberto Wolfler Calvo

Transp. Sci., 2016

Fast machine reassignment.

Franck Butelle, Laurent Alfandari, Camille Coti, Lucian Finta, Lucas Létocart, Gérard Plateau, Frédéric Roupin, Antoine Rozenknop, Roberto Wolfler Calvo

Ann. Oper. Res., 2016

2015

A branch-and-price-and-cut approach for sustainable crop rotation planning.

Laurent Alfandari, Agnès Plateau, Xavier Schepler

Eur. J. Oper. Res., 2015

2014

A note on the Clustered Set Covering Problem.

Laurent Alfandari, Jérôme Monnot

Discret. Appl. Math., 2014

2013

Solving the electricity production planning problem by a column generation based heuristic.

Antoine Rozenknop, Roberto Wolfler Calvo, Laurent Alfandari, Daniel Chemla, Lucas Létocart

J. Sched., 2013

Hybrid column generation for large-size Covering Integer Programs: Application to transportation planning.

Laurent Alfandari, J. Sadki, Agnès Plateau, Anass Nagih

Comput. Oper. Res., 2013

2011

Edge cover by connected bipartite subgraphs.

Leo Liberti, Laurent Alfandari, Marie-Christine Plateau

Ann. Oper. Res., 2011

A MIP flow model for crop-rotation planning in a context of forest sustainable development.

Laurent Alfandari, J. L. Lemalade, Anass Nagih, Gérard Plateau

Ann. Oper. Res., 2011

2010

Approximation of the Clustered Set Covering Problem.

Laurent Alfandari, Jérôme Monnot

Electron. Notes Discret. Math., 2010

2007

Improved approximation of the general soft-capacitated facility location problem.

Laurent Alfandari

RAIRO Oper. Res., 2007

Edge cover by bipartite subgraphs.

Marie-Christine Plateau, Leo Liberti, Laurent Alfandari

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2000

Master-Slave Strategy and Polynomial Approximation.

Laurent Alfandari, Vangelis Th. Paschos

Comput. Optim. Appl., 2000