scientific article; zbMATH DE number 764407

MaRDI QIDQ4836293zbMATH OpenFDO

Authors Matthias Ehrgott

Publication date 14 June 1995

zbMATH Keywords

branch-and-cutconnected subgraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

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

Cited in

(14)

• k-subdomination in graphs
• On the connected spanning cubic subgraph problem
• Variable neighborhood search for minimal connected subgraph
• The k-node connected subgraph problem: polyhedral analysis and branch-and-cut
• On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem
• Polynomial algorithms for some hard problems of finding connected spanning subgraphs of extreme total edge weight
• A branch and cut approach to the cardinality constrained circuit problem.
• Cardinality constrained minimum cut problems: complexity and algorithms.
• Exploring the constrained maximum edge-weight connected graph problem
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
• Different Formulations for Solving the HeaviestK-Subgraph Problem
• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
• 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)