Pages that link to "Item:Q5684848"
From MaRDI portal
The following pages link to Minimum cost routing for dynamic network models (Q5684848):
Displaying 11 items.
- Transmission facility planning in telecommunications networks: A heuristic approach (Q788618) (← links)
- A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network (Q841973) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Planning horizons for capacity expansion (Q1097830) (← links)
- Facility location models for planning a transatlantic communications network (Q1148216) (← links)
- The DT-polynomial approach to discrete time-varying network flow problems (Q1245139) (← links)
- A heuristic approach for capacity expansion of packet networks (Q1278229) (← links)
- Multiple Routing Strategies in a Labelled Network (Q2765602) (← links)
- A Reach and Bound algorithm for acyclic dynamic-programming networks (Q3632964) (← links)
- Networks synthesis and optimum network design problems: Models, solution methods and applications (Q3818783) (← links)
- LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY (Q3964470) (← links)
