Pages that link to "Item:Q1315446"
From MaRDI portal
The following pages link to A generic auction algorithm for the minimum cost network flow problem (Q1315446):
Displaying 6 items.
- Uncertain minimum cost flow problem (Q894387) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- The invisible hand algorithm: solving the assignment problem with statistical physics (Q1338267) (← links)
- Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm (Q1751136) (← links)
- The boundary method for semi-discrete optimal transport partitions and Wasserstein distance computation (Q2423519) (← links)
- A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs (Q5132024) (← links)
