A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM

DOI10.15807/JORSJ.47.1MaRDI QIDQ5697484zbMATH OpenOpenAlexFDO

Authors Akinobu Eguchi, Satoru Fujishige, Takashi Takabatake

Publication date 18 October 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.1

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• New algorithms for generalized network flows
• A polynomial cycle canceling algorithm for submodular flows
• Faster algorithms for the generalized network flow problem
• A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
• Combinatorial approximation algorithms for generalized flow problems

Cited in

(2)

• Ex ante and ex post envy-freeness on polytope resources
• Maximum network flows with concave gains

This page was built for publication: A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM

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