Pages that link to "Item:Q1320412"
From MaRDI portal
The following pages link to The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412):
Displaying 11 items.
- Parallel Aggregation Based on Compatible Weighted Matching for AMG (Q3297463) (← links)
- Geometry Helps to Compare Persistence Diagrams (Q4577947) (← links)
- Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning (Q4686929) (← links)
- An Algorithm for Optimal Transport between a Simplex Soup and a Point Cloud (Q4689764) (← links)
- Game of Thrones: Fully Distributed Learning for Multiplayer Bandits (Q4991671) (← links)
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems (Q5230605) (← links)
- A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements (Q5944024) (← links)
- Walrasian equilibria from an optimization perspective: A guide to the literature (Q6076488) (← links)
- Dynamic task allocation based on auction in robotic mobile fulfilment system (Q6175362) (← links)
- Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching (Q6199741) (← links)
- On the Stability of Multigraded Betti Numbers and Hilbert Functions (Q6202886) (← links)
