Capacity Scaling Algorithms

Capacity Scaling Algorithms is a network flow algorithm that belongs to the class of scaling methods, distinguished by its strategy of progressively refining flow assignments based on successively smaller capacity thresholds to efficiently solve maximum flow problems.

41

Publications

1.9K

Citations

100

Authors

72

Institutions

Publications per year

2017–2026

7

Authors

100

  1. JB
    James B. Orlin

    Massachusetts Institute of Technology, United States

    5 publications · 293 citations

    5

    h-index

  2. SI
    Satoru Iwata

    The University of Tokyo, Japan

    3 publications · 71 citations

    3

    h-index

  3. RK
    Ravindra K. Ahuja

    University of Florida, United States

    3 publications · 215 citations

    3

    h-index

  4. MM
    Marco Mellia

    Politecnico di Torino, Italy

    2 publications · 61 citations

    2

    h-index

  5. AL
    Alfio Lombardo

    University of Catania, Italy

    2 publications · 61 citations

    2

    h-index

1–5 of 100

Venues

  1. Mathematical Programming

    4 publications · 85 citations

    4

    h-index

  2. IEEE Transactions on Information Theory

    3 publications · 140 citations

    3

    h-index

  3. IEEE Transactions on Communications

    2 publications · 142 citations

    2

    h-index

  4. Performance Evaluation

    2 publications · 35 citations

    2

    h-index

  5. Journal of Power Sources

    1 publications · 121 citations

    1

    h-index

1–5