Minimum cost routing for static network models

DOI10.1002/net.3230010205zbMath0228.90011OpenAlexW2160408584MaRDI QIDQ5636668

B. jun. Yaged

Publication date: 1971

Published in: Networks (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items

LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY, Ein Verfahren zur Optimierung von Nachrichtenübertragungsnetzen mit Mehrwegeführung, A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints, Multimodal transport network systems interface, interaction coordination: A specification for control systems integration, A decomposition method for the min concave cost flow problem with a staircase structure, An algorithm for the min concave cost flow problem, On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems, A new algorithm to find the shortest paths between all pairs of nodes, A survey of dynamic network flows, Eine Planungsmethode für das Vermittlungsnetz eines Datennetzes mit Paketvermittlung, An improved branch and bound algorithm for minimum concave cost network flow problems, Global search algorithms for minimum concave-cost network flow problems, Algorithms for the single-source uncapacitated minimum concave-cost network flow problem, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Concave cost minimization on networks, The network redesign problem for access telecommunications networks, Design of private backbone networks. I: Time varying traffic, Simulation and optimization of supply chains: Alternative or complementary approaches?, Resource allocation and capacity assignment in distributed systems, An algorithm for optimizing network flow capacity under economies of scale, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, Parallel computing in nonconvex programming, Global and local search algorithms for concave cost transshipment problems

Cites Work

• Traffic flow information for minimum cost routing procedures