Pages that link to "Item:Q1370711"
From MaRDI portal
The following pages link to A parallel branch-and-bound algorithm for multicommodity location with balancing requirements (Q1370711):
Displaying 12 items.
- Positioning empty containers among multiple ports with leasing and purchasing considerations (Q989622) (← links)
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← links)
- Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem (Q1606886) (← links)
- A branch-and-bound method for multicommodity location with balancing requirements (Q1804068) (← links)
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements (Q1908996) (← links)
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements (Q2146977) (← links)
- Bicriteria optimization model for locating maritime container depots: application to the Port of Valencia (Q2357881) (← links)
- On estimating workload in interval branch-and-bound global optimization algorithms (Q2392108) (← links)
- An approach for solving competitive location problems with variable demand using multicore systems (Q2448138) (← links)
- New facets for the two-stage uncapacitated facility location polytope (Q2655408) (← links)
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements (Q4280729) (← links)
- (Q5020877) (← links)
