IMPROVED LAGRANGEAN DECOMPOSITION - AN APPLICATION TO THE GENERALIZED ASSIGNMENT PROBLEM

被引：20

作者：

BARCIA, P ^{[1
]}

JORNSTEN, K ^{[1
]}

机构：

[1] NORWEGIAN SCH ECON & BUSINESS ADM, BERGEN, NORWAY

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1990年 / 46卷 / 01期

关键词：

assignment; Integer programming; Lagrange multipliers;

D O I：

10.1016/0377-2217(90)90300-Z

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Recently two new ways of obtaining improved Lagrangean bounds have been suggested: Lagrangean decomposition and bound improving sequences. In this work we will obtain a Lagrangean approach combining the two ideas mentioned above. Theoretical results are provided about the sharpness of the bounds obtained by the combined approach for the general case as well as an application to the generalized assignment problem. Computational experience is reported. © 1990.

引用

页码：84 / 92

页数：9

共 17 条

[11]

Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223

[12] A NEW LAGRANGIAN-RELAXATION APPROACH TO THE GENERALIZED ASSIGNMENT PROBLEM [J].

JORNSTEN, K ;

NASBERG, M .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 27 (03) :313-323

[13]

JORNSTEN KO, 1985, LITHMATR8504 LINK U

[14]

MARSTEN R, 1985, USERS MANUAL ZOOM XM

[15]

Martello S., 1981, Operational Research '81. Proceedings of the Ninth IFORS International Conference, P589

[16]

MINOUX M, 1987, MATH PROGRAMMING

[17]

Ribeiro C., 1986, Methods of Operations Research, V53, P303

← 1 2 →