Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements

DOI10.1080/03155986.1993.11732224zbMath0781.90060OpenAlexW2402281147MaRDI QIDQ3142069

Teodor Gabriel Crainic, Bernard Gendron

Publication date: 17 February 1994

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1993.11732224

zbMATH Keywords

balancing requirementsparallel branch-and-bound algorithmsnetwork of transputersmulticommodity locationmaster-slave approach

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

A parallel branch-and-bound algorithm for multicommodity location with balancing requirements ⋮ Parallel processing for difficult combinatorial optimization problems

This page was built for publication: Parallel Implementations Of A Branch-And-Bound Algorithm For Multicommodity Location With Balancing Requirements