Pages that link to "Item:Q2583145"
From MaRDI portal
The following pages link to Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145):
Displaying 19 items.
- Hierarchical survivable network design problems (Q325448) (← links)
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Two-connected networks with rings of bounded cardinality (Q1424779) (← links)
- On imposing connectivity constraints in integer programs (Q1683690) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
- Polyhedral results for two-connected networks with bounded rings (Q1849257) (← links)
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope (Q2480058) (← 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)
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
- Survivability in hierarchical telecommunications networks (Q2892145) (← links)
- A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut (Q3418127) (← links)
- A decomposition algorithm for the ring spur assignment problem (Q4921258) (← links)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
- Network design with vulnerability constraints and probabilistic edge reliability (Q6599059) (← links)
