The minimum cover flow problem in networks

MaRDI QIDQ5260320zbMATH OpenFDO

Authors Hao Lin, Lan Lin

Publication date 29 June 2015

zbMATH Keywords

network flowpolynomial-time algorithmminimum cover flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Stochastic network models in operations research (90B15)

Recommendations

• Minimal blocking flow in networks
• scientific article; zbMATH DE number 6402605
• scientific article; zbMATH DE number 4204092
• Minimum saturated flow problem in directed network and its algorithm
• scientific article; zbMATH DE number 4041594

Cited in

(10)

• On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows
• The ferry cover problem on regular graphs and small-degree graphs
• Complexity of minimum irreducible infeasible subsystem covers for flow networks
• A minimum cost network flow model for the maximum covering and patrol routing problem
• scientific article; zbMATH DE number 2150421 (Why is no real title available?)
• Minimum saturated flow problem in directed network and its algorithm
• Facets of the stochastic network flow problem
• On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
• scientific article; zbMATH DE number 5997367 (Why is no real title available?)
• scientific article; zbMATH DE number 1116645 (Why is no real title available?)

This page was built for publication: The minimum cover flow problem in networks

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