In formulating linear programming problems, analysts tend to include constraints that are not binding at the optimal solution for fear of excluding necessary constraints. The inclusion of such constraints does not alter the optimum solutions, but may require many additional iterations to be...

Intelligent problem-solving, whether by man or by machine, implies selective rather than just rapid behavior. Humans achieve this selectivity through heuristics--principles that, on the average, contribute to reduction of search in problem-solving. Heuristic programming is the construction of...

Several recent research efforts have studied the use of probabilistic schemes for generating solutions to particular combinatorial problems. Characteristically, such schemes include both rapid production of many potential solutions, through repeated application of simple choice rules, and...

This paper presents a heuristic procedure for balancing production assembly lines and a computer program for carrying out that procedure. This research was undertaken to investigate the application of complex information processing techniques (as used in producing the Chess Machine and Logic...