Parallel algorithms for a multi-level network optimization problem

DOI10.1080/10637190310001603630zbMath1083.68644OpenAlexW2020476421MaRDI QIDQ4819658

Geraldo Robson Mateus, Frederico R. B. Cruz

Publication date: 27 September 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Uses Software

• OR-Library
• PVM

Cites Work

• Parallel branch and bound on fine-grained hypercube multiprocessors
• The hierarchical network design problem
• The telephonic switching centre network problem: Formalization and computational experience
• Reducing the hierarchical network design problem
• Simple approaches to parallel branch and bound
• Solving to optimality the uncapacitated fixed-charge network flow problem
• Algorithms for a multi-level network optimization problem
• Randomized parallel algorithms for backtrack search and branch-and-bound computation
• Anomalies in parallel branch-and-bound algorithms
• An SST-based algorithm for the steiner problem in graphs
• Reduction tests for the steiner problem in grapsh
• A Dual-Based Procedure for Uncapacitated Facility Location
• An integer linear programming approach to the steiner problem in graphs
• Can Parallel Branch and Bound without Communication Be Effective?
• A Dual-Based Algorithm for Multi-Level Network Design
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel algorithms for a multi-level network optimization problem