Soondal Park - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 10 from 10

2005

An epsilon-sensitivity analysis for semidefinite programmingSungmook Lim, Sangwook Lee, Soondal Park. eor, 164(2):417-422, 2005. [doi]

On the Properties of ∊-sensitivity Analysis for Linear ProgrammingChan-Kyoo Park, Woo-Je Kim, Soondal Park. apjor, 22(2):135-152, 2005. [doi]

2004

A New Admissible Pivot Method for Linear ProgrammingSungmook Lim, Soondal Park. apjor, 21(4):421-434, 2004. [doi]

A label-setting algorithm for finding a quickest pathChan-Kyoo Park, Sangwook Lee, Soondal Park. cor, 31(14):2405-2418, 2004. [doi]

Positive sensitivity Analysis in Linear ProgrammingChan-Kyoo Park, Woo-Je Kim, Sangwook Lee, Soondal Park. apjor, 21(1):53-68, 2004. [doi]

2002

LPAKO: A Simplex-based Linear Programming ProgramSungmook Lim, Soondal Park. oms, 17(4):717-745, 2002. [doi]

Solving linear systems in interior-point methodsTongryeol Seol, Soondal Park. cor, 29(4):317-326, 2002. [doi]

2000

Shortest paths in a network with time-dependent flow speedsKiseok Sung, Michael G. H. Bell, Myeongki Seong, Soondal Park. eor, 121(1):32-39, 2000. [doi]

1999

An e-sensitivity analysis in the primal-dual interior point methodWoo-Je Kim, Chan-Kyoo Park, Soondal Park. eor, 116(3):629-639, 1999. [doi]

1982

Technical Note - Complementary Slackness Theorem in Multiple Objective Linear ProgrammingSoondal Park. ior, 30(2):410-412, 1982. [doi]

Sign in or sign up to see more results.

runs on WebDSL