The bottleneck generalized assignment problem
From MaRDI portal
Recommendations
- An algorithm for the bottleneck generalized assignment problem
- Solving the generalized assignment problem: an optimizing and heuristic approach
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- The generalized assignment problem
- A survey of algorithms for the generalized assignment problem
Cites work
- scientific article; zbMATH DE number 3743004 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A New Algorithm for the 0-1 Knapsack Problem
- A branch and bound algorithm for solving the multiple-choice knapsack problem
- A branch and bound algorithm for the generalized assignment problem
- A computational study of a multiple-choice knapsack algorithm
- A new Lagrangian relaxation approach to the generalized assignment problem
- Algorithm for the solution of the bottleneck assignment problem
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results
- An Algorithm for Large Zero-One Knapsack Problems
- An Analysis of Private and Public Sector Location Models
- An algorithm for the solution of the 0-1 knapsack problem
- 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
- Lexicographic bottleneck problems
- Modeling Facility Location Problems as Generalized Assignment Problems
- Solving linear bottleneck assignment problems via strong spanning trees
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
Cited in
(22)- The generalized assignment problem with minimum quantities
- scientific article; zbMATH DE number 3918100 (Why is no real title available?)
- scientific article; zbMATH DE number 2239572 (Why is no real title available?)
- A note on exact algorithms for the bottleneck generalized assignment problem
- Exact solutions to a class of stochastic generalized assignment problems
- The Multicommodity Multilevel Bottleneck Assignment Problem
- Assignment problems: a golden anniversary survey
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
- The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach
- scientific article; zbMATH DE number 5524189 (Why is no real title available?)
- Solution methods and computational investigations for the linear bottleneck assignment problem
- Trapezoidal matrices and the bottleneck assignment problem
- Bottleneck assignment problems under categorization
- A Survey of the Generalized Assignment Problem and Its Applications
- An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
- Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
- An algorithm for the bottleneck generalized assignment problem
- Fair task allocation problem
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function
- A robust optimization solution to bottleneck generalized assignment problem under uncertainty
- Competitive strategies for an online generalized assignment problem with a service consecution constraint
This page was built for publication: The bottleneck generalized assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388853)
