A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks |
scientific article; zbMATH DE number 7355301
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks |
scientific article; zbMATH DE number 7355301 |
Statements
A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (English)
0 references
4 June 2021
0 references
large-scale optimization
0 references
interior-point methods
0 references
minimum cost flow problems
0 references
preconditioned conjugate gradient
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.88767356
0 references
0 references
0.88718015
0 references
0 references
0.8781462
0 references
0.8754911
0 references
0.8732019
0 references
0.8718856
0 references
