Convex Location Problems on Tree Networks. - P. M. Dearing; Richard L. Francis; Timothy J. Lowe (Oper. Res., 1976)

A location model with queueing constraints. - Perino M. Dearing; James P. Jarvis (Comput. Oper. Res., 1978)

Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network. - Douglas R. Shier; Perino M. Dearing (Oper. Res., 1983)

Maximal chordal subgraphs. - Perino M. Dearing; Douglas R. Shier; D. D. Warner (Discret. Appl. Math., 1988)

Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem. - Perino M. Dearing; Peter L. Hammer; Bruno Simeone (Transp. Sci., 1992)

Neighborhood Subtree Tolerance Graphs. - Eric Bibelnieks; Perino M. Dearing (Discret. Appl. Math., 1993)

On the Equivalence Between Roof Duality and Lagrangian Duality for Unconstrained 0-1 Quadratic Programming Problems. - Warren P. Adams; Perino M. Dearing (Discret. Appl. Math., 1994)

An Equivalence Result for Single Facility Planar Location Problems with Rectilinear Distance and Barriers. - Perino M. Dearing; Roy Segars Jr. (Ann. Oper. Res., 2002)

Solving Rectilinear Planar Location Problems with Barriers by a Polynomial Partitioning. - Perino M. Dearing; Roy Segars Jr. (Ann. Oper. Res., 2002)

Planar Location Problems with Block Distance and Barriers. - Perino M. Dearing; Kathrin Klamroth; Roy Segars Jr. (Ann. Oper. Res., 2005)

A dual algorithm for the minimum covering ball problem in Rn. - P. M. Dearing; Christiane R. Zeck (Oper. Res. Lett., 2009)

A dual algorithm for the minimum covering weighted ball problem in $${ mathbb{R}^n}$$. - P. M. Dearing; Andrea M. Smith (J. Glob. Optim., 2013)

The minimum covering Euclidean ball of a set of Euclidean balls in $I ! !R^n$. - P. M. Dearing; Mark E. Cawood (Ann. Oper. Res., 2023)

The weighted Euclidean one-center problem in ${ mathbb {R}}^n$. - Mark E. Cawood; P. M. Dearing (Comput. Optim. Appl., 2024)