A Flow Augmentation Approach to the Network with Gains Minimum Cost Flow Problem

DOI10.1287/mnsc.23.6.631zbMath0352.90024OpenAlexW2060574300MaRDI QIDQ4123061

Gora Bhaumik, Paul A. Jensen

Publication date: 1977

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.23.6.631

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)

Related Items

An integrated planning model in centralized power systems ⋮ The structure of bases in bicircular matroids ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem ⋮ The capacity expansion problem in the service industry

Uses Software

• NETGEN