An algorithm for the many-visits m-traveling salesman problem

Detalhes bibliográficos
Autor(a) principal: Szwarcfiter, Jayme Luiz
Data de Publicação: 1985
Tipo de documento: Relatório
Idioma: eng
Título da fonte: Repositório Institucional da UFRJ
Texto Completo: http://hdl.handle.net/11422/1589
Resumo: Descreve-se um método baseado em programação linear inteira para a solução do problema do m-caixeiro viajante com múltiplas visitas.
id UFRJ_44325bf19e3ed4fa129fa20ce30dc055
oai_identifier_str oai:pantheon.ufrj.br:11422/1589
network_acronym_str UFRJ
network_name_str Repositório Institucional da UFRJ
repository_id_str
spelling Szwarcfiter, Jayme Luiz2017-03-17T12:06:51Z2023-11-30T03:01:58Z1985-11-30SZWARCFITER, J. L. An algorithm for the many-visits m-traveling salesman problem. Rio de Janeiro: NCE, UFRJ, 1985. 10 p. (Relatório Técnico, 02/85)http://hdl.handle.net/11422/1589Descreve-se um método baseado em programação linear inteira para a solução do problema do m-caixeiro viajante com múltiplas visitas.We described a method based on integer linear programming for solving the many-visitis m-traveling salesman problem.Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-03-17T12:06:51Z No. of bitstreams: 1 02_85_000040320.pdf: 887930 bytes, checksum: b1aaf0030ed589165ca3b35929d5b688 (MD5)Made available in DSpace on 2017-03-17T12:06:51Z (GMT). No. of bitstreams: 1 02_85_000040320.pdf: 887930 bytes, checksum: b1aaf0030ed589165ca3b35929d5b688 (MD5) Previous issue date: 1985-11-30engRelatório Técnico NCECNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAOProgramação linear inteiraProblema do caixeiro viajanteAlgoritmosAn algorithm for the many-visits m-traveling salesman probleminfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/report0285abertoBrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionaisinfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFRJinstname:Universidade Federal do Rio de Janeiro (UFRJ)instacron:UFRJORIGINAL02_85_000040320.pdf02_85_000040320.pdfapplication/pdf887930http://pantheon.ufrj.br:80/bitstream/11422/1589/1/02_85_000040320.pdfb1aaf0030ed589165ca3b35929d5b688MD51LICENSElicense.txtlicense.txttext/plain; charset=utf-81853http://pantheon.ufrj.br:80/bitstream/11422/1589/2/license.txtdd32849f2bfb22da963c3aac6e26e255MD52TEXT02_85_000040320.pdf.txt02_85_000040320.pdf.txtExtracted texttext/plain7129http://pantheon.ufrj.br:80/bitstream/11422/1589/3/02_85_000040320.pdf.txt6ce26e656c4f16b862871f50b5c52465MD5311422/15892023-11-30 00:01:58.609oai:pantheon.ufrj.br:11422/1589TElDRU7Dh0EgTsODTy1FWENMVVNJVkEgREUgRElTVFJJQlVJw4fDg08KCkFvIGFzc2luYXIgZSBlbnRyZWdhciBlc3RhIGxpY2Vuw6dhLCB2b2PDqihzKSBvKHMpIGF1dG9yKGVzKSBvdSBwcm9wcmlldMOhcmlvKHMpIGRvcyBkaXJlaXRvcyBhdXRvcmFpcyBjb25jZWRlKG0pIGFvIFJlcG9zaXTDs3JpbyBQYW50aGVvbiBkYSBVbml2ZXJzaWRhZGUgRmVkZXJhbCBkbyBSaW8gZGUgSmFuZWlybyAoVUZSSikgbyBkaXJlaXRvIG7Do28gLSBleGNsdXNpdm8gZGUgcmVwcm9kdXppciwgY29udmVydGVyIChjb21vIGRlZmluaWRvIGFiYWl4byksIGUvb3UgZGlzdHJpYnVpciBvIGRvY3VtZW50byBlbnRyZWd1ZSAoaW5jbHVpbmRvIG8gcmVzdW1vKSBlbSB0b2RvIG8gbXVuZG8sIGVtIGZvcm1hdG8gZWxldHLDtG5pY28gZSBlbSBxdWFscXVlciBtZWlvLCBpbmNsdWluZG8sIG1hcyBuw6NvIGxpbWl0YWRvIGEgw6F1ZGlvIGUvb3UgdsOtZGVvLgoKVm9jw6ogY29uY29yZGEgcXVlIGEgVUZSSiBwb2RlLCBzZW0gYWx0ZXJhciBvIGNvbnRlw7pkbywgdHJhZHV6aXIgYSBhcHJlc2VudGHDp8OjbyBkZSBxdWFscXVlciBtZWlvIG91IGZvcm1hdG8gY29tIGEgZmluYWxpZGFkZSBkZSBwcmVzZXJ2YcOnw6NvLgoKVm9jw6ogdGFtYsOpbSBjb25jb3JkYSBxdWUgYSBVRlJKIHBvZGUgbWFudGVyIG1haXMgZGUgdW1hIGPDs3BpYSBkZXNzYSBzdWJtaXNzw6NvIHBhcmEgZmlucyBkZSBzZWd1cmFuw6dhLCBiYWNrLXVwIGUgcHJlc2VydmHDp8OjbyBkaWdpdGFsLgoKRGVjbGFyYSBxdWUgbyBkb2N1bWVudG8gZW50cmVndWUgw6kgc2V1IHRyYWJhbGhvIG9yaWdpbmFsLCBlIHF1ZSB2b2PDqiB0ZW0gbyBkaXJlaXRvIGRlIGNvbmNlZGVyIG9zIGRpcmVpdG9zIGNvbnRpZG9zIG5lc3RhIGxpY2Vuw6dhLiBWb2PDqiB0YW1iw6ltIGRlY2xhcmEgcXVlIGEgc3VhIGFwcmVzZW50YcOnw6NvLCBjb20gbyBtZWxob3IgZGUgc2V1cyBjb25oZWNpbWVudG9zLCBuw6NvIGluZnJpbmdpIGRpcmVpdG9zIGF1dG9yYWlzIGRlIHRlcmNlaXJvcy4KClNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIGNvbnTDqW0gbWF0ZXJpYWwgZG8gcXVhbCB2b2PDqiBuw6NvIHRlbSBkaXJlaXRvcyBkZSBhdXRvciwgZGVjbGFyYSBxdWUgb2J0ZXZlIGEgcGVybWlzc8OjbyBpcnJlc3RyaXRhIGRvIGRldGVudG9yIGRvcyBkaXJlaXRvcyBhdXRvcmFpcyBlIGNvbmNlZGUgYSBVRlJKIG9zIGRpcmVpdG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW7Dp2EsIGUgcXVlIGVzc2UgbWF0ZXJpYWwgZGUgcHJvcHJpZWRhZGUgZGUgdGVyY2Vpcm9zIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3UgY29udGXDumRvIGRhIHN1Ym1pc3PDo28uCgpTZSBvIGRvY3VtZW50byBlbnRyZWd1ZSDDqSBiYXNlYWRvIGVtIHRyYWJhbGhvIHF1ZSBmb2ksIG91IHRlbSBzaWRvIHBhdHJvY2luYWRvIG91IGFwb2lhZG8gcG9yIHVtYSBhZ8OqbmNpYSBvdSBvdXRybyhzKSBvcmdhbmlzbW8ocykgcXVlIG7Do28gYSBVRlJKLCB2b2PDqiBkZWNsYXJhIHF1ZSBjdW1wcml1IHF1YWxxdWVyIGRpcmVpdG8gZGUgUkVWSVPDg08gb3UgZGUgb3V0cmFzIG9icmlnYcOnw7VlcyByZXF1ZXJpZGFzIHBvciBjb250cmF0byBvdSBhY29yZG8uCgpBIFVGUkogaXLDoSBpZGVudGlmaWNhciBjbGFyYW1lbnRlIG8ocykgc2V1KHMpIG5vbWUocykgY29tbyBhdXRvcihlcykgb3UgcHJvcHJpZXTDoXJpbyhzKSBkYSBzdWJtaXNzw6NvLCBlIG7Do28gZmFyw6EgcXVhbHF1ZXIgYWx0ZXJhw6fDo28sIHBhcmEgYWzDqW0gZGFzIHBlcm1pdGlkYXMgcG9yIGVzdGEgbGljZW7Dp2EsIG5vIGF0byBkZSBzdWJtaXNzw6NvLgo=Repositório de PublicaçõesPUBhttp://www.pantheon.ufrj.br/oai/requestopendoar:2023-11-30T03:01:58Repositório Institucional da UFRJ - Universidade Federal do Rio de Janeiro (UFRJ)false
dc.title.pt_BR.fl_str_mv An algorithm for the many-visits m-traveling salesman problem
title An algorithm for the many-visits m-traveling salesman problem
spellingShingle An algorithm for the many-visits m-traveling salesman problem
Szwarcfiter, Jayme Luiz
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
Programação linear inteira
Problema do caixeiro viajante
Algoritmos
title_short An algorithm for the many-visits m-traveling salesman problem
title_full An algorithm for the many-visits m-traveling salesman problem
title_fullStr An algorithm for the many-visits m-traveling salesman problem
title_full_unstemmed An algorithm for the many-visits m-traveling salesman problem
title_sort An algorithm for the many-visits m-traveling salesman problem
author Szwarcfiter, Jayme Luiz
author_facet Szwarcfiter, Jayme Luiz
author_role author
dc.contributor.author.fl_str_mv Szwarcfiter, Jayme Luiz
dc.subject.cnpq.fl_str_mv CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
topic CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
Programação linear inteira
Problema do caixeiro viajante
Algoritmos
dc.subject.por.fl_str_mv Programação linear inteira
Problema do caixeiro viajante
Algoritmos
description Descreve-se um método baseado em programação linear inteira para a solução do problema do m-caixeiro viajante com múltiplas visitas.
publishDate 1985
dc.date.issued.fl_str_mv 1985-11-30
dc.date.accessioned.fl_str_mv 2017-03-17T12:06:51Z
dc.date.available.fl_str_mv 2023-11-30T03:01:58Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/report
format report
status_str publishedVersion
dc.identifier.citation.fl_str_mv SZWARCFITER, J. L. An algorithm for the many-visits m-traveling salesman problem. Rio de Janeiro: NCE, UFRJ, 1985. 10 p. (Relatório Técnico, 02/85)
dc.identifier.uri.fl_str_mv http://hdl.handle.net/11422/1589
identifier_str_mv SZWARCFITER, J. L. An algorithm for the many-visits m-traveling salesman problem. Rio de Janeiro: NCE, UFRJ, 1985. 10 p. (Relatório Técnico, 02/85)
url http://hdl.handle.net/11422/1589
dc.language.iso.fl_str_mv eng
language eng
dc.relation.ispartof.pt_BR.fl_str_mv Relatório Técnico NCE
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.country.fl_str_mv Brasil
dc.publisher.department.fl_str_mv Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFRJ
instname:Universidade Federal do Rio de Janeiro (UFRJ)
instacron:UFRJ
instname_str Universidade Federal do Rio de Janeiro (UFRJ)
instacron_str UFRJ
institution UFRJ
reponame_str Repositório Institucional da UFRJ
collection Repositório Institucional da UFRJ
bitstream.url.fl_str_mv http://pantheon.ufrj.br:80/bitstream/11422/1589/1/02_85_000040320.pdf
http://pantheon.ufrj.br:80/bitstream/11422/1589/2/license.txt
http://pantheon.ufrj.br:80/bitstream/11422/1589/3/02_85_000040320.pdf.txt
bitstream.checksum.fl_str_mv b1aaf0030ed589165ca3b35929d5b688
dd32849f2bfb22da963c3aac6e26e255
6ce26e656c4f16b862871f50b5c52465
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFRJ - Universidade Federal do Rio de Janeiro (UFRJ)
repository.mail.fl_str_mv
_version_ 1784097082615791616

Registros relacionados