IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v97y1997i1p172-182.html
   My bibliography  Save this article

The partial sum criterion for Steiner trees in graphs and shortest paths

Author

Listed:
  • Duin, C. W.
  • Volgenant, A.

Abstract

No abstract is available for this item.

Suggested Citation

  • Duin, C. W. & Volgenant, A., 1997. "The partial sum criterion for Steiner trees in graphs and shortest paths," European Journal of Operational Research, Elsevier, vol. 97(1), pages 172-182, February.
    • Handle: RePEc:eee:ejores:v:97:y:1997:i:1:p:172-182
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)00113-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Andreatta, G. & Mason, F., 1985. "k-eccentricity and absolute k-centrum of a probabilistic tree," European Journal of Operational Research, Elsevier, vol. 19(1), pages 114-117, January.
    2. Punnen, Abraham P., 1991. "A linear time algorithm for the maximum capacity path problem," European Journal of Operational Research, Elsevier, vol. 53(3), pages 402-404, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Volgenant, A., 2002. "Solving some lexicographic multi-objective combinatorial problems," European Journal of Operational Research, Elsevier, vol. 139(3), pages 578-584, June.
    2. Eduardo Álvarez-Miranda & Hesso Farhan & Martin Luipersbeck & Markus Sinnl, 2017. "A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death," Annals of Operations Research, Springer, vol. 258(1), pages 5-30, November.

    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. Abumoslem Mohammadi & Javad Tayyebi, 2019. "Maximum Capacity Path Interdiction Problem with Fixed Costs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(04), pages 1-21, August.
    2. Erhan Erkut & Armann Ingolfsson, 2000. "Catastrophe Avoidance Models for Hazardous Materials Route Planning," Transportation Science, INFORMS, vol. 34(2), pages 165-179, May.
    3. Michael Bell, 2006. "Mixed Route Strategies for the Risk-Averse Shipment of Hazardous Materials," Networks and Spatial Economics, Springer, vol. 6(3), pages 253-265, September.
    4. Volgenant, A., 2002. "Solving some lexicographic multi-objective combinatorial problems," European Journal of Operational Research, Elsevier, vol. 139(3), pages 578-584, June.
    5. H. Edwin Romeijn & Ravindra K. Ahuja & James F. Dempsey & Arvind Kumar, 2006. "A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems," Operations Research, INFORMS, vol. 54(2), pages 201-216, April.
    6. R. L. Francis & T. J. Lowe & Arie Tamir, 2000. "Aggregation Error Bounds for a Class of Location Models," Operations Research, INFORMS, vol. 48(2), pages 294-307, April.
    7. Tayyebi, Javad & Mitra, Ankan & Sefair, Jorge A., 2023. "The continuous maximum capacity path interdiction problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 38-52.
    8. Rodríguez-Chía, Antonio M. & Espejo, Inmaculada & Drezner, Zvi, 2010. "On solving the planar k-centrum problem with Euclidean distances," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1169-1186, 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:eee:ejores:v:97:y:1997:i:1:p:172-182. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.