NP-COMPLETENESS AND APPROXIMATION ALGORITHM FOR THE MAXIMUM INTEGRAL VERTEX-BALANCED FLOW PROBLEM

DOI10.15807/JORSJ.34.13zbMath0746.90020OpenAlexW652196075MaRDI QIDQ3982631

Akira Nakayama

Publication date: 26 June 1992

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.34.13

zbMATH Keywords

polynomial-time approximationtwo-terminal networkmaximum balanced flow problemmaximum integral balanced flowmaximum vertex-balanced flow problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

This page was built for publication: NP-COMPLETENESS AND APPROXIMATION ALGORITHM FOR THE MAXIMUM INTEGRAL VERTEX-BALANCED FLOW PROBLEM