Adaptive Mean Value Cross Decomposition Algorithms for Capacitated Facility Location Problems
暂无分享,去创建一个
[1] Graciano Sá,et al. Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem , 1969, Oper. Res..
[2] B. M. Khumawala,et al. An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem , 1977 .
[3] Robert M. Nauss,et al. An Improved Algorithm for the Capacitated Facility Location Problem , 1978 .
[4] Tony J. Van Roy,et al. Cross decomposition for mixed integer programming , 1983, Math. Program..
[5] Tony J. Van Roy,et al. A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..
[6] Hanan Luss,et al. A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints , 1986 .
[7] K. Holmberg. Linear mean value cross decomposition: A generalization of the Kornai-Liptak method , 1992 .
[8] K. Holmberg. Mean value cross decomposition applied to integer programming problems , 1997 .
[9] Andreas Klose,et al. An LP-based heuristic for two-stage capacitated facility location problems , 1999, J. Oper. Res. Soc..
[10] Andreas Klose,et al. A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem , 2000, Eur. J. Oper. Res..
[11] Angel B. Ruiz,et al. Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic , 2007, Transp. Sci..