Journal ArticleDOI
A tree search algorithm for the p-median problem
Reads0
Chats0
TLDR
Two lower bounds for the p-median problem are presented, the problem of locating p facilities (medians) on a network, based on two separate lagrangean relaxations of a zero-one formulation of the problem with subgradient optimisation being used to maximise these bounds.About:
This article is published in European Journal of Operational Research.The article was published on 1982-06-01. It has received 113 citations till now. The article focuses on the topics: Upper and lower bounds & Subgradient method.read more
Citations
More filters
Journal ArticleDOI
Facility location models for distribution system design
TL;DR: In this article, the authors present a review of the state-of-the-art in continuous location models and network location models, mixed-integer programming models, and applications for distribution system design.
Journal ArticleDOI
An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
TL;DR: A Lagrangean relaxation of a zero-one integer programming formulation of the problem of cutting a number of rectangular pieces from a single large rectangle is developed and used as a bound in a tree search procedure.
Journal ArticleDOI
Lagrangean heuristics for location problems
TL;DR: In this article, a framework for developing Lagrangean heuristics with respect to location problems is presented, and the results indicate that the framework presented in this paper is robust, i.e. it gives good quality solutions for each of these different location problems.
Journal ArticleDOI
Simultaneous siting and routing in the disposal of hazardous wastes
TL;DR: Methods of shortest paths, a zero-one mathematical program for siting, and the weighting method of multiobjective programming are blended to show how to derive optimal solutions to the development of a model which simultaneously sites the storage facilities, assigns reactors to those facilities and chooses routes for the shipment of the spent fuel.
Journal ArticleDOI
Capacitated clustering problems by hybrid simulated annealing and tabu search
TL;DR: In this article, a simple constructive heuristic, a λ-interchange generation mechanism, a hybrid simulated annealing (SA) and tabu search (TS) algorithm which has computationally desirable features using a new non-monotonic cooling schedule, are developed.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Algorithm 97: Shortest path
TL;DR: The procedure was originally programmed in FORTRAN for the Control Data 160 desk-size computer and was limited to te t ra t ion because subroutine recursiveness in CONTROL Data 160 FORTRan has been held down to four levels in the interests of economy.
Journal ArticleDOI
Validation of subgradient optimization
TL;DR: It is concluded that the “relaxation” procedure for approximately solving a large linear programming problem related to the traveling-salesman problem shows promise for large-scale linear programming.
Journal ArticleDOI
A dual-based procedure for uncapacitated facility location
TL;DR: This approach has obtained and verified optimal solutions to all the Kuehn-Hamburger location problems in well under 0.1 seconds each on an IBM 360/91 computer, with no branching required.
Related Papers (5)
Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
Michael B. Teitz,Polly Bart +1 more