Young-Gun G

According to our database, Young-Gun G authored at least 5 papers between 2001 and 2004.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of seven.

2004

An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem.

Y.-J. Seong, Young-Gun G, M.-K. Kang, C.-W. Kang

J. Oper. Res. Soc., 2004

2003

A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.

Young-Gun G, Young-Jo Seong, Maing-Kyu Kang

Oper. Res. Lett., 2003

Application of the out-of-kilter algorithm to the asymmetric traveling salesman problem.

Sang-Ho Kwon, Young-Gun G, Maing-Kyu Kang

J. Oper. Res. Soc., 2003

2002

A new upper bound for unconstrained two-dimensional cutting and packing.

Young-Gun G, M.-K. Kang

J. Oper. Res. Soc., 2002

2001

A fast algorithm for two-dimensional pallet loading problems of large size.

Young-Gun G, Maing-Kyu Kang

Eur. J. Oper. Res., 2001