loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
7th International Conference on Hybrid Intelligent Systems (HIS 2007)
Computing Sharp Lower and Upper Bounds for the Minimum Latency Problem
Kaiserslautern, Germany
September 17-September 19
ISBN: 0-7695-2946-1
ASCII Text
x 
 
Joao Sarubbi, Henrique Pacca Luna, Gilberto de Miranda, Ricardo Saraiva de Camargo, "Computing Sharp Lower and Upper Bounds for the Minimum Latency Problem," Hybrid Intelligent Systems, International Conference on, pp. 71-77, 7th International Conference on Hybrid Intelligent Systems (HIS 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/HIS.2007.39,
author = {Joao Sarubbi and Henrique Pacca Luna and Gilberto de Miranda and Ricardo Saraiva de Camargo},
title = {Computing Sharp Lower and Upper Bounds for the Minimum Latency Problem},
journal ={Hybrid Intelligent Systems, International Conference on},
volume = {0},
year = {2007},
isbn = {0-7695-2946-1},
pages = {71-77},
doi = {http://doi.ieeecomputersociety.org/10.1109/HIS.2007.39},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Hybrid Intelligent Systems, International Conference on
TI - Computing Sharp Lower and Upper Bounds for the Minimum Latency Problem
SN - 0-7695-2946-1
SP71
EP77
A1 - Joao Sarubbi,
A1 - Henrique Pacca Luna,
A1 - Gilberto de Miranda,
A1 - Ricardo Saraiva de Camargo,
PY - 2007
KW - null
VL - 0
JA - Hybrid Intelligent Systems, International Conference on
ER -
 
Joao Sarubbi, Federal University of Minas Gerais
Henrique Pacca Luna, Federal University of Alagoas
Gilberto de Miranda, Federal University of Minas Gerais
Ricardo Saraiva de Camargo, Federal University of Ouro Preto
The Minimum Latency Problem, also known as Traveling Repairman Problem, the Deliveryman Problem and the Traveling Salesman Problem with Cumulative Costs is a variant of the Traveling Salesman Problem in which a repairman is required to visit customers located on each node of a graph in such a way that the overall waiting times of these customers is minimized. In the present work, an algorithm based on tight different linear programming lowerbounds and a specialized GRASP procedure are presented. The linear programming based lower-bounds are based on the Quadratic Assignment Problem with the aid of side constraints. Instances from 10 up to 60 nodes are solved very close to optimality in reasonable time.
Citation:
Joao Sarubbi, Henrique Pacca Luna, Gilberto de Miranda, Ricardo Saraiva de Camargo, "Computing Sharp Lower and Upper Bounds for the Minimum Latency Problem," his, pp.71-77, 7th International Conference on Hybrid Intelligent Systems (HIS 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.