Abstract
In this note we apply recent results in dynamic programming to improve the complexity bounds of several median and coverage location models on the real line.
Original language | English |
---|---|
Pages (from-to) | 395-402 |
Number of pages | 8 |
Journal | Operations Research Letters |
Volume | 10 |
Issue number | 7 |
DOIs | |
State | Published - Oct 1991 |
Keywords
- center problems
- computational complexity
- facility location
- median problems