Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks

C. R. Baugh, T. Ibaraki and S. Muroga
Additional contact information
C. R. Baugh: Bell Telephone Laboratories, Holmdel, New Jersey
T. Ibaraki: Kyoto University, Kyoto, Japan
S. Muroga: University of Illinois, Urbana, Illinois

Operations Research, 1971, vol. 19, issue 4, 1090-1096

Abstract: The design of optimum networks has for sometime been formulated as an integer programming problem; however, only recently have networks been obtained by using these formulations. This note reports some computational experience on the synthesis of optimum networks using Gomory's all-integer integer method. A typical example has a problem size of 91 unknowns and 240 inequalities. The effects of further restricting the problem by adding additional constraints are also investigated. Some other experiments, such as various ordering of inequalities and convergence characteristics of feasible versus infeasible problems, are described.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.4.1090 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:19:y:1971:i:4:p:1090-1096

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().