Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/353437
Type: Artigo
Title: Approximation algorithms for the bus evacuation problem
Author: Pedrosa, Lehilton L. C.
Schouery, Rafael C. S.
Abstract: We consider the bus evacuation problem. Given a positive integer B, a bipartite graph G with parts S and in a metric space and functions and , one wishes to find a set of B walks in G. Every walk in B should start at r and finish in T and r must be visite
Subject: Algoritmos de aproximação
Otimização combinatória
Teoria dos grafos
Espaços métricos
Country: Estados Unidos
Editor: Society for Mining, Metallurgy and Exploration
Rights: fechado
Identifier DOI: 10.1007/s10878-018-0290-x
Address: https://link.springer.com/article/10.1007/s10878-018-0290-x
Date Issue: 2018
Appears in Collections:IC - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
000434382000013.pdf523.35 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.