论文信息 - Lagrangean decomposition for integer programming: theory and applications - 字舞流文

Lagrangean decomposition for integer programming: theory and applications

On met en evidence tout l'intetet d'une methode nouvelle, la decomposition lagrangienne, et on illustre sur un cas, sa superiorite sur les relaxations classiques

M. Guignard | Siwhan Kim

[1] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[2] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

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

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

[5] Robert M. Nauss,et al. An Improved Algorithm for the Capacitated Facility Location Problem , 1978 .

[6] H. Crowder,et al. Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[7] R. E. Marsten,et al. A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem , 1980 .

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

[9] K. Jörnsten,et al. A new Lagrangian relaxation approach to the generalized assignment problem , 1986 .