Minimum cost routing for static network models

DOI10.1002/NET.3230010205MaRDI QIDQ5636668zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• Traffic flow information for minimum cost routing procedures

Cited in

(24)

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

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

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