A distributed processing algorithm for solving integer programs using a cluster of workstations

DOI10.1016/S0167-8191(97)00016-1zbMath0907.68022OpenAlexW1968168204MaRDI QIDQ1391780

Gautam Mitra, I. Hai, Mozafar T. Hajian

Publication date: 23 July 1998

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

Full work available at URL: https://doi.org/10.1016/s0167-8191(97)00016-1

zbMATH Keywords

linear programmingperformance analysisbranch and bound algorithmdistributed processingPVMworkstation cluster

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Improving branch-and-cut performance by random sampling, Parallelization of the FICO Xpress-Optimizer, FiberSCIP—A Shared Memory Parallelization of SCIP, A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound

Uses Software

• MIPLIB
• PVM