Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach

DOI10.1016/0377-2217(93)90011-BMaRDI QIDQ684336zbMATH OpenOpenAlexFDO

Authors Kurt Jörnsten, Peter Värbrand, Asa Hallefjord

Publication date 15 September 1993

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(93)90011-b

zbMATH Keywords

disaggregationaggregationcluster analysislarge scale generalized assignment

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Boolean programming (90C09) Discrete location and assignment (90B80)

Recommendations

• Solving large-scale linear programs by aggregation
• Solving the generalized assignment problem: an optimizing and heuristic approach
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• Effective algorithm and heuristic for the generalized assignment problem.
• Aggregation in the generalized transportation problem

Cites work

• scientific article; zbMATH DE number 3678973 (Why is no real title available?)
• scientific article; zbMATH DE number 3581927 (Why is no real title available?)
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• A new Lagrangian relaxation approach to the generalized assignment problem
• Aggregation and Disaggregation in Integer Programming Problems
• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
• An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
• Bounds on the Effect of Aggregating Variables in Linear Programs
• Computing bounds for the optimal value in linear programming
• Modeling Facility Location Problems as Generalized Assignment Problems
• Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• Technical Note—Improved Bounds for Aggregated Linear Programs

Cited in

(5)

• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Maximal covering code multiplexing access telecommunication networks
• A Survey of the Generalized Assignment Problem and Its Applications
• Using error bounds to compare aggregated generalized transportation models
• A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS

This page was built for publication: Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q684336)