Pages that link to "Item:Q1329787"
From MaRDI portal
The following pages link to Arborescence polytopes for series-parallel graphs (Q1329787):
Displayed 10 items.
- Designing reliable tree networks with two cable technologies (Q1291775) (← links)
- The Steiner tree polytope and related polyhedra (Q1322552) (← links)
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
- Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
- Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
- Opposite Elements in Clutters (Q5219549) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)