CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A Comparison of Several Models for the Hamiltonian p-Median Problem

S. Gollowitzer ; L. Gouveia ; G. Laporte ; D. L. Pereira ; Adam Wojciechowski (Institutionen för matematiska vetenskaper, matematik)
Networks (0028-3045). Vol. 63 (2014), 4, p. 350-363.
[Artikel, refereegranskad vetenskaplig]

The Hamiltonian p-median problem consists of determining p 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. (C) 2014 Wiley Periodicals, Inc.

Nyckelord: cycle cover, graphs, travelling salesman problem, mathematical programming models

Denna post skapades 2014-07-21.
CPL Pubid: 200615


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för matematiska vetenskaper, matematik (2005-2016)



Chalmers infrastruktur