Minimal covering problem and PLA minimization
From MaRDI portal
Recommendations
Cites work
- A Method for the Fast Approximate Solution of Large Prime Implicant Charts
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An Algorithm for the Bounded Variable Integer Programming Problem
- An implicit enumeration program for zero-one integer programming
- An Improved Implicit Enumeration Approach for Integer Programming
- Computer Solutions to Minimum-Cover Problems
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General Algorithm
- scientific article; zbMATH DE number 3743175 (Why is no real title available?)
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 3305071 (Why is no real title available?)
- Integer Linear Programming: A Study in Computational Efficiency
- Symmetric Minimal Covering Problem and Minimal PLA's with Symmetric Variables
Cited in
(4)
This page was built for publication: Minimal covering problem and PLA minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735634)