K_TREE/K_SUBGRAPH

swMATH15444MaRDI QIDQ27333FDOQ27333

Author name not available (Why is that?)

Described by source

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

Cited In (11)

• Local and variable neighborhood search for the \(k\) -cardinality subgraph problem
• Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
• Revisiting dynamic programming for finding optimal subtrees in trees
• Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem
• Local search algorithms for the \(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
• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
• Title not available (Why is that?)
• New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem

This page was built for software: K_TREE/K_SUBGRAPH