Pages that link to "Item:Q1342646"
From MaRDI portal
The following pages link to Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations (Q1342646):
Displaying 6 items.
- The partitioned \(\varepsilon\)-relaxation algorithm for separable convex network flow problems (Q1294809) (← links)
- Parallel primal-dual methods for the minimum cost flow problem (Q1315451) (← links)
- Data parallel computing for network-structured optimization problems (Q1328430) (← links)
- Efficient parallel algorithms for the minimum cost flow problem (Q1379929) (← links)
- A parallel asynchronous implementation of the \(\epsilon\)-relaxation method for the linear minimum cost flow problem (Q1391202) (← links)
- Parallel algorithms for solving the convex minimum cost flow problem (Q5931039) (← links)