The bottleneck generalized assignment problem
From MaRDI portal
Publication:1388853
DOI10.1016/0377-2217(93)E0271-XzbMath0899.90130MaRDI QIDQ1388853
Publication date: 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
heuristicsbranch-and-boundrelaxationapproximate algorithmsgeneralized assignmentmultiple-choice knapsack
Related Items
Assignment problems: a golden anniversary survey, Exact and approximation algorithms for makespan minimization on unrelated parallel machines, A note on exact algorithms for the bottleneck generalized assignment problem, A robust optimization solution to bottleneck generalized assignment problem under uncertainty, A Survey of the Generalized Assignment Problem and Its Applications, The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach, An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function, Fair task allocation problem, 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, Competitive strategies for an online generalized assignment problem with a service consecution constraint
Cites Work
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm for solving the multiple-choice knapsack problem
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results
- A new Lagrangian relaxation approach to the generalized assignment problem
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Algorithm for the solution of the bottleneck assignment problem
- An algorithm for the solution of the 0-1 knapsack problem
- Lexicographic bottleneck problems
- Solving linear bottleneck assignment problems via strong spanning trees
- An augmenting path method for solving linear bottleneck assignment problems
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A computational study of a multiple-choice knapsack algorithm
- A New Algorithm for the 0-1 Knapsack Problem
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- An Algorithm for Large Zero-One Knapsack Problems
- A branch and bound algorithm for the generalized assignment problem
- Modeling Facility Location Problems as Generalized Assignment Problems
- An Analysis of Private and Public Sector Location Models
