Publication Date
Volume
6
Issue
4
Start Page
55
File Attachment
V-6_4.pdf5.38 MB
Abstract
Historical records and data frequently have been reduced by combination of accounts. The problem we address is that of finding all ways a given set of accounts could have been combined to give some given set of reduced accounts. An algorithm has been developed to accomplish this task and a computer code in FORTRAN is given. An example with some MUF data is also presented.