Partitioning of biweighted trees

Alessandro Agnetis; Pitu B. Mirchandani; Andrea Pacifici

doi:10.1002/nav.10003

Partitioning of biweighted trees

Alessandro Agnetis, Pitu B. Mirchandani, Andrea Pacifici

Research output: Contribution to journal › Article › peer-review

2 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 language	English (US)
Pages (from-to)	143-158
Number of pages	16
Journal	Naval Research Logistics
Volume	49
Issue number	2
DOIs	https://doi.org/10.1002/nav.10003
State	Published - Mar 2002
Externally published	Yes

Keywords

Bicriteria optimization
Location
Network partitioning

ASJC Scopus subject areas

Modeling and Simulation
Ocean Engineering
Management Science and Operations Research

Access to Document

10.1002/nav.10003

Cite this

@article{07145c5498384ae490ce3aac83c01019,

title = "Partitioning of biweighted trees",

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.",

keywords = "Bicriteria optimization, Location, Network partitioning",

author = "Alessandro Agnetis and Mirchandani, {Pitu B.} and Andrea Pacifici",

year = "2002",

month = mar,

doi = "10.1002/nav.10003",

language = "English (US)",

volume = "49",

pages = "143--158",

journal = "Naval Research Logistics",

issn = "0894-069X",

publisher = "John Wiley and Sons Inc.",

number = "2",

}

TY - JOUR

T1 - Partitioning of biweighted trees

AU - Agnetis, Alessandro

AU - Mirchandani, Pitu B.

AU - Pacifici, Andrea

PY - 2002/3

Y1 - 2002/3

N2 - 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.

AB - 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.

KW - Bicriteria optimization

KW - Location

KW - Network partitioning

UR - http://www.scopus.com/inward/record.url?scp=0036499805&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036499805&partnerID=8YFLogxK

U2 - 10.1002/nav.10003

DO - 10.1002/nav.10003

M3 - Article

AN - SCOPUS:0036499805

SN - 0894-069X

VL - 49

SP - 143

EP - 158

JO - Naval Research Logistics

JF - Naval Research Logistics

IS - 2

ER -

Partitioning of biweighted trees

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this