Showing papers in "Location Science in 1996"

TL;DR: In this paper, integer programming formulations for four types of discrete hub location problems are presented: the p-hub median problem, the uncapacitated hub location problem, p -hub center problems and hub covering problems.

TL;DR: In this article, a branch-and-bound LP formulation for the single allocation p-hub median problem is presented, which requires fewer variables and constraints than those traditionally used in the literature.

TL;DR: In this article, the authors introduce a geometric version of the Covering Salesman Problem, in which each salesman's clients specify a neighborhood in which they are willing to meet the salesman.

TL;DR: This paper introduces flow-based models for designing capacitated networks and routing policies and proposes heuristic schemes based on mathematical programming for solving hub location problems and related routing policies.

TL;DR: A determination of the optimal number of hubs as the fixed costs and interhub discount factors change is determined, and the results show that the integer-friendliness of the formulation depends on the value of α.

TL;DR: In this paper, the p-center location problem for demand originating in an area is investigated, which is equivalent to covering every point in the area by p circles with the smallest possible radius.

TL;DR: An algorithm is described, based on dual ascent and dual adjustment techniques within a branch-and-bound scheme, for one of these models, the uncapacitated hub location problem (UHLP), involving the novel feature of using the solution to a transportation problem to determine feasible dual values.

TL;DR: In this article, the optimal location of interacting hub facilities is considered in the USApHMP problem and a Hopfield neural network is used to solve the problem in a postal delivery network.

TL;DR: In this article, the authors identify applications for closest assignment constraints and propose necessary improvements to one of the major CA constraints, and offer a comparison of the different integer-linear approaches to CA.

TL;DR: A tabu search heuristic is developed and computational tests on randomly generated instances are presented, and sensitivity analyses are performed on a number of parameters used in the algorithm.

TL;DR: The new model and solution procedure reported in this paper can solve large-scale problems that are intractable to the branch-and-cut algorithm developed in the previous papers.

TL;DR: This paper establishes the long-run average optimality of a simple demand rate ranking and partitioning scheme which has previously been suggested in the literature through heuristic reasoning and simulation studies.

TL;DR: In this paper, it is shown that the interregional mobility of a firm will depend on the prices of the goods being shipped, and that the importance of total logistics costs relative to transportation costs is much greater than simply transportation costs.

TL;DR: An algorithm for aggregating demand points for the rectilinear distance p-center problem is presented and the maximum objective function error between true and aggregated problems can be well predicted prior to solving the aggregated problem.

TL;DR: In this paper, an exact formulation of the simple plant location problem with spatial interaction is presented, which is based on the derivation of the spatially interactive travel behavior, often described through a spatial "gravity" model.

TL;DR: A perspective on the practical application side of the development and implementation of a mixed integer programming type model designed to determine the best transport mode and rail network location strategy for a leading international automobile manufacturer to supply its North American dealers is provided.

TL;DR: The second edition of Network and Discrete Location: Models, Algorithms, and Applications as discussed by the authors provides a taxonomy of location problems and models, as well as a full range of exercises to equip readers with an understanding of the basic facility location model types.

TL;DR: In this article, a multiobjective model for locating solid waste transfer stations (SWTS) examines the tradeoffs between minimizing costs and public opposition, while expected public opposition is modeled as a decreasing function of distance from the facility.

TL;DR: It is proved that Condorcet and median points of a simple rectilinear polygon coincide and an O(N + nlogN) algorithm for computing these sets is presented.

TL;DR: In this paper, an infinite family of pure strategy Nash equilibria for a 3-firm location game on a sphere has been presented, which is the first known pure Nash equilibrium for location games in dimension two.

TL;DR: In this article, a theoretical model of the commercial property market is developed which takes account of the firm's choice between alternative forms of occupancy (owner-occupancy or tenancy) and locations (centre or periphery), and assumes that equilibrium rents and prices are determined by a set of simultaneous market clearing conditions in sub-markets for the different occupancy types and locations.