Università di Pisa
Sistema bibliotecario di ateneo

Fast Lower Bounds for the Capacitated Minimum Spanning Tree Problem

Frangioni, Antonio and Pretolani, Daniele and Scutellà, Maria Grazia (1999) Fast Lower Bounds for the Capacitated Minimum Spanning Tree Problem. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Postscript (GZip) - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (162Kb)


    We propose some techniques, based on minimum cost flow computations, for efficiently computing lower bounds for the Capacitated Minimum Spanning Tree problem (CMST). With respect to other methods proposed in the literature, our approaches often provide comparable bounds, with a substantially lower computational cost. For this reason, and for other features discussed in the paper, the proposed methods may be particularly promising in the context of exact algorithms for CMST.

    Item Type: Book
    Uncontrolled Keywords: Capacitated Minimum Spanning Tree, Minimum Cost Flow, Lagrangean relaxations.
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 26 Jan 2015 14:33
    Last Modified: 26 Jan 2015 14:33
    URI: http://eprints.adm.unipi.it/id/eprint/2008

    Repository staff only actions

    View Item