A branch-and-bound algorithm for depot location and container fleet management

Location Science - Tập 3 - Trang 39-53 - 1995
Bernard Gendron1, Teodor Gabriel Crainic1
1Centre de recherche sur les transports, Université de Montréal, C.P. 6128 Succursale centre-ville, Montréal, QC H3C 3J7, Canada

Tài liệu tham khảo

Ahuja, 1993 Cornuejols, 1990, The uncapacitated facility location problem, 119 Crainic, 1989, Models for multimode multicommodity location problems with interdepot balancing requirements, Annals of Operations Research, 18, 279, 10.1007/BF02097809 Crainic, 1993, Dual-ascent procedures for multicommodity location-allocation problems with balancing requirements, Transportation Science, 27, 90, 10.1287/trsc.27.2.90 Crainic, 1993, A branch-and-bound method for multicommodity location with balancing requirements, European Journal of Operational Research, 65, 368, 10.1016/0377-2217(93)90117-6 Crainic, 1992, A tabu search procedure for multicommodity location/allocation with balancing requirements, Annals of Operations Research, 41, 359, 10.1007/BF02023001 Dejax, 1987, Planification tactique du transport terrestre des conteneurs vides—Rapport de synthèse Erlenkotter, 1978, A dual-based procedure for uncapacitated facility location, Operations Research, 26, 992, 10.1287/opre.26.6.992 Geoffrion, 1974, Langrangean relaxation for integer programming, Mathematical Programming Study, 2, 82, 10.1007/BFb0120690 Grigoriadis, 1979 Ibaraki, 1987, Enumerative approaches to combinatorial optimization, Annals of Operations Research, 10-11 Krarup, 1983, The simple plant location problem: Survey and synthesis, European Journal of Operational Research, 12, 36, 10.1016/0377-2217(83)90181-9 Van Roy, 1982, A dual-based procedure for dynamic facility location, Management Science, 28, 1091, 10.1287/mnsc.28.10.1091