A transportation problem with a permuted demand vector

MaRDI QIDQ1806273zbMATH OpenFDO

Authors Steffen G. Meusel, Rainer E. Burkard

Publication date 1 November 1999

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

computational complexityMonge propertysolution procedures

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• A note on the complexity of the transportation problem with a permutable demand vector
• scientific article; zbMATH DE number 232274
• Multiparametric demand transportation problem
• Transportation problem with multi-choice cost and demand and stochastic supply
• A Vehicle Routing Problem with Stochastic Demand
• scientific article; zbMATH DE number 1404429
• Transportation problems with two sided constraints on supplies and demands
• A Stochastic Transportation Problem
• scientific article; zbMATH DE number 3202921
• A dual-matrix approach to the transportation problem

Cited in

(4)

• Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems
• An inapproximability of transshipment problems with permutable transit vectors
• Some good characterization results relating to the Kőnig-Egerváry theorem
• Transportation problems on permutations: properties of estimates in the branch and bound method

This page was built for publication: A transportation problem with a permuted demand vector

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806273)