A comparison of several models for the hamiltonian p-median problem

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorGollowitzer, Stefan-
Autor(es): dc.creatorGouveia, Luis-
Autor(es): dc.creatorLaporte, Gilbert-
Autor(es): dc.creatorPereira, Dilson Lucas-
Autor(es): dc.creatorWojciechowski, Adam-
Data de aceite: dc.date.accessioned2026-02-09T11:52:00Z-
Data de disponibilização: dc.date.available2026-02-09T11:52:00Z-
Data de envio: dc.date.issued2017-10-31-
Data de envio: dc.date.issued2017-10-31-
Data de envio: dc.date.issued2014-07-
Fonte completa do material: dc.identifierhttps://repositorio.ufla.br/handle/1/15610-
Fonte completa do material: dc.identifierhttp://onlinelibrary.wiley.com/doi/10.1002/net.21550/full-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1149183-
Descrição: dc.descriptionThe 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-
Idioma: dc.languageen-
Publicador: dc.publisherWiley-
Direitos: dc.rightsrestrictAccess-
???dc.source???: dc.sourceNetworks-
Título: dc.titleA comparison of several models for the hamiltonian p-median problem-
Tipo de arquivo: dc.typeArtigo-
Aparece nas coleções:Repositório Institucional da Universidade Federal de Lavras (RIUFLA)

Não existem arquivos associados a este item.