Interior-point Methods For Flow
Interior-Point Methods for Flow is a computational optimization framework belonging to the class of interior-point algorithms, specifically designed to solve network flow problems by traversing the interior of the feasible region to efficiently converge to an optimal solution.
305
Publications
18.6K
Citations
573
Authors
287
Institutions
Publications per year
2017–2026
46
Parents
305
On the Implementation of a Primal-Dual Interior Point Method
Sanjay Mehrotra · SIAM Journal on Optimization · 1992 · 1.6K citations
Interior point methods 25 years later
Jacek Gondzio · European Journal of Operational Research · 2011 · 383 citations · Full text
1–5 of 305
573
12
h-index
7
h-index
7
h-index
6
h-index
6
h-index
1–5 of 573
287

University of Waterloo
Waterloo, Canada
18 h-index
37 publications
3.1K citations
University of Iowa
Iowa City, United States
11 h-index
17 publications
1.3K citations

Universidade Estadual de Campinas (UNICAMP)
Campinas, Brazil
9 h-index
17 publications
511 citations
Georgia Institute of Technology
Atlanta, United States
7 h-index
11 publications
1.8K citations
Stanford University
Stanford, United States
7 h-index
11 publications
359 citations
COMSATS University Islamabad
Islamabad, Pakistan
6 h-index
9 publications
679 citations
Universidade Estadual Paulista (Unesp)
São Paulo, Brazil
6 h-index
21 publications
451 citations

University of Edinburgh
Edinburgh, United Kingdom
6 h-index
9 publications
731 citations
1–8 of 287
38 publications · 5.3K citations
32
h-index
26 publications · 1.4K citations
19
h-index
16 publications · 1.3K citations
14
h-index
13 publications · 642 citations
12
h-index
11 publications · 972 citations
10
h-index
1–5