A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
type: Item
instance of: scholarly article
title: A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
zbMATH Open document ID: 0893.90116
DOI: 10.1016/S0305-0548(96)00094-9
author: Bernard Gendron
author: Teodor Gabriel Crainic
published in: Computers \& Operations Research
publication date: 1997-10-26T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 1079102
zbMATH Keywords: parallel branch-and-bound
zbMATH Keywords: multicommodity location
zbMATH Keywords: synchronous initialization
zbMATH Keywords: asynchronous exploration
MaRDI profile type: Publication
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 branch-and-bound method for multicommodity location with balancing requirements
cites work: A tabu search procedure for multicommodity location/allocation with balancing requirements
cites work: A branch-and-bound algorithm for depot location and container fleet management
cites work: Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements
cites work: Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
cites work: Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements
cites work: Parallel Branch-and-Branch Algorithms: Survey and Synthesis
cites work: The simple plant location problem: Survey and synthesis
cites work: Q3351135
cites work: A Dual-Based Procedure for Uncapacitated Facility Location
cites work: A Dual-Based Procedure for Dynamic Facility Location
description: scientific article; zbMATH DE number 1079102