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.

The traveling-salesman problem and minimum spanning trees. II.(English)Zbl 0232.90038


MSC:

90C10 Integer programming

Citations:

Zbl 0226.90047

Cite

References:

[1]S. Agmon, ”The relaxation method for linear inequalities,”Canadian Journal of Mathematics 6 (1954) 382–392. ·Zbl 0055.35001 ·doi:10.4153/CJM-1954-037-2
[2]M. Bellmore and G.L. Nemhauser, ”The traveling salesman problem: a survey”,Operations Research 16 (1968) 538–558. ·Zbl 0213.44604 ·doi:10.1287/opre.16.3.538
[3]G.A. Croes, ”A method for solving traveling salesman problems,”Operations Research 6 (1958) 791–812. ·doi:10.1287/opre.6.6.791
[4]G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, ”Solution of a large scale traveling salesman problem”,Operation Research 2 (1954) 393–410. ·doi:10.1287/opre.2.4.393
[5]E.W. Dijkstra, ”A note on two problems in connexion with graphs,”Numerische Mathematik 1 (1959) 269–271. ·Zbl 0092.16002 ·doi:10.1007/BF01386390
[6]D. Gale, ”Optimal assignments in an ordered set: an application of matroid theory,”Journal of Combinatorial Theory 4 (1968) 176–180. ·Zbl 0197.00803 ·doi:10.1016/S0021-9800(68)80039-0
[7]M. Held and R.M. Karp, ”The traveling-salesman problem and minimum spanning trees,”Operations Research 18 (1970) 1138–1162. ·Zbl 0226.90047 ·doi:10.1287/opre.18.6.1138
[8]M. Held and R.M. Karp, ”A dynamic programming approach to sequencing problems,”Journal of the Society for Industrial and Applied Mathematics 10 (1962) 196–210. ·Zbl 0106.14103 ·doi:10.1137/0110015
[9]L.L. Karg and G.L. Thompson, ”A heuristic approach to solving traveling salesman problems,”Management Science 10 (1964) 225–248. ·doi:10.1287/mnsc.10.2.225
[10]J.B. Kruskal, ”On the shortest spanning subtree of a graph and the traveling salesman problem,”Proceedings of the American Mathematical Society 2 (1956) 48–50. ·Zbl 0070.18404 ·doi:10.1090/S0002-9939-1956-0078686-7
[11]S. Lin, ”Computer solution of the traveling salesman problem,”Bell System Technical Journal 44 (1965) 2245–2269. ·Zbl 0136.14705
[12]T. Motzkin and I.J. Schoenberg, ”The relaxation method for linear inequalities,”Canadian Journal of Mathematics 6 (1954) 393–404. ·Zbl 0055.35002 ·doi:10.4153/CJM-1954-038-x
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