A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem

Jean-François Bérubé, Michel Gendreau, Jean-Yves Potvin. A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem. Networks, 54(1):56-67, 2009. [doi]

Abstract

Abstract is missing.