default search action
Sara Khodaparasti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c5]Maria Elena Bruni, Sara Khodaparasti, Guido Perboli:
Economic Sustainability in Last-Mile Drone Delivery Problem with Fulfillment Centers: A Mathematical Formulation. ICORES 2024: 382-389 - 2023
- [j10]Maria Elena Bruni, Sara Khodaparasti, Guido Perboli:
Energy Efficient UAV-Based Last-Mile Delivery: A Tactical-Operational Model With Shared Depots and Non-Linear Energy Consumption. IEEE Access 11: 18560-18570 (2023) - [j9]Patrizia Beraldi, Sara Khodaparasti:
A bi-level model for the design of dynamic electricity tariffs with demand-side flexibility. Soft Comput. 27(18): 12925-12942 (2023) - 2022
- [j8]Samuel Nucamendi-Guillén, Iris Martínez-Salazar, Sara Khodaparasti, Maria Elena Bruni:
New formulations and solution approaches for the latency location routing problem. Comput. Oper. Res. 143: 105767 (2022) - [j7]Maria Elena Bruni, Sara Khodaparasti, Mohammad Moshref-Javadi:
A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones. Comput. Oper. Res. 145: 105845 (2022) - [j6]Maria Elena Bruni, Sara Khodaparasti, Iris Martínez-Salazar, Samuel Nucamendi-Guillén:
The multi-depot k-traveling repairman problem. Optim. Lett. 16(9): 2681-2709 (2022) - [c4]Maria Elena Bruni, Sara Khodaparasti:
Addressing the Challenges of Last-mile: The Drone Routing Problem with Shared Fulfillment Centers. ICORES 2022: 362-367 - 2020
- [j5]Maria Elena Bruni, Patrizia Beraldi, Sara Khodaparasti:
A hybrid reactive GRASP heuristic for the risk-averse k-traveling repairman problem with profits. Comput. Oper. Res. 115: 104854 (2020) - [j4]Maria Elena Bruni, Sara Khodaparasti, Erik Demeulemeester:
The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times. Comput. Oper. Res. 123: 105017 (2020) - [c3]Maria Elena Bruni, Sara Khodaparasti, Samuel Nucamendi-Guillén:
The Bi-objective Minimum Latency Problem with Profit Collection and Uncertain Travel Times. ICORES 2020: 109-118
2010 – 2019
- 2019
- [c2]Maria Elena Bruni, Sara Khodaparasti:
Tractable Risk Measures for the Selective Scheduling Problem with Sequence-Dependent Setup Times. ICORES (Selected Papers) 2019: 70-84 - [c1]Maria Elena Bruni, Sara Khodaparasti, Patrizia Beraldi:
A Selective Scheduling Problem with Sequence-dependent Setup Times: A Risk-averse Approach. ICORES 2019: 195-201 - 2018
- [j3]Maria Elena Bruni, Patrizia Beraldi, Sara Khodaparasti:
A heuristic Approach for the k-Traveling Repairman Problem with Profits under Uncertainty. Electron. Notes Discret. Math. 69: 221-228 (2018) - 2017
- [j2]Roberto Aringhieri, Maria Elena Bruni, Sara Khodaparasti, J. Theresia van Essen:
Emergency medical services and beyond: Addressing new challenges through a wide literature review. Comput. Oper. Res. 78: 349-368 (2017) - 2016
- [j1]Sara Khodaparasti, Hamid Reza Maleki, Maria Elena Bruni, Sedigheh Jahedi, Patrizia Beraldi, Domenico Conforti:
Balancing efficiency and equity in location-allocation models with an application to strategic EMS design. Optim. Lett. 10(5): 1053-1070 (2016)
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-05-08 20:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint