Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem

DOI10.1016/S0377-2217(99)00092-2zbMath0961.90087MaRDI QIDQ1577113

Takeo Yamada, Norio Araki, Seiji Kataoka

Publication date: 30 August 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial analysisminimum spanning treematroid theorysubtree

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (6)

Integer Programming Formulations for the k-Cardinality Tree Problem ⋮ The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches ⋮ Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation ⋮ New branch-and-bound algorithms for k-cardinality tree problems

Uses Software

• K_TREE/K_SUBGRAPH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Search-hide games on trees
• \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
• A heuristic algorithm for the mini-max spanning forest problem
• A branch-and-bound algorithm for the mini-max spanning forest problem
• Weighted k‐cardinality trees: Complexity and polyhedral structure

This page was built for publication: Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem