Article ID: | iaor19991743 |
Country: | United Kingdom |
Volume: | 25 |
Issue: | 5 |
Start Page Number: | 351 |
End Page Number: | 366 |
Publication Date: | May 1998 |
Journal: | Computers and Operations Research |
Authors: | Bard Jonathan F., Ros-Mercado Roger Z. |
Keywords: | programming: travelling salesman |
This paper presents a branch-and-cut (B&C) algorithm for the problem of minimizing the makespan associated with scheduling