z-logo
open-access-imgOpen Access
Semi-Infinite Transportation Problems
Author(s) -
H. Voigt
Publication year - 1998
Publication title -
zeitschrift für analysis und ihre anwendungen
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.567
H-Index - 35
eISSN - 1661-4534
pISSN - 0232-2064
DOI - 10.4171/zaa/847
Subject(s) - transport engineering , computer science , engineering
An old set partitioning problem is treated as a special case of the KantorovkMonge transportation problem. This problem is then related to Klötzler's transportation flow problems which allow the consideration of a local cost rate, instead of the constant cost rate in the Kantorovk-Monge problem. Three possibilities for the ; numerical solution of the problem are discussed and briefly compared.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom