A catalog of steiner tree formulations. - Michel X. Goemans; Young-Soo Myung (Networks, 1993)

On the generalized minimum spanning tree problem. - Young-Soo Myung; Chang-ho Lee; Dong-wan Tcha (Networks, 1995)

A bi-objective uncapacitated facility location problem. - Young-Soo Myung; Hu-gon Kim; Dong-wan Tcha (Eur. J. Oper. Res., 1997)

Optimal Load Balancing on Sonet Bidirectional Rings. - Young-Soo Myung; Hu-gon Kim; Dong-wan Tcha (Oper. Res., 1997)

Base station location in a cellular CDMA system. - Dong-wan Tcha; Young-Soo Myung; June-Hyuk Kwon (Telecommun. Syst., 2000)

An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting. - Young-Soo Myung (SIAM J. Discret. Math., 2001)

A New Algorithm for the Ring Loading Problem with Demand Splitting. - Young-Soo Myung; Hu-gon Kim (Applied Informatics, 2003)

A cutting plane algorithm for computing k. - Young-Soo Myung; Hyun-joon Kim (Eur. J. Oper. Res., 2004)

On the ring loading problem with demand splitting. - Young-Soo Myung; Hu-gon Kim (Oper. Res. Lett., 2004)

Multicommodity flows in cycle graphs. - Young-Soo Myung (Discret. Appl. Math., 2006)

On the clique partitioning problem in weighted interval graphs. - Young-Soo Myung (Theor. Comput. Sci., 2008)

A network flow model for the optimal allocation of both foldable and standard containers. - Young-Soo Myung; Ilkyeong Moon (Oper. Res. Lett., 2014)

Complexity and relaxation methods for minimising total average cycle stock subject to practical constraints. - Young-Soo Myung; Ilkyeong Moon (J. Oper. Res. Soc., 2020)

A polynomial time algorithm for the triangle packing problem on interval graphs. - Young-Soo Myung (Discret. Appl. Math., 2024)