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

Problem difficulty of real instances of convoy planning

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

DOI10.1057/PALGRAVE.JORS.2601863zbMath1084.90541OpenAlexW2083173637MaRDI QIDQ5318353

Andrew L. Tuson, S. A. Harrison

Publication date: 26 September 2005

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.2601863


zbMATH Keywords

heuristicsmilitaryconvoys


Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)


Related Items (1)

Computational complexity of convoy movement planning problems







This page was built for publication: Problem difficulty of real instances of convoy planning

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