A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand
From MaRDI portal
Publication:342327
DOI10.1016/j.cor.2015.12.018zbMath1349.90572OpenAlexW2236369595MaRDI QIDQ342327
Gilbert Laporte, Vedat Verter, Alper Ekrem Murat
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.12.018
Numerical mathematical programming methods (65K05) Dynamic programming (90C39) Discrete location and assignment (90B80) Numerical solution of boundary value problems involving ordinary differential equations (65L10)
Related Items
Data driven hybrid evolutionary analytical approach for multi objective location allocation decisions: automotive green supply chain empirical evidence ⋮ Efficient sensor network management for asset localization ⋮ A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
- A continuous analysis framework for the solution of location-allocation problems with dense demand
- Sequential location-allocation of public facilities in one- and two- dimensional space: Comparison of several policies
- Solving systems of nonlinear equations with continuous GRASP
- Improved complexity bounds for location problems on the real line
- Location-allocation on a line with demand-dependent costs
- Solving the plant location problem on a line by linear programming
- Existence and characterization of optimal locations
- Lipschitzian optimization without the Lipschitz constant
- A distance constrained \(p\)-facility location problem on the real line
- Location and sizing of facilities on a line
- A continuous model for production-distribution system design
- Optimal positioning of a mobile service unit on a line
- A Note on the Optimal Positioning of Service Units
- Solving a Class of Two-Dimensional Uncapacitated Location-Allocation Problems by Dynamic Programming
- The load-distance balancing problem
- A Patrol Problem
- Euclidean Distance Location-Allocation Problems with Uniform Demands over Convex Polygons
- Optimal Locations on a Line Are Interleaved
- Optimal Positioning of Service Units Along a Coordinate Line
- Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
- On Hotelling's "Stability in Competition"
- Optimal storage locations in a carousel storage and retrieval system
- Multiple anticipatory moves of a server on a line
- Optimal positioning of read/write heads in mirrored disks
- Optimal Anticipatory Position Of A Disk Arm For Queries Of Random Length And Location
- Facility location and capacity acquisition: An integrated approach
- Capacitated Location Problems on a Line
- Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
- On the Continuous Fermat-Weber Problem
- Contraction Mappings in the Theory Underlying Dynamic Programming
- Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
- Static competitive facility location: an overview of optimisation approaches.
- Capacitated location-allocation problems on a line
This page was built for publication: A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand
