Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems

被引：2
|
作者：
Litvinchev, I. S. [1 ]
Rangel, S. [2 ]
机构：
[1] Russian Acad Sci, Dorodnicyn Comp Ctr, Moscow 119991, Russia
[2] Sao Paulo State Univ, Sao Jose Do Rio Preto, Brazil
来源：
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS | 2008年 / 48卷 / 05期
基金：
俄罗斯基础研究基金会;
关键词：
Lagrangian bounds in optimization problems; improvement of Lagrangian bounds; generalized assignment problem;
D O I：
10.1134/S0965542508050047
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are examined. For the class of generalized assignment problems, this property of constraints is used to design a Benders algorithm for solving the modified dual problem. Numerical results are presented that compare the quality of classical and modified bounds.
引用
收藏
页码：739 / 746
页数：8
相关论文
共 50 条
  • [1] Comparison of Lagrangian bounds for one class of generalized assignment problems
    I. S. Litvinchev
    S. Rangel
    [J]. Computational Mathematics and Mathematical Physics, 2008, 48
  • [2] Lagrangian heuristic for a class of the generalized assignment problems
    Litvinchev, Igor
    Mata, Miguel
    Rangel, Socorro
    Saucedo, Jania
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2010, 60 (04) : 1115 - 1123
  • [3] Improved Lagrangian bounds and heuristics for the generalized assignment problem
    Litvinchev, I.
    Mata, M.
    Saucedo, J.
    Rangel, S.
    [J]. JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2017, 56 (05) : 803 - 809
  • [4] Improved Lagrangian bounds and heuristics for the generalized assignment problem
    I. Litvinchev
    M. Mata
    J. Saucedo
    S. Rangel
    [J]. Journal of Computer and Systems Sciences International, 2017, 56 : 803 - 809
  • [5] Studying properties of Lagrangian bounds for many-to-many assignment problems
    Litvinchev, I.
    Rangel, S.
    Mata, M.
    Saucedo, J.
    [J]. JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2009, 48 (03) : 363 - 369
  • [6] Studying properties of Lagrangian bounds for many-to-many assignment problems
    I. Litvinchev
    S. Rangel
    M. Mata
    J. Saucedo
    [J]. Journal of Computer and Systems Sciences International, 2009, 48 : 363 - 369
  • [7] SOME LOWER BOUNDS FOR A CLASS OF FREQUENCY ASSIGNMENT PROBLEMS
    GAMST, A
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 1986, 35 (01) : 8 - 14
  • [8] Greedy approaches for a class of nonlinear Generalized Assignment Problems
    Sharkey, Thomas C.
    Romeijn, H. Edwin
    [J]. DISCRETE APPLIED MATHEMATICS, 2010, 158 (05) : 559 - 572
  • [9] Exact solutions to a class of stochastic generalized assignment problems
    Albareda-Sambola, Maria
    van der Vlerk, Maarten H.
    Fernandez, Elena
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 173 (02) : 465 - 487
  • [10] A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
    Poore, AB
    Robertson, AJ
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1997, 8 (02) : 129 - 150
12345