Dominated parasitic flow loops in networks
type: Item
instance of: scholarly article
zbMATH Open document ID: 1479.90048
author: M. T. Todinov
publication date: 2021-12-17T00:00:00Z
full work available at URL: IJOR2014 vol11 no1 p001 p017.pdf
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 7447425
zbMATH Keywords: parasitic flow loops
zbMATH Keywords: flow networks
zbMATH Keywords: dominated parasitic flow loops
zbMATH Keywords: optimization
MaRDI profile type: MaRDI publication profile
cites work: Network flows. Theory, algorithms, and applications.
cites work: Finding minimum-cost flows by double scaling
cites work: Q4538163
cites work: Introduction to algorithms
cites work: Weighted min cost flows
cites work: Finding minimum-cost circulations by canceling negative cycles
cites work: Algorithm design: Foundations, analysis, and Internet examples
cites work: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm
cites work: A strong-connectivity algorithm and its applications in data flow analysis
cites work: A strongly polynomial minimum cost circulation algorithm
cites work: Q3707420
Recommended article: Q4343043
Recommended article: Flow networks. Analysis and optimization of repairable flow networks, networks with disturbed flows, static flow networks and reliability networks
Recommended article: Improving traffic flows at no cost
Recommended article: Efficient Methods for Selfish Network Design
Recommended article: Efficient methods for selfish network design
description: scientific article; zbMATH DE number 7447425