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 条
  • [11] On the properties of stable many-to-many matchings under responsive preferences
    Alkan, A
    [J]. CURRENT TRENDS IN ECONOMICS: THEORY AND APPLICATIONS, 1999, 8 : 29 - 39
  • [12] Lower bounds for nonlinear assignment problems using many body interactions
    Ramachandran, B
    Pekny, JF
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 105 (01) : 202 - 215
  • [13] Implementation in the many-to-many matching market
    Sotomayor, M
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2004, 46 (01) : 199 - 212
  • [14] SEARCH MEMORY FOR MANY-TO-MANY COMPARISONS
    DIGBY, DW
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1973, C-22 (08) : 768 - 772
  • [15] Many-to-many aggregation for sensor networks
    Silberstein, Adam
    Yang, Jun
    [J]. 2007 IEEE 23RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2007, : 961 - +
  • [16] A many-to-many 'rural hospital theorem'
    Klijn, Flip
    Yazici, Ayse
    [J]. JOURNAL OF MATHEMATICAL ECONOMICS, 2014, 54 : 63 - 73
  • [17] Many-to-many matching and price discrimination
    Gomes, Renato
    Pavan, Alessandro
    [J]. THEORETICAL ECONOMICS, 2016, 11 (03): : 1005 - 1052
  • [18] Conveyors for Streaming Many-To-Many Communication
    Maley, F. Miller
    DeVinney, Jason G.
    [J]. 2019 IEEE/ACM 9TH WORKSHOP ON IRREGULAR APPLICATIONS - ARCHITECTURES AND ALGORITHMS (IA3), 2019, : 1 - 8
  • [19] Double Auction-based Optimal Relay Assignment for Many-to-Many Cooperative Wireless Networks
    Wang, Yong
    Li, Yun
    Yang, Xiaolong
    Liao, Chao
    Chen, Quan
    [J]. 2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2012, : 1635 - 1640
  • [20] Many-to-many information flow policies
    Baldan, Paolo
    Lafuente, Alberto Lluch
    [J]. SCIENCE OF COMPUTER PROGRAMMING, 2018, 168 : 118 - 141
12345