Pages that link to "Item:Q4022020"
From MaRDI portal
The following pages link to Integer Solution to Synthesis of Communication Networks (Q4022020):
Displaying 12 items.
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- Integer version of the multipath flow network synthesis problem (Q1003728) (← links)
- A rounding algorithm for integer programs (Q1327212) (← links)
- Cost-efficient network synthesis from leased lines (Q1383114) (← links)
- Multi-terminal multipath flows: synthesis (Q1887053) (← links)
- The network synthesis problem in a cycle (Q1924616) (← links)
- Flows over edge-disjoint mixed multipaths and applications (Q2381819) (← links)
- Multiroute flows: cut-trees and realizability (Q2581318) (← links)
- On the robustness of potential-based flow networks (Q2689822) (← links)
- 2-commodity integer network synthesis problem (Q2867369) (← links)
- On half-integrality of network synthesis problem (Q2928993) (← links)
- On integer network synthesis problem with tree-metric cost (Q3121495) (← links)