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.

Analysis of mathematical programming problems prior to applying the simplex algorithm.(English)Zbl 0317.90037


MSC:

90C05 Linear programming
65K05 Numerical mathematical programming methods

Cite

References:

[1]APEX II, User Information Manual, 59158100 Rev. Control Data Corporation, Minneapolis, U.S.A.
[2]E. Balas, ”An additive algorithm for solving linear programs with zero–one variables”,Operations Research 13 (1965) 517–546. ·Zbl 0194.19903 ·doi:10.1287/opre.13.4.517
[3]E.M.I. Beale, ”Advanced algorithmic features for general mathematical programming systems”, in: J. Abadie, ed., Integer and nonlinear programming (North Holland, Amsterdam, 1970) pp. 119–138. ·Zbl 0333.65029
[4]G.B. Dantzig and R.M. VanSlyke, ”Generalized upper bounded techniques for linear programming”, I, II, Operations Research Centre, University of California, Berkeley, Calif., ORC 64-17, 18.
[5]J. Haldi, ”25 integer programming test problems”, Working Paper No. 43, Graduate School of Business, Stanford University, Stanford, Calif. (1964).
[6]A. Land and S. Powell, ”FORTRAN codes for mathematical programming, linear, quadratic and discrete problems (Wiley, New York, 1973). ·Zbl 0278.68036
[7]Mathematical Programming System Extended (MPSX), Program Number 5734 XM4, IBM Trade Corporation, New York (1971).
[8]G. Mitra, ”A generalized row elimination algorithm for exclusive row structure problems”, ICL/DATASKIL Internal Rept. (1972).
[9]S. Senju and Y. Toyoda, ”An approach to linear programming with 0–1 variables”,Management Science (4) (1968) B196–B207.
[10]H.P. Williams, ”Experiments in the formulation of integer programming problems”, to appear. ·Zbl 0353.90062
[11]F.P. Wyman, ”Binary programming: a decision rule for selecting optimal vs heuristic techniques”,Computer Journal 16 (2) (1973) 135–140. ·doi:10.1093/comjnl/16.2.135
[12]G. Zoutendijk, ”A product form algorithm using contracted transformation vectors”, in: J. Abadie, ed., Integer and nonlinear programming (North-Holland, Amsterdam, 1970) pp. 511–523. ·Zbl 0332.90025
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