A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
From MaRDI portal
Publication:2463484
DOI10.1016/j.ejor.2007.02.043zbMath1149.90091MaRDI QIDQ2463484
Jian-lin Jiang, Xiao-Ming Yuan
Publication date: 12 December 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.02.043
variational inequalities; location-allocation; constrained multi-source weber problem; projection-contraction
90C59: Approximation methods and heuristics in mathematical programming
90B80: Discrete location and assignment
Related Items
Accelerating the convergence in the single-source and multi-source Weber problems, A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand, Multi-source facility location-allocation and inventory problem, The use of interval arithmetic in solving a non-linear rational expectation based multiperiod output-inflation process model: the case of the IN/GB method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometrical properties of the Fermat-Weber problem
- An optimal method for solving the (generalized) multi-Weber problem
- A new method for a class of linear variational inequalities
- A heuristic method for large-scale multi-facility location problems
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- A primal-dual algorithm for a constrained Fermat-Weber problem involving mixed norms
- Location-Allocation Problems
- Monotone Operators and the Proximal Point Algorithm
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- Engineering and Economic Applications of Complementarity Problems
- A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
- Heuristic Methods for Location-Allocation Problems
- On the basic theorem of complementarity
- A note on Fermat's problem
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
