Polynomial-time algorithms for multimarginal optimal transport problems with structure (Q6038667): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Price of Correlations in Stochastic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barycenters in the Wasserstein Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results for multimarginal optimal transport problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4998935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wasserstein Barycenters Are NP-Hard to Compute / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Wasserstein barycenters: optimal transport for discrete data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with Submodular Functions: A Convex Optimization Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Network Reliability Analysis: An Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Bregman Projections for Regularized Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An entropy minimization approach to second-order variational mean-field games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Numerical Method to Solve Multi-Marginal Optimal Transport Problems with Coulomb Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized incompressible flows, multi-marginal transport and Sinkhorn algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth: Structure and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Least Action Principle and the Related Concept of Generalized Flows for Incompressible Perfect Fluids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dual least action problem for an ideal, incompressible fluid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal geodesics on groups of volume-preserving maps and generalized solutions of the Euler equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized solutions and hydrostatic approximation of the Euler equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching for teams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical methods for matching for teams and Wasserstein barycenters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributionally Robust Linear and Discrete Optimization with Marginals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density Functional Theory and Optimal Transportation with Coulomb Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Mixtures of Product Distributions over Discrete Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial approaches to Monte Carlo estimation of network lifetime distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Ferromagnetic Ising with Local Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Marginal Optimal Transport and Probabilistic Graphical Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness against dependence in PERT: An application of duality and distributions with known marginals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Decompositions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimates for the Distribution Function of a Sum of Two Random Variables When the Marginal Distributions are Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex majorization with an application to the length of critical paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable circuits using less reliable relays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic PERT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Persistency Model and Its Applications in Choice Modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Probability Bounds in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing correlated equilibria in multi-player games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random variables with maximum sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(n\)-coupling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonal Equivalence to Matrices with Prescribed Row and Column Sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convolutional wasserstein distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4558144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple min-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4805362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical Models, Exponential Families, and Variational Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Bounds on Distributions of Optimal Value Functions with Applications to PERT, Network Flows and Reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for estimating network reliability / rank
 
Normal rank

Revision as of 00:55, 1 August 2024

scientific article; zbMATH DE number 7681272
Language Label Description Also known as
English
Polynomial-time algorithms for multimarginal optimal transport problems with structure
scientific article; zbMATH DE number 7681272

    Statements

    Polynomial-time algorithms for multimarginal optimal transport problems with structure (English)
    0 references
    0 references
    0 references
    2 May 2023
    0 references
    multimarginal optimal transport
    0 references
    polynomial-time algorithms
    0 references
    implicit linear programming
    0 references
    structured linear programs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers