Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Analysis of algorithms for an online version of the convoy movement problem

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

DOI10.1057/palgrave.jors.2602612zbMath1196.90024OpenAlexW2072551148MaRDI QIDQ3161778

No author found.

Publication date: 18 October 2010

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602612


zbMATH Keywords

online algorithmscompetitive ratioconvoy movement problem


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)


Related Items (1)

Computational complexity of convoy movement planning problems




This page was built for publication: Analysis of algorithms for an online version of the convoy movement problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3161778&oldid=16423761"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 4 February 2024, at 06:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki