On a decentralized transportation problem

MaRDI QIDQ3115687zbMATH OpenFDO

Authors V. T. Dement'ev, Artem Pyatkin

Publication date 10 February 2012

zbMATH Keywords

algorithmic complexitybilevel programmingNP-completeness

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 one polynomially solvable case of the decentralized transportation problem
• Approximation algorithms for the transportation problem with market choice and related models
• scientific article; zbMATH DE number 4068610
• On the Complexity of the Production-Transportation Problem

Cited in

(7)

• On one polynomially solvable case of the decentralized transportation problem
• The Caterer Problem
• scientific article; zbMATH DE number 1552334 (Why is no real title available?)
• Bilevel optimization: theory, algorithms, applications and a bibliography
• On polynomial solvability of the decentralized transportation problem with block matrices of profits of customers
• A distributed transportation simplex applied to a Content Distribution Network problem
• Minimizing settlements

This page was built for publication: On a decentralized transportation problem

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