Routing a vehicle of capacity greater than one
type: Item
instance of: scholarly article
title: Routing a vehicle of capacity greater than one
zbMATH Open document ID: 0895.90084
DOI: 10.1016/S0166-218X(97)00074-7
author: D. Massart
published in: Discrete Applied Mathematics
publication date: 1998-03-25T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1133150
zbMATH Keywords: vehicle routing
zbMATH Keywords: graph algorithms
zbMATH Keywords: satisfiability
zbMATH Keywords: feedback vertex set
zbMATH Keywords: limited capacity
zbMATH Keywords: motion planning
zbMATH Keywords: NP-complete
MaRDI profile type: Publication
cites work: Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
cites work: A Note on the Complexity of a Simple Transportation Problem
cites work: Preemptive Ensemble Motion Planning on a Tree
cites work: Nonpreemptive Ensemble Motion Planning on a Tree
cites work: The Complexity of Near-Optimal Graph Coloring
cites work: A priority queue in which initialization and queue operations takeO(loglogD) time
Wikidata QID: Q127474293
OpenAlex ID: W2000628435
Recommended article: Multiple Capacity Vehicle Routing on Paths
Recommended article: Vehicle Routeing with Multiple Use of Vehicles
Recommended article: Q3688099
Recommended article: Q5687192
Recommended article: Q3688098
Recommended article: Routing a Heterogeneous Fleet of Vehicles
Recommended article: Vehicle routing with full loads
Recommended article: Q3415792
Recommended article: Vehicle routing problems with multiple trips
description: scientific article; zbMATH DE number 1133150