IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v49y2002i2p143-158.html
   My bibliography  Save this article

Partitioning of biweighted trees

Author

Listed:
  • Alessandro Agnetis
  • Pitu B. Mirchandani
  • Andrea Pacifici

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. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 143–158, 2002; DOI 10.1002/nav.10003

Suggested Citation

  • Alessandro Agnetis & Pitu B. Mirchandani & Andrea Pacifici, 2002. "Partitioning of biweighted trees," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(2), pages 143-158, March.
    • Handle: RePEc:wly:navres:v:49:y:2002:i:2:p:143-158
    DOI: 10.1002/nav.10003
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.10003
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.10003?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. James G. Morris & John P. Norback, 1980. "A Simple Approach to Linear Facility Location," Transportation Science, INFORMS, vol. 14(1), pages 1-8, February.
    2. Hanif D. Sherali & Frederick L. Nordai, 1988. "A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands," Transportation Science, INFORMS, vol. 22(1), pages 70-73, February.
    3. Cavalier, Tom M. & Sherali, Hanif D., 1986. "Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree," European Journal of Operational Research, Elsevier, vol. 23(2), pages 246-255, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hanif D. Sherali & Taehyung Park, 2000. "Discrete equal‐capacity p‐median problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 166-183, March.
    2. Jianping Li & Suding Liu & Junran Lichen & Wencheng Wang & Yujie Zheng, 2020. "Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 492-508, February.
    3. Jack Brimberg & Robert Schieweck & Anita Schöbel, 2015. "Locating a median line with partial coverage distance," Journal of Global Optimization, Springer, vol. 62(2), pages 371-389, June.
    4. Schobel, Anita, 1998. "Locating least-distant lines in the plane," European Journal of Operational Research, Elsevier, vol. 106(1), pages 152-159, April.
    5. Diaz-Banez, J.M. & Ramos, P.A. & Sabariego, P., 2007. "The maximin line problem with regional demand," European Journal of Operational Research, Elsevier, vol. 181(1), pages 20-29, August.
    6. Diaz-Banez, J. M. & Mesa, J. A. & Schobel, A., 2004. "Continuous location of dimensional structures," European Journal of Operational Research, Elsevier, vol. 152(1), pages 22-44, January.
    7. Jack Brimberg & Henrik Juel & Anita Schöbel, 2007. "Locating a Circle on a Sphere," Operations Research, INFORMS, vol. 55(4), pages 782-791, August.
    8. Jack Brimberg & Henrik Juel & Anita Schöbel, 2002. "Linear Facility Location in Three Dimensions---Models and Solution Methods," Operations Research, INFORMS, vol. 50(6), pages 1050-1057, December.
    9. Jianping Li & Junran Lichen & Wencheng Wang & Jean Yeh & YeongNan Yeh & Xingxing Yu & Yujie Zheng, 2022. "1-line minimum rectilinear steiner trees and related problems," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2832-2852, November.
    10. James F. Campbell, 1992. "Location‐allocation for distribution to a uniform demand with transshipments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(5), pages 635-649, August.
    11. Blanquero, Rafael & Carrizosa, Emilio & Schöbel, Anita & Scholz, Daniel, 2011. "A global optimization procedure for the location of a median line in the three-dimensional space," European Journal of Operational Research, Elsevier, vol. 215(1), pages 14-20, November.
    12. Rafael Blanquero & Emilio Carrizosa, 2013. "Solving the median problem with continuous demand on a network," Computational Optimization and Applications, Springer, vol. 56(3), pages 723-734, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:49:y:2002:i:2:p:143-158. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.