The forum is focused on thinking about and with algorithms as a way of unifying all one's mathematical endeavors. The lead article by Maurer presents examples and discussion of this point. Responses, often disagreeing with his views, are by Douglas, Korte, Hilton, Renz, Smorynski, Hammersley, and Halmos. (MNS)

Mathematical models that are used to solve facility location problems are presented. All involve minimizing some distance function. (MNS)

Algorithms to determine the optimal locations of emergency service centers in a given city are presented, with theorems and proofs. (MNS)

A program for drawing a line segment is developed. (MNS)

An efficient division algorithm is developed, using a computer program, to convert any positive fraction to its decimal representation. The computer program listing is included. (MNS)

Presents an example from the combinatorial theory of partially ordered sets. Discusses algorithms of on-line antichain partitioning problems, a topic in discrete optimization. (YP)

Describes the algorithm used to select a simple random sample of certain size without having to list all possible samples and a justification based on Pascal's triangle. Provides testing results by various computers. (YP)

This article develops an algorithm to find all solutions to the problem, making all sums of a hexagram's nine lines the same. It shows how to exploit the geometric structure of the hexagram and its group of automorphisms. (YP)