Template Function ADS::bbTsp

• Defined in File BranchAndBound.h

Function Documentation

template<class T>
std::pair<T, Nodes> ADS::bbTsp(const std::vector<std::vector<T>> &D, const Nodes &start = {}, TspBound how = TspBound::BOOK, long *generated = nullptr)

bbTsp(): the cost and a minimum circuit from 0, starting from the circuit start if not empty; the number of nodes of the tree of the choices generated, the root included, goes to *generated, if given

Pre:

D is square, start empty or a permutation, D symmetric for the 1-tree

Post:

a permutation and its cost, if n >= 2