Movatterモバイル変換


[0]ホーム

URL:


×

zbMATH Open — the first resource for mathematics

from until
Reset all

Examples

GeometrySearch for the termGeometry inany field. Queries arecase-independent.
Funct*Wildcard queries are specified by* (e .g.functions,functorial, etc.). Otherwise the search isexact.''Topological group'':Phrases (multi - words) should be set in''straight quotation marks''.
au: Bourbaki & ti: AlgebraSearch forauthorBourbaki andtitleAlgebra. Theand-operator & is default and can be omitted.
Chebyshev | TschebyscheffTheor-operator| allows to search forChebyshev orTschebyscheff.
Quasi* map* py: 1989The resulting documents havepublicationyear1989.
so:Eur* J* Mat* Soc* cc:14Search for publications in a particularsource with aMathematics SubjectClassificationcode in14.
cc:*35 ! any:ellipticSearch for documents about PDEs (prefix with * to search only primary MSC); the not-operator ! eliminates all results containing the wordelliptic.
dt: b & au: HilbertThedocumenttype is set tobooks; alternatively:j forjournal articles,a forbookarticles.
py: 2000 - 2015 cc:(94A | 11T)Numberranges when searching forpublicationyear are accepted . Terms can be grouped within( parentheses).
la: chineseFind documents in a givenlanguage .ISO 639 - 1 (opens in new tab) language codes can also be used.
st: c r sFind documents that arecited, havereferences and are from asingle author.

Fields

ab Text from the summary or review (for phrases use “. ..”)
an zbMATH ID, i.e.: preliminary ID, Zbl number, JFM number, ERAM number
any Includes ab, au, cc, en, rv, so, ti, ut
arxiv arXiv preprint number
au Name(s) of the contributor(s)
br Name of a person with biographic references (to find documents about the life or work)
cc Code from the Mathematics Subject Classification (prefix with* to search only primary MSC)
ci zbMATH ID of a document cited in summary or review
db Database: documents in Zentralblatt für Mathematik/zbMATH Open (db:Zbl), Jahrbuch über die Fortschritte der Mathematik (db:JFM), Crelle's Journal (db:eram), arXiv (db:arxiv)
dt Type of the document: journal article (dt:j), collection article (dt:a), book (dt:b)
doi Digital Object Identifier (DOI)
ed Name of the editor of a book or special issue
en External document ID: DOI, arXiv ID, ISBN, and others
in zbMATH ID of the corresponding issue
la Language (use name, e.g.,la:French, orISO 639-1, e.g.,la:FR)
li External link (URL)
na Number of authors of the document in question. Interval search with “-”
pt Reviewing state: Reviewed (pt:r), Title Only (pt:t), Pending (pt:p), Scanned Review (pt:s)
pu Name of the publisher
py Year of publication. Interval search with “-”
rft Text from the references of a document (for phrases use “...”)
rn Reviewer ID
rv Name or ID of the reviewer
se Serial ID
si swMATH ID of software referred to in a document
so Bibliographical source, e.g., serial title, volume/issue number, page range, year of publication, ISBN, etc.
st State: is cited (st:c), has references (st:r), has single author (st:s)
sw Name of software referred to in a document
ti Title of the document
ut Keywords

Operators

a & bLogical and (default)
a | bLogical or
!abLogical not
abc*Right wildcard
ab cPhrase
(ab c)Term grouping

See also ourGeneral Help.

A note on optimality conditions for the Euclidean multifacility location problem.(English)Zbl 0614.90033

The key problem of the Euclidean multifacility location (EMFL) problem is to decide whether a given dead point is optimal. If it is not optimal, we wish to compute a descent direction. This paper extends the optimality conditions ofP. H. Calamai andA. R. Conn [SIAM J. Sci. Stat. Comput. 1, 512-526 (1980;Zbl 0469.65040); Lect. Notes Math. 912, 1-25 (1982;Zbl 0485.65013)] andM. L. Overton [Math. Program. 27, 34-63 (1983;Zbl 0536.65053)] to the case when the rows of the active constraints matrix are linearly dependent. We show that linear dependence occurs whenever G, the graph of the coinciding facilities, has a cycle. In this case the key problem is formulated as a linear least squares problem with bounds on the Euclidean norms of certain subvectors.

MSC:

90B05 Inventory, storage, reservoirs

Cite

References:

[1]R.G. Busacker and T.L. Saaty,Finite Graphs and Networks (McGraw-Hill, New York, 1965). ·Zbl 0146.20104
[2]S. Busovaca, ”Handling degeneracy in a nonlinearl 1 algorithm,” Technical Report CS85 34, University of Waterloo (Waterloo, Ontario, 1985).
[3]P.H. Calamai, ”On numerical methods for continuous location problems,” Ph.D. Thesis, University of Waterloo (Waterloo, Ontario, 1983).
[4]P.H. Calamai and C. Charalambous, ”Solving multifacility location problems, involving Euclidean distances,” Naval Research Logistics Quarterly 27 (1980) 609–620. ·Zbl 0447.90022 ·doi:10.1002/nav.3800270408
[5]P.H. Calamai and A.R. Conn, ”A stable algorithm for solving the multifacility location problem involving Euclidean distances,” SIAM Journal on Scientific and Statistical Computing 1 (1980) 512–526. ·Zbl 0469.65040 ·doi:10.1137/0901037
[6]P.H. Calamai and A.R. Conn, ”A second-order method for solving the continuous multifacility location problem,” in: G.A. Watson, ed.,Numerical Analysis: Proceedings of the Ninth Biennial Conference, Dundee, Scotland, Lecture Notes in Mathematics 912 (Springer-Verlag, Berlin, 1982), pp. 1–25. ·Zbl 0485.65013
[7]A. Dax, ”An efficient algorithm for solving the rectilinear multifacility location problem” submitted for publication in IMA Journal of Numerical Analysis (1984).
[8]A. Dax, ”An efficient clustering technique for solving the Euclidean multifacility location problem,” in preparation (1986). ·Zbl 0632.65074
[9]M.L. Overton, ”A quadratically convergent method for minimizing a sum of Euclidean norms,” Mathematical Programming 27 (1983) 34–63. ·Zbl 0536.65053 ·doi:10.1007/BF02591963
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
© 2025FIZ Karlsruhe GmbHPrivacy PolicyLegal NoticesTerms & Conditions
  • Mastodon logo
 (opens in new tab)

[8]ページ先頭

©2009-2025 Movatter.jp