Improved complexity bounds for location problems on the real line

Improved complexity bounds for location problems on the real line

0.00 Avg rating0 Votes
Article ID: iaor1992853
Country: Netherlands
Volume: 10
Issue: 7
Start Page Number: 395
End Page Number: 402
Publication Date: Oct 1991
Journal: Operations Research Letters
Authors: ,
Keywords: programming: dynamic
Abstract:

In this note the authors apply recent results in dynamic programming to improve the complexity bounds of several median and coverage location models on the real line.

Reviews

Required fields are marked *. Your email address will not be published.