A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
From MaRDI portal
Publication:709182
DOI10.1016/j.cor.2010.07.003zbMath1231.90275OpenAlexW1988207468MaRDI QIDQ709182
Gilbert Laporte, Vedat Verter, Alper Ekrem Murat
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.07.003
Continuous location (90B85) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Numerical methods for partial differential equations, initial value and time-dependent initial-boundary value problems (65M99)
Related Items (5)
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 ⋮ Conditional facility location problems with continuous demand and a polygonal barrier ⋮ Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams ⋮ 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
- A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand
- A continuous analysis framework for the solution of location-allocation problems with dense demand
- A continuous location-allocation problem with zone-dependent fixed cost
- Evaluation of plant focus strategies: A continuous approximation framework
- The general optimal market area model
- A quadratic integer program for the location of interacting hub facilities
- An optimal method for solving the (generalized) multi-Weber problem
- A linear program for the two-hub location problem
- Using estimated missing spatial data with the 2-median model
- A continuous approach to the design of physical distribution systems
- A continuous model for production-distribution system design
- On the Complexity of Some Common Geometric Location Problems
- Intersection and Closest-Pair Problems for a Set of Planar Discs
- Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons
- An Overview of Representative Problems in Location Research
- Location-Allocation Problems
- An efficient algorithm for the location-allocation problem with rectangular regions
- Properties and Solution Methods for Large Location-Allocation Problems
- Location-allocation for distribution to a uniform demand with transshipments
- A new heuristic approach for the P-median problem
- 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 multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
