scientific article; zbMATH DE number 1195632

zbMath0906.90167MaRDI QIDQ4208337

Francesco Maffioli, Matthias Ehrgott, J. Freitag, Horst W. Hamacher

Publication date: 1 September 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph partitioningheuristicfacility layoutconnected subgraphNP-hard combinatorial optimizationminimal weight subtree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem, Revisiting dynamic programming for finding optimal subtrees in trees, Integer Programming Formulations for the k-Cardinality Tree Problem, Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem, Cardinality constrained minimum cut problems: complexity and algorithms., 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, Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem, Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem

Uses Software

• K_TREE/K_SUBGRAPH