default search action
Wenqiang Dai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Wenqiang Dai, Min Liu, Chengbin Chu, Ming Liu:
Robust optimization for spread quality and shortfall in guaranteed targeted display advertising planning. Comput. Oper. Res. 161: 106421 (2024) - [j14]Xiaoyue Zhang, Wenqiang Dai, Xiaoqiang Cai:
Inventory replenishment decisions with uncertain price and demand. Int. J. Prod. Res. 62(7): 2663-2682 (2024) - 2023
- [j13]Xiaoyue Zhang, Wenqiang Dai, Xiaoqiang Cai, Xiaoyu Zhou:
Replenishment Policy with Limited Price Information. Asia Pac. J. Oper. Res. 40(3): 2250029:1-2250029:26 (2023) - 2022
- [j12]Wenqiang Dai, Meng Zheng, Xu Chen
, Zhuolin Yang:
Online economic ordering problem for deteriorating items with limited price information. J. Comb. Optim. 44(4): 2246-2268 (2022) - 2020
- [j11]Wenqiang Dai, Zhuolin Yang
Real-time procurement policy with yield and price uncertainty. Int. J. Prod. Res. 58(3): 758-782 (2020)
2010 – 2019
- 2018
- [j10]Wenxin Wang, Yi Feng, Wenqiang Dai:
Topic analysis of online reviews for two competitive products using latent Dirichlet allocation. Electron. Commer. Res. Appl. 29: 142-156 (2018) - 2016
- [j9]Wenqiang Dai, Qingzhu Jiang, Yi Feng:
A note: An improved upper bound for the online inventory problem with bounded storage and order costs. Eur. J. Oper. Res. 249(2): 628-630 (2016) - [j8]Wenqiang Dai, Yucheng Dong, Xiaotian Zhang:
Competitive analysis of the online financial lease problem. Eur. J. Oper. Res. 250(3): 865-873 (2016) - 2015
- [j7]Yi Feng, Shaoxiang Chen
The Optimal Order Policy for a Capacitated Multiple Product Inventory System Under Symmetry. Asia Pac. J. Oper. Res. 32(2): 1550005:1-1550005:17 (2015) - 2014
- [j6]Wenqiang Dai:
A 16-competitive algorithm for hierarchical median problem. Sci. China Inf. Sci. 57(3): 1-7 (2014) - 2012
- [j5]Guoliang He, Jian Su, Wenqiang Dai:
The Optimal L2 Error Estimate of Stabilized Finite Volume Method for the Stationary Navier-Stokes Problem. Adv. Numer. Anal. 2012: 251908:1-251908:17 (2012) - 2011
- [c6]Wenqiang Dai, Yi Feng:
An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem. FAW-AAIM 2011: 29-35 - 2010
- [j4]Wenqiang Dai, Xianju Zeng:
Incremental Facility Location Problem and Its Competitive Algorithms. J. Comb. Optim. 20(3): 307-320 (2010) - [c5]Wenqiang Dai:
Some Results on Incremental Vertex Cover Problem. AAIM 2010: 112-118
2000 – 2009
- 2007
- [j3]Yinfeng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki
Triangulating a convex polygon with fewer number of non-standard bars. Theor. Comput. Sci. 389(1-2): 143-151 (2007) - 2006
- [j2]Wenqiang Dai, Yinfeng Xu, Binhai Zhu:
On the edge linfinitf radius of Saitou and Nei's method for phylogenetic reconstruction. Theor. Comput. Sci. 369(1-3): 448-455 (2006) - [c4]Yixue Li, Yu Xu, Gengzhong Feng, Wenqiang Dai:
On Loan-to-Value Ratios of Inventory Financing with Doubly Stochastic Poisson Default Processes. APSCC 2006: 663-666 - 2005
- [j1]Yinfeng Xu, Wenqiang Dai, Binhai Zhu:
A lower bound on the edge linfinitely radius of Saitou and Nei's method for phylogenetic reconstruction. Inf. Process. Lett. 94(5): 225-230 (2005) - [c3]Feifeng Zheng, Wenqiang Dai, Peng Xiao, Yun Zhao:
Competitive Strategies for On-line Production Order Disposal Problem. AAIM 2005: 46-54 - [c2]Wenqiang Dai, Peng Xiao, Ke Jiang:
Facility Location in a Global View. AAIM 2005: 142-150 - [c1]Yin-Feng Xu, Wenqiang Dai, Naoki Katoh, Makoto Ohsaki:
Triangulating a Convex Polygon with Small Number of Non-standard Bars. COCOON 2005: 481-489
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-25 05:55 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: