A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
From MaRDI portal
(Redirected from Publication:429526)
Recommendations
- New heuristic methods for the capacitated multi-facility Weber problem
- The Weber problem with regional demand
- An algorithm for generalized constrained multi-source Weber problem with demand substations
- A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
- A minisum location problem with regional demand considering farthest Euclidean distances
Cites work
- R-linear convergence of the Barzilai and Borwein gradient method
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- A New Active Set Algorithm for Box Constrained Optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A note on Fermat's problem
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- Adaptive two-point stepsize gradient algorithm
- An affine-scaling interior-point CBB method for box-constrained optimization
- An Algorithm for a Constrained Weber Problem
- An Approach to Location Models Involving Sets as Existing Facilities
- Dynamic facility location: The progressive p-median problem
- Gradient Method with Retards and Generalizations
- Heuristic Methods for Location-Allocation Problems
- scientific article; zbMATH DE number 47593 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 2221955 (Why is no real title available?)
- Locating facilities by minimax relative to closest points of demand areas
- Location of facilities with rectangular distances among point and area destinations
- Minisum location problem with farthest Euclidean distances
- Minisum location with closest Euclidean distances
- Modified two-point stepsize gradient methods for unconstrained optimization
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- Optimal location of a facility relative to area demands
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- The Euclidean Multifacility Location Problem
- The p-center location problem in an area
- The Weber problem with regional demand
- Two-Point Step Size Gradient Methods
Cited in
(6)- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
- A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
- A minisum location problem with regional demand considering farthest Euclidean distances
- Heuristics for a continuous multi-facility location problem with demand regions
- A perturbation approach for an inverse quadratic programming problem over second-order cones
- Distributionally robust Weber problem with uncertain demand
This page was built for publication: A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429526)
