Pages that link to "Item:Q922946"
From MaRDI portal
The following pages link to Solution of large dense transportation problems using a parallel primal algorithm (Q922946):
Displaying 8 items.
- A survey of dynamic network flows (Q917417) (← links)
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem (Q1118534) (← links)
- Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations (Q1342646) (← links)
- A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem (Q1365379) (← links)
- Efficient parallel algorithms for the minimum cost flow problem (Q1379929) (← links)
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (Q1814992) (← links)
- Solution of constrained generalized transportation problems using the pivot and probe algorithm (Q1820696) (← links)
- (Q5488955) (← links)