Branch-and-Bound for the Travelling Salesman Problem

Abstract

1 The setting 1 1.1 Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2.1 Decision problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2.2 Optimization problems… (More)

Topics

Cite this paper

@inproceedings{Liberti2011BranchandBoundFT, title={Branch-and-Bound for the Travelling Salesman Problem}, author={Leo Liberti}, year={2011} }