| Article ID: | iaor200390 |
| Country: | United States |
| Volume: | 49 |
| Issue: | 2 |
| Start Page Number: | 143 |
| End Page Number: | 158 |
| Publication Date: | Mar 2002 |
| Journal: | Naval Research Logistics |
| Authors: | Mirchandani Pitu B., Agnetis Alessandro, Pacifici Andrea |
| Keywords: | networks |
A districting problem is formulated as a network partitioning model where each link has one weight to denote travel time and another weight to denote workload. The objective of the problem is to minimize the maximum diameter of the districts while equalizing the workload among the districts. The case of tree networks is addressed and efficient algorithms are developed when the network is to be partitioned into two or three districts.