K_TREE/K_SUBGRAPH

swMATH15444MaRDI QIDQ27333

No author found.

Described by source

• \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs

Related Items (11)

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 ⋮ Unnamed Item ⋮ 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. ⋮ Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem ⋮ Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem

This page was built for software: K_TREE/K_SUBGRAPH