| as.ATSP {TSP} | Class ATSP -- Asymmetric traveling salesperson problem |
| as.ATSP.dist {TSP} | Class ATSP -- Asymmetric traveling salesperson problem |
| as.ATSP.matrix {TSP} | Class ATSP -- Asymmetric traveling salesperson problem |
| as.matrix {TSP} | Class ATSP -- Asymmetric traveling salesperson problem |
| as.matrix.ATSP {TSP} | Class ATSP -- Asymmetric traveling salesperson problem |
| as.TOUR {TSP} | Class TOUR -- Solution to a traveling salesperson problem |
| as.TOUR.integer {TSP} | Class TOUR -- Solution to a traveling salesperson problem |
| as.TSP {TSP} | Class TSP -- Symmetric traveling salesperson problem |
| as.TSP.dist {TSP} | Class TSP -- Symmetric traveling salesperson problem |
| as.TSP.matrix {TSP} | Class TSP -- Symmetric traveling salesperson problem |
| ATSP {TSP} | Class ATSP -- Asymmetric traveling salesperson problem |
| Concorde {TSP} | Using the Concorde TSP Solver |
| concorde_help {TSP} | Using the Concorde TSP Solver |
| concorde_path {TSP} | Using the Concorde TSP Solver |
| cut_tour {TSP} | Cut a tour to form a path |
| cut_tour.TOUR {TSP} | Cut a tour to form a path |
| image.ATSP {TSP} | Class ATSP -- Asymmetric traveling salesperson problem |
| image.TSP {TSP} | Class TSP -- Symmetric traveling salesperson problem |
| insert_dummy {TSP} | Insert dummy cities into a distance matrix |
| labels.ATSP {TSP} | Class ATSP -- Asymmetric traveling salesperson problem |
