A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
From MaRDI portal
Publication:1610661
DOI10.1023/A:1014899909753zbMath1046.90071OpenAlexW1548665505MaRDI QIDQ1610661
Panos M. Pardalos, Stanislav Busygin, Sergiy I. Butenko
Publication date: 20 August 2002
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014899909753
Related Items
An adaptive multistart tabu search approach to solve the maximum clique problem, A new trust region technique for the maximum weight clique problem, Combinatorial algorithms for the maximum \(k\)-plex problem, Local search with edge weighting and configuration checking heuristics for minimum vertex cover, On a polynomial fractional formulation for independence number of a graph, Constructing test functions for global optimization using continuous formulations of graph problems, A nonconvex quadratic optimization approach to the maximum edge weight clique problem, A tutorial on branch and cut algorithms for the maximum stable set problem, On solving trust-region and other regularised subproblems in optimization, Indirect unstructured hex-dominant mesh generation using tetrahedra recombination, Simple and fast surrogate constraint heuristics for the maximum independent set problem, Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers, Novel approaches for analyzing biological networks
Uses Software
