Extended formulations for sparsity matroids (Q304267): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1538034711 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1403.7272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph polytopes and independence polytopes of count matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations, nonnegative factorizations, and randomized communication protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest compact formulation for the permutahedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees of the vertices of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some \(0/1\) polytopes need exponential size extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs and rigidity of plane skeletal structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using separation algorithms to generate mixed integer model reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural realizations of sparsity matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigidity of multi-graphs. I: Linking rigid bodies in n-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs / rank
 
Normal rank

Latest revision as of 10:58, 12 July 2024

scientific article
Language Label Description Also known as
English
Extended formulations for sparsity matroids
scientific article

    Statements

    Extended formulations for sparsity matroids (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 August 2016
    0 references
    randomized communication protocol
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references