Pages that link to "Item:Q4229642"
From MaRDI portal
The following pages link to A branch-and-bound algorithm for depot location and container fleet management (Q4229642):
Displayed 10 items.
- Planning models for freight transportation (Q1278638) (← links)
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973) (← links)
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements (Q1370711) (← links)
- Empty container management in a port with long-run average criterion (Q1764955) (← links)
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements (Q1908996) (← links)
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements (Q1919844) (← links)
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements (Q2146977) (← links)
- Dynamic location of modular manufacturing facilities with relocation of individual modules (Q2184138) (← links)
- Bicriteria optimization model for locating maritime container depots: application to the Port of Valencia (Q2357881) (← links)
- New facets for the two-stage uncapacitated facility location polytope (Q2655408) (← links)