A branch and bound algorithm for the acyclic subgraph problem (Q1154950)

From MaRDI portal
Revision as of 11:51, 13 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch and bound algorithm for the acyclic subgraph problem
scientific article

    Statements

    A branch and bound algorithm for the acyclic subgraph problem (English)
    0 references
    1981
    0 references
    branch and bound algorithm
    0 references
    acyclic subgraph problem
    0 references
    feedback arc set problem
    0 references
    heuristic algorithm
    0 references
    lexicographic enumeration
    0 references
    0 references

    Identifiers

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