default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuanqun Ni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j13]Guanqun Ni
:
An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller. J. Comb. Optim. 46(2): 13 (2023)- 2022
- [j12]Hui Zhang, Kai Luo, Guanqun Ni:
The effects of price subsidy and fairness concern on pricing and benefits of take-away supply chain. J. Comb. Optim. 43(5): 1106-1124 (2022) - 2020
- [j11]Guanqun Ni, Lei Chen:
Improved Scheduling for the Three-Machine Proportionate Open Shop and Mixed Shop Minimum Makespan Problems. IEEE Access 8: 186805-186812 (2020) - [j10]Guanqun Ni:
Replenishment policy for a purchase-to-order seller: a tradeoff between ordering cost and delay cost. Int. J. Prod. Res. 58(4): 1239-1254 (2020) - [j9]Guanqun Ni, Xin Feng, Lei Chen:
Hotel room allocation with multiple sales channels: a perspective of minimax regret. J. Control. Decis. 7(4): 359-378 (2020) - [j8]Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, Yao Xu, An Zhang:
Approximation algorithms for the three-machine proportionate mixed shop scheduling. Theor. Comput. Sci. 803: 57-70 (2020) - 2019
- [j7]Guanqun Ni, Feifeng Zheng, Yinfeng Xu:
Competitive analysis of online revenue management with hierarchical resources. Inf. Process. Lett. 142: 41-45 (2019) - 2018
- [j6]Xin Feng, Yinfeng Xu, Guanqun Ni, Yongwu Dai:
Online leasing problem with price fluctuations under the consumer price index. J. Comb. Optim. 36(2): 493-507 (2018) - 2016
- [j5]Hongmei Li, Yin-Feng Xu, Guanqun Ni:
Minimax regret vertex 2-sink location problem in dynamic path networks. J. Comb. Optim. 31(1): 79-94 (2016) - 2015
- [j4]Guanqun Ni, Li Luo, Yinfeng Xu, Jiuping Xu, Yucheng Dong:
Optimal decisions on group buying option with a posted retail price and heterogeneous demand. Electron. Commer. Res. Appl. 14(1): 23-33 (2015) - [j3]Guanqun Ni, Li Luo, Yin-Feng Xu, Jiuping Xu:
Optimal online markdown and markup pricing policies with demand uncertainty. Inf. Process. Lett. 115(11): 804-811 (2015) - [j2]Yuya Higashikawa, John Augustine, Siu-Wing Cheng, Mordecai J. Golin, Naoki Katoh, Guanqun Ni, Bing Su, Yin-Feng Xu:
Minimax regret 1-sink location problem in dynamic path networks. Theor. Comput. Sci. 588: 24-36 (2015) - 2013
- [j1]Guanqun Ni, Yinfeng Xu, Yucheng Dong:
Price and speed decisions in customer-intensive services with two classes of customers. Eur. J. Oper. Res. 228(2): 427-436 (2013)
Conference and Workshop Papers
- 2018
- [c6]Longcheng Liu, Guanqun Ni, Yong Chen, Randy Goebel, Yue Luo, An Zhang, Guohui Lin:
Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop. AAIM 2018: 268-280 - 2017
- [c5]Guanqun Ni:
To or Not to Cooperate with Third-Party E-commerce Platform: The Influence of Commission Fee and Service Level. WHICEB 2017: 67 - 2014
- [c4]Guanqun Ni, Yinfeng Xu, Yucheng Dong:
Minimax Regret k-sink Location Problem in Dynamic Path Networks. AAIM 2014: 23-31 - 2013
- [c3]Siu-Wing Cheng, Yuya Higashikawa, Naoki Katoh, Guanqun Ni, Bing Su, Yinfeng Xu:
Minimax Regret 1-Sink Location Problems in Dynamic Path Networks. TAMC 2013: 121-132 - 2012
- [c2]Guanqun Ni, Yinfeng Xu:
Online Joint Pricing and Booking Policies in Airline Revenue Management. COCOA 2012: 281-290 - 2010
- [c1]Xia Li, Lihui Sun, Guanqun Ni:
An On-line Approach for Emergency Relief Scheduling Problem under Uncertainty. ICEE 2010: 3683-3686
Informal and Other Publications
- 2018
- [i1]Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, An Zhang:
Approximation algorithms for the three-machine proportionate mixed shop scheduling. CoRR abs/1809.05745 (2018)
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-10-07 22: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:
