default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Zhuoyu Long
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Daniel Zhuoyu Long
, Jin Qi, Aiqi Zhang:
Supermodularity in Two-Stage Distributionally Robust Optimization. Manag. Sci. 70(3): 1394-1409 (2024)- [j12]Xiaoqiang Cai, Daniel Zhuoyu Long, Gen Yu, Lianmin Zhang:
Multiportfolio Optimization: A Fairness-Aware Target-Oriented Model. Manuf. Serv. Oper. Manag. 26(3): 952-971 (2024) - 2023
- [j11]Lianmin Zhang, Lei Guan, Daniel Zhuoyu Long, Houcai Shen, Huajun Tang:
Who is better off by selling extended warranties in the supply chain: the manufacturer, the retailer, or both? Ann. Oper. Res. 328(2): 1557-1583 (2023) - [j10]Daniel Zhuoyu Long, Melvyn Sim, Minglong Zhou:
Robust Satisficing. Oper. Res. 71(1): 61-82 (2023) - [j9]Zheng Cui, Daniel Zhuoyu Long, Jin Qi, Lianmin Zhang:
The Inventory Routing Problem Under Uncertainty. Oper. Res. 71(1): 378-395 (2023) - [c1]Chen Yang, Ziqiang Zhang, Bo Cao, Zheng Cui, Bin Hu, Tong Li, Daniel Zhuoyu Long, Jin Qi, Feng Wang, Ruohan Zhan:
Fragility Index: A New Approach for Binary Classification. KDD 2023: 2918-2929 - 2022
- [j8]Vincent Tsz Fai Chow, Zheng Cui, Daniel Zhuoyu Long:
Target-Oriented Distributionally Robust Optimization and Its Applications to Surgery Allocation. INFORMS J. Comput. 34(4): 2058-2072 (2022) - 2021
- [j7]Jin Xu, Xiaohan Zhou, Jianghua Zhang, Daniel Zhuoyu Long:
The optimal channel structure with retail costs in a dual-channel supply chain. Int. J. Prod. Res. 59(1): 47-75 (2021) - [j6]Antonio J. Conejo, Nicholas G. Hall, Daniel Zhuoyu Long, Runhao Zhang:
Robust Capacity Planning for Project Management. INFORMS J. Comput. 33(4): 1533-1550 (2021) - [j5]Xin Chen, Daniel Zhuoyu Long, Jin Qi:
Preservation of Supermodularity in Parametric Optimization: Necessary and Sufficient Conditions on Constraint Structures. Oper. Res. 69(1): 1-12 (2021) - 2020
- [i2]Xin Huang, Duan Li, Daniel Zhuoyu Long:
Scenario-decomposition Solution Framework for Nonseparable Stochastic Control Problems. CoRR abs/2010.08985 (2020)
2010 – 2019
- 2019
- [i1]Xin Huang, Duan Li, Daniel Zhuoyu Long:
Revised Progressive-Hedging-Algorithm Based Two-layer Solution Scheme for Bayesian Reinforcement Learning. CoRR abs/1906.09035 (2019) - 2015
- [j4]Nicholas G. Hall, Daniel Zhuoyu Long, Jin Qi, Melvyn Sim:
Managing Underperformance Risk in Project Portfolio Selection. Oper. Res. 63(3): 660-675 (2015) - [j3]Lucy Gongtao Chen, Daniel Zhuoyu Long, Melvyn Sim:
On Dynamic Decision Making to Meet Consumption Targets. Oper. Res. 63(5): 1117-1130 (2015) - [j2]Lucy Gongtao Chen, Daniel Zhuoyu Long, Georgia Perakis:
The Impact of a Target on Newsvendor Decisions. Manuf. Serv. Oper. Manag. 17(1): 78-86 (2015) - 2014
- [j1]Daniel Zhuoyu Long, Jin Qi:
Distributionally robust discrete optimization with Entropic Value-at-Risk. Oper. Res. Lett. 42(8): 532-538 (2014)
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-08-05 21:19 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:
