Which matrices are immune against the transportation paradox?

DOI10.1016/S0166-218X(03)00327-5zbMath1033.90008OpenAlexW2111871591MaRDI QIDQ1408459

Bettina Klinz, Gerhard J. Woeginger, Vladimir G. Deǐneko

Publication date: 22 September 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00327-5

zbMATH Keywords

Combinatorial optimizationTransportation problemAlgebraic transportation problemMore-for-less paradoxTransportation paradox

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (1)

Two classical transportation problems revisited: pure constant fixed charges and the paradox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear and combinatorial optimization in ordered algebraic structures
• A general Hungarian method for the algebraic transportation problem
• Minimizing Overshipments In Bottleneck Transportation Problems
• Weakly admissible transformations for solving algebraic assignment and transportation problems
• The transportation paradox
• The Transportation Problem and its Variants

This page was built for publication: Which matrices are immune against the transportation paradox?