default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbdullah Dasci
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]Mumtaz Karatas
, Ertan Yakici, Abdullah Dasci:
Solving a bi-objective unmanned aircraft system location-allocation problem. Ann. Oper. Res. 319(2): 1631-1654 (2022)- 2021
- [j13]Fatma Tevhide Altekin, Abdullah Dasci, Mumtaz Karatas:
Linear and conic reformulations for the maximum capture location problem under multinomial logit choice. Optim. Lett. 15(8): 2611-2637 (2021) - 2020
- [j12]Mumtaz Karatas, Abdullah Dasci:
A two-level facility location and sizing problem for maximal coverage. Comput. Ind. Eng. 139: 106204 (2020) - [i1]Siamak Naderi, Kemal Kilic, Abdullah Dasci:
A Deterministic Model for the Transshipment Problem of a Fast Fashion Retailer under Capacity Constraints. CoRR abs/2001.02499 (2020)
2010 – 2019
- 2015
- [c1]Engin Topaloglu, Abdullah Dasci, M. Hasan Eken:
A Hierarchical Model for the Cash Transfer System Design Problem. ICCL 2015: 31-45 - 2014
- [j11]Fatma Gzara, Eissa Nematollahi, Abdullah Dasci:
Linear location-inventory models for service parts logistics network design. Comput. Ind. Eng. 69: 53-63 (2014)
2000 – 2009
- 2009
- [j10]Abdullah Dasci, Mustafa Karakul:
Two-period dynamic versus fixed-ratio pricing in a capacity constrained duopoly. Eur. J. Oper. Res. 197(3): 945-968 (2009) - [r1]Abdullah Dasci, Vedat Verter:
Production-Distribution System Design Problem. Encyclopedia of Optimization 2009: 3088-3098 - 2008
- [j9]Abdullah Dasci, Mustafa Karakul:
Performance evaluation of a single-stage two-product manufacturing system operating under pull-type control. Comput. Oper. Res. 35(9): 2861-2876 (2008) - 2007
- [j8]Abdullah Dasci, Gilbert Laporte:
Erratum to "A Continuous Model for Multistore Competitive Location". Oper. Res. 55(6): 1188-1190 (2007) - 2005
- [j7]Abdullah Dasci, Vedat Verter:
Evaluation of Plant Focus Strategies: A Continuous Approximation Framework. Ann. Oper. Res. 136(1): 303-327 (2005) - [j6]Abdullah Dasci, Gilbert Laporte:
A Continuous Model for Multistore Competitive Location. Oper. Res. 53(2): 263-280 (2005) - [j5]Abdullah Dasci, Gilbert Laporte:
An analytical approach to the facility location and capacity acquisition problem under demand uncertainty. J. Oper. Res. Soc. 56(4): 397-405 (2005) - 2002
- [j4]Abdullah Dasci, Horst A. Eiselt, Gilbert Laporte:
On the (r|Xp)-Medianoid Problem on a Network with Vertex and Edge Demands. Ann. Oper. Res. 111(1-4): 271-278 (2002) - [j3]Vedat Verter, Abdullah Dasci:
The plant location and flexible technology acquisition problem. Eur. J. Oper. Res. 136(2): 366-382 (2002) - [j2]Abdullah Dasci, Vedat Verter:
Erratum to: "A continuous model for production-distribution system design problem" [EJOR 129 (2) (2001) 287-298]. Eur. J. Oper. Res. 137(1): 229 (2002) - 2001
- [j1]Abdullah Dasci, Vedat Verter:
A continuous model for production-distribution system design. Eur. J. Oper. Res. 129(2): 287-298 (2001)
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-04-24 22:53 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:
