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 optimization… Expand

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 solution… Expand

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) plant… Expand

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

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 geographic… Expand

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 of… Expand

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

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

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