Algorithm for the solution of the bottleneck assignment problem

DOI10.1007/BF02243552MaRDI QIDQ1148790zbMATH OpenFDO

Authors Paolo Toth, Giorgio Carpaneto

Publication date 1981

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

exact algorithmimplementationcomputational resultsbottleneck assignment problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09)

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Algorithm for the solution of the bottleneck assignment problem
• An augmenting path method for solving linear bottleneck assignment problems

Cited in

(10)

• A priority based assignment problem
• Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
• Selected topics on assignment problems
• An alternate approach to solve two-level priority based assignment problem
• The bottleneck generalized assignment problem
• Task preference-based bottleneck assignment problem
• A priority based unbalanced time minimization assignment problem
• Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem
• An improved algorithm for two stage time minimization assignment problem
• Algorithm for the solution of the bottleneck assignment problem

Describes a project that uses

Uses Software

• Algorithm 548

This page was built for publication: Algorithm for the solution of the bottleneck assignment problem

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