论文信息 - The return plant location problem: Modelling and resolution - 字舞流文

The return plant location problem: Modelling and resolution

B. Pelegrín | Alfredo Marín

[1] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..

[2] B. M. Khumawala,et al. An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem , 1977 .

[3] Hanif D. Sherali,et al. Linear Programming and Network Flows , 1977 .

[4] J. Krarup,et al. The simple plant location problem: Survey and synthesis , 1983 .

[5] Monique Guignard-Spielberg,et al. Lagrangean decomposition: A model yielding stronger lagrangean bounds , 1987, Math. Program..

[6] M. Guignard,et al. Lagrangean decomposition for integer programming: theory and applications , 1987 .

[7] M. Rosenwein,et al. An application-oriented guide for designing Lagrangean dual ascent algorithms , 1989 .

[8] Kurt Jörnsten,et al. Improved Lagrangean decomposition: An application to the generalized assignment problem , 1990 .

[9] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[10] Monique Guignard-Spielberg,et al. An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem , 1990, Networks.

[11] K. Jörnsten,et al. Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem , 1991 .

[12] B. Pelegrín,et al. Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta , 1992 .