Pantheon Institutional repository
Collect, preserve and disseminate digital academic production in all areas of knowledge.
Comprise the assets of the repository, in addition to theses and dissertations at UFRJ, scientific articles, electronic books, book chapters and papers presented at events for teachers, researchers, administrative staff and students of master's and doctoral degrees.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11422/1589
| Type: | Relatório |
| Title: | An algorithm for the many-visits m-traveling salesman problem |
| Author(s)/Inventor(s): | Szwarcfiter, Jayme Luiz |
| Abstract: | 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. |
| Abstract: | We described a method based on integer linear programming for solving the many-visitis m-traveling salesman problem. |
| Keywords: | Programação linear inteira Problema do caixeiro viajante Algoritmos |
| Subject CNPq: | CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
| Production unit: | Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais |
| In: | Relatório Técnico NCE |
| Issue: | 0285 |
| Issue Date: | 30-Nov-1985 |
| Publisher country: | Brasil |
| Language: | eng |
| Right access: | Acesso Aberto |
| Citation: | 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) |
| Appears in Collections: | Relatórios |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 02_85_000040320.pdf | 867.12 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.