On the acyclic subgraph polytope (Q3698818): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q403651
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Gerhard Reinelt / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the linear ordering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Algorithm for the Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the acyclic subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem for Directed Graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01582009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042649619 / rank
 
Normal rank

Latest revision as of 09:26, 30 July 2024

scientific article
Language Label Description Also known as
English
On the acyclic subgraph polytope
scientific article

    Statements

    On the acyclic subgraph polytope (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    feedback arc set problem
    0 references
    facets of polyhedra
    0 references
    polynomial time
    0 references
    algorithms
    0 references
    acyclic subgraph problem
    0 references
    digraph
    0 references
    acyclic subgraph polytope
    0 references
    weakly acyclic digraphs
    0 references

    Identifiers

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