Algorithms for the simple equal flow problem

DOI10.1287/MNSC.45.10.1440MaRDI QIDQ3116705zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

minimum cost flow problemnetworksimplex algorithm

Mathematics Subject Classification ID

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

Recommendations

• Network simplex algorithm for the general equal flow problem.
• The equal flow problem
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• scientific article; zbMATH DE number 4079141
• Finding minimum-cost flows by double scaling

Cited in

(19)

• Uniform flow distribution over the sink arcs in a network
• The equal flow problem
• Network simplex algorithm for the general equal flow problem.
• A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
• Flow constrained minimum cost flow problem
• Algorithms and complexity for the almost equal maximum flow problem
• An algorithm to solve the proportional network flow problem
• Some further results on minimum distribution cost flow problems
• A linear input dependence model for interdependent networks
• Robust minimum cost flow problem under consistent flow constraints
• Fast algorithms for specially structured minimum cost flow problems with applications
• An efficient lagrangean relaxation scheme for linear and integer equal flow problems
• Proportional Equity Flow Problem for Terminal Arcs
• 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
• Integrality in the multinetwork min‐cost equal‐flow problem
• Algorithms and complexity for the almost equal maximum flow problem
• A manufacturing supply chain optimization model for distilling process
• Integer equal flows

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)