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