| Article ID: | iaor20041486 |
| Country: | China |
| Volume: | 6 |
| Issue: | 3 |
| Start Page Number: | 61 |
| End Page Number: | 68 |
| Publication Date: | Jan 2002 |
| Journal: | OR Transactions |
| Authors: | Lin Yixun, Shang Songpu |
This paper studies two point–line location problems in the plane as follows: (1) Determine a straight-line L to minimize the total weighted distances from n given points; (2) Determine a point X to minimize the total weighted distances from n given straight-lines. For these non-linear optimization problems, we present polynomial-time algorithms.