Alternate strategies for solving bottleneck assignment problems - analysis and computational results

DOI10.1007/BF02240182zbMath0546.90064OpenAlexW53740398MaRDI QIDQ798564

Ulrich Derigs

Publication date: 1984

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02240182

zbMATH Keywords

computational resultscomputational studybottleneck assignmentcomputational behaviourhybrid procedurelabeling techniqueshortest augmenting path concepttheoretical equivalencethreshold method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Graph theory (including graph drawing) in computer science (68R10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Solution methods and computational investigations for the linear bottleneck assignment problem ⋮ The bottleneck generalized assignment problem ⋮ The random linear bottleneck assignment problem ⋮ An improved algorithm for two stage time minimization assignment problem ⋮ Selected topics on assignment problems ⋮ A priority based assignment problem ⋮ A priority based unbalanced time minimization assignment problem ⋮ An alternate approach to solve two-level priority based assignment problem ⋮ An efficient Dijkstra-like labeling method for computing shortest odd/even paths

Cites Work

• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• An augmenting path method for solving linear bottleneck assignment problems