Solving the set cover problem on a supercomputer

DOI10.1016/0167-8191(90)90132-SMaRDI QIDQ910182zbMATH OpenOpenAlexFDO

Authors Shyong Jian Shyu, R. C. T. Lee

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

zbMATH Keywords

set cover problemsupercomputervectorized algorithm

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(4)

• Solving Coverability Problem for Monotonic Counter Systems by Supercompilation
• scientific article; zbMATH DE number 4096771 (Why is no real title available?)
• scientific article; zbMATH DE number 4106856 (Why is no real title available?)
• scientific article; zbMATH DE number 97096 (Why is no real title available?)

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)