default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHasan Murat Afsar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c3]Matthieu Godichaud, Hasan Murat Afsar, Yassine Ouazene:
Pre-positioned inventory model for supply chain disruption mitigation. CoDIT 2024: 1745-1750- 2022
- [j12]Hasan Murat Afsar
:
Traveling salesperson problem with unique pricing and stochastic thresholds. Comput. Ind. Eng. 173: 108696 (2022) - [j11]Sana Frifita, Hasan Murat Afsar, Faicel Hnaien:
A robust optimization approach for disassembly assembly routing problem under uncertain yields. Expert Syst. Appl. 202: 117304 (2022) - 2020
- [j10]Hasan Murat Afsar, Faicel Hnaien:
Formulations and solution algorithms for dynamic assembly routing problem. Int. J. Prod. Res. 58(3): 671-688 (2020)
2010 – 2019
- 2017
- [c2]Jorge F. Victoria, Hasan Murat Afsar, Christian Prins:
Metaheuristic Framework for a Disaster Logistics Problem with Time-Dependent Demands. ICCL 2017: 143-157 - 2016
- [j9]Hasan Murat Afsar, Christian Artigues, Eric Bourreau, Safia Kedad-Sidhoum:
Machine reassignment problem: the ROADEF/EURO challenge 2012. Ann. Oper. Res. 242(1): 1-17 (2016) - [j8]Juan Carlos Rivera, Hasan Murat Afsar, Christian Prins:
Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem. Eur. J. Oper. Res. 249(1): 93-104 (2016) - [j7]Maher Rebai, Hasan Murat Afsar, Hichem Snoussi:
Exact methods for sensor deployment problem with connectivity constraint in wireless sensor networks. Int. J. Sens. Networks 21(3): 157-168 (2016) - 2015
- [j6]Juan Carlos Rivera, Hasan Murat Afsar, Christian Prins:
A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem. Comput. Optim. Appl. 61(1): 159-187 (2015) - 2014
- [j5]Hasan Murat Afsar, Christian Prins, Andréa Cynthia Santos:
Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size. Int. Trans. Oper. Res. 21(1): 153-175 (2014) - 2013
- [j4]Hasan Murat Afsar, Nacima Labadie:
Team Orienteering Problem with Decreasing Profits. Electron. Notes Discret. Math. 41: 285-293 (2013) - [j3]Ender Özcan, Christian Artigues, Eric Bourreau, Hasan Murat Afsar:
Special issue on maintenance scheduling: theory and applications. J. Sched. 16(6): 549-550 (2013) - [c1]Juan Carlos Rivera, Hasan Murat Afsar, Christian Prins:
Multistart Evolutionary Local Search for a Disaster Relief Problem. Artificial Evolution 2013: 129-141 - 2011
- [j2]Hasan Murat Afsar, Nicolas Jozefowiez, Pierre Lopez:
A branch-and-price algorithm for the windy rural postman problem. RAIRO Oper. Res. 45(4): 353-364 (2011) - 2010
- [j1]Hasan Murat Afsar:
A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows. Electron. Notes Discret. Math. 36: 319-326 (2010)
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-11-14 00:57 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:
