Kang Maing-Kyu

Maing-Kyu Kang

Information about the author Maing-Kyu Kang will soon be added to the site.
Found 5 papers in total
An improved best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
An improved best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
2005
In this paper, we develop an improved branch and bound algorithm for the (un)weighted...
Determination of the candidate arc set for the asymmetric traveling salesman problem
Determination of the candidate arc set for the asymmetric traveling salesman problem
2005
As size of the traveling salesman problem (TSP) increases, it is unreasonable to find...
Determination of arc candidate set for the asymmetric traveling salesman
Determination of arc candidate set for the asymmetric traveling salesman
2003
The traveling salesman problem (TSP) is an NP-hard problem. As the number of nodes...
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
2003
This paper is concerned with the problem of unconstrained two-dimensional cutting of...
A fast algorithm for two-dimensional pallet loading problems of large size
A fast algorithm for two-dimensional pallet loading problems of large size
2001
This paper concerns the two-dimensional pallet loading problem (PLP), which requires...
Papers per page: