Finding Optimal Groups - A Quadratic Programming Approach in Zero/One Variables with Applications.

摘要

In the design of many large scale systems it is frequently useful to formulate a number of the engineering problems as optimization problems in zero/one variables. Much effort is directed towards developing algorithms for solution of these problems which are readily programmed and do not require unreasonable amounts of computation time and storage. Linear programming has been one of the more successful techniques developed to deal with problems of this nature. For example,special algorithms have been developed for efficient solution of the classical transportation and assignment problems. In the document the author provides a method for solving a quadratic binary programming problem. The author shows this problem to have a wide range of applicability in both operations research and in computer systems design. (Author)