An Application of Generalized Linear Programming to Network Flows

DOI10.1137/0110020zbMath0105.12805OpenAlexW1995040662MaRDI QIDQ3290207

No author found.

Publication date: 1962

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0110020

zbMATH Keywords

applications of probability theory, mathematical programming

Related Items (18)

Network design and dynamic routing under queueing demand ⋮ Single-commodity robust network design with finite and hose demand sets ⋮ The multi-layered network design problem ⋮ Multi-terminal multipath flows: synthesis ⋮ Single-commodity robust network design problem: complexity, instances and heuristic solutions ⋮ A generalized linear production model: A unifying model ⋮ The network synthesis problem in a cycle ⋮ A polynomial-time algorithm for message routing in hierarchical communication networks ⋮ On the robustness of potential-based flow networks ⋮ Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements ⋮ Integer version of the multipath flow network synthesis problem ⋮ On the core of network synthesis games ⋮ The sensitivity of a traffic network ⋮ A distributed method for optimal capacity reservation ⋮ On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic ⋮ Synthesis of single-product networks ⋮ Exact solution of multicommodity network optimization problems with general step cost functions ⋮ Beiträge zur Dekomposition von linearen Programmen

This page was built for publication: An Application of Generalized Linear Programming to Network Flows