An unconstrained binary quadratic programming for the maximum independent set problem
From MaRDI portal
Publication:2870792
Recommendations
- A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
- A new heuristic algorithm to solve the maximum independent set problem
- On characterization of maximal independent sets via quadratic optimization
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
Cited in
(11)- A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
- A novel evolutionary formulation of the maximum independent set problem
- An elitist genetic algorithm for the maximum independent set problem.
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
- A priori optimization for the probabilistic maximum independent set problem
- Algorithms for the generalized independent set problem based on a quadratic optimization approach
- A new heuristic algorithm to solve the maximum independent set problem
- On characterization of maximal independent sets via quadratic optimization
- An integer linear programming formulation and genetic algorithm for the maximum set splitting problem
- An effective modeling and solution approach for the generalized independent set problem
- The generalized independent set problem: polyhedral analysis and solution approaches
This page was built for publication: An unconstrained binary quadratic programming for the maximum independent set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870792)
