论文信息 - Efficient cuts in Lagrangean 'Relax-and-cut' schemes - 字舞流文

Efficient cuts in Lagrangean 'Relax-and-cut' schemes

[1] A. M. Geoffrion. Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .

[2] Richard M. Soland,et al. A branch and bound algorithm for the generalized assignment problem , 1975, Math. Program..

[3] R. Nauss,et al. Parametric integer programming , 1979 .

[4] M. Fisher,et al. A multiplier adjustment method for the generalized assignment problem , 1986 .

[5] Monique Guignard-Spielberg,et al. Technical Note - An Improved Dual Based Algorithm for the Generalized Assignment Problem , 1989, Oper. Res..

[6] Kurt Jörnsten,et al. A facet generation and relaxation technique applied to an assignment problem with side constraints , 1991 .

[7] Matteo Fischetti,et al. Facets of the Asymmetric Traveling Salesman Polytope , 1991, Math. Oper. Res..

[8] Kavindra Malik,et al. A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships , 1994, Ann. Oper. Res..