A branch-and-bound method for multicommodity location with balancing requirements
type: Item
instance of: scholarly article
title: A branch-and-bound method for multicommodity location with balancing requirements
zbMATH Open document ID: 0779.90053
DOI: 10.1016/0377-2217(93)90117-6
author: Teodor Gabriel Crainic
author: Louis Delorme
author: P. Dejax
published in: European Journal of Operational Research
publication date: 1993-06-29T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 222255
zbMATH Keywords: empty flow balancing
zbMATH Keywords: fleet management
zbMATH Keywords: container transportation
zbMATH Keywords: branch- and-bound
zbMATH Keywords: multicommodity location-allocation
zbMATH Keywords: tight bounds
MaRDI profile type: Publication
full work available at URL: 0377-2217(93)90117-6
OpenAlex ID: W2090983252
cites work: Facility location models for distribution planning
cites work: Models for multimode multicommodity location problems with interdepot balancing requirements
cites work: Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
cites work: A Dual-Based Procedure for Uncapacitated Facility Location
cites work: An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
cites work: Optimal and heuristic algorithms for multiproduct uncapacitated facility location
cites work: A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
cites work: The simple plant location problem: Survey and synthesis
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
Recommended article: A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
Recommended article: Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements
Recommended article: The many-commodity location problem (the branch-and-bound method)
Recommended article: A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
Recommended article: Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements
Recommended article: A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
Recommended article: Tabu Search With Exact Neighbor Evaluation For Multicommodity Location With Balancing Requirements
Recommended article: Models for multimode multicommodity location problems with interdepot balancing requirements
Recommended article: A tree search algorithm for the multi-commodity location problem
Recommended article: A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
description: scientific article; zbMATH DE number 222255