An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems (Q6087567): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1002/net.22082 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Some Recent Advances in Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast and Simple Algorithm for the Maximum Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of the primal and dual simplex algorithms for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly polynomial dual simplex methods for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Suggested Computation for Maximal Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strongly polynomial dual simplex algorithms for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the history of the transportation and maximum flow problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.22082 / rank
 
Normal rank

Latest revision as of 18:19, 30 December 2024

scientific article; zbMATH DE number 7775907
Language Label Description Also known as
English
An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems
scientific article; zbMATH DE number 7775907

    Statements

    An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems (English)
    0 references
    0 references
    0 references
    0 references
    12 December 2023
    0 references
    linear programming
    0 references
    maximum flow problem
    0 references
    network optimization
    0 references
    node capacities
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references