COMBINATION PROBLEM ANALYZING DEVICE

• Main Authors: TSUBAKI KAZUHIRO, MORISHITA TARO, YAMAJI TAKAHIRO
• Format: Patent
• Language: English
• Published: 19.05.1995
• Edition: 6
• Subjects: CALCULATING; COMPUTING; COUNTING; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES; ELECTRIC DIGITAL DATA PROCESSING; PHYSICS; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR

PURPOSE:To shorten the processing time for a combination problem and to enable the execution of a larger problem by preparing a transposed square matrix expressing the coupling propriety from an imparted element and a cou pling relation among each element and determining a maximum partial square matrix where all the elements are composed of 1. CONSTITUTION:When elements 1 to 5, for instance, are inputted in an input means, the coupling check between each element is performed. As a result, pair sets such as {1, 2}, {1, 5},... etc., are generated. These pair sets are passed to the next coupling possible maximum aggregate preparation part 11. In the processing of this coupling-possible maximum set preparation part 11, the line of a figure shows the coupling check among the elements and the elements of a vector show that they are possible to couple. In this system, the relation of the prepared pair set and {1...n}: coupling possible identical {1, 2}, {1, 3}...{n-1, n}; coupling possible is used and a coupling possible maximum set is prepared without performing the couplig check with other element. The coupled element is displayed by a display means.