Pages that link to "Item:Q2870792"

The following pages link to An unconstrained binary quadratic programming for the maximum independent set problem (Q2870792):

Displaying 9 items.

• A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere (Q1610661) (← 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)
• 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)
• An effective modeling and solution approach for the generalized independent set problem (Q2458909) (← links)
• An elitist genetic algorithm for the maximum independent set problem. (Q2768237) (← links)
• An integer linear programming formulation and genetic algorithm for the maximum set splitting problem (Q2853283) (← links)
• A priori optimization for the probabilistic maximum independent set problem (Q5958320) (← links)