A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)

DOI10.15807/jorsj.47.244zbMath1106.90072OpenAlexW587082522MaRDI QIDQ4671021

Maiko Shigeno

Publication date: 23 April 2005

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.47.244

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (1)

A Strongly Polynomial Algorithm for Generalized Flow Maximization

This page was built for publication: A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)