Minimum cost routing for dynamic network models

DOI10.1002/NET.3230030302MaRDI QIDQ5684848zbMATH OpenOpenAlexFDO

Authors B. jun. Yaged

Publication date 1973

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230030302

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cited in

(11)

• Planning horizons for capacity expansion
• Facility location models for planning a transatlantic communications network
• The DT-polynomial approach to discrete time-varying network flow problems
• A heuristic approach for capacity expansion of packet networks
• Multiple routing strategies in a labelled network
• A Reach and Bound algorithm for acyclic dynamic-programming networks
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
• Transmission facility planning in telecommunications networks: A heuristic approach
• A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network
• A survey of dynamic network flows

This page was built for publication: Minimum cost routing for dynamic network models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5684848)