Optimal dynamic routing in communication networks with continuous traffic

DOI10.1002/NET.3230140308zbMath0546.90097OpenAlexW2088045969MaRDI QIDQ3337975

Bruce Hajek, Richard G. Ogier

Publication date: 1984

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

communication networkslinear constraintsconvex costflow relaxationcontinuous traffic network modelopen-loop computationoptimal state-dependent routing strategies

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items (19)

Fenchel duality and smoothness of solution of the optimal routing problem ⋮ Average flow constraints and stabilizability in uncertain production-distribution systems ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ Solution algorithms for a class of continuous linear programs with fuzzy valued objective functions ⋮ Lexicographically optimal earliest arrival flows ⋮ Scheduling arc maintenance jobs in a network to maximize total flow over time ⋮ An Introduction to Network Flows over Time ⋮ A linear programming approach to routing control in networks of constrained linear positive systems ⋮ A survey of dynamic network flows ⋮ Unnamed Item ⋮ A simplex based algorithm to solve separated continuous linear programs ⋮ Earliest arrival flows in networks with multiple sinks ⋮ Complexity analysis for maximum flow problems with arc reversals ⋮ Universally maximum flow with piecewise-constant capacities ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths ⋮ Traffic Networks and Flows over Time ⋮ Efficient continuous-time dynamic network flow algorithms

Cites Work

• Unnamed Item

This page was built for publication: Optimal dynamic routing in communication networks with continuous traffic