An unconstrained binary quadratic programming for the maximum independent set problem
For a given graph G = (V, E) the maximum independent set problem is to find the largest subset of pairwise nonadjacent vertices. We propose a new model which is a reformulation of the maximum independent set problem as an unconstrained quadratic binary programming, and we resolve it afterward by mea...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vilnius University Press
2012-10-01
|
| Series: | Nonlinear Analysis |
| Subjects: | |
| Online Access: | http://www.journals.vu.lt/nonlinear-analysis/article/view/14047 |