default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUe-Pyng Wen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j24]Yun-Chu Chen, Shu-Cherng Fang, Ue-Pyng Wen:
Pricing policies for substitutable products in a supply chain with Internet and traditional channels. Eur. J. Oper. Res. 224(3): 542-551 (2013)- [j23]Kang-Ting Ma
, Chi-Jen Lin, Ue-Pyng Wen:
Type II sensitivity analysis of cost coefficients in the degenerate transportation problem. Eur. J. Oper. Res. 227(2): 293-300 (2013) - 2012
- [j22]Hsu-Shih Shih, Chi-Bin Cheng, Ue-Pyng Wen, Y.-C. Huang, M.-Y. Peng:
Determining a subsidy rate for Taiwan's recycling glass industry: an application of bi-level programming. J. Oper. Res. Soc. 63(1): 28-37 (2012) - 2011
- [j21]Chi-Jen Lin, Ue-Pyng Wen, Pei-Yi Lin:
Advanced sensitivity analysis of the fuzzy assignment problem. Appl. Soft Comput. 11(8): 5341-5349 (2011) - [j20]Ue-Pyng Wen, Yun-Chu Chen, Kam-Hong Cheung:
Equal Pricing Strategies in a Dual Channel Supply Chain. Int. J. Oper. Res. Inf. Syst. 2(4): 34-51 (2011) - 2010
- [j19]Ue-Pyng Wen, Yi Chen:
Dynamic Pricing Model for Substitutable Products. Int. J. Oper. Res. Inf. Syst. 1(1): 35-51 (2010) - 2009
- [j18]Ue-Pyng Wen, D. Daniel Sheu, Sheue-Ling Hwang, Der-Baau Perng:
Foreword. Comput. Ind. Eng. 57(2): 445 (2009) - [j17]Ue-Pyng Wen, Kuen-Ming Lan, Hsu-Shih Shih:
A review of Hopfield neural networks for solving mathematical programming problems. Eur. J. Oper. Res. 198(3): 675-687 (2009) - 2007
- [j16]Chi-Jen Lin, Ue-Pyng Wen:
Sensitivity Analysis of Objective Function Coefficients of the Assignment Problem. Asia Pac. J. Oper. Res. 24(2): 203-221 (2007) - [j15]Fang-Chuan Lee, Ue-Pyng Wen:
A Heuristic Approach for Solving Serially Distributed Storage Depots under General-Integer Policy. Asia Pac. J. Oper. Res. 24(4): 479-497 (2007) - [j14]Kuen-Ming Lan, Ue-Pyng Wen, Hsu-Shih Shih, E. Stanley Lee:
A hybrid neural network approach to bilevel programming problems. Appl. Math. Lett. 20(8): 880-884 (2007) - 2006
- [j13]Chyi-Bao Yang, Ue-Pyng Wen, Ching-Chir Shyur:
Delay Guarantee Backup Route Planning for Multicast Networks. Asia Pac. J. Oper. Res. 23(1): 25-39 (2006) - 2005
- [j12]Chyi-Bao Yang, Ue-Pyng Wen:
Applying tabu search to backup path planning for multicast networks. Comput. Oper. Res. 32: 2875-2889 (2005) - 2004
- [j11]Chi-Jen Lin, Ue-Pyng Wen:
A labeling algorithm for the fuzzy assignment problem. Fuzzy Sets Syst. 142(3): 373-391 (2004) - 2003
- [j10]Chi-Jen Lin, Ue-Pyng Wen:
Sensitivity analysis of the optimal assignment. Eur. J. Oper. Res. 149(1): 35-46 (2003) - 2002
- [j9]Ue-Pyng Wen, Tsung-Lin Wu, Ching-Chir Shyur:
Bi-directional self-healing ring network planning. Comput. Oper. Res. 29(12): 1719-1737 (2002) - 2001
- [j8]Ching-Chir Shyur, Ue-Pyng Wen:
Optimizing the system of virtual paths by tabu search. Eur. J. Oper. Res. 129(3): 650-662 (2001) - [j7]Ching-Chir Shyur, Ue-Pyng Wen:
SDHTOOL: Planning Survivable and Cost-Effective SDH Networks at Chunghwa Telecom. Interfaces 31(4): 87-108 (2001) - 1999
- [j6]Ching-Chir Shyur, Ta-Chien Lu, Ue-Pyng Wen:
Applying tabu search to spare capacity planning for network restoration. Comput. Oper. Res. 26(12): 1175-1194 (1999) - 1996
- [j5]Ue-Pyng Wen, Sen-Fon Lin:
Finding an efficient solution to linear bilevel programming problem: An effective approach. J. Glob. Optim. 8(3): 295-306 (1996) - 1993
- [j4]Wu-Der Jeng, James T. Lin, Ue-Pyng Wen:
Algorithms for sequencing robot activities in a robot-centered parallel-processor workcell. Comput. Oper. Res. 20(2): 185-197 (1993) - 1990
- [j3]Ue-Pyng Wen, Y. H. Yang:
Algorithms for solving the mixed integer two-level linear programming problem. Comput. Oper. Res. 17(2): 133-142 (1990) - 1989
- [j2]Ue-Pyng Wen, Shuh-Tzy Hsu:
A note on a linear bilevel programming algorithm based on bicriteria programming. Comput. Oper. Res. 16(1): 79-83 (1989) - 1986
- [j1]Ue-Pyng Wen, Wayne F. Bialas:
The hybrid algorithm for solving the three-level linear programming problem. Comput. Oper. Res. 13(4): 367-377 (1986)
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 2025-01-21 00:01 CET 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:
