State space relaxation for set covering problems related to bus driver scheduling
type: Item
instance of: scholarly article
title: State space relaxation for set covering problems related to bus driver scheduling
zbMATH Open document ID: 0799.90061
DOI: 10.1016/0377-2217(93)90056-S
author: V. Pereyra
published in: European Journal of Operational Research
publication date: 1994-11-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 562572
zbMATH Keywords: lower bound technique
zbMATH Keywords: state space relaxation
zbMATH Keywords: crew scheduling
zbMATH Keywords: set covering
zbMATH Keywords: bus driver scheduling
MaRDI profile type: Publication
cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
cites work: An algorithm for set covering problem
cites work: Algorithms for large scale set covering problems
cites work: State-space relaxation procedures for the computation of bounds to routing problems
cites work: Computer-aided transit scheduling. Proceedings of the fourth international workshop on computer-aided scheduling of public transport, held in Hamburg, FRG, 28th -- 31st July 1987
cites work: A Column Generation Approach to the Urban Transit Crew Scheduling Problem
cites work: Q4178782
cites work: A Survey of Lagrangean Techniques for Discrete Optimization
cites work: Q3929365
full work available at URL: 0377-2217(93)90056-s
OpenAlex ID: W2027920449
description: scientific article; zbMATH DE number 562572