On one polynomially solvable case of the decentralized transportation problem

MaRDI QIDQ3115246zbMATH OpenFDO

Authors V. T. Dement'ev, Yuriy V. Shamardin

Publication date 20 February 2012

zbMATH Keywords

dynamic programmingdecentralized transportation problem

Mathematics Subject Classification ID

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

Recommendations

• On polynomial solvability of the decentralized transportation problem with block matrices of profits of customers
• On a decentralized transportation problem
• scientific article; zbMATH DE number 706867
• Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
• A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time

Cited in

(4)

• On a decentralized transportation problem
• On polynomial solvability of the decentralized transportation problem with block matrices of profits of customers
• A polynomial time algorithm for unloading boxes off a gravity conveyor
• Bilevel optimization: theory, algorithms, applications and a bibliography

This page was built for publication: On one polynomially solvable case of the decentralized transportation problem

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