scientific article; zbMATH DE number 764407
From MaRDI portal
Publication:4836293
zbMATH Open0828.90131MaRDI QIDQ4836293FDOQ4836293
Authors: Matthias Ehrgott
Publication date: 14 June 1995
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1195632
- Weighted k‐cardinality trees: Complexity and polyhedral structure
- A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
- The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut
Programming involving graphs or networks (90C35) Integer programming (90C10) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Cited In (8)
- \(k\)-subdomination in graphs
- A branch and cut approach to the cardinality constrained circuit problem.
- Polynomial algorithms for some hard problems of finding connected spanning subgraphs of extreme total edge weight
- Cardinality constrained minimum cut problems: complexity and algorithms.
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Exploring the constrained maximum edge-weight connected graph problem
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
- A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem
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 Q4836293)