70 likes | 131 Vues
Example Problem. Travelling Salesman ProblemInput: connected, weighted digraphG = (V = {1,2,,n},E), w : E -> ROutput: Minimum weighted cycle that visits each vertex exactly once[i1,i2,in] such that ?1 = k = n ik ? V and (ik, ik 1) ? E and ?
E N D