Algorithms for a network design problem with crossing supermodular demands (Q4474300)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2081230
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.89473695
0 references
0.8824258
0 references
0.88184834
0 references
0.88043785
0 references
0.88031256
0 references
0 references
0.8753024
0 references
0.87449557
0 references
