scientific article

zbMath1479.90048MaRDI QIDQ3384766

M. T. Todinov

Publication date: 17 December 2021

Full work available at URL: http://www.orstw.org.tw/ijor/vol11no1/IJOR2014_vol11_no1_p001_p017.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

optimizationflow networksdominated parasitic flow loopsparasitic flow loops

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strongly polynomial minimum cost circulation algorithm
• A strong-connectivity algorithm and its applications in data flow analysis
• Weighted min cost flows
• Finding minimum-cost flows by double scaling
• Finding minimum-cost circulations by canceling negative cycles
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems

This page was built for publication: