A warehouse location-routing problem
暂无分享,去创建一个
[1] Thomas L. Magnanti,et al. Implementing vehicle routing algorithms , 1977, Networks.
[2] M. H. J. Webb,et al. Cost Functions in the Location of Depots for Multiple-Delivery Journeys , 1968 .
[3] Kurt Spielberg,et al. Direct Search Algorithms for Zero-One and Mixed-Integer Programming , 1967, Oper. Res..
[4] A. M. Geoffrion,et al. Multicommodity Distribution System Design by Benders Decomposition , 1974 .
[5] B. Gillett,et al. Multi-terminal vehicle-dispatch algorithm , 1976 .
[6] Robert M. Nauss,et al. An Improved Algorithm for the Capacitated Facility Location Problem , 1978 .
[7] D. G. Elson. Site Location via Mixed-integer Programming , 1972 .
[8] A. M. Geoffrion,et al. Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .
[9] B. M. Khumawala,et al. An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem , 1977 .
[10] T. L. Ray,et al. Warehouse Location Under Continuous Economies of Scale , 1966 .
[11] G. Laporte,et al. An exact algorithm for minimizing routing and operating costs in depot location , 1981 .
[12] Anthony Wren,et al. Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .
[13] R. H. Mole,et al. A Sequential Route-building Algorithm Employing a Generalised Savings Criterion , 1976 .
[14] Graham K. Rand,et al. Methodological Choices in Depot Location Studies , 1976 .
[15] Jossef Perl,et al. A unified warehouse location-routing analysis , 1983 .