\(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
From MaRDI portal
Publication:1268220
DOI10.1016/0377-2217(96)00084-7zbMath0925.90368OpenAlexW2064963298MaRDI QIDQ1268220
Publication date: 9 June 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(96)00084-7
Related Items (12)
Revisiting dynamic programming for finding optimal subtrees in trees ⋮ 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 ⋮ Local and variable neighborhood search for the \(k\) -cardinality subgraph problem ⋮ New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation ⋮ Local search algorithms for the \(k\)-cardinality tree problem. ⋮ \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs ⋮ K_TREE/K_SUBGRAPH ⋮ Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem ⋮ Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
Cites Work
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
- Weighted k‐cardinality trees: Complexity and polyhedral structure
- Unnamed Item
This page was built for publication: \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
