Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

AN INAPPROXIMABILITY OF TRANSSHIPMENT PROBLEMS WITH PERMUTABLE TRANSIT VECTORS

From MaRDI portal
Publication:3006910
Jump to:navigation, search

DOI10.15807/JORSJ.53.220zbMATH Open1220.90037OpenAlexW2171020605MaRDI QIDQ3006910

Kougaku Yamashita, Mingzhe Lu, Yoshiyuki Karuno

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

transportationcombinatorial optimizationinapproximabilitygap technique


Mathematics Subject Classification ID

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








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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3006910&oldid=16027879"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 22:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki