A simulation tool for the performance evaluation of parallel branch and bound algorithms

DOI10.1007/BF01589406zbMath0658.90078MaRDI QIDQ1111941

Harry W. J. M. Trienekens, Arie de Bruin, Alexander H. G. Rinnooy Kan

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

simulationnondeterminismParallel computationasynchronicityparallel branch and bound

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Probabilistic models, generic numerical methods in probability and statistics (65C20) Combinatorial optimization (90C27)

Related Items

Branch-and-bound and parallel computation: A historical note, Speedup estimates for some variants of the parallel implementations of the branch-and-bound method, Large-scale 0-1 linear programming on distributed workstations

Uses Software

• DPUP
• Simula 67

Cites Work

• Unnamed Item
• Unnamed Item
• An introduction to parallelism in combinatorial optimization
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• Random Trees and the Analysis of Branch and Bound Procedures
• Anomalies in parallel branch-and-bound algorithms
• The Power of Dominance Relations in Branch-and-Bound Algorithms
• Computational Efficiency of Approximate Branch-and-Bound Algorithms
• Branch-and-Bound Methods: General Formulation and Properties