scientific article; zbMATH DE number 1062936
From MaRDI portal
Publication:4355372
Recommendations
Cited in
(27)- Step graphs and their application to the organization of commodity flows in networks
- A note on practical construction of maximum bandwidth paths.
- Construction of simple path graphs in transport networks. I: General solutions and examples
- Maximum flow problem in the distribution network
- An approximate polynomial method for solving a combinatorial problem of finding the maximum flow in a network
- The Maximum Labeled Path Problem
- scientific article; zbMATH DE number 4131955 (Why is no real title available?)
- scientific article; zbMATH DE number 988194 (Why is no real title available?)
- The maximum flow problem in a network with special conditions of flow distribution
- A note on the paper “characterization of all optimal solutions and parametric maximal flows in networks” of G. Ruhe (optimization 16 (1985) 1, 51-61)
- scientific article; zbMATH DE number 4158666 (Why is no real title available?)
- scientific article; zbMATH DE number 3908126 (Why is no real title available?)
- scientific article; zbMATH DE number 3943526 (Why is no real title available?)
- scientific article; zbMATH DE number 3950169 (Why is no real title available?)
- scientific article; zbMATH DE number 3970465 (Why is no real title available?)
- scientific article; zbMATH DE number 4053314 (Why is no real title available?)
- scientific article; zbMATH DE number 45131 (Why is no real title available?)
- scientific article; zbMATH DE number 67667 (Why is no real title available?)
- scientific article; zbMATH DE number 706868 (Why is no real title available?)
- scientific article; zbMATH DE number 754202 (Why is no real title available?)
- Playing with the Maximum-Flow Problem
- The Maximum Flow Problem for Oriented Flows
- Determination of the maximal steady state flow of traffic through a railroad network
- Method of calculating the maximum flow in network picture
- Flows on few paths: Algorithms and lower bounds
- A measure-theoretical max-flow problem
- Maximal flow in possibilistic networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355372)