An algorithm for the bottleneck generalized assignment problem

DOI10.1016/0305-0548(93)90079-XzbMath0772.90064MaRDI QIDQ1260736

Joseph B. Mazzola, Alan W. Neebe

Publication date: 25 August 1993

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

generalized assignment problem; bottleneck

Mathematics Subject Classification ID

90C27: Combinatorial optimization

90B80: Discrete location and assignment

90C09: Boolean programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

On lexicographic optimal solutions in transportation problems, Bilevel time minimizing assignment problem, A note on exact algorithms for the bottleneck generalized assignment problem, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Multivariate composite distributions for coefficients in synthetic optimization problems, A polynomial algorithm for a two-stage time minimizing transportation problem., Max-min sum minimization transportation problem, CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM

Cites Work

• Unnamed Item
• Unnamed Item
• Merging groups to maximize object partition comparison
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
• Generalized Assignment with Nonlinear Capacity Interaction
• Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• Bottleneck linear programming
• An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
• The m-Center Problem: Minimax Facility Location
• Modeling Facility Location Problems as Generalized Assignment Problems
• An all Zero-One Algorithm for a Certain Class of Transportation Problems
• An Analysis of Private and Public Sector Location Models
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems
• The bottleneck transportation problem