Minimal covering problem and PLA minimization

DOI10.1007/BF00991179zbMath0599.94017MaRDI QIDQ3735634

Saburo Muroga, Ming Huei Young

Publication date: 1985

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

zbMATH Keywords

heuristic algorithmimplicit enumeration methodlogic minimizationminimal sumQuine-McCluskey methodheuristic minimizationminimization of programmable logic arrays

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Symmetric Minimal Covering Problem and Minimal PLA's with Symmetric Variables
• An Algorithm for the Bounded Variable Integer Programming Problem
• Direct Search Algorithms for Zero-One and Mixed-Integer Programming
• Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General Algorithm
• Integer Linear Programming: A Study in Computational Efficiency
• Computer Solutions to Minimum-Cover Problems
• An Improved Implicit Enumeration Approach for Integer Programming
• A Method for the Fast Approximate Solution of Large Prime Implicant Charts
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• An implicit enumeration program for zero-one integer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal covering problem and PLA minimization