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 条
  • [31] Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration
    Fuhito Kojima
    M. Utku Ünver
    [J]. International Journal of Game Theory, 2008, 36 : 473 - 488
  • [32] On the scalability of many-to-many reliable multicast sessions
    Yoon, WY
    Lee, D
    Youn, HY
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2004, 16 (13): : 1353 - 1363
  • [33] Remote intelligence enables many-to-many solutions
    Condon, Michael
    [J]. Control Engineering, 2022, 69 (10)
  • [34] Many-to-Many Superpixel Matching for Robust Tracking
    Wang, Junqiu
    Yagi, Yasushi
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2014, 44 (07) : 1237 - 1248
  • [35] Tractable Model of Dynamic Many-to-Many Matching
    Peski, Marcin
    [J]. AMERICAN ECONOMIC JOURNAL-MICROECONOMICS, 2022, 14 (02) : 1 - 43
  • [36] SMART: A many-to-many multicast protocol for ATM
    Gauthier, E
    LeBoudec, JY
    Oechslin, P
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1997, 15 (03) : 458 - 472
  • [37] Random paths to pairwise stability in many-to-many matching problems:: a study on market equilibration
    Kojima, Fuhito
    Uenver, M. Utku
    [J]. INTERNATIONAL JOURNAL OF GAME THEORY, 2008, 36 (3-4) : 473 - 488
  • [38] Diffusion: Analysis of Many-to-Many Transactions in Bitcoin
    Eck, Dylan
    Torek, Adam
    Cutchin, Steven
    Dagher, Gaby G.
    [J]. 2021 IEEE INTERNATIONAL CONFERENCE ON BLOCKCHAIN (BLOCKCHAIN 2021), 2021, : 388 - 393
  • [39] Contract design and stability in many-to-many matching
    Hatfield, John William
    Kominers, Scott Duke
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2017, 101 : 78 - 97
  • [40] Many-to-Many Matching for Combinatorial Spectrum Trading
    Jiang, Linshan
    Cai, Haofan
    Chen, Yanjiao
    Zhang, Jin
    Li, Baochun
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2016,
12345