default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNadia Lahrichi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Nazgol Niroumandrad, Nadia Lahrichi, Andrea Lodi
:
Learning tabu search algorithms: A scheduling application. Comput. Oper. Res. 170: 106751 (2024)- [c7]Joseph Orion Thompson, Nadia Lahrichi, Patrick Meyer, Mehrdad Mohammadi, Simon Thevenin:
A Large Neighborhood Search Metaheuristic for the Stochastic Mixed Model Assembly Line Balancing Problem with Walking Workers. MIC (2) 2024: 334-340 - 2023
- [j15]Chunlong Yu, Nadia Lahrichi, Andrea Matta:
Optimal budget allocation policy for tabu search in stochastic simulation optimization. Comput. Oper. Res. 150: 106046 (2023) - 2022
- [j14]Dominic Breuer, Shashank Kapadia, Nadia Lahrichi, James C. Benneyan:
Joint robust optimization of bed capacity, nurse staffing, and care access under uncertainty. Ann. Oper. Res. 312(2): 673-689 (2022) - [j13]Nadia Lahrichi, Ettore Lanzarone, Semih Yalçindag:
A First Route Second Assign decomposition to enforce continuity of care in home health care. Expert Syst. Appl. 193: 116442 (2022) - [c6]Nazgol Niroumandrad, Nadia Lahrichi, Andrea Lodi:
A Learning Metaheuristic Algorithm for a Scheduling Application. MIC 2022: 76-87 - 2021
- [j12]Gabriel Madelin, Nadia Lahrichi:
Modeling and improving the logistic distribution network of a hospital. Int. Trans. Oper. Res. 28(1): 70-90 (2021) - 2020
- [j11]Florian Grenouilleau, Nadia Lahrichi, Louis-Martin Rousseau:
New decomposition methods for home care scheduling with predefined visits. Comput. Oper. Res. 115: 104855 (2020)
2010 – 2019
- 2019
- [j10]Florian Grenouilleau, Antoine Legrain, Nadia Lahrichi, Louis-Martin Rousseau:
A set partitioning heuristic for the home health care routing and scheduling problem. Eur. J. Oper. Res. 275(1): 295-303 (2019) - 2016
- [j9]Renaud Masson, Nadia Lahrichi, Louis-Martin Rousseau:
A two-stage solution method for the annual dairy transportation problem. Eur. J. Oper. Res. 251(1): 36-43 (2016) - [c5]Karam Mustapha, Quentin Gilli, Jean-Marc Frayret, Nadia Lahrichi, Elnaz Karimi:
Agent-based Simulation Patient Model for Colon and Colorectal Cancer Care Trajectory. CENTERIS/ProjMAN/HCist 2016: 188-197 - [c4]Karam Mustapha, Quentin Gilli, Jean-Marc Frayret, Nadia Lahrichi:
Agent-Based Modelling and Simulation Framework for Health Care. SIMULTECH (Selected Papers) 2016: 171-197 - 2015
- [j8]Nadia Lahrichi, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei, Gloria Cerasela Crisan, Thibaut Vidal:
An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: Application to the MDPVRP. Eur. J. Oper. Res. 246(2): 400-412 (2015) - [j7]Nizar El Hachemi, Teodor Gabriel Crainic, Nadia Lahrichi, Walter Rei, Thibaut Vidal:
Solution integration in combinatorial optimization with applications to cooperative search and rich vehicle routing. J. Heuristics 21(5): 663-685 (2015) - [j6]Antoine Legrain, Hocine Bouarab, Nadia Lahrichi:
The Nurse Scheduling Problem in Real-Life. J. Medical Syst. 39(1): 160 (2015) - [j5]Nadia Lahrichi, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei, Louis-Martin Rousseau:
Strategic analysis of the dairy transportation problem. J. Oper. Res. Soc. 66(1): 44-56 (2015) - 2013
- [c3]Philip Troy, Nadia Lahrichi, Lawrence Rosenberg:
An alternative approach to modeling a pre-surgical screening clinic. WSC 2013: 2444-2451 - 2012
- [j4]Thibaut Vidal, Teodor Gabriel Crainic, Michel Gendreau, Nadia Lahrichi, Walter Rei:
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems. Oper. Res. 60(3): 611-624 (2012) - 2010
- [j3]Alain Hertz, Nadia Lahrichi, Marino Widmer:
A flexible MILP model for multiple-shift workforce planning under annualized hours. Eur. J. Oper. Res. 200(3): 860-873 (2010)
2000 – 2009
- 2009
- [j2]Alain Hertz, Nadia Lahrichi:
A patient assignment algorithm for home care services. J. Oper. Res. Soc. 60(4): 481-495 (2009) - [c2]Teodor Gabriel Crainic, Gloria Cerasela Crisan, Michel Gendreau, Nadia Lahrichi, Walter Rei:
A concurrent evolutionary approach for rich combinatorial optimization. GECCO (Companion) 2009: 2017-2022 - [c1]Teodor Gabriel Crainic, Gloria Cerasela Crisan, Michel Gendreau, Nadia Lahrichi, Walter Rei:
Multi-thread integrative cooperative optimization for rich combinatorial problems. IPDPS 2009: 1-8 - 2006
- [j1]Nadia Lahrichi, Sophie D. Lapierre, Alain Hertz, A. Talib, Lorraine Bouvier:
Analysis of a territorial approach to the delivery of nursing home care services based on historical data. J. Medical Syst. 30(4): 283-291 (2006)
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-12-10 21:45 CET 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:
