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

DOI10.1016/0377-2217(93)90117-6zbMATH Open0779.90053OpenAlexW2090983252MaRDI QIDQ1804068FDOQ1804068

Louis Delorme, Teodor Gabriel Crainic, P. 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

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

zbMATH Keywords

fleet managementtight boundscontainer transportationbranch- and-boundempty flow balancingmulticommodity location-allocation

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Cites Work

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

Cited In (18)

• 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
• Title not available (Why is that?)
• 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)