Algorithms for a network design problem with crossing supermodular demands (Q4474300): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:05, 7 February 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
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
