Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem

DOI10.1016/S0167-8191(99)00094-0zbMath1046.68503OpenAlexW2171097355MaRDI QIDQ1606886

Benoît Bourbeau, Teodor Gabriel Crainic, Bernard Gendron

Publication date: 29 July 2002

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(99)00094-0

zbMATH Keywords

multicommodity network flow structure

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (6)

A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements ⋮ Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms ⋮ A parallelizable dynamic fleet management model with random travel times ⋮ Solving packing problems by a distributed global optimization algorithm ⋮ Unnamed Item ⋮ P2P B&B and GA for the Flow-Shop Scheduling Problem

This page was built for publication: Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem