Minimum cost flow problem with conflicts (Q6065835)

From MaRDI portal
scientific article; zbMATH DE number 7775488
Language Label Description Also known as
English
Minimum cost flow problem with conflicts
scientific article; zbMATH DE number 7775488

    Statements

    title
    Minimum cost flow problem with conflicts (English)
    0 references
    published in
    Networks
    0 references
    publication date
    11 December 2023
    0 references
    zbMATH Keywords
    branch-and-bound
    0 references
    combinatorial optimization
    0 references
    conflict constraints
    0 references
    minimum cost flow
    0 references
    networks
    0 references
    Russian doll search
    0 references
    cites work
    Q3056948
    0 references
    Q4258216
    0 references
    Integer Programming
    0 references
    Q3292914
    0 references
    Q4198056
    0 references
    On cliques in graphs
    0 references
    Q4040221
    0 references
    Q4871056
    0 references

    Identifiers

    DOI
    10.1002/net.22021
    0 references
    zbMATH DE Number
    7775488
    0 references
    OpenAlex ID
    W3126580133
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6065835&oldid=37609758"
    Powered by MediaWiki