scientific article; zbMATH DE number 1377930

MaRDI QIDQ4703380zbMATH OpenFDO

Authors Ryôhei Nozawa

Publication date 14 December 1999

zbMATH Keywords

continuous networkGale's feasibility theoremmax-flow problems

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Gale's feasibility theorem and max-flow problems in a continuous network.
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
• scientific article; zbMATH DE number 67667
• An Approximation for a Continuous Max-Flow Problem
• On Gale's feasibility theorem for certain infinite networks
• The maximum flow problem in a network with special conditions of flow distribution
• A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(<Special Issue>Network Design, Control and Optimization)
• The problem of maximum flow with minimum attainable cost in a network
• Finding a feasible flow in a strongly connected network
• The maximum flow in dynamic networks

Cited in

(3)

• On Gale's feasibility theorem for certain infinite networks
• A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota
• scientific article; zbMATH DE number 3928683 (Why is no real title available?)

This page was built for publication:

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