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

Please use this identifier to cite or link to this item: http://repositorio.ufla.br/jspui/handle/1/15610

Full metadata record

DC Field	Value	Language
dc.creator	Gollowitzer, Stefan	-
dc.creator	Gouveia, Luis	-
dc.creator	Laporte, Gilbert	-
dc.creator	Pereira, Dilson Lucas	-
dc.creator	Wojciechowski, Adam	-
dc.date.accessioned	2017-10-31T17:49:03Z	-
dc.date.available	2017-10-31T17:49:03Z	-
dc.date.issued	2014-07	-
dc.identifier.citation	GOLLOWITZER, S. et al. A comparison of several models for the hamiltonian p-median problem. Networks, New York, v. 63, n. 4, p. 350 - 363, Jul. 2014.	pt_BR
dc.identifier.uri	http://onlinelibrary.wiley.com/doi/10.1002/net.21550/full	pt_BR
dc.identifier.uri	repositorio.ufla.br/jspui/handle/1/15610	-
dc.description.abstract	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	pt_BR
dc.language	en_US	pt_BR
dc.publisher	Wiley	pt_BR
dc.rights	restrictAccess	pt_BR
dc.source	Networks	pt_BR
dc.title	A comparison of several models for the hamiltonian p-median problem	pt_BR
dc.type	Artigo	pt_BR
Appears in Collections:	DCC - Artigos publicados em periódicos

Files in This Item:

There are no files associated with this item.

Admin Tools