Solving the set cover problem on a supercomputer

DOI10.1016/0167-8191(90)90132-SzbMATH Open0695.68013OpenAlexW2007865068MaRDI QIDQ910182FDOQ910182

R. C. T. Lee, Shyong Jian Shyu

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90132-s

Recommendations

• Solving large set covering problems on a personal computer
• scientific article
• Computer Solutions to Minimum-Cover Problems
• Parallel and serial heuristics for the minimum set cover problem
• An algorithm for set covering problem

zbMATH Keywords

supercomputerset cover problemvectorized algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Theory of software (68N99)

Cited In (4)

• Solving Coverability Problem for Monotonic Counter Systems by Supercompilation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Solving the set cover problem on a supercomputer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910182)