Partitioning of biweighted trees

Alessandro Agnetis, Pitu B. Mirchandani, Andrea Pacifici

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)143-158
Number of pages16
JournalNaval Research Logistics
Volume49
Issue number2
DOIs
StatePublished - Mar 2002
Externally publishedYes

Keywords

  • Bicriteria optimization
  • Location
  • Network partitioning

ASJC Scopus subject areas

  • Modeling and Simulation
  • Ocean Engineering
  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'Partitioning of biweighted trees'. Together they form a unique fingerprint.

Cite this