Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows
type: Item
instance of: scholarly article
title: Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows
zbMATH Open document ID: 1158.90346
author: Ahmed Hadjar
author: François Soumis
published in: Computers \& Operations Research
publication date: 2009-04-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5544738
zbMATH Keywords: vehicle scheduling
zbMATH Keywords: time windows
zbMATH Keywords: column generation
zbMATH Keywords: branch and price
zbMATH Keywords: branch and bound
zbMATH Keywords: window reduction
describes a project that uses: MCF
MaRDI profile type: Publication
full work available at URL: j.cor.2008.08.010
OpenAlex ID: W1988416901
cites work: On some matching problems arising in vehicle scheduling models
cites work: Q5687193
cites work: A branch and bound algorithm for the multiple depot vehicle scheduling problem
cites work: A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
cites work: An exact algorithm for multiple depot bus scheduling
cites work: Vehicle scheduling in public transit and Lagrangean pricing
cites work: A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
cites work: A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
cites work: Q4889095
cites work: Multi-depot vehicle scheduling problems with time windows and waiting costs
cites work: A Set Partitioning Approach to the Crew Scheduling Problem
cites work: Letter to the Editor—A Method for Obtaining the Optimal Dual Solution to a Linear Program Using the Dantzig-Wolfe Decomposition
cites work: Q4955271
cites work: Q4955266
DOI: 10.1016/J.COR.2008.08.010
description: scientific article; zbMATH DE number 5544738