#### Filter Results:

#### Publication Year

2001

2002

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We study the p-median problem which is one the classical problems in location theory. For p = 2 and on a two-dimensional mesh, we give an O(mn 2 p)-time algorithm for solving the problem, where, assuming that m n, m is the number of rows of the mesh containing demand points, n the number of columns containing demand points, and p the number of demand points.

- F C M Lau, P K W Cheng
- 2002

We study the p-median problem which is one the classical problems in location theory. For p = 2 a n d o n a t wo-dimensional mesh, we give a n O(mn 2 p)-time algorithm for solving the problem, where, assuming that m n, m is the numberofrows of the mesh containing demand points, n the number of columns containing demand points, and p the number of demand… (More)

We study the p-median problem which is one of the classical problems in location theory. For p = 2 and on a two-dimensional mesh, we give an O(mn 2 q)-time algorithm for solving the problem, where, assuming that m ≥ n, m is the number of rows of the mesh containing demand points, n the number of columns containing demand points and q the number of demand… (More)

- ‹
- 1
- ›