R H U first ( s ) nex t (s) last ( s ) as the row ass igned to c o l u m n y ( j -1 . . . . . n); as the label o f c o l u m n j ; i fLCj = 0, c o l u m n j is un labe led ( ] = 1 . . . . . n); asâ€¦ (More)

The FORTRAN implementation of an efficient algorithm which solves the Bottleneck Assignment Problem is given. Computational results are presented, showing the proposed method to be generally superiorâ€¦ (More)

The Vehicle Scheduling Problem is an important combinatorial optimization problem arising in the management of transportation companies. It consists in assigning a set of time-tabled trips to a setâ€¦ (More)

The FORTRAN implementation of an efficient algorithm which solves the Assignment Problem for sparse matrices is given. Computional results are presented, showing the proposed method to be generallyâ€¦ (More)

A lowest-first, branch-and-bound algorithm for the <italic>Asymmetric Traveling Salesman Problem</italic> is presented. The method is based on the <italic>Assignment Problem relaxation</italic> andâ€¦ (More)

The Fortran code CDT, implementing an algorithm for the <italic>asymmetric traveling salesman problem</italic>, is presented. The method is based on the <italic>Assignment Problem relaxation</italic>â€¦ (More)