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. (C) 2002 Wiley Periodicals, Inc.

Agnetis, A., Mirchandani, P., Pacifici, A. (2002). Partitioning of biweighted trees. NAVAL RESEARCH LOGISTICS, 49(2), 143-158 [10.1002/nav.10003].

Partitioning of biweighted trees

PACIFICI, ANDREA
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. (C) 2002 Wiley Periodicals, Inc.
Pubblicato
Rilevanza internazionale
Articolo
Esperti anonimi
Settore MAT/09 - Ricerca Operativa
English
Bicriteria optimization; Location; Network partitioning
Agnetis, A., Mirchandani, P., Pacifici, A. (2002). Partitioning of biweighted trees. NAVAL RESEARCH LOGISTICS, 49(2), 143-158 [10.1002/nav.10003].
Agnetis, A; Mirchandani, P; Pacifici, A
Articolo su rivista
File in questo prodotto:
File Dimensione Formato  
6.amp-nrl02.pdf

accesso aperto

Dimensione 227 kB
Formato Adobe PDF
227 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2108/34725
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 1
social impact