scientific article; zbMATH DE number 1195632
From MaRDI portal
Publication:4208337
Recommendations
Cited in
(22)- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
- Cardinality constrained minimum cut problems: complexity and algorithms.
- Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem
- New metaheuristic approaches for the edge-weighted k-cardinality tree problem
- Local search algorithms for the \(k\)-cardinality tree problem.
- Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
- Heuristics for the network design problem with connectivity requirements
- New branch-and-bound algorithms for k-cardinality tree problems
- Integer Programming Formulations for the k-Cardinality Tree Problem
- scientific article; zbMATH DE number 1215044 (Why is no real title available?)
- Weighted k‐cardinality trees: Complexity and polyhedral structure
- scientific article; zbMATH DE number 764407 (Why is no real title available?)
- Obtaining optimal \(k\)-cardinality trees fast
- Simple heuristics for the rooted max tree coverage problem
- Extended formulations for the cardinality constrained subtree of a tree problem
- Revisiting dynamic programming for finding optimal subtrees in trees
- Local and variable neighborhood search for the k -cardinality subgraph problem
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
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)
