A discrete mass transportation problem for infinitely many sites, and general representant systems for infinite families

DOI10.1007/S001860300285MaRDI QIDQ1423710zbMATH OpenOpenAlexFDO

Authors Iosif Pinelis

Publication date 7 March 2004

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s001860300285

zbMATH Keywords

Discrete mass transportationGeneral representant systemsHall's theorem

Mathematics Subject Classification ID

Transversal (matching) theory (05D15) Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• Discrete infinite transportation problems
• scientific article; zbMATH DE number 903398
• Hyperfinite Transversal Theory
• Semi-infinite transportation problems
• Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications

Cited in

(1)

• Nonnegative sum-symmetric matrices and optimal-score partitions

This page was built for publication: A discrete mass transportation problem for infinitely many sites, and general representant systems for infinite families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1423710)