A continuous analysis framework for the solution of location-allocation problems with dense demand

DOI10.1016/j.cor.2009.04.001zbMath1171.90457OpenAlexW2011242159MaRDI QIDQ733530

Gilbert Laporte, Vedat Verter, Alper Ekrem Murat

Publication date: 16 October 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.04.001

zbMATH Keywords

Voronoi diagramsFermat-Weber problemlocation-allocation problemcontinuous modeling

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items (10)

Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand ⋮ A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand ⋮ A continuous approximation approach for the integrated facility-inventory allocation problem ⋮ A Planar Location-Allocation Problem with Waiting Time Costs ⋮ Comparative error bound theory for three location models: continuous demand versus discrete demand ⋮ Optimal transport and a bilevel location-allocation problem ⋮ A heuristic algorithm for solving large location-inventory problems with demand uncertainty ⋮ A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand ⋮ A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms ⋮ Joint location, inventory, and preservation decisions for non-instantaneous deterioration items under delay in payments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On worst-case aggregation analysis for network location problems
• Approximate formulas of average distances associated with regions and their applications to location problems
• Evaluation of plant focus strategies: A continuous approximation framework
• The general optimal market area model
• Locational optimization problems solved through Voronoi diagrams
• The Weber problem with regional demand
• An algorithm for continuous type optimal location problem
• A continuous approach to the design of physical distribution systems
• A continuous model for production-distribution system design
• The Fermat-Weber location problem revisited
• On the Complexity of Some Common Geometric Location Problems
• Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An efficient algorithm for the location-allocation problem with rectangular regions
• Location-allocation for distribution to a uniform demand with transshipments
• Replacing continuous demand with discrete demand in a competitive location model
• Scheduling, Location, Transportation, and Continuum Mechanics: Some Simple Approximations to Optimization Problems
• Heuristic Methods for Location-Allocation Problems
• A new heuristic for the multi-mode resource investment problem
• Facility location and capacity acquisition: An integrated approach
• On the Continuous Fermat-Weber Problem

This page was built for publication: A continuous analysis framework for the solution of location-allocation problems with dense demand