Finding a cluster of points and the grey pattern quadratic assignment problem

In this paper we propose a model which aims at selecting a tight cluster from a set of points. The same formulation applies also to the grey pattern problem where the objective is to find a set of black dots in a rectangular grid with a given density so that the dots are spread as evenly as possible. A branch and bound algorithm and five heuristic approaches are proposed. Computational results demonstrate the efficiency of these approaches. Seven grey pattern problems are solved to optimality and for eight additional grey pattern problems the best known solution is improved. The cluster problem on a network is solved for 40 problems with the number of points ranging between 100 and 900 and the size of the cluster ranging between 5 and 200. Twenty one problems were solved optimally and the remaining 19 problems were heuristically solved in a very short computer time with excellent results.     

Reciprocal free association: Listening with the third ear as an instrument in psychoanalysis.

The focus of this article is the psychological processes occurring in the analysand and the analyst, and shaping the exchanges between them. These processes have been given by Otto Isakower the metaphorical name of the analyzing instrument while Theodor Reik used the metaphor of the third ear. In the spirit of the methodology of operationalism, the author was the first in 1984 to rename this process reciprocal-free association. The further focus is the status of free association as the foundation of psychoanalysis as method of psychological investigation, discovery (heuristics), and healing, even in its latter function, psychoanalysis contains additional, and equally essential, procedures, such as confrontation, reality testing, elucidation of ethical conflicts, logical analysis of premise and prejudice. But this does not mean mutual exclusion. Rather, such dichotomizing of the approaches to the analytic process reflects the fact of basic human archetypes, the cause of recurrent polarizations among analysts of poets versus pragmatists and scientists, those inspired by imagination, image and metaphor versus those guided by logic and literalness. A good method requires the conjoining of all the available approaches. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Layout of facilities with some fixed points

This paper deals with the location of facilities or “movable” points on a planar area, on which there already exist fixed points. The minimax criterion for optimality is used and distances among points are assumed to be rectilinear. Two very efficient algorithms for the solution of the problem are presented. One is based on a univariate search, and the other on a steepest descent method. Some computational results are presented.     

Hierarchies of complete problems

Summary An attempt is made to present a framework for the diverse complete problems that have been found. A new concept—a Hierarchy of Complete Problems is defined. Several hierarchies in various domains such as graph theory, automata theory, theorem proving and games are established.Some of the results in this paper were presented in the John Hopkins Conference on Information Sciences and Systems, April 1975.     

Some Aspects of the Aqueous Chemistry of Molybdenum

Some aspects of the aqueous chemistry of molybdenum in the oxidation states +3, +4, +5 and +6 are reviewed. Mention is made only of well characterized species and complexes.     

On Optimizing Bin Picking and Insertion Plans for Assembly Robots

In robotic assembly stations robots pick a series of component parts from bins and then insert and assemble them. Several approaches are described and formulated for optimizing bin organization, picking, and insertion sequence and route. Solution procedures are developed for several modes of assembly tasks. The Simple Assembly Plan problem (SAP) is defined and solved. Extensions to this problem are heuristically solved by separating the SAP problem into the Bin Assignment Problem (BAP) and the Pick-Insert Sequencing (PIS) problem. We then define and formulate a new version of the assignment problem which is termed the Minimax Assignment Problem (MAP). An algorithm for the solution of this problem is developed and tested.     

Fast Algorithms for the Round Trip Location Problem

This paper presents several fast algorithms for the round trip location problem. I show how to simplify the method given in an article by Chan and Hearn in which only the rectilinear case is addressed and get an algorithm with improved complexity for a given accuracy. An exact solution algorithm (the complexity of which is unknown) that solved test data problems even faster is presented and generalized for Euclidean and ℓ_p distances. Computational results are also presented.