Convoy movement problem: a civilian perspective

This publication has 16 references indexed in Scilit:

• Comprehensive Study on Computational Methods for K-Shortest Paths Problem
  International Journal of Computer Applications, 2012
• On the usage of Lagrangean Relaxation for the convoy movement problem
  Journal of the Operational Research Society, 2011
• On the formulation and solution of the convoy routing problem
  Transportation Research Part E: Logistics and Transportation Review, 2010
• Analysis of algorithms for an online version of the convoy movement problem
  Journal of the Operational Research Society, 2009
• Efficient algorithms for clique problems
  Information Processing Letters, 2009
• A generic view of Dantzig–Wolfe decomposition in mixed integer programming
  Operations Research Letters, 2006
• Problem difficulty of real instances of convoy planning
  Journal of the Operational Research Society, 2005
• Finding all k-cliques in k-partite graphs, an application in textile engineering
  Computers & Operations Research, 2002
• Finding the k Shortest Paths
  SIAM Journal on Computing, 1998
• A convoy scheduling problem
  Discrete Applied Mathematics, 1991