On the bottleneck assignment problem

DOI10.1007/BF00933089zbMath0336.90056OpenAlexW1978282390MaRDI QIDQ1229812

K. Appert

Publication date: 1977

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions for minimax problems (49K35)

Related Items (18)

The three-dimensional bottleneck assignment problem with capacity constraints ⋮ Assignment problems: a golden anniversary survey ⋮ Max-min matching problems with multiple assignments ⋮ Tabu search and iterated local search for the cyclic bottleneck assignment problem ⋮ Bilevel time minimizing assignment problem ⋮ An improved algorithm for two stage time minimization assignment problem ⋮ Time–cost trade-off in a multi-choice assignment problem ⋮ A generalized bottleneck assignment problem ⋮ On the bottleneck linear programming problem ⋮ A lexi-search algorithm for a time minimizing assignment problem. ⋮ A priority based assignment problem ⋮ A priority based unbalanced time minimization assignment problem ⋮ Bottleneck assignment problems under categorization ⋮ A variant of time minimizing assignment problem ⋮ A variation of the assignment problem ⋮ The three dimensional bottleneck assignment problem and its variants ⋮ An alternate approach to solve two-level priority based assignment problem ⋮ Competitive strategies for an online generalized assignment problem with a service consecution constraint

Cites Work

• The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the bottleneck assignment problem