K_TREE/K_SUBGRAPH

MaRDI QIDQ27333swMATHFDO

Official website http://www.sciencedirect.com/science/article/pii/0377221796000847

Described by source

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

Cited in

(12)

• Local and variable neighborhood search for the \(k\) -cardinality subgraph problem
• New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
• Local search algorithms for the \(k\)-cardinality tree problem.
• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
• Revisiting dynamic programming for finding optimal subtrees in trees
• HC-ACO
• scientific article; zbMATH DE number 1195632 (Why is no real title available?)
• Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem
• Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

This page was built for software: K_TREE/K_SUBGRAPH