New Models for and Numerical Tests of the Hamiltonian p-Median Problem
Paper i proceeding, 2011

The Hamiltonian p-median problem (HpMP) was introduced by [Branco90]. It is closely related to two well-known problems, namely the Travelling Salesman problem (TSP) and the Vehicle Routing problem (VRP). The HpMP is to find exactly p node-disjoint cycles of minimum edge cost, such that each node of the graph is contained in exactly one cycle. We present three new models for the HpMP problem which differ with regard to the constraints that enforce a maximum number of cycles. We demonstrate that one of the models (SEC) is dominated by another model (PCON) with regard to the LP relaxation. Further, we introduce a class of symmetry breaking constraints. We present results regarding the quality of the lower bounds provided by the respective LP relaxations for two of the models, and provide computational results that demonstrate the computational efficiency.

Hamiltonian p-Median


Stefan Gollowitzer

Universität Wien

Dilson Lucas Pereira

Universidade Federal de Minas Gerais

Adam Wojciechowski

Chalmers, Matematiska vetenskaper, Matematik

Göteborgs universitet

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 6701/2011 385-394
978-364221526-1 (ISBN)




Grundläggande vetenskaper





Mer information

Senast uppdaterat