A shorter and simpler algorithm of complexity of 0(N log N) is presented. The results yield an algorithm for the rectilinear round-trip location problem.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.