A branch-and-bound method for multicommodity location with balancing requirements
From MaRDI portal
(Redirected from Publication:1804068)
Recommendations
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
- Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements
- The many-commodity location problem (the branch-and-bound method)
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
- A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
- Tabu Search With Exact Neighbor Evaluation For Multicommodity Location With Balancing Requirements
- Models for multimode multicommodity location problems with interdepot balancing requirements
- A tree search algorithm for the multi-commodity location problem
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
Cites work
- A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
- A Dual-Based Procedure for Uncapacitated Facility Location
- A branch-and-bound method for multicommodity location with balancing requirements
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
- Facility location models for distribution planning
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Models for multimode multicommodity location problems with interdepot balancing requirements
- Optimal and heuristic algorithms for multiproduct uncapacitated facility location
- The simple plant location problem: Survey and synthesis
Cited in
(18)- Multicommodity network flows: a survey. I: Applications and formulations
- A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- The many-commodity location problem (the branch-and-bound method)
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
- Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
- A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
- Location and layout planning. A survey
- Bicriteria optimization model for locating maritime container depots: application to the Port of Valencia
- Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
- Models for multimode multicommodity location problems with interdepot balancing requirements
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
- A tree search algorithm for the multi-commodity location problem
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
- Resource planning and a depot location model for electric power restoration.
- A branch-and-bound method for multicommodity location with balancing requirements
- Dynamic supply chain design with inventory
This page was built for publication: A branch-and-bound method for multicommodity location with balancing requirements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804068)
