In the m-Peripatetic Salesman Problem (m-PSP) the aim is to determine m edge disjoint Hamiltonian cycles of minimum total cost on a graph. This article describes exact branch-and-cut solution procedures for the undirected m-PSP. Computational results are reported on random and Euclidean graphs.

We consider a generalization of the drinking philosophers problem, called GDrPP, in which processes may issue AND-OR requests for resources, as opposed to the AND requests of the original formulation. For GDrPP, we introduce a basic priority dynamics that can be regarded as generalizing the edge-reversal priority dynamics underlying the classical solution to the original formulation. The novel ...

WHEN WE survey the history of science, no matter what our philosophical persuasions, it is clear that the formation of new ways of conceptualizing reality is a central feature of the scientific enterprise and of what we call ‘scientific progress’. However, little attention has been given to the study of how these new concepts are actually formed. Indeed, until the last 20 years or so, the quest...

Mathematics and philosophy have historically enjoyed a mutually beneficial and productive relationship, as a brief review of the work of mathematician-philosophers such as Descartes, Leibniz, Bolzano, Dedekind, Frege, Brouwer, Hilbert, Gödel, and Weyl easily confirms. In the last century, it was especially mathematical logic and research in the foundations of mathematics which, to a significant...