The following pages link to (Q5743402):
Displaying 19 items.
- Reprint of: Optimally solving a transportation problem using Voronoi diagrams (Q390172) (← links)
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs (Q685703) (← links)
- Entropy based transportation problem use geometric programming method (Q849740) (← links)
- An algorithm for semi-infinite transportation problems (Q929608) (← links)
- Computational aspects of the optimal transit path problem (Q999233) (← links)
- On universally consistent and fully distribution-free rank tests of vector independence (Q2091822) (← links)
- Optimally solving a transportation problem using Voronoi diagrams (Q2391547) (← links)
- FPTAS for minimizing the earth mover's distance under rigid transformations and related problems (Q2408088) (← links)
- Topological learning for brain networks (Q2686041) (← links)
- Algorithms for the minimax transportation problem (Q3026747) (← links)
- (Q4390591) (← links)
- Geometry Helps to Compare Persistence Diagrams (Q4577947) (← links)
- On Geometric Prototype and Applications (Q5009580) (← links)
- (Q5020990) (← links)
- (Q5088931) (← links)
- Preconditioning for the Geometric Transportation Problem (Q5088942) (← links)
- (Q5088980) (← links)
- (Q5091017) (← links)
- A data-dependent approach for high-dimensional (robust) Wasserstein alignment (Q6579774) (← links)