Discrete optimization methods for multiprocessor computer systems

DOI10.1007/BF01070581MaRDI QIDQ3034793zbMATH OpenOpenAlexFDO

Authors L. F. Gulyanitskii, A. N. Khodzinskij, I. V. Sergienko

Publication date 1988

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01070581

zbMATH Keywords

algorithmsmultiprocessor computer systemsparallel computations

Mathematics Subject Classification ID

Theory of software (68N99) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 4054989 (Why is no real title available?)
• scientific article; zbMATH DE number 4093169 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3443177 (Why is no real title available?)
• Theoretical comparisons of search strategies in branch-and-bound algorithms

This page was built for publication: Discrete optimization methods for multiprocessor computer systems

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