A correcting algorithm for solving allocation type problems (Q2266669)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A correcting algorithm for solving allocation type problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A correcting algorithm for solving allocation type problems |
scientific article |
Statements
A correcting algorithm for solving allocation type problems (English)
0 references
1984
0 references
One presents an algorithm for solving problems of unification, allocation, covering, construction of disjunctive normal forms that are minimal, shortest, or contain a minimal number of letters with negations. The algorithm is based on the idea of approximating irregular initial data by regular ones. One gives the results of a computational experiment, confirming the efficiency of the algorithm.
0 references
unification
0 references
allocation
0 references
covering
0 references
construction of disjunctive normal forms
0 references
algorithm
0 references
approximating irregular initial data
0 references
0 references
0.8841076
0 references
0.87935054
0 references
0.8793168
0 references
0.8640418
0 references
