Pages that link to "Item:Q4018843"
From MaRDI portal
The following pages link to Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems (Q4018843):
Displaying 11 items.
- Polyhedral study of the connected subgraph problem (Q468440) (← links)
- On two-connected subgraph polytopes (Q1910503) (← links)
- \(k\)-edge connected polyhedra on series-parallel graphs (Q2564304) (← links)
- Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
- An efficiently solvable case of the minimum weight equivalent subgraph problem (Q3706869) (← links)
- Strong Formulations for 2-Node-Connected Steiner Network Problems (Q5505657) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5891092) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)
