On network flow functions

DOI10.1002/NAV.3800080204zbMATH Open0123.43406OpenAlexW2032091905MaRDI QIDQ5736899FDOQ5736899

Authors: Lloyd S. Shapley 

Publication date: 1961

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800080204

Recommendations

• scientific article
• scientific article
• scientific article; zbMATH DE number 4085386
• Sensitive and parametric analysis of the maximum flow in a network
• scientific article

zbMATH Keywords

classical field theory, relativity theory

Cited In (10)

• Minimax problem of suppressing a communication network
• Structural and algorithmic properties for parametric minimum cuts
• Flow on Sweeping Networks
• More on complementarity and substitutability in the transshipment problem.
• Substitutes and Complements in Constrained Linear Models
• Some Recent Advances in Network Flows
• Substitutes and complements in network flow problems
• Submodularity and valid inequalities in capacitated fixed charge networks
• Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen
• On a function for the vulnerability of a directed flow network

This page was built for publication: On network flow functions

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