Location analysis: a synthesis and survey
From MaRDI portal
Publication:1776950
DOI10.1016/j.ejor.2003.11.032zbMath1112.90362MaRDI QIDQ1776950
H. A. Eiselt, Charles S. Re Velle
Publication date: 12 May 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.11.032
90B80: Discrete location and assignment
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Site selection in the US retailing industry, A mixed-integer approach to Core-Edge design of storage area networks, Location coverage models with demand originating from nodes and paths: Application to cellular network design, A facility location and installation of resources model for level of repair analysis, The stochastic \(p\)-median problem with unknown cost probability distribution, A bibliography for some fundamental problem categories in discrete location science, A hierarchical location model for public facility planning, GASUB: finding global optima to discrete location problems by a genetic-like algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Hierarchical location-allocation problems: A classification scheme
- A center location problem with congestion
- A note on the Weber location problem
- Asymptotic behavior of the Weber location problem on the plane
- Location and layout planning. An international bibliography
- A method for solving to optimality uncapacitated location problems
- A quadratic integer program for the location of interacting hub facilities
- Analytical models for locating undesirable facilities
- On the exact solution of large-scale simple plant location problems
- A queueing-location model with expected service time dependent queueing disciplines
- A comparative study of heuristics for a two-level routing-location problem
- The dynamic set covering problem
- Dynamic versions of set covering type public facility location problems
- An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region
- On locating new facilities in a competitive environment
- An optimal method for solving the (generalized) multi-Weber problem
- Facility siting and integer-friendly programming
- Optimizing solid waste collection in Brussels
- Heuristic concentration: Two stage solution construction
- Quantitative models for reverse logistics: A review
- Heuristic concentration and tabu search: A head to head comparison
- Equity measurement in facility location analysis: A review and framework
- Logistic chain modelling
- Strategic facility location: A review
- A gamma heuristic for the \(p\)-median problem
- Network distance characteristics that affect computational effort in \(p\)-median location problems
- The maximum return-on-investment plant location problem
- An Analysis of Network Location Problems with Distance Constraints
- An Integer Programming Approach to the Apparel Sizing Problem
- Medi-Centers of a Tree
- Location-Allocation Problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- The Hierarchical Service Location Problem
- The Multiperiod Location-Allocation Problem with Relocation of Facilities
- A Plant and Warehouse Location Problem
- The Plant Location Problem: New Models and Research Prospects
- The Maximum Availability Location Problem
- La Localisation D’Une Installation De Stockage De Dechets Stabilises : Le Cas De La Suisse Romande
- Competitive Location Models: A Framework and Bibliography
- Integer Programming: Methods, Uses, Computations
- Link-Length Minimization in Networks
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations on a Graph with Probabilistic Demands
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- The m-Center Problem
- An Analysis of Private and Public Sector Location Models
- The Location of Emergency Service Facilities
- A note on Fermat's problem
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Static competitive facility location: an overview of optimisation approaches.
