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.

Edmonds polytopes and a hierarchy of combinatorial problems.(English)Zbl 0253.05131


MSC:

05C65 Hypergraphs
90C10 Integer programming
90C27 Combinatorial optimization
52B05 Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)

Cite

References:

[1]Balas, E., A note on the branch-and-bound principle, Operations Res., 16, 443-445 (1968) ·Zbl 0186.24901
[2]Berge, C., Graphes et hypergraphs (1970), Dunod: Dunod Paris ·Zbl 0213.25702
[3]Chvátal, V., Hypergraphs and Ramseyian theorems, Proc. Am. Math. Soc., 27, 434-440 (1971) ·Zbl 0255.05108
[4]Chvátal, V., Remarks on a problem of Moser, Canad. Math. Bull., 15, 19-21 (1972) ·Zbl 0232.05002
[5]V. Chvátal, Edmonds polytopes and weakly Hamiltonian graphs, Math. Programming, to appear.; V. Chvátal, Edmonds polytopes and weakly Hamiltonian graphs, Math. Programming, to appear. ·Zbl 0267.05118
[6]V. Chvátal, On certain polytopes associated with graphs, submitted to J. Combin. Theory.; V. Chvátal, On certain polytopes associated with graphs, submitted to J. Combin. Theory. ·Zbl 0226.05106
[7]Cook, S. A., The complexity of theorem-proving procedures, Conference record of third ACM symposium on theory of computing, 151-158 (1970) ·Zbl 0253.68020
[8]Edmonds, J., Minimum partition of a matroid into independent subsets, J. Res. Nat. Bur. Standards Sect. B, 69, 67-72 (1965) ·Zbl 0192.09101
[9]Edmonds, J., Maximum matching and a polyhedron with 0, 1-vertices, J. Res. Nat. Bur. Standards Sect. B, 69, 125-130 (1965) ·Zbl 0141.21802
[10]Edmonds, J., Paths, tree and flowers, Canad. J. Math., 17, 449-467 (1965) ·Zbl 0132.20903
[11]Edmonds, J.; Johnson, E. L., Matching: A well-solved class of integer linear programs, (Guy, R. K.; etal., Combinatorial structures and their applications (1970), Gordon and Breach: Gordon and Breach New York) ·Zbl 1024.90505
[12]Edmonds, J.; Karp, R. M., Theoretical improvements in algorithmic efficiency for network flow problems, (Guy, R. K.; etal., Combinatorial structures and their applications (1970), Gordon and Breach: Gordon and Breach New York) ·Zbl 0248.90056
[13]Erdös, P., Some remarks on the theory of graphs, Bull. Amer. Math. Soc., 53, 292-294 (1947) ·Zbl 0032.19203
[14]Fulkerson, D. R., Anti-blocking polyhedra, J. Combin. Theory, 12, 50-71 (1972) ·Zbl 0227.05015
[15]Gallai, T., On directed paths and circuits, (Erdös, P.; Katona, G., Theory of graphs (1968), Akademiai Kiado: Akademiai Kiado Budapest) ·Zbl 0159.54403
[16]Gomory, R. E., An algorithm for integer solutions to linear programs, Princeton IBM Math. Report. (Graves, R. L.; Wolfe, P., Recent advances in Mathematical programming (1963), McGraw-Hill: McGraw-Hill New York) (1958), also in: ·Zbl 0132.13702
[17]Hall, M., Combinatorial theory (1967), Blaisdell: Blaisdell Waltham, Mass ·Zbl 0196.02401
[18]Hoffman, A. J.; Kruskal, J. B., Integral boundary points of convex polyhedra, (Kuhn, H. W.; Tucker, A. W., Linear inequalities and related systems. Linear inequalities and related systems, Ann. of Math. Study, 38 (1956), Princeton University Press: Princeton University Press Princeton, N.J) ·Zbl 0072.37803
[19]Hopcroft, J.; Karp, R. M., A \(n^{52}\) algorithm for maximum matchings in bipartite graphs, Twelfth annual symposium on switching and automata theory, 122-125 (1971)
[20]Hu, T. C., Integer programming and network flows (1969), Addison-Wesley: Addison-Wesley Reading, Mass ·Zbl 0197.45701
[21]Karp, R. M., Reducibility among combinatorial problems, (Miller, R. E.; etal., Complexity of computer computations (1972), Plenum Press: Plenum Press New York) ·Zbl 0366.68041
[22]Lovász, L., Normal hypergraphs and the perfect graph conjecture, Discrete Math., 2, 253-268 (1972) ·Zbl 0239.05111
[23]Lovász, L., A characterization of perfect graphs, J. Combin. Theory, 13, 95-98 (1972) ·Zbl 0241.05107
[24]Moser, L., Problem P. 170, Canad. Math. Bull., 13, 268 (1970)
[25]Trotter, L. E., Solution characteristics and algorithms for the vertex-packing problem, (Thesis (1973), Cornell University)
[26]Tutte, W. T., The factorization of linear graphs, J. London Math. Soc., 22, 107-111 (1947) ·Zbl 0029.23301
[27]Veinott, A. F.; Dantzig, G. B., Integer extreme points, SIAM Review, 10, 371-372 (1968) ·Zbl 0162.33401
[28]Wolf, T., The electric kool-acid acid test (1969), Bantam Books
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