Exact algorithms for the minimum latency problem
type: Item
instance of: scholarly article
title: Exact algorithms for the minimum latency problem
zbMATH Open document ID: 1173.68832
author: Bang Ye Wu
author: Zheng-Nan Huang
author: Fu-Jie Zhan
published in: Information Processing Letters
publication date: 2009-08-27T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 5599173
zbMATH Keywords: algorithms
zbMATH Keywords: minimum latency problem
zbMATH Keywords: dynamic programming
zbMATH Keywords: branch and bound
MaRDI profile type: Publication
full work available at URL: j.ipl.2004.09.009
OpenAlex ID: W2005117954
cites work: The complexity of the travelling repairman problem
cites work: Q4471278
cites work: Approximation Schemes for Minimum Latency Problems
cites work: The minimum latency problem
cites work: A note on the traveling repairman problem
cites work: An improved approximation ratio for the minimum latency problem
cites work: Q4818841
cites work: The delivery man problem on a tree network
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Q4737530
cites work: Polynomial time algorithms for some minimum latency problems
DOI: 10.1016/J.IPL.2004.09.009
description: scientific article; zbMATH DE number 5599173