Designing a distribution network in a supply chain system: Formulation and efficient solution procedure

European Journal of Operational Research - Tập 171 - Trang 567-576 - 2006
Ali Amiri1
1Department of MSIS, Oklahoma State University, 210 College of Business, Stillwater, OK 74078, USA

Tài liệu tham khảo

Aikens, 1985, Facility location models for distribution planning, European Journal of Operational Research, 22, 263, 10.1016/0377-2217(85)90246-2 Avella, 1998, Some personal views on the current state and the future of locational analysis, European Journal of Operational Research, 104, 269, 10.1016/S0377-2217(97)00183-5 Bazaraa, 1979, A survey of various tactics for generating Lagrangean multipliers in the context of Lagrangean duality, European Journal of Operational Research, 3, 322, 10.1016/0377-2217(79)90228-5 Brandeau, 1989, An overview of representative problems in location research, Management Science, 35, 645, 10.1287/mnsc.35.6.645 Francis, 1983, Locational analysis, European Journal of Operations Research, 12, 220, 10.1016/0377-2217(83)90194-7 Gavish, 1979, On obtaining the ‘best’ multipliers for a Lagrangean relaxation for integer programming, Computers and Operations Research, 5, 55, 10.1016/0305-0548(78)90018-7 Gourdin, 2000, The uncapacitated facility location problem with client matching, Operations Research, 48, 671, 10.1287/opre.48.5.671.12410 Jayaraman, 1998, An efficient heuristic procedure for practical-sized capacitated warehouse design and management, Decision Sciences, 29, 729, 10.1111/j.1540-5915.1998.tb01361.x Pirkul, 1998, A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution, Computers and Operations Research, 25, 869, 10.1016/S0305-0548(97)00096-8 Poljack, 1967, A general method of solving extremum problems, Soviet Mathematics Doklady, 8, 593 Tragantalerngsak, 2000, An exact method for the two-echelon, single-source, capacitated facility location problem, European Journal of Operational Research, 123, 473, 10.1016/S0377-2217(99)00105-8