Optimal Trees

Thomas Magnanti and Laurence Wolsey ()
Additional contact information
Thomas Magnanti: Sloan School of Management and Operations Research Center, MIT
Laurence Wolsey: CORE, Université catholique de Louvain, B-1348 Louvain-la-Neuve, Belgium

No 1994026, LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

Abstract: A number of basic results concerning tree optimization problems are presented. As well as treating the polynominally solvable problems of finding minimum weight spanning trees and rooted subtrees of a tree, attention is paid to various NP-hard models including the Steiner tree problem, the problem of packing subtreees of a tree or of a more general graph and very recent work on hierarchicak embedbing of tree on trees. More generally this study is used to introduce many of the key ideas from the branch of combinatorial optimization known as polyhedral combinatories (the study of integer polyhedra).

Date: 1994-05-01
References: Add references at CitEc
Citations:

Downloads: (external link)
https://sites.uclouvain.be/core/publications/coredp/coredp1994.html (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cor:louvco:1994026

Access Statistics for this paper

More papers in LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().