An efficient algorithm for solving minimum cost flow problem with complementarity slack conditions

DOI10.1155/2020/2439265MaRDI QIDQ6534770zbMATH OpenFDO

Authors Yongwen Hu, Xiao Zhao, Jing Liu, Binyuan Liang, Chao Ma

Publication date 18 May 2021

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/2439265

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• A new algorithm for finding the minimum cost flow using the duality principle
• An O(nm^ 2) time algorithm for solving minimal cost network flow problems
• On dual minimum cost flow algorithms (extended abstract)
• On dual minimum cost flow algorithms
• scientific article; zbMATH DE number 150473

Cites work

• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A new efficient algorithm for optimal assignment of smart weapons to targets
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• Complexity of strict robust integer minimum cost flow problems: an overview and further results
• Matching, Euler tours and the Chinese postman
• Minimum cost network flows: Problems, algorithms, and software
• Minimum-cost flows in unit-capacity networks
• Network flows. Theory, algorithms, and applications.
• On dual minimum cost flow algorithms
• The Operator-Scheduling Problem: A Network-Flow Approach
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: An efficient algorithm for solving minimum cost flow problem with complementarity slack conditions

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