An Application of Generalized Linear Programming to Network Flows

DOI10.1137/0110020MaRDI QIDQ3290207zbMATH OpenOpenAlexFDO

Authors

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

Cited in

(18)

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

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

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