On the selection of primary paths for a communication network
DOI10.1016/0169-7552(85)90001-7zbMath0586.90031MaRDI QIDQ3713826
Dong-wan Tcha, Kiyoshi Maruyama
Publication date: 1985
Published in: Computer Networks and ISDN Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0169-7552(85)90001-7
convergence; lower bounds; heuristic algorithm; congestion; multicommodity flows; communication network; routing; mixed 0-1 linear programming; suboptimal solution; Computational experience; average network delay; maximum link utilization factor; non-bifurcated static flow assignment
65K05: Numerical mathematical programming methods
90C11: Mixed integer programming
90B10: Deterministic network models in operations research
05C38: Paths and cycles
94C15: Applications of graph theory to circuits and networks
Related Items