Ue-Pyng Wen

According to our database1, Ue-Pyng Wen authored at least 24 papers between 1986 and 2013.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Type II sensitivity analysis of cost coefficients in the degenerate transportation problem.
Eur. J. Oper. Res., 2013

Pricing policies for substitutable products in a supply chain with Internet and traditional channels.
Eur. J. Oper. Res., 2013

2012
Determining a subsidy rate for Taiwan's recycling glass industry: an application of bi-level programming.
J. Oper. Res. Soc., 2012

2011
Equal Pricing Strategies in a Dual Channel Supply Chain.
Int. J. Oper. Res. Inf. Syst., 2011

Advanced sensitivity analysis of the fuzzy assignment problem.
Appl. Soft Comput., 2011

2010
Dynamic Pricing Model for Substitutable Products.
Int. J. Oper. Res. Inf. Syst., 2010

2009
A review of Hopfield neural networks for solving mathematical programming problems.
Eur. J. Oper. Res., 2009

Foreword.
Comput. Ind. Eng., 2009

2007
A hybrid neural network approach to bilevel programming problems.
Appl. Math. Lett., 2007

Sensitivity Analysis of Objective Function Coefficients of the Assignment Problem.
Asia Pac. J. Oper. Res., 2007

A Heuristic Approach for Solving Serially Distributed Storage Depots under General-Integer Policy.
Asia Pac. J. Oper. Res., 2007

2006
Delay Guarantee Backup Route Planning for Multicast Networks.
Asia Pac. J. Oper. Res., 2006

2005
Applying tabu search to backup path planning for multicast networks.
Comput. Oper. Res., 2005

2004
A labeling algorithm for the fuzzy assignment problem.
Fuzzy Sets Syst., 2004

2003
Sensitivity analysis of the optimal assignment.
Eur. J. Oper. Res., 2003

2002
Bi-directional self-healing ring network planning.
Comput. Oper. Res., 2002

2001
SDHTOOL: Planning Survivable and Cost-Effective SDH Networks at Chunghwa Telecom.
Interfaces, 2001

Optimizing the system of virtual paths by tabu search.
Eur. J. Oper. Res., 2001

1999
Applying tabu search to spare capacity planning for network restoration.
Comput. Oper. Res., 1999

1996
Finding an efficient solution to linear bilevel programming problem: An effective approach.
J. Glob. Optim., 1996

1993
Algorithms for sequencing robot activities in a robot-centered parallel-processor workcell.
Comput. Oper. Res., 1993

1990
Algorithms for solving the mixed integer two-level linear programming problem.
Comput. Oper. Res., 1990

1989
A note on a linear bilevel programming algorithm based on bicriteria programming.
Comput. Oper. Res., 1989

1986
The hybrid algorithm for solving the three-level linear programming problem.
Comput. Oper. Res., 1986


  Loading...