Problem difficulty of real instances of convoy planning

DOI10.1057/PALGRAVE.JORS.2601863MaRDI QIDQ5318353zbMATH OpenOpenAlexFDO

Authors Andrew L. Tuson, S. A. Harrison

Publication date 26 September 2005

Published in The 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

convoysheuristicsmilitary

Mathematics Subject Classification ID

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

Recommendations

• Computational complexity of convoy movement planning problems
• Solving a Time-Space Network Formulation for the Convoy Movement Problem
• A convoy scheduling problem
• Optimization of transportation requirements in the deployment of military units
• scientific article; zbMATH DE number 3952495

Cited in

(7)

• Analyzing and exploiting the competitiveness of scenarios for negotiating convoy formation under time constraints
• Analysis of algorithms for an online version of the convoy movement problem
• Efficient strategies for transporting mobile forces
• Computational complexity of convoy movement planning problems
• Solving a Time-Space Network Formulation for the Convoy Movement Problem
• A convoy scheduling problem
• Optimization of transportation requirements in the deployment of military units

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

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