Finding the foremost ares in a network with parametric are capacities

DOI10.1080/02331938508843092MaRDI QIDQ3731345zbMATH OpenOpenAlexFDO

Authors D. T. Ivanchev

Publication date 1985

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331938508843092

zbMATH Keywords

flow networkparametric arc capacitiesforemost arcsminimization of the maximal flow

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3876893
• Minimum cuts in parametric networks
• Parametric flows in static networks
• A Fast Parametric Maximum Flow Algorithm and Applications
• Parametric max flow problems in a class of networks with series-parallel structure

Cites work

• Removing Arcs from a Network

Cited in

(4)

• Characterization of all optimal solutions and parametric maximal mows in networks
• Sensitive and parametric analysis of the maximum flow in a network
• scientific article; zbMATH DE number 3876893 (Why is no real title available?)
• scientific article; zbMATH DE number 3937112 (Why is no real title available?)

This page was built for publication: Finding the foremost ares in a network with parametric are capacities

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