A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
type: Item
instance of: scholarly article
title: A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
zbMATH Open document ID: 0961.90008
DOI: 10.1016/S0377-2217(99)00235-0
author: Stefan Irnich
published in: European Journal of Operational Research
publication date: 2000-10-03T00:00:00Z
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 1512946
zbMATH Keywords: transportation
zbMATH Keywords: modeling
zbMATH Keywords: pickup and delivery
zbMATH Keywords: hub
describes a project that uses: OR-Library
MaRDI profile type: Publication
cites work: Finding maximum cliques in arbitrary and in special graphs
cites work: A branch and bound algorithm for the maximum clique problem
cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Air Network Design for Express Shipment Service
cites work: An algorithm for set covering problem
cites work: Q4735035
cites work: A genetic algorithm for the set covering problem
cites work: Enhancing an algorithm for set covering problems
cites work: On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
cites work: A heuristic algorithm for the set covering problem
cites work: A Heuristic Method for the Set Covering Problem
cites work: Routing with time windows by column generation
cites work: Q4955266
cites work: Q4955271
cites work: The pickup and delivery problem with time windows
cites work: Q4198056
cites work: Simple Lagrangian heuristic for the set covering problem
cites work: Q3993418
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
cites work: A Branch-and-Price Algorithm for the Generalized Assignment Problem
cites work: The General Pickup and Delivery Problem
cites work: DRIVE: Dynamic routing of independent vehicles
description: scientific article; zbMATH DE number 1512946