Skip to search formSkip to main contentSkip to account menu

Flow network

Known as: Random networks, Flows, Generalized network 
In graph theory, a flow network (also known as a transportation network) is a directed graph where each edge has a capacity and each edge receives a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Approximate max-flow min-cut theoremBellman–Ford algorithmBiconnected graphBreadth-first search

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Weighted Sums of Random Kitchen Sinks: Replacing minimization with randomization in learning
Randomized neural networks are immortalized in this AI Koan: In the days when Sussman was a novice, Minsky once came to him as… 
Highly Cited
2007
Highly Cited
2007
Two-Stage Robust Network Flow and Design Under Demand Uncertainty
We describe a two-stage robust optimization approach for solving network flow and design problems with uncertain demand. In two… 
Highly Cited
1999
Highly Cited
1999
Periodic mesoporous organosilicas with organic groups inside the channel walls
Surfactant-mediated synthesis methods have attracted much interest for the production of inorganic mesoporous materials, which… 
Highly Cited
1995
Highly Cited
1995
On reliability evaluation of a capacitated-flow network in terms of minimal pathsets
Many real-world systems such as electric power transmission and distribution systems, transportation systems, and manufacturing… 
Highly Cited
1988
Highly Cited
1988
Sensitivity Analysis for Equilibrium Network Flow
Direct application of existing sensitivity analysis methods for nonlinear programming problems or for variational inequalities to… 
Highly Cited
1984
Highly Cited
1984
Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae
Highly Cited
1977
Highly Cited
1977
Linear Programming and Network Flows
Highly Cited
1975
Highly Cited
1975
On the complexity of time table and multi-commodity flow problems
A very primitive version of Gotlieb's timetable problem is shown to be NP-complete, and therefore all the common timetable… 
Highly Cited
1974
Highly Cited
1974
NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
The purpose of this paper is to describe the development, implementation, and availability of a computer program for generating a… 
Highly Cited
1956
Highly Cited
1956
NETWORK FLOW THEORY
Abstract : The labeling algorithm for the solution of maximal network flow problems and its application to various problems of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)