A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
From MaRDI portal
Publication:429526
DOI10.1007/s10589-010-9392-9zbMath1243.90097OpenAlexW2128115040MaRDI QIDQ429526
Jian-lin Jiang, Xiao-Ming Yuan
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9392-9
facility locationBarzilai-Borwein gradient methodfarthest distanceregional demandWeiszfeld procedure
Related Items
Heuristics for a continuous multi-facility location problem with demand regions ⋮ Distributionally robust Weber problem with uncertain demand ⋮ Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances ⋮ A minisum location problem with regional demand considering farthest Euclidean distances ⋮ A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach ⋮ A perturbation approach for an inverse quadratic programming problem over second-order cones
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minisum location problem with farthest Euclidean distances
- An affine-scaling interior-point CBB method for box-constrained optimization
- The Weber problem with regional demand
- Modified two-point stepsize gradient methods for unconstrained optimization
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Minisum location with closest Euclidean distances
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- R-linear convergence of the Barzilai and Borwein gradient method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A New Active Set Algorithm for Box Constrained Optimization
- An Algorithm for a Constrained Weber Problem
- Two-Point Step Size Gradient Methods
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- The Euclidean Multifacility Location Problem
- Optimal location of a facility relative to area demands
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- The p-center location problem in an area
- Dynamic facility location: The progressive p-median problem
- Gradient Method with Retards and Generalizations
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Heuristic Methods for Location-Allocation Problems
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- On the Barzilai and Borwein choice of steplength for the gradient method
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Location of facilities with rectangular distances among point and area destinations
- A note on Fermat's problem
- An Approach to Location Models Involving Sets as Existing Facilities
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- Adaptive two-point stepsize gradient algorithm
- Locating facilities by minimax relative to closest points of demand areas
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
