Models for the single-vehicle preemptive pickup and delivery problem
type: Item
instance of: scholarly article
title: Models for the single-vehicle preemptive pickup and delivery problem
zbMATH Open document ID: 1242.90196
author: Hervé L. M. Kerivin
author: Mathieu Lacroix
author: A. R. Mahjoub
published in: Journal of Combinatorial Optimization
publication date: 2012-05-23T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6038102
zbMATH Keywords: pickup and delivery
zbMATH Keywords: reloads
zbMATH Keywords: minimal representations
zbMATH Keywords: complexity
zbMATH Keywords: integer linear programs
zbMATH Keywords: separation problems
zbMATH Keywords: preemptive stacker crane problem
describes a project that uses: CPLEX
describes a project that uses: TSPLIB
describes a project that uses: Boost
describes a project that uses: BGL
describes a project that uses: Rudy
MaRDI profile type: Publication
full work available at URL: s10878-010-9349-z
OpenAlex ID: W2101910194
cites work: The preemptive swapping problem on a tree
cites work: Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
cites work: Preemptive Ensemble Motion Planning on a Tree
cites work: Planning models for long-haul operations of postal and express shipment companies
cites work: On the complexity of the Eulerian closed walk with precedence path constraints problem
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Perturbation heuristics for the pickup and delivery traveling salesman problem
cites work: The General Pickup and Delivery Problem
cites work: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
cites work: NP-completeness of some edge-disjoint paths problems
DOI: 10.1007/S10878-010-9349-Z
description: scientific article; zbMATH DE number 6038102