An inapproximability of transshipment problems with permutable transit vectors

DOI10.15807/JORSJ.53.220MaRDI QIDQ3006910zbMATH OpenOpenAlexFDO

Authors Kougaku Yamashita, Yoshiyuki Karuno, Mingzhe Lu

Publication date 21 June 2011

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.53.220

zbMATH Keywords

combinatorial optimizationtransportationinapproximabilitygap technique

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)

Recommendations

• A transportation problem with a permuted demand vector
• A note on the complexity of the transportation problem with a permutable demand vector
• \(N\)-fold integer programming and nonlinear multi-transshipment
• Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems
• The transportation problem with exclusionary side constraints

This page was built for publication: An inapproximability of transshipment problems with permutable transit vectors

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