Experiments with parallel algorithms for combinatorial problems

DOI10.1016/0377-2217(88)90255-XzbMath0631.90052OpenAlexW2618995073MaRDI QIDQ1095034

G. A. P. Kindervater, Harry W. J. M. Trienekens

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90255-x

zbMATH Keywords

parallel computationbranch and boundshortest pathscomputational resultsknapsackdivide and conquer

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (8)

A parallel branch and bound algorithm for the quadratic assignment problem ⋮ Branch-and-bound and parallel computation: A historical note ⋮ Conflicting criteria, cooperating processors - some experiments on implementing a multicriteria decision support method on a parallel computer ⋮ From the theory to the tools: parallel dynamic programming ⋮ Solving knapsack problems on GPU ⋮ Parallel processing for difficult combinatorial optimization problems ⋮ An extension of labeling techniques for finding shortest path trees ⋮ Experiments with parallel branch-and-bound algorithms for the set covering problem

Uses Software

• Sisal
• Algorithm 97

Cites Work

• A note on two problems in connexion with graphs
• A Theorem on Boolean Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Experiments with parallel algorithms for combinatorial problems