A branch-and-bound algorithm for depot location and container fleet management
- 1 May 1995
- journal article
- Published by Elsevier in Location Science
- Vol. 3 (1) , 39-53
- https://doi.org/10.1016/0966-8349(95)00005-3
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A tabu search procedure for multicommodity location/allocation with balancing requirementsAnnals of Operations Research, 1993
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing RequirementsTransportation Science, 1993
- A branch-and-bound method for multicommodity location with balancing requirementsEuropean Journal of Operational Research, 1993
- Models for multimode multicommodity location problems with interdepot balancing requirementsAnnals of Operations Research, 1989
- The simple plant location problem: Survey and synthesisEuropean Journal of Operational Research, 1983
- A Dual-Based Procedure for Dynamic Facility LocationManagement Science, 1982
- A Dual-Based Procedure for Uncapacitated Facility LocationOperations Research, 1978
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974