A new algorithm for solving the feasibility problem of a network flow (Q990544): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2007.03.038 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050503419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Time Bounds for the Maximum Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for computing a most positive cut using the minimum flow algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond the flow decomposition barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Deterministic Maximum Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing maximum mean cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online load balancing and network flow / rank
 
Normal rank

Latest revision as of 03:04, 3 July 2024

scientific article
Language Label Description Also known as
English
A new algorithm for solving the feasibility problem of a network flow
scientific article

    Statements

    A new algorithm for solving the feasibility problem of a network flow (English)
    0 references
    0 references
    1 September 2010
    0 references
    operation research
    0 references
    network flow
    0 references
    infeasible network
    0 references
    scaling algorithm
    0 references
    positive cut
    0 references

    Identifiers