Skip to main content
SpringerLink
Log in

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

Mathematical Methods of Operations Research volume 58, pages 105–129 (2003)Cite this article

Abstract.

A discrete mass transportation problem, studied by Kellerer, is extended to the case of infinitely many sites. An application to general representant systems is given, which generalizes M. Hall's extension of P. Hall's theorem to the case of infinite families of sets.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

39,95 €

Price includes VAT (Finland)

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Michigan Technological University, Houghton, MI, 49931, USA

    Iosif Pinelis

Authors
  1. Iosif Pinelis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Iosif Pinelis.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Pinelis, I. A discrete mass transportation problem for infinitely many sites, and general representant systems for infinite families. Math Meth Oper Res 58, 105–129 (2003). https://doi.org/10.1007/s001860300285

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001860300285

Key words

  • Discrete mass transportation
  • General representant systems
  • Hall's theorem

Search

Navigation