Computational complexity of convoy movement planning problems
type: Item
instance of: scholarly article
title: Computational complexity of convoy movement planning problems
zbMATH Open document ID: 1325.90011
author: Ram Gopalan
published in: Mathematical Methods of Operations Research
publication date: 2015-09-02T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6477554
zbMATH Keywords: complexity theory
zbMATH Keywords: logistics
zbMATH Keywords: multiple objective programming
zbMATH Keywords: convoy routing
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: s00186-015-0503-3
OpenAlex ID: W227112848
cites work: A survey of dynamic network flows
cites work: A convoy scheduling problem
cites work: Scheduling railway traffic at a construction site
cites work: A disjunctive graph model and framework for constructing new train schedules
cites work: Solving a Time-Space Network Formulation for the Convoy Movement Problem
cites work: A tutorial on the use of graph coloring for some problems in robotics
cites work: A reoptimization algorithm for the shortest path problem with time windows
cites work: Efficient delay routing
cites work: Q4471275
cites work: Quickest Flows Over Time
cites work: Constructing Maximal Dynamic Flows from Static Flows
cites work: Q4198056
cites work: Analysis of algorithms for an online version of the convoy movement problem
cites work: Multicommodity flows over time: Efficient algorithms and complexity
cites work: A dual algorithm for the constrained shortest path problem
cites work: The fleet assignment problem: Solving a large scale integer program
cites work: Minimal cost linkages in graphs
cites work: A simple model of optimal clearance of improvised explosive devices
cites work: Efficient strategies for transporting mobile forces
cites work: Developing Conflict-Free Routes for Automated Guided Vehicles
cites work: Optimal network configuration and capacity expansion of railroads
cites work: Q4739657
cites work: Problem difficulty of real instances of convoy planning
cites work: Packet Routing: Complexity and Algorithms
cites work: Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
cites work: Approximation Algorithms for Conflict-Free Vehicle Routing
cites work: An Introduction to Network Flows over Time
cites work: Survey of research in the design and control of automated guided vehicle systems
cites work: Solving some lexicographic multi-objective combinatorial problems
DOI: 10.1007/S00186-015-0503-3
description: scientific article; zbMATH DE number 6477554