Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems
From MaRDI portal
Recommendations
- Polyhedral study of the connected subgraph problem
- Polytopes and connected subgraphs
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
- scientific article; zbMATH DE number 3869364
- The polyhedron of a problem on an m-vertex subgraph of a complete graph
- Two-edge connected spanning subgraphs and polyhedra
- The k-Edge-Connected Spanning Subgraph Polyhedron
- On two-connected subgraph polytopes
- Steiner k-edge connected subgraph polyhedra
- A polyhedral study of the maximum edge subgraph problem
Cited in
(12)- The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs
- k-edge connected polyhedra on series-parallel graphs
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- An efficiently solvable case of the minimum weight equivalent subgraph problem
- Strong Formulations for 2-Node-Connected Steiner Network Problems
- Polyhedral study of the connected subgraph problem
- Using a hybrid of exact and genetic algorithms to design survivable networks
- On two-connected subgraph polytopes
- A polyhedral study of the maximum edge subgraph problem
- Steiner trees and polyhedra
- Critical extreme points of the 2-edge connected spanning subgraph polytope
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
This page was built for publication: Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018843)
