Maximum flow problem in the distribution network

DOI10.3934/JIMO.2006.2.237MaRDI QIDQ2458356zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 31 October 2007

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/jimo.2006.2.237

zbMATH Keywords

cyclesdistribution networklabeling methodmaximum flow problem

Mathematics Subject Classification ID

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

Recommendations

• The maximum flow problem in a network with special conditions of flow distribution
• scientific article; zbMATH DE number 988194
• Uniform flow distribution over the sink arcs in a network
• A maximal flow algorithm for the manufacturing network
• scientific article; zbMATH DE number 1062936

Cited in

(8)

• Maximum balanced flow in a network
• Maximum flows in generalized processing networks
• Incremental gradient-free method for nonsmooth distributed optimization
• A compaction scheme and generator for distribution networks
• The maximum flow problem in a network with special conditions of flow distribution
• scientific article; zbMATH DE number 6863577 (Why is no real title available?)
• Maximal flow network modelling of production bottleneck problems
• A new approach to computing maximum flows using electrical flows

This page was built for publication: Maximum flow problem in the distribution network

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