Algorithms for the simple equal flow problem
From MaRDI portal
Publication:3116705
DOI10.1287/MNSC.45.10.1440zbMATH Open1231.90106OpenAlexW2149301478MaRDI QIDQ3116705FDOQ3116705
Authors: Ravindra K. Ahuja, James B. Orlin, 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
Recommendations
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cited In (17)
- Algorithms and complexity for the almost equal maximum flow problem
- Integer equal flows
- A manufacturing supply chain optimization model for distilling process
- The equal flow problem
- Uniform flow distribution over the sink arcs in a network
- Fast algorithms for specially structured minimum cost flow problems with applications
- Willingness-to-pay estimation with choice-based conjoint analysis: addressing extreme response behavior with individually adapted designs
- A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals
- Network simplex algorithm for the general equal flow problem.
- Integrality in the multinetwork min‐cost equal‐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
- Algorithms and complexity for the almost equal maximum flow problem
- Flow constrained minimum cost flow problem
- A linear input dependence model for interdependent networks
- Robust minimum cost flow problem under consistent flow constraints
- An algorithm to solve the proportional network flow problem
This page was built for publication: Algorithms for the simple equal flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3116705)
