Pages that link to "Item:Q4274755"
From MaRDI portal
The following pages link to A decomposition algorithm for capacity expansion of local access networks (Q4274755):
Displayed 8 items.
- A new approach for solving the network problems (Q505104) (← links)
- A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment (Q543889) (← links)
- Models for planning capacity expansion in local access telecommunication networks (Q806810) (← links)
- Network flow models for the local access network expansion problem (Q856692) (← links)
- A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815) (← links)
- On the minimization of possibly discontinuous functions by means of pointwise approximations (Q1686551) (← links)
- A global optimization algorithm for reliable network design (Q2379515) (← links)
- A node rooted flow-based model for the local access network expansion problem (Q2654316) (← links)