A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks

DOI10.1007/s11590-011-0356-5zbMath1254.90269OpenAlexW2088390726MaRDI QIDQ1758062

Orhan Feyzioğlu, Ufuk Bahçeci

Publication date: 7 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0356-5

zbMATH Keywords

network simplex algorithmminimum cost network flowdisconnected subnetworksproportional flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

Deciding probabilistic automata weak bisimulation: theory and practice ⋮ A linear input dependence model for interdependent networks ⋮ An algorithm to solve the proportional network flow problem ⋮ A compaction scheme and generator for distribution networks

Cites Work

• Unnamed Item
• Unnamed Item
• A manufacturing supply chain optimization model for distilling process
• An efficient generalized network-simplex-based algorithm for manufacturing network flows
• A note on a generalized network flow model for manufacturing process
• The equal flow problem
• Network simplex algorithm for the general equal flow problem.
• A network simplex algorithm for simple manufacturing network model
• A network simplex algorithm for solving the minimum distribution cost problem
• Some further results on minimum distribution cost flow problems
• Manufacturing network flows: a generalized network flow model for manufacturing process modelling
• Algorithms for the Simple Equal Flow Problem
• Network Optimization Problems: Algorithms, Applications and Complexity

This page was built for publication: A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks