On the bottleneck assignment problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3351330 (Why is no real title available?)
- scientific article; zbMATH DE number 3068569 (Why is no real title available?)
- The stepping stone method of explaining linear programming calculations in transportation problems
Cited in
(18)- A priority based assignment problem
- Assignment problems: a golden anniversary survey
- An alternate approach to solve two-level priority based assignment problem
- Max-min matching problems with multiple assignments
- On the bottleneck linear programming problem
- Bilevel time minimizing assignment problem
- A lexi-search algorithm for a time minimizing assignment problem.
- A variation of the assignment problem
- The three-dimensional bottleneck assignment problem with capacity constraints
- Bottleneck assignment problems under categorization
- Time–cost trade-off in a multi-choice assignment problem
- A variant of time minimizing assignment problem
- A generalized bottleneck assignment problem
- Tabu search and iterated local search for the cyclic bottleneck assignment problem
- A priority based unbalanced time minimization assignment problem
- The three dimensional bottleneck assignment problem and its variants
- An improved algorithm for two stage time minimization assignment problem
- Competitive strategies for an online generalized assignment problem with a service consecution constraint
This page was built for publication: On the bottleneck assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1229812)
