Hop-indexed Circuit-based formulations for the Traveling Salesman Problem

Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12207/577

Full metadata record

wcag
DC Field	Value	Language
dc.contributor.author	Godinho, Maria	-
dc.contributor.author	Gouveia, Lus	-
dc.contributor.author	Pesneau, Pierre	-
dc.date.accessioned	2013-11-15T11:46:15Z	-
dc.date.available	2013-10-21	-
dc.date.available	2013-11-15T11:46:15Z	-
dc.date.issued	2010-08-01	-
dc.identifier.citation	Godinho, M. T., Gouveia, L., Pesneau, P. (2010). Hop-indexed Circuit-based formulations for the Traveling Salesman Problem. Electronic Notes in Discrete Mathematics, 36, 1049-1056.	pt
dc.identifier.uri	http://hdl.handle.net/20.500.12207/577	-
dc.description.abstract	We discuss a new Hop-indexed Circuit-based formulation for the Traveling Salesman Problem (TSP). We show that the new formulation enhanced with some valid inequalities dominates the previous best (compact) formulations from the literature and that it produces very tight linear bounds (with emphasis on the so-called cumulative TSP).	pt
dc.language.iso	eng	pt
dc.rights	closedAccess	pt
dc.subject	TSP	pt
dc.subject	Hop-indexed Models	pt
dc.subject.classification	Indexação Scopus	pt
dc.title	Hop-indexed Circuit-based formulations for the Traveling Salesman Problem	pt
dc.type	article	pt
dc.peerreviewed	yes	pt
dc.relation.publisherversion	http://dx.doi.org/10.1016/j.endm.2010.05.133	pt
degois.publication.firstPage	1049	pt
degois.publication.lastPage	1056	pt
degois.publication.title	Electronic Notes in Discrete Mathematics	pt
degois.publication.volume	36	pt
Appears in Collections:	D-MCF - Artigos em revistas com peer review

Files in This Item:

There are no files associated with this item.

acessibilidade