Lagrangean Relaxation Applied to Capacitated Facility Location Problems
暂无分享,去创建一个
[1] Alfred A. Kuehn,et al. A Heuristic Program for Locating Warehouses , 1963 .
[2] P. S. Davis,et al. A branch‐bound algorithm for the capacitated facilities location problem , 1969 .
[3] P. Gray,et al. Solving Fixed Charge Location-Allocation Problems with Capacity and Configuration Constraints , 1971 .
[4] John A. Tomlin,et al. Technical Note - An Improved Branch-and-Bound Method for Integer Programming , 1971, Oper. Res..
[5] John J. H. Forrest,et al. Practical Solution of Large Mixed Integer Programming Problems with Umpire , 1974 .
[6] J. Shapiro. A Survey of Lagrangian Techniques for Discrete Optimization. , 1979 .
[7] Harvey M. Salkin,et al. Integer Programming , 2019, Engineering Optimization Theory and Practice.