Semi-infinite transportation problems (Q5906277): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4171/zaa/847 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993145531 / rank | |||
Normal rank | |||
Latest revision as of 09:17, 30 July 2024
scientific article; zbMATH DE number 1211549
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-infinite transportation problems |
scientific article; zbMATH DE number 1211549 |
Statements
Semi-infinite transportation problems (English)
0 references
8 April 1999
0 references
Summary: An old set partitioning problem is treated as a special case of the Kantorovič-Monge 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 Kantorovič-Monge problem. Three possibilities for the numerical solution of the problem are discussed and briefly compared.
0 references
market area problem
0 references
set partitioning
0 references
transportation problem
0 references
transportation flow problems
0 references
