Master polytopes for cycles of binary matroids (Q1824625): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Martin Grötschel / rank | |||
Property / author | |||
Property / author: Klaus Truemper / rank | |||
Property / author | |||
Property / author: Martin Grötschel / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Klaus Truemper / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0024-3795(89)90478-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1974683421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The max-cut problem on graphs not contractible to \(K_ 5\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the cycle polytope of a binary matroid / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching, Euler tours and the Chinese postman / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition and optimization over cycles in binary matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5659589 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition of regular matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matroids and multicommodity flows / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3249424 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4111952 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:02, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Master polytopes for cycles of binary matroids |
scientific article |
Statements
Master polytopes for cycles of binary matroids (English)
0 references
1989
0 references
L\({}_ k\), the complete binary matroid of order k, is defined by the binary standard representation matrix \([I| A_ k]\) where I is the identity matrix and \(A_ k\) is the 0-1 matrix with k columns that has as rows all possible distinct 0-1 vectors except for the k unit vectors and the 0-vector. For an arbitrary binary matroid P(M) denotes the convex hull of incidence vectors of cycles of M. The authors develop a method to deduce from the facets of \(P(L_ k)\) all facets of P(M) where M is a binary matroid of corank k. Next they apply a lifting procedure to produce for arbitrary binary matroids M a subset of the facets of P(M) using \(P(L_ j)\), \(j\leq k\).
0 references
polyhedral combinatorics
0 references
binary matroid
0 references