A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
From MaRDI portal
Publication:2318909
DOI10.1155/2013/624398zbMath1470.90041OpenAlexW2023868019WikidataQ58916439 ScholiaQ58916439MaRDI QIDQ2318909
Kun Cheng, Saeed Assani, Xiao-xing Zhu, Jian-lin Jiang
Publication date: 16 August 2019
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/624398
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Three-field modelling of nonlinear nonsmooth boundary value problems and stability of differential mixed variational inequalities
- 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
- Time-dependent variational inequality for an oligopolistic market equilibrium problem with production and demand excesses
- On the structure of the solution set for the single facility location problem with average distances
- A qualitative mathematical analysis of a class of linear variational inequalities via semi-complementarity problems: applications in electronics
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem
- Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
- Restricted center problems under polyhedral gauges
- The Weber problem with regional demand
- A new method for a class of linear variational inequalities
- An alternative theorem for generalized variational inequalities and solvability of nonlinear quasi-\(P^M_*\)-complementarity problems
- A heuristic method for large-scale multi-facility location problems
- Minisum location with closest Euclidean distances
- An inexact alternating direction method for solving a class of structured variational inequalities
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- Locating a central hunter on the plane
- On the Complexity of Some Common Geometric Location Problems
- Using Block Norms for Location Modeling
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- Mathematical Models of Road Travel Distances
- Optimal location of a facility relative to area demands
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- The p-center location problem in an area
- Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
- Engineering and Economic Applications of Complementarity Problems
- Heuristic Methods for Location-Allocation Problems
- Location of facilities with rectangular distances among point and area destinations
- On the basic theorem of complementarity
- An Approach to Location Models Involving Sets as Existing Facilities
- Location Models With Groups Of Demand Points
- Convergence properties of projection and contraction methods for variational inequality problems
