Minimum cost routing for dynamic network models

DOI10.1002/net.3230030302zbMath0266.90057OpenAlexW4239369411MaRDI QIDQ5684848

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

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

Related Items

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

Cites Work

• Unnamed Item