default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKun-Shan Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j13]Liang-Yuh Ouyang
, Kun-Shan Wu, Chih-Te Yang, Hsiu-Feng Yen:
Optimal order policy in response to announced price increase for deteriorating items with limited special order quantity. Int. J. Syst. Sci. 47(3): 718-729 (2016)- [j12]Kun-Shan Wu, Pei-Chuan Chang:
Identifying communities and influential node in Facebook fan page - a case study of FJU 2013 ad camp. Int. J. Web Based Communities 12(4): 376-392 (2016) - 2012
- [j11]Chiau-Ching Chen, Hsu-Shih Shih, Huan-Jyh Shyur, Kun-Shan Wu:
A business strategy selection of green supply chain management via an analytic network process. Comput. Math. Appl. 64(8): 2544-2557 (2012) - 2011
- [j10]Chih-Te Yang, Liang-Yuh Ouyang, Kun-Shan Wu, Hsiu-Feng Yen:
An optimal replenishment policy for deteriorating items with stock-dependent demand and relaxed terminal conditions under limited storage space. Central Eur. J. Oper. Res. 19(1): 139-153 (2011)
2000 – 2009
- 2009
- [j9]Kun-Shan Wu, Liang-Yuh Ouyang, Chih-te Yang:
Coordinating replenishment and pricing policies for non-instantaneous deteriorating items with price-sensitive demand. Int. J. Syst. Sci. 40(12): 1273-1281 (2009) - 2007
- [j8]Liang-Yuh Ouyang, Kun-Shan Wu, Chih-te Yang:
An EOQ Model with Limited Storage Capacity under Trade Credits. Asia Pac. J. Oper. Res. 24(4): 575-592 (2007) - [j7]Jhieh-Yu Shyng, Fang-Kuo Wang, Gwo-Hshiung Tzeng, Kun-Shan Wu:
Rough Set Theory in analyzing the attributes of combination values for the insurance market. Expert Syst. Appl. 32(1): 56-64 (2007) - [j6]Kun-Shan Wu, Liang-Yuh Ouyang, Chia-Huei Ho:
Integrated vendor--buyer inventory system with sublot sampling inspection policy and controllable lead time. Int. J. Syst. Sci. 38(4): 339-350 (2007) - 2006
- [j5]Liang-Yuh Ouyang, Kun-Shan Wu, Chia-Huei Ho:
The Single-Vendor Single-Buyer Integrated inventory Problem with Quality Improvement and lead Time Reduction - minimax Distribution-Free Approach. Asia Pac. J. Oper. Res. 23(3): 407-424 (2006) - [j4]Liang-Yuh Ouyang, Kun-Shan Wu, Chih-te Yang:
A study on an inventory model for non-instantaneous deteriorating items with permissible delay in payments. Comput. Ind. Eng. 51(4): 637-651 (2006) - [j3]Hung-Chi Chang, Liang-Yuh Ouyang, Kun-Shan Wu, Chia-Huei Ho:
Integrated vendor-buyer cooperative inventory models with controllable lead time and ordering cost reduction. Eur. J. Oper. Res. 170(2): 481-495 (2006) - 2002
- [j2]Kun-Shan Wu:
EOQ inventory model for items with Weibull distribution deterioration, time-varying demand and partial backlogging. Int. J. Syst. Sci. 33(5): 323-329 (2002)
1990 – 1999
- 1997
- [j1]Liang-Yuh Ouyang, Kun-Shan Wu:
Mixture inventory model involving variable lead time with a service level constraint. Comput. Oper. Res. 24(9): 875-882 (1997)
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:00 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:
