Optimizing constrained subtrees of trees
type: Item
instance of: scholarly article
title: Optimizing constrained subtrees of trees
zbMATH Open document ID: 0846.90114
DOI: 10.1007/BF01585993
author: Thomas L. Magnanti
author: Laurence A. Wolsey
author: El-Houssaine Aghezzaf
published in: Mathematical Programming. Series A. Series B
publication date: 1996-10-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 883901
zbMATH Keywords: polyhedral combinatorics
zbMATH Keywords: knapsacks with precedence
zbMATH Keywords: column generation
zbMATH Keywords: dynamic programming
zbMATH Keywords: subtree packing problem
zbMATH Keywords: rooted subtree problem
zbMATH Keywords: tree
zbMATH Keywords: weight function
zbMATH Keywords: maximum weight subtree
zbMATH Keywords: valid inequalities
Wikidata QID: Q89214185
MaRDI profile type: Publication
cites work: Modelling piecewise linear concave costs in a tree partitioning problem
cites work: A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
cites work: Packing and covering a tree by subtrees
cites work: Polyhedral results for the precedence-constrained knapsack problem
cites work: The node capacitated graph partitioning problem: A computational study
cites work: Q3328583
cites work: Optimal Subtrees and Extensions
cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
cites work: Efficient Algorithm for the Partitioning of Trees
cites work: Q4040221
description: scientific article; zbMATH DE number 883901