Fast algorithms for specially structured minimum cost flow problems with applications

DOI10.1287/OPRE.1100.0846zbMATH Open1231.90111OpenAlexW2139464137MaRDI QIDQ3098331FDOQ3098331

Authors: Balachandran Vaidyanathan, Ravindra K. Ahuja 

Publication date: 17 November 2011

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1100.0846

Recommendations

• Fast algorithms for convex cost flow problems on circles, lines, and trees
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Algorithms for the simple equal flow problem
• Finding minimum-cost flows by double scaling
• Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs

zbMATH Keywords

computational complexityminimum cost flow problemnetwork flow algorithms

Mathematics Subject Classification ID

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

Cited In (6)

• Simple linear flow decomposition algorithms on trees, circles, and augmented trees
• Title not available (Why is that?)
• Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs
• Fast algorithms for convex cost flow problems on circles, lines, and trees
• On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
• Machine-part cell formation using biclustering

This page was built for publication: Fast algorithms for specially structured minimum cost flow problems with applications

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