Algorithms for a network design problem with crossing supermodular demands (Q4474300): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 16:59, 5 March 2024

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
    0 references
    4 August 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    network design problems
    0 references
    crossing supermodular functions
    0 references
    approximation algorithms
    0 references
    linear programming
    0 references
    basic solutions
    0 references