Computing minimum cuts by randomized search heuristics (Q633832)
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 5871660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing minimum cuts by randomized search heuristics |
scientific article; zbMATH DE number 5871660 |
Statements
Computing minimum cuts by randomized search heuristics (English)
0 references
30 March 2011
0 references
evolutionary algorithms
0 references
minimum \(s\)-\(t\)-cuts
0 references
multi-objective optimization
0 references
randomized search heuristics
0 references
0 references
0 references
0.7919030785560608
0 references
0.7852445244789124
0 references
0.7755851149559021
0 references
0.7735621929168701
0 references
