Studying properties of Lagrangian bounds for many-to-many assignment problems

被引：2
|
作者：
Litvinchev, I. [1 ]
Rangel, S. [1 ]
Mata, M. [1 ]
Saucedo, J. [1 ]
机构：
[1] Nuevo Leon State Univ, Sao Paulo State Univ, Russian Acad Sci, Ctr Comp, Monterrey, Nuevo Leon, Mexico
来源：
JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL | 2009年 / 48卷 / 03期
关键词：
RELAXATION; HEURISTICS;
D O I：
10.1134/S1064230709030046
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are studied. For the class of many-to-many assignment problems, this property of constraints is used to design a subgradient algorithm for solving the modified dual problem. Numerical results are presented to compare the quality of classical and modified bounds, as well as the properties of the corresponding Lagrangian solutions.
引用
收藏
页码：363 / 369
页数：7
相关论文
共 50 条
  • [1] 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
  • [2] A Lagrangian bound for many-to-many assignment problems
    Litvinchev, Igor
    Rangel, Socorro
    Saucedo, Jania
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2010, 19 (03) : 241 - 257
  • [3] A Lagrangian bound for many-to-many assignment problems
    Igor Litvinchev
    Socorro Rangel
    Jania Saucedo
    [J]. Journal of Combinatorial Optimization, 2010, 19 : 241 - 257
  • [4] Pareto optimality in many-to-many matching problems
    Cechlarova, Katarina
    Eirinakis, Pavlos
    Fleiner, Tamas
    Magos, Dimitrios
    Mourtos, Ioannis
    Potpinkova, Eva
    [J]. DISCRETE OPTIMIZATION, 2014, 14 : 160 - 169
  • [5] A Gradient-Based Interior-Point Method to Solve the Many-to-Many Assignment Problems
    Das, Nitish
    Priya, P. Aruna
    [J]. COMPLEXITY, 2019, 2019
  • [6] Credible group stability in many-to-many matching problems
    Konishi, Hideo
    Unver, M. Utku
    [J]. JOURNAL OF ECONOMIC THEORY, 2006, 129 (01) : 57 - 80
  • [7] Dynamic user optimal assignment with physical queues for a many-to-many OD pattern
    Kuwahara, M
    Akamatsu, T
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2001, 35 (05) : 461 - 479
  • [8] IMPERFECT MANY-TO-MANY TELEPORTATION
    Ghiu, Iulia
    Isdraila, Tudor
    Suciu, Serban
    [J]. ROMANIAN JOURNAL OF PHYSICS, 2012, 57 (3-4): : 564 - 570
  • [9] Many-To-Many Innovation Contexts
    D'Auria, Anna
    Tregua, Marco
    Spena, Tiziana Russo
    Bifulco, Francesco
    [J]. IFKAD 2015: 10TH INTERNATIONAL FORUM ON KNOWLEDGE ASSET DYNAMICS: CULTURE, INNOVATION AND ENTREPRENEURSHIP: CONNECTING THE KNOWLEDGE DOTS, 2015, : 2082 - 2093
  • [10] Many-to-Many Pair Trading
    Wang, Yingying
    Li, Xiaodong
    Wu, Pangjing
    Xie, Haoran
    [J]. WEB AND BIG DATA, PT I, APWEB-WAIM 2022, 2023, 13421 : 399 - 407
12345