Mass transportation problems with capacity constraints

DOI10.1239/jap/1032374463zbMath0946.60009OpenAlexW2006133043MaRDI QIDQ4935337

Ingram Olkin, Svetlozar T. Rachev

Publication date: 17 October 2000

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1032374463

zbMATH Keywords

linear programminggreedy algorithmsmeasures of dependenceMonge-Kantorovich problemmultivariate distributionmarginal distribution

Mathematics Subject Classification ID

Probability distributions: general theory (60E05)

Related Items (8)

An iterative algorithm for two level hierarchical time minimization transportation problem ⋮ A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem ⋮ Capacitated transportation problem with bounds on rim conditions ⋮ Perspectives of Monge properties in optimization ⋮ A solution technique for capacitated two-level hierarchical time minimization transportation problem ⋮ An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions ⋮ An iterative solution technique for capacitated two-stage time minimization transportation problem ⋮ Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities

This page was built for publication: Mass transportation problems with capacity constraints