Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
From MaRDI portal
Publication:684336
DOI10.1016/0377-2217(93)90011-BzbMath0776.90057OpenAlexW2033920799MaRDI QIDQ684336
Kurt O. 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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Discrete location and assignment (90B80) Boolean programming (90C09)
Related Items
Maximal covering code multiplexing access telecommunication networks ⋮ Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches ⋮ Using error bounds to compare aggregated generalized transportation models ⋮ A Survey of the Generalized Assignment Problem and Its Applications
Cites Work
- Unnamed Item
- Unnamed Item
- A new Lagrangian relaxation approach to the generalized assignment problem
- Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- Bounds on the Effect of Aggregating Variables in Linear Programs
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- Technical Note—Improved Bounds for Aggregated Linear Programs
- A branch and bound algorithm for the generalized assignment problem
- An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
- Computing bounds for the optimal value in linear programming
- Modeling Facility Location Problems as Generalized Assignment Problems
- Aggregation and Disaggregation in Integer Programming Problems
