Combinatorial dominance guarantees for heuristic algorithms (Q3576755)
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 5763309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial dominance guarantees for heuristic algorithms |
scientific article; zbMATH DE number 5763309 |
Statements
2 August 2010
0 references
combinatorial optimization
0 references
approximation algorithms
0 references
domination analysis contents 1 introduction 1
0 references
0.9136046767234802
0 references
0.8393124938011169
0 references
0.7606921792030334
0 references
0.7503626346588135
0 references
0.7491297125816345
0 references
