Skip to main content
SpringerLink
Log in

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

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

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

Search

Navigation