Traveling Salesperson Problem (TSP)

ATSP | Class ATSP - Asymmetric traveling salesperson problem |

Concorde | Using the Concorde TSP Solver |

cut_tour | Cut a tour to form a path |

ETSP | Class ETSP - Euclidean traveling salesperson problem |

insert_dummy | Insert dummy cities into a distance matrix |

reformulate_ATSP_as_TSP | Reformulate a ATSP as a symmetric TSP |

solve_TSP | TSP solver interface |

TOUR | Class TOUR - Solution to a traveling salesperson problem |

tour_length | Calculate the length of a tour |

TSP | Class TSP - Symmetric traveling salesperson problem |

TSPLIB | Read and write TSPLIB files |

TSP-package | TSP: Traveling Salesperson Problem (TSP) |

USCA | USCA312/USCA50 - 312/50 cities in the US and Canada |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.