Comparison of Lagrangian bounds for one class of generalized assignment problems

2008 ◽  
Vol 48 (5) ◽  
pp. 739-746 ◽  
Author(s):  
I. S. Litvinchev ◽  
S. Rangel
Keyword(s):  
Assignment Problems ◽  
Generalized Assignment

A Determinant Elimination Method for Bottleneck Assignment and Generalized Assignment Problems

2012 ◽  
Vol 239-240 ◽  
pp. 1522-1527
Author(s):  
Wen Bo Wu ◽  
Yu Fu Jia ◽  
Hong Xing Sun
Keyword(s):  
Computational Complexity ◽  
Optimization Algorithm ◽  
Assignment Problem ◽  
Numerical Experiments ◽  
High Efficiency ◽  
Synthesis Method ◽  
Assignment Problems ◽  
Generalized Assignment ◽  
The Cost ◽  
Time And Space Complexity

The bottleneck assignment (BA) and the generalized assignment (GA) problems and their exact solutions are explored in this paper. Firstly, a determinant elimination (DE) method is proposed based on the discussion of the time and space complexity of the enumeration method for both BA and GA problems. The optimization algorithm to the pre-assignment problem is then discussed and the adjusting and transformation to the cost matrix is adopted to reduce the computational complexity of the DE method. Finally, a synthesis method for both BA and GA problems is presented. The numerical experiments are carried out and the results indicate that the proposed method is feasible and of high efficiency.

scholarly journals Lagrangian heuristic for a class of the generalized assignment problems

2010 ◽  
Vol 60 (4) ◽  
pp. 1115-1123 ◽  
Author(s):  
Igor Litvinchev ◽  
Miguel Mata ◽  
Socorro Rangel ◽  
Jania Saucedo
Keyword(s):  
Assignment Problems ◽  
Generalized Assignment ◽  
Lagrangian Heuristic

scholarly journals Greedy approaches for a class of nonlinear Generalized Assignment Problems

2010 ◽  
Vol 158 (5) ◽  
pp. 559-572 ◽  
Author(s):  
Thomas C. Sharkey ◽  
H. Edwin Romeijn
Keyword(s):  
Assignment Problems ◽  
Generalized Assignment
Sign in / Sign up

Export Citation Format

Share Document