zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach. (English) Zbl 1149.90091
Summary: For solving the well-known multi-source Weber problem (MWP), each iteration of the heuristic alternate location-allocation algorithm consists of a location phase and an allocation phase. The task of the location phase is to solve finitely many single-source Weber problems (SWP), which are reduced by the heuristic of nearest center reclassification for the customers in the previous allocation phase. This paper considers the more general and practical case - the MWP with constraints (CMWP). In particular, a variational inequality approach is contributed to solving the involved constrained SWP (CSWP), and thus a new heuristic algorithm for CMWP is presented. The involved CSWP in the location phases are reformulated into some linear variational inequalities, whose special structures lead to a new projection-contraction (PC) method. Global convergence of the PC method is proved under mild assumptions. The new heuristic algorithm using the PC method in the location phases approaches to the heuristic solution of CMWP efficiently, which is verified by the preliminary numerical results reported in this paper.
90B80Discrete location and assignment
90C59Approximation methods and heuristics