A branch-and-bound method for multicommodity location with balancing requirements

DOI10.1016/0377-2217(93)90117-6zbMath0779.90053MaRDI QIDQ1804068

Louis Delorme, Teodor Gabriel Crainic, Pierre Dejax

Publication date: 29 June 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90117-6

zbMATH Keywords

fleet management; tight bounds; container transportation; branch- and-bound; empty flow balancing; multicommodity location-allocation

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90B80: Discrete location and assignment

91B32: Resource and cost allocation (including fair division, apportionment, etc.)

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Unnamed Item, A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points, A parallel branch-and-bound algorithm for multicommodity location with balancing requirements, Location and layout planning. A survey, Resource planning and a depot location model for electric power restoration., A branch-and-bound method for multicommodity location with balancing requirements, Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements, Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements, A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements, Bicriteria optimization model for locating maritime container depots: application to the Port of Valencia, A tabu search procedure for multicommodity location/allocation with balancing requirements, Dynamic supply chain design with inventory

Cites Work

• Models for multimode multicommodity location problems with interdepot balancing requirements
• Facility location models for distribution planning
• Optimal and heuristic algorithms for multiproduct uncapacitated facility location
• A branch-and-bound method for multicommodity location with balancing requirements
• The simple plant location problem: Survey and synthesis
• A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
• A Dual-Based Procedure for Uncapacitated Facility Location
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem