Algorithms for the Simple Equal Flow Problem

DOI10.1287/mnsc.45.10.1440zbMath1231.90106OpenAlexW2149301478MaRDI QIDQ3116705

James B. Orlin, Ravindra K. Ahuja, Giovanni M. Sechi, Paola Zuddas

Publication date: 12 February 2012

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/2660

zbMATH Keywords

networksimplex algorithmminimum cost flow problem

Mathematics Subject Classification ID

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

Related Items (12)

Integer equal flows ⋮ A linear input dependence model for interdependent networks ⋮ Robust minimum cost flow problem under consistent flow constraints ⋮ Integrality in the multinetwork min‐cost equal‐flow problem ⋮ Flow constrained minimum cost flow problem ⋮ Network simplex algorithm for the general equal flow problem. ⋮ Willingness-to-pay estimation with choice-based conjoint analysis: addressing extreme response behavior with individually adapted designs ⋮ An algorithm to solve the proportional network flow problem ⋮ Some further results on minimum distribution cost flow problems ⋮ A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks ⋮ A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals ⋮ A manufacturing supply chain optimization model for distilling process

This page was built for publication: Algorithms for the Simple Equal Flow Problem