z-logo
Premium
Partitioning of biweighted trees
Author(s) -
Agnetis Alessandro,
Mirchandani Pitu B.,
Pacifici Andrea
Publication year - 2002
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.10003
Subject(s) - workload , computer science , operations research , tree (set theory) , flow network , mathematical optimization , mathematics , combinatorics , operating system
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. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 143–158, 2002; DOI 10.1002/nav.10003

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here