Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms (Q2861529)
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 6224295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms |
scientific article; zbMATH DE number 6224295 |
Statements
8 November 2013
0 references
0 references
Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms (English)
0 references
0.8300798535346985
0 references
0.8087962865829468
0 references
0.795737087726593
0 references
0.7750594615936279
0 references
