A Lagrangian bound for many-to-many assignment problems

被引：15

作者：

Litvinchev, Igor ^{[1
]}

Rangel, Socorro ^{[2
]}

Saucedo, Jania ^{[1
]}

机构：

[1] UANL, Dept Mech & Elect Engn, Monterrey, Mexico

[2] Sao Paulo State Univ UNESP, BR-15054000 Sj Do Rio Preto, Brazil

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2010年 / 19卷 / 03期

基金：

巴西圣保罗研究基金会;

关键词：

Lagrangian bounds; Integer programming; Many-to-many-assignment problem; VOLUME ALGORITHM; RELAXATION; DECOMPOSITION; HEURISTICS;

D O I：

10.1007/s10878-008-9196-3

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

A simple procedure to tighten the Lagrangian bounds is proposed. The approach is interpreted in two ways. First, it can be seen as a reformulation of the original problem aimed to split the resulting Lagrangian problem into two subproblems. Second, it can be considered as a search for a tighter estimation of the penalty term arising in the Lagrangian problem. The new bounds are illustrated by a small example and studied numerically for a class of the generalized assignment problems.

引用

页码：241 / 257

页数：17

共 50 条

[1] A Lagrangian bound for many-to-many assignment problems
Igor Litvinchev
Socorro Rangel
Jania Saucedo
[J]. Journal of Combinatorial Optimization, 2010, 19 : 241 - 257
[2] 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
[3] 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
[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

← 1 2 3 4 5 →