The problem is solved by means of a branch-and-bound tree in which subproblems arc modified assignment problems subject to some restrictions. Computational results for problems involving up to 100 nodes are reported.
The problem is solved by means of a branch-and-bound tree in which subproblems arc modified assignment problems subject to some restrictions. Computational results for problems involving up to 100 nodes are reported.