Approximating the multi-level bottleneck assignment problem
type: Item
instance of: scholarly article
title: Approximating the multi-level bottleneck assignment problem
zbMATH Open document ID: 1247.90172
author: Trivikram Dokka
author: Anastasia Kouvela
author: Frits C. R. Spieksma
published in: Operations Research Letters
publication date: 2012-09-18T00:00:00Z
full work available at URL: https://lirias.kuleuven.be/handle/123456789/336714
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6083704
zbMATH Keywords: bottleneck problem
zbMATH Keywords: multidimensional assignment
zbMATH Keywords: approximation
zbMATH Keywords: computational complexity
zbMATH Keywords: efficient algorithm
MaRDI profile type: Publication
OpenAlex ID: W4248190034
cites work: The Multicommodity Multilevel Bottleneck Assignment Problem
cites work: A heuristic procedure for the crew rostering problem
cites work: Scheduling with incompatible jobs
cites work: Assignment Problems
cites work: A multi-level bottleneck assignment approach to the bus drivers' rostering problem
cites work: Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum
cites work: Parameterizing by the number of numbers
cites work: Approximation Algorithms for the Assembly Line Crew Scheduling Problem
cites work: Approximation algorithms for multi-index transportation problems with decomposable costs
DOI: 10.1016/J.ORL.2012.04.003
description: scientific article; zbMATH DE number 6083704