Maximal Flow with Gains through a Special Network

DOI10.1287/OPRE.20.3.678zbMATH Open0241.90021OpenAlexW2108941818MaRDI QIDQ5652430FDOQ5652430

Authors: John J. Jarvis, Anthony M. Jezior 

Publication date: 1972

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.20.3.678

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cited In (3)

• Maximum outflow in generalized flow networks
• A decomposition algorithm to determine the maximum flow in a generalized network
• Solving the resource constrained deadline scheduling problem via reduction to the network flow problem

This page was built for publication: Maximal Flow with Gains through a Special Network

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