Pages that link to "Item:Q519101"

The following pages link to Fast local search for the maximum independent set problem (Q519101):

Displaying 8 items.

• A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
• Iterated local search with Trellis-neighborhood for the partial Latin square extension problem (Q525111) (← links)
• A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs (Q1652526) (← links)
• The weighted independent domination problem: integer linear programming models and metaheuristic approaches (Q1681137) (← links)
• Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
• A hybrid iterated local search heuristic for the maximum weight independent set problem (Q1749784) (← links)
• An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)
• A differentiable approach to the maximum independent set problem using dataless neural networks (Q6488722) (← links)