Pages that link to "Item:Q4012426"
From MaRDI portal
The following pages link to An Auction Algorithm for Shortest Paths (Q4012426):
Displaying 17 items.
- Group preference modeling for intelligent shared environments: social welfare beyond the sum (Q506766) (← links)
- Complexity analysis and optimization of the shortest path tour problem (Q691420) (← links)
- The auction algorithm for the transportation problem (Q918416) (← links)
- An extension of labeling techniques for finding shortest path trees (Q1027584) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- A generic auction algorithm for the minimum cost network flow problem (Q1315446) (← links)
- Efficient parallel algorithms for the minimum cost flow problem (Q1379929) (← links)
- Dual bounds of a service level assignment problem with applications to efficient pricing (Q1754037) (← links)
- Polynomial auction algorithms for shortest paths (Q1804574) (← links)
- An auction algorithm for the max-flow problem (Q1906750) (← links)
- The assignment problem revisited (Q2136890) (← links)
- The stochastic shortest path problem: a polyhedral combinatorics perspective (Q2183321) (← links)
- An auction-based approach for the re-optimization shortest path tree problem (Q2282822) (← links)
- Shortest path reoptimization vs resolution from scratch: a computational comparison (Q5043855) (← links)
- On Some Special Network Flow Problems: The Shortest Path Tour Problems (Q5326892) (← links)
- A mechanism design approach for multi-party machine learning (Q6549677) (← links)
- Projection methods for finding the greatest element of the intersection of max-closed convex sets (Q6638853) (← links)
