Computational complexity of convoy movement planning problems

DOI10.1007/s00186-015-0503-3zbMath1325.90011OpenAlexW227112848MaRDI QIDQ494695

Ram Gopalan

Publication date: 2 September 2015

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-015-0503-3

zbMATH Keywords

approximation algorithmsmultiple objective programminglogisticscomplexity theoryconvoy routing

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple model of optimal clearance of improvised explosive devices
• A convoy scheduling problem
• A survey of dynamic network flows
• A tutorial on the use of graph coloring for some problems in robotics
• A reoptimization algorithm for the shortest path problem with time windows
• Efficient delay routing
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• Minimal cost linkages in graphs
• Scheduling railway traffic at a construction site
• Solving some lexicographic multi-objective combinatorial problems
• The fleet assignment problem: Solving a large scale integer program
• Multicommodity flows over time: Efficient algorithms and complexity
• A disjunctive graph model and framework for constructing new train schedules
• Survey of research in the design and control of automated guided vehicle systems
• An Introduction to Network Flows over Time
• Approximation Algorithms for Conflict-Free Vehicle Routing
• Analysis of algorithms for an online version of the convoy movement problem
• Optimal network configuration and capacity expansion of railroads
• Packet Routing: Complexity and Algorithms
• A dual algorithm for the constrained shortest path problem
• Developing Conflict-Free Routes for Automated Guided Vehicles
• Efficient strategies for transporting mobile forces
• Problem difficulty of real instances of convoy planning
• Solving a Time-Space Network Formulation for the Convoy Movement Problem
• Constructing Maximal Dynamic Flows from Static Flows
• Quickest Flows Over Time

This page was built for publication: Computational complexity of convoy movement planning problems