![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Thuy Anh Ta
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j6]Ngan Ha Duong
, Tien Thanh Dam, Thuy Anh Ta, Tien Mai:
Joint location and cost planning in maximum capture facility location under random utilities. Comput. Oper. Res. 159: 106336 (2023) - [j5]Tien Thanh Dam, Thuy Anh Ta, Tien Mai
:
Robust maximum capture facility location under random utility maximization models. Eur. J. Oper. Res. 310(3): 1128-1150 (2023) - 2022
- [j4]Tien Thanh Dam, Thuy Anh Ta, Tien Mai
:
Submodularity and local search approaches for maximum capture problems under generalized extreme value models. Eur. J. Oper. Res. 300(3): 953-965 (2022) - [j3]Tien Thanh Dam, Thuy Anh Ta
, Tien Mai:
Joint chance-constrained staffing optimization in multi-skill call centers. J. Comb. Optim. 44(1): 354-378 (2022) - 2021
- [j2]Thuy Anh Ta, Wyean Chan, Fabian Bastin, Pierre L'Ecuyer
:
A simulation-based decomposition approach for two-stage staffing optimization in call centers under arrival rate uncertainty. Eur. J. Oper. Res. 293(3): 966-979 (2021) - [j1]Thuy Anh Ta, Tien Mai, Fabian Bastin
, Pierre L'Ecuyer:
On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling. Math. Program. 190(1): 1-37 (2021)
Conference and Workshop Papers
- 2023
- [c7]Ngan Ha Duong, Thuy Anh Ta:
Min-Coverage Competitive Facility Location Under Random Utilities. KSE 2023: 1-6 - [c6]Ngan Ha Duong
, Thuy Anh Ta
:
Joint Location and Cost Optimization with Market Expansion and Customer-centric Objective. SoICT 2023: 663-670 - 2022
- [c5]Tien Thanh Dam, Thuy Anh Ta:
Distributionally Robust Fractional 0-1 Programming. KSE 2022: 1-5 - [c4]Ngan Ha Duong
, Thuy Anh Ta:
Approximation Methods for a Nonlinear Competitive Facility Cost Optimization Problem. KSE 2022: 1-6 - [c3]Thuy Anh Ta, Tien Mai, Fabian Bastin, Pierre L'Ecuyer:
A Logistic Regression and Linear Programming Approach for Multi-Skill Staffing Optimization in Call Centers. WSC 2022: 3087-3098 - 2016
- [c2]Wyean Chan, Thuy Anh Ta, Pierre L'Ecuyer
, Fabian Bastin:
Two-stage chance-constrained staffing with agent recourse for multi-skill call centers. WSC 2016: 3189-3200 - 2015
- [c1]Thuy Anh Ta, Wyean Chan, Pierre L'Ecuyer
, Fabian Bastin:
Chance-constrained scheduling with recourse for multi-skill call centers with arrival-rate and absenteeism uncertainty. WSC 2015: 3156-3157
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint