Young-Soo Myung

14 papers Journal 13Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
A polynomial time algorithm for the triangle packing problem on interval graphs.
Discret. Appl. Math.
Young-Soo Myung
2020 J jnl
Complexity and relaxation methods for minimising total average cycle stock subject to practical constraints.
J. Oper. Res. Soc.
Young-Soo Myung, Ilkyeong Moon
2014 J jnl
A network flow model for the optimal allocation of both foldable and standard containers.
Oper. Res. Lett.
Young-Soo Myung, Ilkyeong Moon
2008 J jnl
On the clique partitioning problem in weighted interval graphs.
Theor. Comput. Sci.
Young-Soo Myung
2006 J jnl
Multicommodity flows in cycle graphs.
Discret. Appl. Math.
Young-Soo Myung
2004 J jnl
A cutting plane algorithm for computing k.
Eur. J. Oper. Res.
Young-Soo Myung, Hyun-Joon Kim
2004 J jnl
On the ring loading problem with demand splitting.
Oper. Res. Lett.
Young-Soo Myung, Hu-gon Kim
2003 — conf
A New Algorithm for the Ring Loading Problem with Demand Splitting.
Applied Informatics
Young-Soo Myung, Hu-gon Kim
2001 J jnl
An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting.
SIAM J. Discret. Math.
Young-Soo Myung
2000 J jnl
Base station location in a cellular CDMA system.
Telecommun. Syst.
Dong-wan Tcha, Young-Soo Myung, June-Hyuk Kwon
1997 J jnl
A bi-objective uncapacitated facility location problem.
Eur. J. Oper. Res.
Young-Soo Myung, Hu-gon Kim, Dong-wan Tcha
1997 J jnl
Optimal Load Balancing on Sonet Bidirectional Rings.
Oper. Res.
Young-Soo Myung, Hu-gon Kim, Dong-wan Tcha
1995 J jnl
On the generalized minimum spanning tree problem.
Networks
Young-Soo Myung, Chang-Ho Lee, Dong-wan Tcha
1993 J jnl
A catalog of steiner tree formulations.
Networks
Michel X. Goemans, Young-Soo Myung