Pages that link to "Item:Q3418125"
From MaRDI portal
The following pages link to Multicommodity network design with discrete node costs (Q3418125):
Displayed 7 items.
- Prize collecting Steiner trees with node degree dependent costs (Q709134) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
- Optimal solution of the discrete cost multicommodity network design problem (Q2518654) (← links)
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem (Q2669599) (← links)
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
- Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)