Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem
type: Item
instance of: scholarly article
title: Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem
zbMATH Open document ID: 0961.90087
DOI: 10.1016/S0377-2217(99)00092-2
author: Seiji Kataoka
author: Norio Araki
author: Takeo Yamada
published in: European Journal of Operational Research
publication date: 2000-08-30T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1498193
zbMATH Keywords: combinatorial analysis
zbMATH Keywords: minimum spanning tree
zbMATH Keywords: subtree
zbMATH Keywords: matroid theory
describes a project that uses: K_TREE/K_SUBGRAPH
MaRDI profile type: Publication
cites work: Q3056948
cites work: Search-hide games on trees
cites work: \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
cites work: Q4208337
cites work: Weighted k‐cardinality trees: Complexity and polyhedral structure
cites work: Q4198056
cites work: Q4216482
cites work: A heuristic algorithm for the mini-max spanning forest problem
cites work: A branch-and-bound algorithm for the mini-max spanning forest problem
description: scientific article; zbMATH DE number 1498193