default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurent Alfandari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Laurent Alfandari, Victoire Denoyel
, Aurélie Thiele:
Correction to: Solving utility-maximization selection problems with Multinomial Logit demand: Is the First-Choice model a good approximation? Ann. Oper. Res. 332(1): 1223 (2024)- [j22]Debajyoti Biswas, Laurent Alfandari, Claudia Archetti:
A Triple Bottom Line optimization model for assignment and routing of on-demand home services. Comput. Oper. Res. 167: 106644 (2024) - 2022
- [j21]Laurent Alfandari, Ivana Ljubic, Marcos de Melo da Silva:
A tailored Benders decomposition approach for last-mile delivery with autonomous robots. Eur. J. Oper. Res. 299(2): 510-525 (2022) - [j20]Debajyoti Biswas, Laurent Alfandari:
Designing an optimal sequence of non-pharmaceutical interventions for controlling COVID-19. Eur. J. Oper. Res. 303(3): 1372-1391 (2022) - 2021
- [j19]Laurent Alfandari, Alborz Hassanzadeh, Ivana Ljubic:
An exact method for assortment optimization under the nested logit model. Eur. J. Oper. Res. 291(3): 830-845 (2021) - [j18]Laurent Alfandari, Sophie Toulouse:
Approximation of the Double Traveling Salesman Problem with Multiple Stacks. Theor. Comput. Sci. 877: 74-89 (2021) - 2020
- [j17]Laurent Alfandari, Victoire Denoyel, Aurélie Thiele:
Solving utility-maximization selection problems with Multinomial Logit demand: Is the First-Choice model a good approximation? Ann. Oper. Res. 292(1): 553-573 (2020) - [j16]Yanlu Zhao, Laurent Alfandari:
Design of diversified package tours for the digital travel industry : A branch-cut-and-price approach. Eur. J. Oper. Res. 285(3): 825-843 (2020) - [i1]Laurent Alfandari, Sophie Toulouse:
Approximation of the Double Travelling Salesman Problem with Multiple Stacks. CoRR abs/2010.00138 (2020)
2010 – 2019
- 2019
- [j15]Milad Keshvari Fard, Laurent Alfandari:
Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem. Comput. Oper. Res. 104: 358-374 (2019) - 2018
- [j14]Juan-Carlos Espinoza García, Laurent Alfandari:
Robust location of new housing developments using a choice model. Ann. Oper. Res. 271(2): 527-550 (2018) - [j13]Laurent Alfandari, Juan-Carlos Espinoza García:
Robust optimization for non-linear impact of data variation. Comput. Oper. Res. 99: 38-47 (2018) - 2017
- [j12]Victoire Denoyel, Laurent Alfandari, Aurélie Thiele:
Optimizing healthcare network design under reference pricing and parameter uncertainty. Eur. J. Oper. Res. 263(3): 996-1006 (2017) - 2016
- [j11]Franck Butelle, Laurent Alfandari, Camille Coti, Lucian Finta, Lucas Létocart, Gérard Plateau, Frédéric Roupin, Antoine Rozenknop, Roberto Wolfler Calvo:
Fast machine reassignment. Ann. Oper. Res. 242(1): 133-160 (2016) - [j10]Paolo Gianessi, Laurent Alfandari, Lucas Létocart, Roberto Wolfler Calvo:
The Multicommodity-Ring Location Routing Problem. Transp. Sci. 50(2): 541-558 (2016) - 2015
- [j9]Laurent Alfandari, Agnès Plateau, Xavier Schepler:
A branch-and-price-and-cut approach for sustainable crop rotation planning. Eur. J. Oper. Res. 241(3): 872-879 (2015) - 2014
- [j8]Laurent Alfandari, Jérôme Monnot:
A note on the Clustered Set Covering Problem. Discret. Appl. Math. 164: 13-19 (2014) - 2013
- [j7]Laurent Alfandari, J. Sadki, Agnès Plateau, Anass Nagih:
Hybrid column generation for large-size Covering Integer Programs: Application to transportation planning. Comput. Oper. Res. 40(8): 1938-1946 (2013) - [j6]Antoine Rozenknop, Roberto Wolfler Calvo, Laurent Alfandari, Daniel Chemla, Lucas Létocart:
Solving the electricity production planning problem by a column generation based heuristic. J. Sched. 16(6): 585-604 (2013) - 2011
- [j5]Leo Liberti, Laurent Alfandari, Marie-Christine Plateau:
Edge cover by connected bipartite subgraphs. Ann. Oper. Res. 188(1): 307-329 (2011) - [j4]Laurent Alfandari, J. L. Lemalade, Anass Nagih, Gérard Plateau:
A MIP flow model for crop-rotation planning in a context of forest sustainable development. Ann. Oper. Res. 190(1): 149-164 (2011) - 2010
- [j3]Laurent Alfandari, Jérôme Monnot:
Approximation of the Clustered Set Covering Problem. Electron. Notes Discret. Math. 36: 479-485 (2010)
2000 – 2009
- 2007
- [j2]Laurent Alfandari:
Improved approximation of the general soft-capacitated facility location problem. RAIRO Oper. Res. 41(1): 83-93 (2007) - [c1]Marie-Christine Plateau, Leo Liberti, Laurent Alfandari:
Edge cover by bipartite subgraphs. CTW 2007: 127-132 - 2000
- [j1]Laurent Alfandari, Vangelis Th. Paschos:
Master-Slave Strategy and Polynomial Approximation. Comput. Optim. Appl. 16(3): 231-245 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
