An effective heuristic for large-scale capacitated facility location problems
暂无分享,去创建一个
[1] P. Camerini,et al. On improving relaxation methods by modified gradient techniques , 1975 .
[2] Rajmohan Rajaraman,et al. Analysis of a local search heuristic for facility location problems , 2000, SODA '98.
[3] Francisco Barahona,et al. The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..
[4] Matteo Fischetti,et al. Algorithms for railway crew management , 1997, Math. Program..
[5] G. Cornuéjols,et al. A comparison of heuristics and relaxations for the capacitated plant location problem , 1991 .
[6] Fabián A. Chudak,et al. Near-optimal solutions to large-scale facility location problems , 2005, Discret. Optim..
[7] Egon Balas,et al. An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..
[8] J. Beasley. An algorithm for solving large capacitated warehouse location problems , 1988 .
[9] Karen Aardal,et al. Capacitated facility location: Separation algorithms and computational experience , 1998, Math. Program..
[10] Laurence A. Wolsey,et al. Capacitated Facility Location: Valid Inequalities and Facets , 1995, Math. Oper. Res..
[11] J. Beasley. Lagrangean heuristics for location problems , 1993 .
[12] David P. Williamson,et al. Improved approximation algorithms for capacitated facility location problems , 1999, IPCO.
[13] Karen Aardal. On the Solution of One and Two-Level Capacitated Facility Location Problems by the Cutting Plane Approach , 1992 .