Pages that link to "Item:Q2067496"
From MaRDI portal
The following pages link to Hardness results for multimarginal optimal transport problems (Q2067496):
Displaying 13 items.
- The complexity of computing the Muirhead-Dalton distance (Q1013525) (← links)
- Gaussian discrepancy: a probabilistic relaxation of vector balancing (Q2081474) (← links)
- Wasserstein Barycenters Are NP-Hard to Compute (Q5065469) (← links)
- Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems (Q5084524) (← links)
- On the Hardness of Energy Minimisation for Crystal Structure Prediction* (Q5862342) (← links)
- Optimal transportation, modelling and numerical simulation (Q5887829) (← links)
- Polynomial-time algorithms for multimarginal optimal transport problems with structure (Q6038667) (← links)
- A family of pairwise multi-marginal optimal transports that define a generalized metric (Q6097155) (← links)
- Discrete Optimal Transport with Independent Marginals is #P-Hard (Q6155882) (← links)
- Unbalanced multi-marginal optimal transport (Q6156383) (← links)
- Efficient and exact multimarginal optimal transport with pairwise costs (Q6571369) (← links)
- An external dual charge approach to the multimarginal optimal transport with Coulomb cost (Q6612248) (← links)
- Convergence proof for the GenCol algorithm in the case of two-marginal optimal transport (Q6622390) (← links)