A note on the complexity of the transportation problem with a permutable demand vector
From MaRDI portal
Publication:1806274
zbMath0967.90081MaRDI QIDQ1806274
Bettina Klinz, Mihály Hujter, Gerhard J. Woeginger
Publication date: 3 September 2001
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
computational complexitytransportation problemminimum weight \(f\)-factor problempermutable demand vector
Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (1)
This page was built for publication: A note on the complexity of the transportation problem with a permutable demand vector
