Algorithms for a network design problem with crossing supermodular demands (Q4474300)

From MaRDI portal
Revision as of 15:23, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
scientific article; zbMATH DE number 2081230
Language Label Description Also known as
English
Algorithms for a network design problem with crossing supermodular demands
scientific article; zbMATH DE number 2081230

    Statements

    Algorithms for a network design problem with crossing supermodular demands (English)
    0 references
    0 references
    0 references
    0 references
    4 August 2004
    0 references
    network design problems
    0 references
    crossing supermodular functions
    0 references
    approximation algorithms
    0 references
    linear programming
    0 references
    basic solutions
    0 references

    Identifiers

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