An exact algorithm for the min-cost network containment problem (Q4458721)
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 2056987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for the min-cost network containment problem |
scientific article; zbMATH DE number 2056987 |
Statements
An exact algorithm for the min-cost network containment problem (English)
0 references
15 March 2004
0 references
network design
0 references
polyhedra containment
0 references
max weight directed cut
0 references
0.8000274300575256
0 references
0.7730607390403748
0 references
0.7646521329879761
0 references
