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

DOI10.1007/BF02240182zbMATH Open0546.90064OpenAlexW53740398MaRDI QIDQ798564FDOQ798564

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

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

Cites Work

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

Cited In (9)

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

This page was built for publication: Alternate strategies for solving bottleneck assignment problems - analysis and computational results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798564)