A branch-and-bound algorithm for depot location and container fleet management
From MaRDI portal
Publication:4229642
DOI10.1016/0966-8349(95)00005-3zbMATH Open0917.90227OpenAlexW2003594070WikidataQ127571262 ScholiaQ127571262MaRDI QIDQ4229642FDOQ4229642
Authors: Bernard Gendron, Teodor Gabriel Crainic 
Publication date: 5 August 1999
Published in: Location Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0966-8349(95)00005-3
Recommendations
Cited In (13)
- A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem
- Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
- New facets for the two-stage uncapacitated facility location polytope
- Planning models for freight transportation
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
- Dynamic location of modular manufacturing facilities with relocation of individual modules
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
- Bicriteria optimization model for locating maritime container depots: application to the Port of Valencia
- Empty container management in a port with long-run average criterion
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
- A branch and bound algorithm for allocation problems in which constraint coefficients depend upon decision variables
This page was built for publication: A branch-and-bound algorithm for depot location and container fleet management
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229642)
