scientific article; zbMATH DE number 1195632

zbMATH Open0906.90167MaRDI QIDQ4208337FDOQ4208337

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

Publication date: 1 September 1998

Title of this publication is not available (Why is that?)

Recommendations

• Weighted k‐cardinality trees: Complexity and polyhedral structure
• scientific article; zbMATH DE number 764407
• Local search algorithms for the \(k\)-cardinality tree problem.
• scientific article; zbMATH DE number 1215044

zbMATH Keywords

heuristicgraph partitioningfacility layoutconnected subgraphNP-hard combinatorial optimizationminimal weight subtree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (20)

• 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
• A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
• Heuristics for the network design problem with connectivity requirements
• Revisiting dynamic programming for finding optimal subtrees in trees
• Integer Programming Formulations for the k-Cardinality Tree Problem
• Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem
• Simple heuristics for the rooted max tree coverage problem
• Local search algorithms for the \(k\)-cardinality tree problem.
• Cardinality constrained minimum cut problems: complexity and algorithms.
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• New branch-and-bound algorithms for \(k\)-cardinality tree problems
• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
• \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
• Extended formulations for the cardinality constrained subtree of a tree problem
• Title not available (Why is that?)
• Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
• New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem
• Obtaining optimal \(k\)-cardinality trees fast

Uses Software

• K_TREE/K_SUBGRAPH

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4208337)