A note on exact algorithms for the bottleneck generalized assignment problem
From MaRDI portal
Recommendations
- An algorithm for the bottleneck generalized assignment problem
- The bottleneck generalized assignment problem
- An approximation algorithm for the generalized assignment problem
- A note on the complexity of the bilevel bottleneck assignment problem
- An efficient approximation for the generalized assignment problem
- An efficient algorithm for a class of generalized assignment problem
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- Approximating the multi-level bottleneck assignment problem
- Approximating the multi-level bottleneck assignment problem
- A survey of algorithms for the generalized assignment problem
Cites work
Cited in
(6)- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
- scientific article; zbMATH DE number 5524189 (Why is no real title available?)
- A Survey of the Generalized Assignment Problem and Its Applications
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- Fair task allocation problem
- A conditional logic approach for strengthening mixed 0-1 linear programs
This page was built for publication: A note on exact algorithms for the bottleneck generalized assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388862)