A comparison of several models for the hamiltonian p‐median problem. Issue 4 (7th March 2014)

• Record Type: Journal Article
• Authors: Gollowitzer, Stefan; Gouveia, Luis; Laporte, Gilbert; Pereira, Dilson Lucas; Wojciechowski, Adam
• Is Part Of: Networks. Volume 63:Issue 4(2014:Jul.)
• Page Start: 350
• Page End: 363
• Publication Date: 2014-03-07
• Subjects: Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21550
• Languages: English
• ISSNs: 0028-3045

Abstract

<abstract abstract-type="main"> <title> <x xml:space="preserve">Abstract</x> </title> <p>The Hamiltonian <italic>p</italic>‐median problem consists of determining <italic>p</italic> disjoint cycles of minimum total cost covering all vertices of a graph. We present several new and existing models for this problem, provide a hierarchy with respect to the quality of the lower bounds yielded by their linear programming relaxations, and compare their computational performance on a set of benchmark instances. We conclude that three of the models are superior from a computational point of view, two of which are introduced in this article. © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 63(4), 350–363 2014</p> </abstract>