A continuous analysis framework for the solution of location-allocation problems with dense demand
From MaRDI portal
(Redirected from Publication:733530)
Recommendations
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
- A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand
- Replacing continuous demand with discrete demand in a competitive location model
- Allocation of discrete demand with changing costs
- Decomposition strategies for large-scale continuous location–allocation problems
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 1803761 (Why is no real title available?)
- scientific article; zbMATH DE number 3889235 (Why is no real title available?)
- scientific article; zbMATH DE number 41029 (Why is no real title available?)
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- A continuous approach to the design of physical distribution systems
- A continuous model for production-distribution system design
- A new heuristic for the multi-mode resource investment problem
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An algorithm for continuous type optimal location problem
- An efficient algorithm for the location-allocation problem with rectangular regions
- Approximate formulas of average distances associated with regions and their applications to location problems
- Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons
- Evaluation of plant focus strategies: A continuous approximation framework
- Facility location and capacity acquisition: An integrated approach
- Heuristic Methods for Location-Allocation Problems
- Location-allocation for distribution to a uniform demand with transshipments
- Locational optimization problems solved through Voronoi diagrams
- On the Complexity of Some Common Geometric Location Problems
- On the Continuous Fermat-Weber Problem
- On worst-case aggregation analysis for network location problems
- Replacing continuous demand with discrete demand in a competitive location model
- Scheduling, Location, Transportation, and Continuum Mechanics: Some Simple Approximations to Optimization Problems
- The Fermat-Weber location problem revisited
- The Weber problem with regional demand
- The general optimal market area model
Cited in
(16)- Joint location, inventory, and preservation decisions for non-instantaneous deterioration items under delay in payments
- A planar location-allocation problem with waiting time costs
- A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms
- Structural properties of Voronoi diagrams in facility location problems with continuous demand
- Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
- Comparative error bound theory for three location models: continuous demand versus discrete demand
- scientific article; zbMATH DE number 5501651 (Why is no real title available?)
- A quadtree-based allocation method for a class of large discrete Euclidean location problems
- Continuous approximation formulas for location problems
- A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand
- Allocation of discrete demand with changing costs
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
- Optimal transport and a bilevel location-allocation problem
- On location-allocation problems for dimensional facilities
- A heuristic algorithm for solving large location-inventory problems with demand uncertainty
- A continuous approximation approach for the integrated facility-inventory allocation problem
This page was built for publication: A continuous analysis framework for the solution of location-allocation problems with dense demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733530)
