default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVan-Anh Truong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i4]Shuoguang Yang, Van-Anh Truong:
Online Learning of Independent Cascade Models with Node-level Feedback. CoRR abs/2109.02519 (2021)- 2020
- [j12]Xin Pan, Jie Song, Jingtong Zhao, Van-Anh Truong:
Online contextual learning with perishable resources allocation. IISE Trans. 52(12): 1343-1357 (2020) - [j11]Guillermo Gallego
, Anran Li, Van-Anh Truong, Xinshang Wang:
Approximation Algorithms for Product Framing and Pricing. Oper. Res. 68(1): 134-160 (2020) - [j10]Clifford Stein, Van-Anh Truong, Xinshang Wang:
Advance Service Reservations with Heterogeneous Customers. Manag. Sci. 66(7): 2929-2950 (2020) - [i3]Shatian Wang, Shuoguang Yang, Zhen Xu, Van-Anh Truong:
Fast Thompson Sampling Algorithm with Cumulative Oversampling: Application to Budgeted Influence Maximization. CoRR abs/2004.11963 (2020)
2010 – 2019
- 2019
- [i2]Shatian Wang, Zhen Xu, Van-Anh Truong:
Beyond Adaptive Submodularity: Adaptive Influence Maximization with Intermediary Constraints. CoRR abs/1911.02986 (2019) - [i1]Shuoguang Yang, Shatian Wang, Van-Anh Truong:
Online Learning and Optimization Under a New Linear-Threshold Model with Negative Influence. CoRR abs/1911.03276 (2019) - 2018
- [j9]Xinshang Wang, Van-Anh Truong:
Multi-Priority Online Scheduling with Cancellations. Oper. Res. 66(1): 104-122 (2018) - 2017
- [j8]Retsef Levi, Robin Roundy, Van-Anh Truong, Xinshang Wang:
Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models. Math. Oper. Res. 42(1): 256-276 (2017) - 2015
- [b1]Van-Anh Truong:
Optimal management of large-scale water resources systems under multi-stressor conditions in the Red River basin, Vietnam. Polytechnic University of Milan, Italy, 2015 - [j7]Van-Anh Truong:
Optimal Advance Scheduling. Manag. Sci. 61(7): 1584-1597 (2015) - 2014
- [j6]Van-Anh Truong:
Approximation Algorithm for the Stochastic Multiperiod Inventory Problem via a Look-Ahead Optimization Approach. Math. Oper. Res. 39(4): 1039-1056 (2014) - 2013
- [j5]Woonghee Tim Huh, Nan Liu, Van-Anh Truong:
Multiresource Allocation Scheduling in Dynamic Environments. Manuf. Serv. Oper. Manag. 15(2): 280-291 (2013) - 2011
- [j4]Van-Anh Truong, Robin O. Roundy:
Multidimensional Approximation Algorithms for Capacity-Expansion Problems. Oper. Res. 59(2): 313-327 (2011) - 2010
- [j3]Amar Sapra, Van-Anh Truong, Rachel Q. Zhang:
How Much Demand Should Be Fulfilled? Oper. Res. 58(3): 719-733 (2010) - [c1]Daniel Ford, François Labelle, Florentina I. Popovici, Murray Stokely, Van-Anh Truong, Luiz Barroso, Carrie Grimes, Sean Quinlan:
Availability in Globally Distributed Storage Systems. OSDI 2010: 61-74
2000 – 2009
- 2008
- [j2]Retsef Levi, Robin Roundy, David B. Shmoys, Van-Anh Truong:
Approximation Algorithms for Capacitated Stochastic Inventory Control Models. Oper. Res. 56(5): 1184-1199 (2008) - 2004
- [j1]Van-Anh Truong, Levent Tunçel:
Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers. Math. Program. 100(2): 295-316 (2004)
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 23:09 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:
