论文信息 - Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems - 字舞流文

Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems

For the simple (uncapacitated) plant location problem for which the coefficient matrix possesses certain properties, we devise a polynomially bounded algorithm by means of which an optimal solution can be derived after a single pass.

J. Krarup | Ole Bilde

[1] E. M. L. Beale,et al. Nonlinear and Dynamic Programming , 1965 .

[2] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .

[3] T. L. Ray,et al. A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..

[4] F. J. Gould,et al. Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model , 1969 .

[5] W. Zangwill. A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

[6] G. Nemhauser,et al. Integer Programming , 2020 .

[7] Manfred W. Padberg,et al. Perfect zero–one matrices , 1974, Math. Program..

[8] Kellogg S. Booth. PQ-tree algorithms. , 1975 .

[9] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[10] J. Krarup,et al. Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .