Soondal Park

According to our database, Soondal Park authored at least 10 papers between 1982 and 2005.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2005

An epsilon-sensitivity analysis for semidefinite programming.

Sungmook Lim, Sangwook Lee, Soondal Park

Eur. J. Oper. Res., 2005

On the Properties of ∊-sensitivity Analysis for Linear Programming.

Chan-Kyoo Park, Woo-Je Kim, Soondal Park

Asia Pac. J. Oper. Res., 2005

2004

A label-setting algorithm for finding a quickest path.

Chan-Kyoo Park, Sangwook Lee, Soondal Park

Comput. Oper. Res., 2004

Positive sensitivity Analysis in Linear Programming.

Chan-Kyoo Park, Woo-Je Kim, Sangwook Lee, Soondal Park

Asia Pac. J. Oper. Res., 2004

A New Admissible Pivot Method for Linear Programming.

Sungmook Lim, Soondal Park

Asia Pac. J. Oper. Res., 2004

2002

LPAKO: A Simplex-based Linear Programming Program.

Sungmook Lim, Soondal Park

Optim. Methods Softw., 2002

Solving linear systems in interior-point methods.

Tongryeol Seol, Soondal Park

Comput. Oper. Res., 2002

2000

Shortest paths in a network with time-dependent flow speeds.

Kiseok Sung, Michael G. H. Bell, Myeongki Seong, Soondal Park

Eur. J. Oper. Res., 2000

1999

An e-sensitivity analysis in the primal-dual interior point method.

Woo-Je Kim, Chan-Kyoo Park, Soondal Park

Eur. J. Oper. Res., 1999

1982

Technical Note - Complementary Slackness Theorem in Multiple Objective Linear Programming.

Soondal Park

Oper. Res., 1982