A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere (Q1610661): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (6 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Sergiy I. Butenko / rank | |||
| Property / author | |||
| Property / author: Sergiy I. Butenko / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GQTPAR / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: QUALEX / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1014899909753 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1548665505 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:06, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere |
scientific article |
Statements
A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere (English)
0 references
20 August 2002
0 references
For a given graph the maximum independent set problem is to find a maximum subset of vertices no two of which are adjacent. We propose a heuristic for the maximum independent set problem which utilizes classical results for the problem of optimization of a quadratic function over a sphere. The efficiency of the approach is confirmed by results of numerical experiments on DIMACS benchmarks.
0 references
