An unconstrained binary quadratic programming for the maximum independent set problem (Q2870792)
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: An unconstrained binary quadratic programming for the maximum independent set problem |
scientific article; zbMATH DE number 6248516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An unconstrained binary quadratic programming for the maximum independent set problem |
scientific article; zbMATH DE number 6248516 |
Statements
21 January 2014
0 references
maximum independent set
0 references
unconstrained binary quadratic programming
0 references
genetic algorithm
0 references
An unconstrained binary quadratic programming for the maximum independent set problem (English)
0 references
0.8449196815490723
0 references
0.8176329731941223
0 references
0.7990962862968445
0 references
0.7876631617546082
0 references
0.7858549952507019
0 references
