Pages that link to "Item:Q1610661"
From MaRDI portal
The following pages link to A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere (Q1610661):
Displaying 21 items.
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- On sequential heuristic methods for the maximum independent set problem (Q521760) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- Indirect unstructured hex-dominant mesh generation using tetrahedra recombination (Q722824) (← links)
- On solving trust-region and other regularised subproblems in optimization (Q977328) (← links)
- Simple and fast surrogate constraint heuristics for the maximum independent set problem (Q1009195) (← links)
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers (Q1015327) (← links)
- A new heuristic algorithm to solve the maximum independent set problem (Q1649282) (← links)
- The generalized independent set problem: polyhedral analysis and solution approaches (Q1753398) (← links)
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
- Algorithms for the generalized independent set problem based on a quadratic optimization approach (Q2329644) (← links)
- On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
- A new trust region technique for the maximum weight clique problem (Q2433799) (← links)
- Heuristic algorithm for finding the maximum independent set (Q2452735) (← links)
- Using critical sets to solve the maximum independent set problem (Q2457270) (← links)
- On a polynomial fractional formulation for independence number of a graph (Q2457911) (← links)
- Novel approaches for analyzing biological networks (Q2576439) (← links)
- An unconstrained binary quadratic programming for the maximum independent set problem (Q2870792) (← links)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
