• Publications
  • Influence
The simple plant location problem: Survey and synthesis
Abstract With emphasis on the simple plant location problem , (SPLP), we consider an important family of discrete, deterministic, single-criterion, NP-hard , and widely applicable optimizationExpand
Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems
For the simple (uncapacitated) plant location problem for which the coefficient matrix possesses certain properties, we devise a polynomially bounded algorithm by means of which an optimal solutionExpand
Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem
A conceptually straightforward method for generating sharp lower bounds constitutes the basic element in a family of efficient branch and bound algorithms for solving simple (uncapacitated) plantExpand
A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
The 1-median problem on a network asks for a vertex minimizing the sum of the weighted shortest path distances from itself to all other vertices, each associated with a certain positive weight. Expand
Heuristic and optimal solutions for set-covering problems in conservation biology
Area-selection methods have recently gained prominence in conservation biology. A typical problem is to identify the minimum number of areas required to represent all species over some geographicExpand
The Peripatetic Salesman and Some Related Unsolved Problems
Some generalizations of the traveling salesman problem are suggested, leading to problems in which we seek to minimize the summed weight of two or more line-disjoint hamiltonian cycles. A number ofExpand
Geometrical Solution to the Fermat Problem with Arbitrary Weights
The prime motivation for the present study is a famous problem, allegedly first formulated in 1643 by Fermat, and the so-called Complementary Problem (CP), proposed but incorrectly solved in 1941 by Courant and Robbins. Expand
A hospital facility layout problem finally solved
This paper presents a history of a difficult facility layout problem that falls into the category of the Koopmans–Beckmann variant of the quadratic assignment problem (QAP), wherein 30 facilities are to be assigned to 30 locations. Expand
Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
A highly efficient algorithm (HK) devised by Held and Karp for solving the symmetric traveling-salesman problem was presented at the 7th Mathematical Programming Symposium in 1970. Expand