Mathematical programming approaches for classes of random network problems (Q319592)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Mathematical programming approaches for classes of random network problems |
scientific article; zbMATH DE number 6633597
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mathematical programming approaches for classes of random network problems |
scientific article; zbMATH DE number 6633597 |
Statements
Mathematical programming approaches for classes of random network problems (English)
0 references
6 October 2016
0 references
interior-point methods
0 references
integer programming
0 references
complex networks
0 references
total unimodularity
0 references
central path
0 references
0 references
0 references
0 references
0.7529435753822327
0 references
0.7379872798919678
0 references
0.7365385293960571
0 references
0.7222105860710144
0 references
0.7140522599220276
0 references
