scientific article; zbMATH DE number 597806

MaRDI QIDQ4298845zbMATH OpenFDO

Authors P. K. Sapiecha

Publication date 29 June 1994

zbMATH Keywords

Boltzmann machinecovering matrix problemssimulated annealing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• AE1: An extension matrix approximate method for the general covering problem
• scientific article; zbMATH DE number 1132808
• scientific article; zbMATH DE number 2102648
• On the hardness of approximating minimization problems
• scientific article; zbMATH DE number 1206043

Cited in

(6)

• A useful transform of standard input data for a classical NP-complete problem
• A neural network for the minimum set covering problem
• AE1: An extension matrix approximate method for the general covering problem
• A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
• Approximation algorithms for NP-hard problems

This page was built for publication:

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