Pages that link to "Item:Q4580079"
From MaRDI portal
The following pages link to Faster algorithms for the geometric transportation problem (Q4580079):
Displaying 14 items.
- A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs (Q685703) (← links)
- Using geometry to solve the transportation problem in the plane (Q1894300) (← links)
- Rényi 100, quantitative and qualitative (in)dependence (Q2236653) (← links)
- Optimally solving a transportation problem using Voronoi diagrams (Q2391547) (← links)
- Fast Algorithms for Geometric Traveling Salesman Problems (Q4024311) (← links)
- Fast Heuristics for Large Geometric Traveling Salesman Problems (Q4030791) (← links)
- (Q4390591) (← links)
- On Geometric Prototype and Applications (Q5009580) (← links)
- (Q5088931) (← links)
- Preconditioning for the Geometric Transportation Problem (Q5088942) (← links)
- (Q5088980) (← links)
- Light Euclidean Spanners with Steiner Points (Q5874539) (← links)
- (Q5875463) (← links)
- A data-dependent approach for high-dimensional (robust) Wasserstein alignment (Q6579774) (← links)