Pages that link to "Item:Q918416"

The following pages link to The auction algorithm for the transportation problem (Q918416):

Displaying 18 items.

• Distributed optimization of P2P live streaming overlays (Q455928) (← links)
• Wasserstein distances in the analysis of time series and dynamical systems (Q617532) (← links)
• New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599) (← links)
• A generic auction algorithm for the minimum cost network flow problem (Q1315446) (← links)
• Auction dynamics: a volume constrained MBO scheme (Q1700735) (← links)
• Dual bounds of a service level assignment problem with applications to efficient pricing (Q1754037) (← links)
• A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (Q1814992) (← links)
• A review of the use of optimal transport distances for high resolution seismic imaging based on the full waveform (Q2094840) (← links)
• Applications of optimal transportation in the natural sciences. Abstracts from the workshop held February 21--27, 2021 (online meeting) (Q2131203) (← links)
• The nested Sinkhorn divergence to learn the nested distance (Q2155219) (← links)
• A fast approach to optimal transport: the back-and-forth method (Q2209529) (← links)
• Scaling algorithms for unbalanced optimal transport problems (Q3177709) (← links)
• Geometry Helps to Compare Persistence Diagrams (Q4577947) (← links)
• Max-Plus Algebraic Statistical Leverage Scores (Q4598335) (← links)
• Empirical Regularized Optimal Transport: Statistical Theory and Applications (Q5027034) (← links)
• Approximation of optimal transport problems with marginal moments constraints (Q5145096) (← links)
• A graph space optimal transport distance as a generalization of <i>L</i> ^<i>p</i> distances: application to a seis (Q5228010) (← links)
• Limit distributions and sensitivity analysis for empirical entropic optimal transport on countable spaces (Q6126806) (← links)