Which matrices are immune against the transportation paradox

Vladimir G. Deineko; Bettina Klinz; Gerhard Woeginger

doi:10.1016/S0166-218X(03)00327-5

Which matrices are immune against the transportation paradox

Vladimir G. Deineko, Bettina Klinz, Gerhard Woeginger

Discrete Mathematics and Mathematical Programming

Research output: Contribution to journal › Article › Academic › peer-review

10 Citations (Scopus)

108 Downloads (Pure)

Abstract

We characterize the m×n cost matrices of the transportation problem for which there exist supplies and demands such that the transportation paradox arises. Our characterization is fairly simple and can be verified within O(mn) computational steps. Moreover, we discuss the corresponding question for the algebraic transportation problem.

Original language	English
Pages (from-to)	495-501
Number of pages	7
Journal	Discrete applied mathematics
Volume	130
Issue number	3
DOIs	https://doi.org/10.1016/S0166-218X(03)00327-5
Publication status	Published - 2003

Keywords

Algebraic transportation problem
Combinatorial optimization
More-for-less paradox
Transportation problem
Transportation paradox

Access to Document

10.1016/S0166-218X(03)00327-5Licence: Other

Deineko03whichFinal published version, 130 KBLicence: Other

Cite this

@article{25f61da0caa64a7f8e25159aaff5f7c3,

title = "Which matrices are immune against the transportation paradox",

abstract = "We characterize the m×n cost matrices of the transportation problem for which there exist supplies and demands such that the transportation paradox arises. Our characterization is fairly simple and can be verified within O(mn) computational steps. Moreover, we discuss the corresponding question for the algebraic transportation problem.",

keywords = "Algebraic transportation problem, Combinatorial optimization, More-for-less paradox, Transportation problem, Transportation paradox",

author = "Deineko, {Vladimir G.} and Bettina Klinz and Gerhard Woeginger",

year = "2003",

doi = "10.1016/S0166-218X(03)00327-5",

language = "English",

volume = "130",

pages = "495--501",

journal = "Discrete applied mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - Which matrices are immune against the transportation paradox

AU - Deineko, Vladimir G.

AU - Klinz, Bettina

AU - Woeginger, Gerhard

PY - 2003

Y1 - 2003

N2 - We characterize the m×n cost matrices of the transportation problem for which there exist supplies and demands such that the transportation paradox arises. Our characterization is fairly simple and can be verified within O(mn) computational steps. Moreover, we discuss the corresponding question for the algebraic transportation problem.

AB - We characterize the m×n cost matrices of the transportation problem for which there exist supplies and demands such that the transportation paradox arises. Our characterization is fairly simple and can be verified within O(mn) computational steps. Moreover, we discuss the corresponding question for the algebraic transportation problem.

KW - Algebraic transportation problem

KW - Combinatorial optimization

KW - More-for-less paradox

KW - Transportation problem

KW - Transportation paradox

U2 - 10.1016/S0166-218X(03)00327-5

DO - 10.1016/S0166-218X(03)00327-5

M3 - Article

SN - 0166-218X

VL - 130

SP - 495

EP - 501

JO - Discrete applied mathematics

JF - Discrete applied mathematics

IS - 3

ER -