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.
Agnetis, A., Mirchandani, P.B., Pacifici, A. (2002). Partitioning of Biweighted Trees. NAVAL RESEARCH LOGISTICS, 49(2), 143-158 [10.1002/nav.10003].
Partitioning of Biweighted Trees
Agnetis, Alessandro;
2002-01-01
Abstract
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.
| File | Dimensione | Formato | |
|---|---|---|---|
|
Partitioning of Biweighted Trees.pdf
non disponibili
Tipologia:
Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
227 kB
Formato
Adobe PDF
|
227 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/24015
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo