Efficient preflow push algorithms (Q2471239)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Efficient preflow push algorithms	scientific article

Statements

scholarly article

0 references

Efficient preflow push algorithms (English)

0 references

Raffaele Cerulli

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

22 February 2008

0 references

zbMATH Keywords

maximum flow

0 references

ping pong effect

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2006.12.023

0 references

0 references

The maximum flow problem: A max-preflow approach

0 references

Implementing Goldberg's max-flow-algorithm ? A computational investigation

0 references

0 references

A new approach to the maximum-flow problem

0 references

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

0 references

0 references

On the complexity of preflow-push algorithms for maximum-flow problems

0 references

An analysis of the highest-level selection rule in the preflow-push max-flow algorithm

0 references

An auction algorithm for the max-flow problem

0 references

0 references

0 references

On implementing the push-relabel method for the maximum flow problem

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.COR.2006.12.023

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2471239

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2471239&oldid=39105604"