default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXuan Vinh Doan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]Ankang Sun
, Bo Chen, Xuan Vinh Doan:
Equitability and welfare maximization for allocating indivisible items. Auton. Agents Multi Agent Syst. 37(1): 8 (2023)- [j18]Ankang Sun, Bo Chen, Xuan Vinh Doan:
Fairness criteria for allocating indivisible chores: connections and efficiencies. Auton. Agents Multi Agent Syst. 37(2): 39 (2023) - [j17]Gökalp Erbeyoglu, Nalan Gülpinar, Xuan Vinh Doan:
Dynamic surgery management under uncertainty. Eur. J. Oper. Res. 309(2): 832-844 (2023) - [j16]Robin Mitra, Sarah F. McGough, Tapabrata Chakraborti, Chris C. Holmes, Ryan Copping, Niels Hagenbuch, Stefanie Biedermann, Jack Noonan, Brieuc Lehmann, Aditi Shenvi, Xuan Vinh Doan, David Leslie, Ginestra Bianconi, Rubén J. Sánchez-García, Alisha Davies, Maxine Mackintosh, Eleni-Rosalina Andrinopoulou, Anahid Basiri, Chris Harbron, Ben D. MacArthur:
Learning from data with structured missingness. Nat. Mac. Intell. 5(1): 13-23 (2023) - [c4]Ankang Sun, Bo Chen, Xuan Vinh Doan:
Equitability and Welfare Maximization for Allocating Indivisible Items. AAMAS 2023: 561-563 - [c3]Thi Tuyet Trinh Nguyen, Hoai An Le Thi, Xuan Vinh Doan:
Optimizing Merkle Tree Structure for Blockchain Transactions by a DC Programming Approach. ICCCI 2023: 405-417 - [i4]Robin Mitra, Sarah F. McGough, Tapabrata Chakraborti, Chris C. Holmes, Ryan Copping, Niels Hagenbuch, Stefanie Biedermann, Jack Noonan, Brieuc Lehmann, Aditi Shenvi, Xuan Vinh Doan, David Leslie, Ginestra Bianconi, Rubén J. Sánchez-García, Alisha Davies, Maxine Mackintosh, Eleni-Rosalina Andrinopoulou, Anahid Basiri, Chris Harbron, Ben D. MacArthur:
Learning from data with structured missingness. CoRR abs/2304.01429 (2023) - 2022
- [j15]Xuan Vinh Doan:
Distributionally robust optimization under endogenous uncertainty with an application in retrofitting planning. Eur. J. Oper. Res. 300(1): 73-84 (2022) - [j14]Chenlan Wang, Xuan Vinh Doan, Bo Chen:
Atomic congestion games with random players: network equilibrium and the price of anarchy. J. Comb. Optim. 44(3): 2123-2142 (2022) - [j13]Xuan Vinh Doan, Stephen A. Vavasis:
Low-rank matrix recovery with Ky Fan 2-k-norm. J. Glob. Optim. 82(4): 727-751 (2022) - 2021
- [c2]Ankang Sun, Bo Chen, Xuan Vinh Doan:
Connections between Fairness Criteria and Efficiency for Allocating Indivisible Chores. AAMAS 2021: 1281-1289 - [i3]Ankang Sun, Bo Chen, Xuan Vinh Doan:
Connections between Fairness Criteria and Efficiency for Allocating Indivisible Chores. CoRR abs/2101.07435 (2021) - 2020
- [j12]Xuan Vinh Doan, Xiao Lei, Siqian Shen:
Pricing of reusable resources under ambiguous distributions of demand and service time with emerging applications. Eur. J. Oper. Res. 282(1): 235-251 (2020) - [j11]Xuan Vinh Doan, Tri-Dung Nguyen:
Technical Note - Robust Newsvendor Games with Ambiguity in Demand Distributions. Oper. Res. 68(4): 1047-1062 (2020)
2010 – 2019
- 2019
- [j10]Xuan Vinh Doan, Duncan Shaw:
Resource allocation when planning for simultaneous disasters. Eur. J. Oper. Res. 274(2): 687-709 (2019) - [c1]Xuan Vinh Doan, Stephen A. Vavasis:
Low-Rank Matrix Recovery with Ky Fan 2-k-Norm. WCGO 2019: 310-319 - 2016
- [j9]Xuan Vinh Doan, Stephen A. Vavasis:
Finding the Largest Low-Rank Clusters With Ky Fan 2-k-Norm and ℓ1-Norm. SIAM J. Optim. 26(1): 274-312 (2016) - 2015
- [j8]Xuan Vinh Doan, Xiaobo Li, Karthik Natarajan:
Robustness to Dependency in Portfolio Optimization Using Overlapping Marginals. Oper. Res. 63(6): 1468-1488 (2015) - 2014
- [i2]Xuan Vinh Doan, Tri-Dung Nguyen:
Robust Stable Payoff Distribution in Stochastic Cooperative Games. CoRR abs/1403.5906 (2014) - 2013
- [j7]Xuan Vinh Doan, Stephen A. Vavasis:
Finding Approximately Rank-One Submatrices with the Nuclear Norm and 퓁1-Norm. SIAM J. Optim. 23(4): 2502-2540 (2013) - [j6]Xuan Vinh Doan, Kim-Chuan Toh, Stephen A. Vavasis:
A Proximal Point Algorithm for Sequential Feature Extraction Applications. SIAM J. Sci. Comput. 35(1) (2013) - [i1]Chenlan Wang, Xuan Vinh Doan, Bo Chen:
Price of Anarchy for Non-atomic Congestion Games with Stochastic Demands. CoRR abs/1310.4874 (2013) - 2012
- [j5]Xuan Vinh Doan, Karthik Natarajan:
On the Complexity of Nonoverlapping Multivariate Marginal Bounds for Probabilistic Combinatorial Optimization Problems. Oper. Res. 60(1): 138-149 (2012) - [j4]Xuan Vinh Doan, Serge Kruk, Henry Wolkowicz:
A robust algorithm for semidefinite programming. Optim. Methods Softw. 27(4-5): 667-693 (2012) - 2010
- [j3]Dimitris Bertsimas, Xuan Vinh Doan:
Robust and data-driven approaches to call centers. Eur. J. Oper. Res. 207(2): 1072-1085 (2010) - [j2]Dimitris Bertsimas, Xuan Vinh Doan, Karthik Natarajan, Chung-Piaw Teo:
Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion. Math. Oper. Res. 35(3): 580-602 (2010)
2000 – 2009
- 2008
- [j1]Dimitris Bertsimas, Xuan Vinh Doan, Jean B. Lasserre:
Approximating integrals of multivariate exponentials: A moment approach. Oper. Res. Lett. 36(2): 205-210 (2008)
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-06-10 20:23 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:
