On the budget-restricted max flow problem

DOI10.1007/BF01719791zbMath0473.90032OpenAlexW2086063815MaRDI QIDQ1159128

H. A. Eiselt, H. von Frajer

Publication date: 1982

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01719791

zbMATH Keywords

approximation algorithmexact solutionsfixed costsbudget-restricted max flow problemtest series

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Related Items (2)

The complexity of flow expansion and electrical flow expansion ⋮ Capacity expansion and reliability evaluation on the networks flows with continuous stochastic functional capacity

Uses Software

• NETGEN

Cites Work

• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Note on Finite Convergence of Exterior Penalty Functions
• Characterization of Totally Unimodular Matrices
• Matroids and the greedy algorithm

This page was built for publication: On the budget-restricted max flow problem