Some personal views on the current state and the future of locational analysis
From MaRDI portal
Publication:1291654
DOI10.1016/S0377-2217(97)00183-5zbMath0955.90061WikidataQ126095550 ScholiaQ126095550MaRDI QIDQ1291654
Publication date: 22 February 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Continuous location (90B85) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)
Related Items (7)
Sequential competitive location on networks ⋮ Semi-obnoxious single facility location in Euclidean space. ⋮ A genetic algorithm for two-stage transportation problem using priority-based encoding ⋮ Public facility location using dispersion, population, and equity criteria ⋮ Uncapacitated and Capacitated Facility Location Problems ⋮ The maximum capture problem with random utilities: problem formulation and algorithms ⋮ Designing a distribution network in a supply chain system: formulation and efficient solution procedure
Uses Software
Cites Work
- Optimization by Simulated Annealing
- A multiobjective model for locating undesirable facilities
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- A destination optimality in asymmetric distance Fermat-Weber problems
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Sequential location-allocation of public facilities in one- and two- dimensional space: Comparison of several policies
- On the exponential cardinality of FDS for the ordered \(p\)-median problem
- The discrete p-dispersion problem
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Estimating road distances by mathematical functions
- Geometrical properties of the Fermat-Weber problem
- Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
- Outcomes of voting and planning in single facility location problems
- The maximum covering/shortest path problem: A multiobjective network design and routing formulation
- Determining an optimum location for an undesirable facility in a workroom environment
- Sets of efficient points in a normed space
- Solving general continuous single facility location problems by cutting planes
- A computational study of efficient shortest path algorithms
- Competitive spatial models
- Analytical models for locating undesirable facilities
- The impact of distance on location problems
- Fuzzy sets and systems. Theory and applications
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- New perspectives in competitive location theory
- Multiobjective programming and planning
- GBSSS: The generalized big square small square method for planar single- facility location
- Neural networks and operations research: An overview
- Neural networks for automated vehicle dispatching
- Solving makespan minimization problems with Lagrangean decomposition
- When facilities coincide: Exact optimality conditions in multifacility location
- On tabu search for the location of interacting hub facilities
- Equity measurement in facility location analysis: A review and framework
- Genetic search and the dynamic facility layout problem
- A user's guide to tabu search
- A tabu search procedure for multicommodity location/allocation with balancing requirements
- Planar weber location problems with line barriers
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
- An Axiomatic Approach to Location on Networks
- Some Properties of Location Problems with Block and Round Norms
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- A heuristic approach to the single facility maximin location problem
- A New Polynomially Bounded Shortest Path Algorithm
- Using Block Norms for Location Modeling
- The Minisum and Minimax Location Problems Revisited
- Using simulated annealing to solve routing and location problems
- An Algorithm for the p-Center Problem in the Plane
- An Enhancement of the Drezner-Wesolowsky Algorithm for Single-Facility Location with Maximin of Rectilinear Distance
- Competitive Location on a Network
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
- An Optimality Criterion for Graph Embeddings of Metrics
- The Complexity of Metric Realization
- Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
- Continuous Location Theory Under Majority Rule
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Maxmin Location Problem
- A Dual-Based Procedure for Dynamic Facility Location
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case
- An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
- Market and Locational Equilibrium for Two Competitors
- A New Distance Function for Modeling Travel Distances in a Transportation Network
- Convex Location Problems on Tree Networks
- The Development of Linear Distance Functions for Distribution Analysis
- Voting Equilibria in Multidimensional Choice Spaces
- On Hotelling's "Stability in Competition"
- OR Forum—Perspectives on Parallel Computing
- Proactive optimization of toxic waste transportation, location and technology
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- Bounding a Probability Measure Over a Polymatroid with an Application to Transportation Problems
- Replacing continuous demand with discrete demand in a competitive location model
- The generalized Weber problem with expected distances
- Equation of State Calculations by Fast Computing Machines
- Fibonacci heaps and their uses in improved network optimization algorithms
- Competitive Location Models: A Framework and Bibliography
- A Reliability Model Applied to Emergency Service Vehicle Location
- Distance matrix of a graph and its realizability
- On convex metrics
- Modelling Inter-city Road Distances by Mathematical Functions
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some personal views on the current state and the future of locational analysis
